mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-07-01 10:28:46 +00:00
Code Activity

refcount leaks

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2020-06-09 14:19:26 -07:00
parent 4fdfc65b37
commit e3d45b9850
3 changed files with 9 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/ast/rewriter/bool_rewriter.h
View file

@ -134,7 +134,7 @@ public:
result = mk_eq(lhs, rhs); result = mk_eq(lhs, rhs);
} }
expr_ref mk_eq_rw(expr* lhs, expr* rhs) { expr_ref mk_eq_rw(expr* lhs, expr* rhs) {
expr_ref r(m()); expr_ref r(m()), _lhs(lhs, m()), _rhs(rhs, m());
mk_eq(lhs, rhs, r); mk_eq(lhs, rhs, r);
return r; return r;
} }

11
src/ast/rewriter/seq_rewriter.cpp
View file

@ -2167,6 +2167,7 @@ bool seq_rewriter::get_re_head_tail_reversed(expr* r, expr_ref& head, expr_ref&
expr_ref seq_rewriter::re_and(expr* cond, expr* r) { expr_ref seq_rewriter::re_and(expr* cond, expr* r) {
expr_ref _cond(cond, m()), _r(r, m());
if (m().is_true(cond)) if (m().is_true(cond))
return expr_ref(r, m()); return expr_ref(r, m());
expr* re_empty = re().mk_empty(m().get_sort(r)); expr* re_empty = re().mk_empty(m().get_sort(r));
@ -2590,10 +2591,10 @@ expr_ref seq_rewriter::mk_derivative_rec(expr* ele, expr* r) {
zstring s1, s2; zstring s1, s2;
if (str().is_string(r1, s1) && str().is_string(r2, s2)) { if (str().is_string(r1, s1) && str().is_string(r2, s2)) {
if (s1.length() == 1 && s2.length() == 1) { if (s1.length() == 1 && s2.length() == 1) {
r1 = m_util.mk_char(s1[0]); expr_ref ch1(m_util.mk_char(s1[0]), m());
r2 = m_util.mk_char(s2[0]); expr_ref ch2(m_util.mk_char(s2[0]), m());
return mk_der_inter(re_predicate(m_util.mk_le(r1, ele), seq_sort), return mk_der_inter(re_predicate(m_util.mk_le(ch1, ele), seq_sort),
re_predicate(m_util.mk_le(ele, r2), seq_sort)); re_predicate(m_util.mk_le(ele, ch2), seq_sort));
} }
else { else {
return mk_empty(); return mk_empty();
@ -3625,7 +3626,7 @@ bool seq_rewriter::reduce_back(expr_ref_vector& ls, expr_ref_vector& rs, expr_re
else if (str().is_unit(l, a) && str().is_string(r, s)) { else if (str().is_unit(l, a) && str().is_string(r, s)) {
SASSERT(s.length() > 0); SASSERT(s.length() > 0);
app* ch = str().mk_char(s, s.length()-1); app_ref ch(str().mk_char(s, s.length()-1), m());
SASSERT(m().get_sort(ch) == m().get_sort(a)); SASSERT(m().get_sort(ch) == m().get_sort(a));
new_eqs.push_back(ch, a); new_eqs.push_back(ch, a);
ls.pop_back(); ls.pop_back();

2
src/ast/seq_decl_plugin.cpp
View file

@ -1181,6 +1181,8 @@ app* seq_util::mk_char(unsigned ch) const {
} }
app* seq_util::mk_le(expr* ch1, expr* ch2) const { app* seq_util::mk_le(expr* ch1, expr* ch2) const {
expr_ref _ch1(ch1, m), _ch2(ch2, m);
#if Z3_USE_UNICODE #if Z3_USE_UNICODE
expr* es[2] = { ch1, ch2 }; expr* es[2] = { ch1, ch2 };
return m.mk_app(m_fid, OP_CHAR_LE, 2, es); return m.mk_app(m_fid, OP_CHAR_LE, 2, es);