mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2026-05-04 09:25:15 +00:00
Code Activity

More bug fixing in the gpower introduction

Browse source
This commit is contained in:
CEisenhofer 2026-03-09 15:20:58 +01:00
parent 32a09859e3
commit 587eec4226
1 changed files with 20 additions and 23 deletions
Download patch file Download diff file Expand all files Collapse all files

43
src/smt/seq/seq_nielsen.cpp
View file

@ -2174,32 +2174,29 @@ namespace seq {
euf::snode* power_snode = m_sg.mk(power_expr); euf::snode* power_snode = m_sg.mk(power_expr);
if (!power_snode) return false; if (!power_snode) return false;
// Create fresh suffix variable
euf::snode* fresh_suffix = mk_fresh_var();
euf::snode* replacement = m_sg.mk_concat(power_snode, fresh_suffix);
// Create child node with substitution var → base^n · suffix
nielsen_node* child = mk_child(node);
nielsen_edge* e = mk_edge(node, child, true);
nielsen_subst s(var, replacement, eq.m_dep);
e->add_subst(s);
child->apply_subst(m_sg, s);
// Side constraint: n >= 0
expr* zero = arith.mk_int(0); expr* zero = arith.mk_int(0);
e->add_side_int(mk_int_constraint(fresh_n, zero, int_constraint_kind::ge, eq.m_dep));
// Side constraint: 0 <= len(suffix) < len(base) // Generate one child per proper prefix of the base, mirroring ZIPT's
if (fresh_suffix->get_expr()) { // GetDecompose. For base [t0, t1, ..., t_{k-1}], the proper prefixes
expr_ref len_suffix(seq.str.mk_length(fresh_suffix->get_expr()), m); // are: ε, t0, t0·t1, ..., t0·t1·...·t_{k-2}.
if (base_len <= 1) { // Child i substitutes var → base^n · prefix_i with n >= 0.
// len(suffix) < 1 means len(suffix) = 0 for (unsigned pfx_len = 0; pfx_len < base_len; ++pfx_len) {
e->add_side_int(mk_int_constraint(len_suffix, zero, int_constraint_kind::eq, eq.m_dep)); euf::snode* replacement = power_snode;
} else { if (pfx_len > 0) {
expr* max_val = arith.mk_int(base_len - 1); euf::snode* prefix_snode = ground_prefix[0];
e->add_side_int(mk_int_constraint(len_suffix, max_val, int_constraint_kind::le, eq.m_dep)); for (unsigned j = 1; j < pfx_len; ++j)
e->add_side_int(mk_int_constraint(len_suffix, zero, int_constraint_kind::ge, eq.m_dep)); prefix_snode = m_sg.mk_concat(prefix_snode, ground_prefix[j]);
replacement = m_sg.mk_concat(power_snode, prefix_snode);
} }
nielsen_node* child = mk_child(node);
nielsen_edge* e = mk_edge(node, child, true);
nielsen_subst s(var, replacement, eq.m_dep);
e->add_subst(s);
child->apply_subst(m_sg, s);
// Side constraint: n >= 0
e->add_side_int(mk_int_constraint(fresh_n, zero, int_constraint_kind::ge, eq.m_dep));
} }
return true; return true;