mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-30 20:35:51 +00:00
Code Activity

moving out viable functionality

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2021-06-21 15:50:04 -07:00
parent 19099244c4
commit 6f93ed8dc2
9 changed files with 242 additions and 121 deletions
Download patch file Download diff file Expand all files Collapse all files

19
src/math/polysat/eq_constraint.cpp
View file

@ -63,24 +63,11 @@ namespace polysat {
rational a = q.hi().val();
rational b = q.lo().val();
bddv const& x = s.var2bits(v).var();
if (b == 0 && a.is_odd()) {
// hacky test optimizing special case.
// general case is compute inverse(a)*-b for equality 2^k*a*x + b == 0
// then constrain x.
//
s.intersect_viable(v, is_positive() ? x.all0() : !x.all0());
}
else {
IF_VERBOSE(10, verbose_stream() << a << "*x + " << b << "\n");
bddv lhs = a * x + b;
bdd xs = is_positive() ? lhs.all0() : !lhs.all0();
s.intersect_viable(v, xs);
}
s.m_vble.intersect_eq(a, v, b, is_positive());
rational val;
if (s.find_viable(v, val) == dd::find_t::singleton)
if (s.m_vble.find_viable(v, val) == dd::find_t::singleton)
s.propagate(v, val, *this);
return;
}