mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-10-04 23:13:57 +00:00
Code Activity

fix a few warnings & simplify debug.h header

Browse source
This commit is contained in:
Nuno Lopes 2020-05-26 13:49:13 +01:00
parent a97bc65af4
commit d8cea7c8d5
6 changed files with 24 additions and 56 deletions
Download patch file Download diff file Expand all files Collapse all files

1
src/smt/seq_regex.cpp
View file

@ -209,7 +209,6 @@ namespace smt {
expr* s = nullptr, *idx = nullptr, *r = nullptr;
expr* e = ctx.bool_var2expr(lit.var());
VERIFY(sk().is_accept(e, s, idx, r));
expr* t = nullptr;
if (i > th.m_max_unfolding_depth &&
th.m_max_unfolding_lit != null_literal &&
ctx.get_assignment(th.m_max_unfolding_lit) == l_true &&

3
src/smt/smt_induction.cpp
View file

@ -400,7 +400,6 @@ literal induction_lemmas::mk_literal(expr* e) {
bool induction_lemmas::operator()(literal lit) {
unsigned num = m_num_lemmas;
enode* r = ctx.bool_var2enode(lit.var());
#if 1
@ -410,6 +409,7 @@ bool induction_lemmas::operator()(literal lit) {
}
return !combinations.empty();
#else
unsigned num = m_num_lemmas;
expr_ref_vector sks(m);
expr_safe_replace rep(m);
// have to be non-overlapping:
@ -494,7 +494,6 @@ void induction_lemmas::apply_induction(literal lit, induction_positions_t const
SASSERT(is_app(t));
args.reset();
unsigned sz = todo.size();
unsigned i = 0;
expr* s = nullptr;
for (unsigned i = 0; i < to_app(t)->get_num_args(); ++i) {
expr* arg = to_app(t)->get_arg(i);

18
src/smt/theory_str.cpp
View file

@ -7045,10 +7045,10 @@ namespace smt {
void theory_str::check_consistency_prefix(expr * e, bool is_true) {
context & ctx = get_context();
ast_manager & m = get_manager();
expr * needle;
expr * haystack;
expr * needle = nullptr;
expr * haystack = nullptr;
u.str.is_prefix(e, needle, haystack);
VERIFY(u.str.is_prefix(e, needle, haystack));
TRACE("str", tout << "check consistency of prefix predicate: " << mk_pp(needle, m) << " prefixof " << mk_pp(haystack, m) << std::endl;);
zstring needleStringConstant;
@ -7072,10 +7072,10 @@ namespace smt {
void theory_str::check_consistency_suffix(expr * e, bool is_true) {
context & ctx = get_context();
ast_manager & m = get_manager();
expr * needle;
expr * haystack;
expr * needle = nullptr;
expr * haystack = nullptr;
u.str.is_suffix(e, needle, haystack);
VERIFY(u.str.is_suffix(e, needle, haystack));
TRACE("str", tout << "check consistency of suffix predicate: " << mk_pp(needle, m) << " suffixof " << mk_pp(haystack, m) << std::endl;);
zstring needleStringConstant;
@ -7099,10 +7099,10 @@ namespace smt {
void theory_str::check_consistency_contains(expr * e, bool is_true) {
context & ctx = get_context();
ast_manager & m = get_manager();
expr * needle;
expr * haystack;
expr * needle = nullptr;
expr * haystack = nullptr;
u.str.is_contains(e, haystack, needle); // first string contains second one
VERIFY(u.str.is_contains(e, haystack, needle)); // first string contains second one
TRACE("str", tout << "check consistency of contains predicate: " << mk_pp(haystack, m) << " contains " << mk_pp(needle, m) << std::endl;);
zstring needleStringConstant;