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

updates to viable

Browse source
This commit is contained in:
Nikolaj Bjorner 2023-12-09 12:08:02 -08:00
parent e9c86bf3a3
commit 30c874d301
9 changed files with 2539 additions and 30 deletions
Download patch file Download diff file Expand all files Collapse all files

42
src/sat/smt/polysat_solver.cpp
View file

@ -254,4 +254,46 @@ namespace polysat {
return expr_ref(bv.mk_bv_add(lo, hi), m);
}
// walk the egraph starting with pvar for overlaps.
void solver::get_bitvector_prefixes(pvar pv, pvar_vector& out) {
theory_var v = m_pddvar2var[pv];
euf::enode_vector todo;
uint_set seen;
unsigned lo, hi;
expr* e = nullptr;
todo.push_back(var2enode(v));
for (unsigned i = 0; i < todo.size(); ++i) {
auto n = todo[i]->get_root();
if (n->is_marked1())
continue;
n->mark1();
for (auto sib : euf::enode_class(n)) {
theory_var w = sib->get_th_var(get_id());
// identify prefixes
if (bv.is_concat(sib->get_expr()))
todo.push_back(sib->get_arg(0));
if (w == euf::null_theory_var)
continue;
if (seen.contains(w))
continue;
seen.insert(w);
auto const& p = m_var2pdd[w];
if (p.is_var())
out.push_back(p.var());
}
for (auto p : euf::enode_parents(n)) {
if (p->is_marked1())
continue;
// find prefixes: e[hi:0] a parent of n
if (bv.is_extract(p->get_expr(), lo, hi, e) && lo == 0) {
SASSERT(n == expr2enode(e)->get_root());
todo.push_back(p);
}
}
}
for (auto n : todo)
n->get_root()->unmark1();
}
}