mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2026-07-01 21:08:55 +00:00
Code Activity

Lattice based refutation (#8211)

Browse source 
* add examples

* add lattice refutation solver class

* store partial order in vector

* capture partial order relations

* begin with the incremental reachability data structure

* implement data structure for incremental reachability

* fix bug in subset propagation

* add trace

* only propagate if new value was added

* begin implementing bitvector variant of reachability matrix

* fix path creation and cycle detection

* fix bug

* make conflict triggering more conservative

* check if theory vars are in bounds

* add cycle detection (including equality propagation)

* add examples

* remove example

* remove traces

* remove sln file
This commit is contained in:
lorenzwinkler1 2026-01-19 02:42:40 +01:00 • committed by GitHub
parent ec3aafd51e
commit 31cbb4b144
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
10 changed files with 789 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

15
src/smt/theory_finite_set.cpp
View file

@ -28,7 +28,8 @@ namespace smt {
theory(ctx, ctx.get_manager().mk_family_id("finite_set")),
u(m),
m_axioms(m), m_rw(m), m_find(*this),
m_cardinality_solver(*this)
m_cardinality_solver(*this),
m_lattice_refutation(*this)
{
// Setup the add_clause callback for axioms
std::function<void(theory_axiom *)> add_clause_fn =
@ -227,8 +228,11 @@ namespace smt {
e = ctx.mk_enode(term, false, m.is_bool(term), true);
// Attach theory variable if this is a set
if (!is_attached_to_var(e))
if (!is_attached_to_var(e)){
ctx.attach_th_var(e, this, mk_var(e));
TRACE(finite_set, tout << "create_theory_var: " << e->get_th_var(get_id()) << " enode:" << e->get_expr() << "\n";);
}
// Assert immediate axioms
if (!ctx.relevancy())
@ -256,6 +260,10 @@ namespace smt {
ctx.push_trail(push_back_vector(m_eqs));
m_find.merge(v1, v2); // triggers merge_eh, which triggers incremental generation of theory axioms
}
m_lattice_refutation.add_equality(v1, v2);
// Check if Z3 has a boolean variable for it
TRACE(finite_set, tout << "new_eq_eh_r1: " << n1->get_root() << "r2: "<< n2->get_root() <<"\n";);
}
/**
@ -279,6 +287,7 @@ namespace smt {
ctx.push_trail(push_back_vector(m_diseqs));
m_axioms.extensionality_axiom(e1, e2);
}
m_lattice_refutation.add_disequality(v1,v2);
}
//
@ -405,6 +414,8 @@ namespace smt {
void theory_finite_set::assign_eh(bool_var v, bool is_true) {
TRACE(finite_set, tout << "assign_eh: v" << v << " is_true: " << is_true << "\n";);
expr *e = ctx.bool_var2expr(v);
TRACE(finite_set, tout << "assign_eh_expr: " << mk_pp(e, m) << "\n";);
// retrieve the watch list for clauses where e appears with opposite polarity
unsigned idx = 2 * e->get_id() + (is_true ? 1 : 0);
if (idx >= m_clauses.watch.size())