mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2026-03-19 19:43:11 +00:00
Code Activity

nseq: use theory propagation in propagate_regex_length_bounds

Browse source 
Co-authored-by: NikolajBjorner <3085284+NikolajBjorner@users.noreply.github.com>
This commit is contained in:
copilot-swe-agent[bot] 2026-03-15 20:19:38 +00:00
parent 77fafec3ff
commit dfd75ec2de
1 changed files with 20 additions and 17 deletions
Download patch file Download diff file Expand all files Collapse all files

37
src/smt/theory_nseq.cpp
View file

@ -332,7 +332,7 @@ namespace smt {
} }
// Propagate length bounds for str.in_re(s, r) → len(s) ∈ [min_len, max_len]. // Propagate length bounds for str.in_re(s, r) → len(s) ∈ [min_len, max_len].
// Adds the conditional clauses as theory axioms so the arithmetic theory // Uses theory propagation, antecedent → consequent, so the arithmetic theory
// can derive conflicts or tighten bounds without waiting for final_check. // can derive conflicts or tighten bounds without waiting for final_check.
void theory_nseq::propagate_regex_length_bounds(expr* s, unsigned min_len, unsigned max_len, literal antecedent) { void theory_nseq::propagate_regex_length_bounds(expr* s, unsigned min_len, unsigned max_len, literal antecedent) {
context& ctx = get_context(); context& ctx = get_context();
@ -341,28 +341,31 @@ namespace smt {
if (!ctx.e_internalized(len_s)) if (!ctx.e_internalized(len_s))
ctx.internalize(len_s, false); ctx.internalize(len_s, false);
auto propagate_len_lit = [&](expr_ref& bound_expr) {
if (!ctx.b_internalized(bound_expr))
ctx.internalize(bound_expr, true);
literal len_lit = ctx.get_literal(bound_expr);
if (ctx.get_assignment(len_lit) == l_true)
return;
ctx.mark_as_relevant(len_lit);
justification* js = ctx.mk_justification(
ext_theory_propagation_justification(
get_id(), ctx,
1, &antecedent,
0, nullptr,
len_lit));
ctx.assign(len_lit, js);
++m_num_length_axioms;
};
if (min_len > 0) { if (min_len > 0) {
expr_ref bound(m_autil.mk_ge(len_s, m_autil.mk_int(min_len)), m); expr_ref bound(m_autil.mk_ge(len_s, m_autil.mk_int(min_len)), m);
if (!ctx.b_internalized(bound)) propagate_len_lit(bound);
ctx.internalize(bound, true);
literal len_lit = ctx.get_literal(bound);
if (ctx.get_assignment(len_lit) != l_true) {
literal clause[2] = {~antecedent, len_lit};
ctx.mk_th_axiom(get_id(), 2, clause);
++m_num_length_axioms;
}
} }
if (max_len < UINT_MAX) { if (max_len < UINT_MAX) {
expr_ref bound(m_autil.mk_le(len_s, m_autil.mk_int(max_len)), m); expr_ref bound(m_autil.mk_le(len_s, m_autil.mk_int(max_len)), m);
if (!ctx.b_internalized(bound)) propagate_len_lit(bound);
ctx.internalize(bound, true);
literal len_lit = ctx.get_literal(bound);
if (ctx.get_assignment(len_lit) != l_true) {
literal clause[2] = {~antecedent, len_lit};
ctx.mk_th_axiom(get_id(), 2, clause);
++m_num_length_axioms;
}
} }
} }