fix: avoid spurious divisibility conflicts in the rational model search of `lia`

This PR fixes `lia` exhausting `liaSteps` on goals where its rational model search looped on a divisibility constraint.

When a variable has a non-integer value in the rational search, a divisibility constraint with a non-integer tail was reported like an unsatisfiable one, and the resulting resolvent changed nothing. The solution lookup now distinguishes `found`, `unsat`, and `skip`; skipped constraints, and unsatisfiable ones once the rational model is imprecise, are left to the integer search.

Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com>
2 files changed