51 if(expr.
id()==ID_symbol ||
52 expr.
id()==ID_index ||
53 expr.
id()==ID_member ||
54 expr.
id()==ID_dereference)
79 for(goto_programt::instructionst::const_iterator
80 it=instructions.begin();
81 it!=instructions.end();
90 for(
const auto &step : path)
98 for(
const auto &step : loop)
109 modified.insert(assignment.
lhs());
115 std::map<exprt, polynomialt> polynomials,
130 std::vector<exprt> polynomials_hold;
135 for(std::map<exprt, polynomialt>::iterator it=polynomials.begin();
136 it!=polynomials.end();
139 const equal_exprt holds(it->first, it->second.to_expr());
142 polynomials_hold.push_back(holds);
147 codet inc_loop_counter=
155 for(std::vector<exprt>::iterator it=polynomials_hold.begin();
156 it!=polynomials_hold.end();
163 std::cout <<
"Checking following program for inductiveness:\n";
173 std::cout <<
"Not inductive!\n";
182 catch(
const std::string &s)
184 std::cout <<
"Error in inductiveness SAT check: " << s <<
'\n';
187 catch (
const char *s)
189 std::cout <<
"Error in inductiveness SAT check: " << s <<
'\n';
196 std::map<exprt, polynomialt> &polynomials,
205 for(std::map<exprt, polynomialt>::iterator it=polynomials.begin();
206 it!=polynomials.end();
209 it->second.substitute(substitution);
220 for(expr_sett::iterator it=modified.begin();
228 vars.erase(loop_counter_name);
230 for(find_symbols_sett::iterator it=vars.begin();
253 for(patht::reverse_iterator r_it=path.rbegin();
266 if(lhs.
id()==ID_symbol ||
267 lhs.
id()==ID_index ||
268 lhs.
id()==ID_dereference)
277 else if(t->is_assume() || t->is_assert())
286 if(!r_it->guard.is_true() && !r_it->guard.is_nil())
306 if(expr.
id()==ID_index ||
307 expr.
id()==ID_dereference)
309 expr_mapt::iterator it=abstractions.find(expr);
311 if(it==abstractions.end())
338 if(expr.
id()==ID_not &&
339 expr.
op0().
id()==ID_nondet)
343 else if(expr.
id()==ID_equal ||
349 if(expr.
op0().
id()==ID_nondet ||
350 expr.
op1().
id()==ID_nondet)
358 std::map<exprt, polynomialt> polynomials,
392 std::vector<exprt> polynomials_hold;
394 for(std::map<exprt, polynomialt>::iterator it=polynomials.begin();
395 it!=polynomials.end();
399 exprt rhs=it->second.to_expr();
406 for(std::vector<exprt>::iterator it=polynomials_hold.begin();
407 it!=polynomials_hold.end();
419 for(std::map<exprt, polynomialt>::iterator p_it=polynomials.begin();
420 p_it!=polynomials.end();
423 program.
assign(p_it->first, p_it->second.to_expr());
426 program.
assume(condition);
431 for(std::map<exprt, polynomialt>::iterator p_it=polynomials.begin();
432 p_it!=polynomials.end();
435 program.
assign(p_it->first, p_it->second.to_expr());
446 std::cout <<
"Checking following program for monotonicity:\n";
455 std::cout <<
"Path is not monotone\n";
461 catch(
const std::string &s)
463 std::cout <<
"Error in monotonicity SAT check: " << s <<
'\n';
468 std::cout <<
"Error in monotonicity SAT check: " << s <<
'\n';
473 std::cout <<
"Path is monotone\n";
487 checker_options.
set_option(
"signed-overflow-check",
true);
488 checker_options.
set_option(
"unsigned-overflow-check",
true);
489 checker_options.
set_option(
"assert-to-assume",
true);
490 checker_options.
set_option(
"assumptions",
true);
496 std::cout <<
"Adding overflow checks at " << now <<
"...\n";
509 std::cout <<
"Done at " << now <<
".\n";
519 for(goto_programt::instructionst::reverse_iterator r_it=loop_body.rbegin();
520 r_it!=loop_body.rend();
523 if(r_it->is_assign())
528 if(assignment.
lhs().
id()==ID_index)
531 assignments.push_back(
532 std::make_pair(assignment.
lhs(), assignment.
rhs()));
536 arrays_written.insert(index_expr.
array());
542 for(expr_pairst::iterator a_it=assignments.begin();
543 a_it!=assignments.end();
558 std::map<exprt, polynomialt> &polynomials,
564 std::cout <<
"Doing arrays...\n";
573 std::cout <<
"Found " << array_assignments.size()
574 <<
" array assignments\n";
577 if(array_assignments.empty())
587 array_assignments, polynomials, poly_assignments, nondet_indices))
592 std::cout <<
"Couldn't model an array assignment :-(\n";
598 for(expr_sett::iterator it=arrays_written.begin();
599 it!=arrays_written.end();
609 for(polynomial_array_assignmentst::iterator it=poly_assignments.begin();
610 it!=poly_assignments.end();
641 for(expr_sett::iterator a_it=arrays_written.begin();
642 a_it!=arrays_written.end();
646 exprt old_array=substitution[array];
647 std::vector<polynomialt> indices;
648 bool nonlinear_index=
false;
650 for(polynomial_array_assignmentst::iterator it=poly_assignments.begin();
651 it!=poly_assignments.end();
658 indices.push_back(index);
666 nonlinear_index=
true;
688 pos_eliminator=neg_eliminator;
689 pos_eliminator.
mult(-1);
693 for(std::vector<polynomialt>::iterator it=indices.begin();
698 exprt max_idx, min_idx;
706 index.
add(pos_eliminator);
715 index.
add(neg_eliminator);
720 assert(!
"ITSALLGONEWRONG");
726 unchanged_operands.push_back(unchanged_by_this_one);
739 for(std::vector<polynomialt>::iterator it=indices.begin();
743 idx_touched_operands.push_back(
761 implies_exprt idx_not_touched_bound(l_bound, idx_not_touched);
763 idx_never_touched=
exprt(ID_forall);
778 implies_exprt idx_unchanged(idx_never_touched, value_unchanged);
786 program.
assume(array_unchanged);
794 std::map<exprt, polynomialt> &polynomials,
798 for(expr_pairst::iterator it=array_assignments.begin();
799 it!=array_assignments.end();
811 std::cout <<
"Couldn't convert index: " 818 std::cout <<
"Converted index to: " 823 if(it->second.id()==ID_nondet)
825 nondet_indices.push_back(poly_assignment.
index);
827 else if(!
expr2poly(it->second, polynomials, poly_assignment.
value))
831 std::cout <<
"Couldn't convert RHS: " <<
expr2c(it->second,
ns)
839 std::cout <<
"Converted RHS to: " 844 array_polynomials.push_back(poly_assignment);
853 std::map<exprt, polynomialt> &polynomials,
856 exprt subbed_expr=expr;
858 for(std::map<exprt, polynomialt>::iterator it=polynomials.begin();
859 it!=polynomials.end();
862 replace_expr(it->first, it->second.to_expr(), subbed_expr);
866 std::cout <<
"expr2poly(" <<
expr2c(subbed_expr,
ns) <<
")\n";
883 std::map<exprt, polynomialt> &polynomials,
899 for(std::map<exprt, polynomialt>::iterator it=polynomials.begin();
900 it!=polynomials.end();
903 const exprt &var=it->first;
918 for(expr_sett::iterator it=nonrecursive.begin();
919 it!=nonrecursive.end();
926 for(goto_programt::instructionst::iterator it=body.begin();
935 if(lhs.
id()==ID_dereference)
939 std::cout <<
"Bailing out on write-through-pointer\n";
944 if(lhs.
id()==ID_index)
947 array_writes.insert(lhs);
949 if(arrays_written.find(lhs.
op0())!=arrays_written.end())
954 std::cout <<
"Bailing out on array written to twice in loop: " <<
960 arrays_written.insert(lhs.
op0());
971 for(expr_sett::iterator it=arrays_written.begin();
972 it!=arrays_written.end();
975 if(arrays_read.find(*it)!=arrays_read.end())
978 std::cout <<
"Bailing out on array read and written on same path\n";
984 for(expr_sett::iterator it=nonrecursive.begin();
985 it!=nonrecursive.end();
988 if(it->id()==ID_symbol)
990 exprt &val=state[*it];
994 std::cout <<
"Fitted nonrecursive: " <<
expr2c(*it,
ns) <<
"=" <<
1000 for(expr_sett::iterator it=array_writes.begin();
1001 it!=array_writes.end();
1004 const exprt &lhs=*it;
1005 const exprt &rhs=state[*it];
1010 std::cout <<
"Failed to assign a nonrecursive array: " <<
1023 const exprt &loop_counter,
1027 std::cout <<
"Modelling array assignment " <<
expr2c(lhs,
ns) <<
"=" <<
1031 if(lhs.
id()==ID_dereference)
1035 std::cout <<
"Bailing out on write-through-pointer\n";
1053 const exprt &fresh_array =
1081 std::cout <<
"Trying to polynomialize " <<
expr2c(idx,
ns) <<
'\n';
1088 if(idx.
id()==ID_pointer_offset)
1101 std::cout <<
"Failed to polynomialize\n";
1115 std::cout <<
"Bailing out on nonlinear index: " 1123 exprt lower_bound=idx;
1124 exprt upper_bound=idx;
1145 std::cout <<
"Bailing out on write to constant array index: " <<
1150 else if(stride == 1 || stride == -1)
1188 exprt fresh_lhs=lhs;
1199 forall.
where() = implies;
1204 program.
assign(arr, fresh_array);
1213 if(e.
id()==ID_index ||
1214 e.
id()==ID_dereference)
1216 arrays.insert(e.
op0());
1227 std::set<std::pair<expr_listt, exprt> > &coefficients,
1230 for(std::set<std::pair<expr_listt, exprt> >::iterator it=coefficients.begin();
1231 it!=coefficients.end();
1236 exprt coefficient=it->second;
1238 std::map<exprt, int> degrees;
1241 monomial.
coeff=mp.to_long();
1243 if(monomial.
coeff==0)
1248 for(expr_listt::iterator it=terms.begin();
1254 if(degrees.find(term)!=degrees.end())
1264 for(std::map<exprt, int>::iterator it=degrees.begin();
1270 term.
exp=it->second;
1271 monomial.
terms.push_back(term);
1274 polynomial.
monomials.push_back(monomial);
std::list< exprt > expr_listt
The type of an expression.
irep_idt name
The unique identifier.
void substitute(substitutiont &substitution)
A generic base class for relations, i.e., binary predicates.
Generate Equation using Symbolic Execution.
targett assign(const exprt &lhs, const exprt &rhs)
exprt simplify_expr(const exprt &src, const namespacet &ns)
std::ostream & output(const namespacet &ns, const irep_idt &identifier, std::ostream &out) const
Output goto program to given stream.
exprt precondition(patht &path)
void add_overflow_checks()
void copy_to_operands(const exprt &expr)
const irep_idt & get_identifier() const
Goto Programs with Functions.
const irep_idt & get_value() const
std::set< goto_programt::targett > natural_loopt
const mp_integer binary2integer(const std::string &n, bool is_signed)
convert binary string representation to mp_integer
irep_idt module
Name of module the symbol belongs to.
std::vector< polynomialt > polynomialst
irep_idt pretty_name
Language-specific display name.
Symbol table entry.This is a symbol in the symbol table, stored in an object of type symbol_tablet...
A constant literal expression.
std::vector< termt > terms
std::vector< polynomial_array_assignmentt > polynomial_array_assignmentst
signedbv_typet signed_poly_type()
bool do_arrays(goto_programt::instructionst &loop_body, std::map< exprt, polynomialt > &polynomials, exprt &loop_counter, substitutiont &substitution, scratch_programt &program)
std::list< instructiont > instructionst
exprt conjunction(const exprt::operandst &op)
const code_assignt & to_code_assign(const codet &code)
const irep_idt & id() const
bool replace_expr(const exprt &what, const exprt &by, exprt &dest)
class symbol_exprt symbol_expr() const
produces a symbol_exprt for a symbol
bool array_assignments2polys(expr_pairst &array_assignments, std::map< exprt, polynomialt > &polynomials, polynomial_array_assignmentst &array_polynomials, polynomialst &nondet_indices)
unsignedbv_typet unsigned_poly_type()
void ensure_no_overflows(scratch_programt &program)
std::vector< expr_pairt > expr_pairst
std::unordered_set< exprt, irep_hash > expr_sett
targett assume(const exprt &guard)
symbolt fresh_symbol(std::string base, typet type)
bool assign_array(const exprt &lhs, const exprt &rhs, const exprt &loop_counter, scratch_programt &program)
exprt eval(const exprt &e)
void stash_variables(scratch_programt &program, expr_sett modified, substitutiont &substitution)
void abstract_arrays(exprt &expr, expr_mapt &abstractions)
API to expression classes.
std::list< path_nodet > patht
instructionst::const_iterator const_targett
bool do_nonrecursive(goto_programt::instructionst &loop_body, std::map< exprt, polynomialt > &polynomials, exprt &loop_counter, substitutiont &substitution, expr_sett &nonrecursive, scratch_programt &program)
void find_modified(const patht &path, expr_sett &modified)
A side effect that returns a non-deterministically chosen value.
void gather_array_accesses(const exprt &expr, expr_sett &arrays)
#define forall_operands(it, expr)
const symbol_exprt & to_symbol_expr(const exprt &expr)
Cast a generic exprt to a symbol_exprt.
void extract_polynomial(scratch_programt &program, std::set< std::pair< expr_listt, exprt > > &coefficients, polynomialt &polynomial)
dstringt has one field, an unsigned integer no which is an index into a static table of strings...
bool check_inductive(std::map< exprt, polynomialt > polynomials, patht &path)
bool check_sat(bool do_slice)
bool expr2poly(exprt &expr, std::map< exprt, polynomialt > &polynomials, polynomialt &poly)
const constant_exprt & to_constant_expr(const exprt &expr)
Cast a generic exprt to a constant_exprt.
The boolean constant false.
int max_degree(const exprt &var)
std::vector< exprt > operandst
void gather_rvalues(const exprt &expr, expr_sett &rvalues)
int coeff(const exprt &expr)
A generic container class for the GOTO intermediate representation of one function.
bool do_assumptions(std::map< exprt, polynomialt > polynomials, patht &body, exprt &guard)
typet type
Type of symbol.
void append_path(patht &path)
void from_expr(const exprt &expr)
targett add_instruction()
Adds an instruction at the end.
Base class for all expressions.
std::map< exprt, exprt > substitutiont
irep_idt base_name
Base (non-scoped) name.
std::string to_string(const string_constraintt &expr)
Used for debug printing.
const source_locationt & source_location() const
void add(polynomialt &other)
std::string expr2c(const exprt &expr, const namespacet &ns)
message_handlert & message_handler
std::unordered_map< exprt, exprt, irep_hash > replace_mapt
#define Forall_operands(it, expr)
void push_nondet(exprt &expr)
symbol_tablet & symbol_table
Expression to hold a symbol (variable)
const char * c_str() const
bool add(const symbolt &symbol)
Add a new symbol to the symbol table.
void set_option(const std::string &option, const bool value)
A statement in a programming language.
std::unordered_set< irep_idt > find_symbols_sett
const symbolt * lookup(const irep_idt &name) const
Find a symbol in the symbol table for read-only access.
#define forall_goto_program_instructions(it, program)
const index_exprt & to_index_expr(const exprt &expr)
Cast a generic exprt to an index_exprt.
void find_symbols(const exprt &src, find_symbols_sett &dest)
std::unordered_map< exprt, exprt, irep_hash > expr_mapt
expr_pairst gather_array_assignments(goto_programt::instructionst &loop_body, expr_sett &arrays_written)
std::vector< monomialt > monomials
bool simplify(exprt &expr, const namespacet &ns)
void stash_polynomials(scratch_programt &program, std::map< exprt, polynomialt > &polynomials, std::map< exprt, exprt > &stashed, patht &path)