52 for(patht::iterator it=loop.begin();
56 body.push_back(*(it->loc));
60 std::map<exprt, polynomialt> polynomials;
67 std::cout <<
"Polynomial accelerating program:\n";
69 for(goto_programt::instructionst::iterator it=body.begin();
76 std::cout <<
"Modified:\n";
78 for(expr_sett::iterator it=targets.begin();
82 std::cout <<
expr2c(*it,
ns) <<
'\n';
86 for(goto_programt::instructionst::iterator it=body.begin();
90 if(it->is_assign() || it->is_decl())
92 assigns.push_back(*it);
103 for(expr_sett::iterator it=targets.begin();
120 if(influence.find(target)==influence.end())
123 std::cout <<
"Found nonrecursive expression: "
131 if(target.
id()==ID_index ||
132 target.
id()==ID_dereference)
141 std::map<exprt, polynomialt> this_poly;
142 this_poly[target]=poly;
146 polynomials.insert(std::make_pair(target, poly));
152 std::cout <<
"Failed to fit a polynomial for "
160 if(polynomials.empty())
177 bool path_is_monotone;
183 catch(
const std::string &s)
186 std::cout <<
"Assumptions error: " << s <<
'\n';
192 for(std::map<exprt, polynomialt>::iterator it=polynomials.begin();
193 it!=polynomials.end();
196 replace_expr(it->first, it->second.to_expr(), guard_last);
245 for(std::map<exprt, polynomialt>::iterator it=polynomials.begin();
246 it!=polynomials.end();
249 program.
assign(it->first, it->second.to_expr());
259 std::cout <<
"Failed to accelerate a nonrecursive expression\n";
284 std::vector<expr_listt> parameters;
285 std::set<std::pair<expr_listt, exprt> > coefficients;
293 std::cout <<
"Fitting a polynomial for " <<
expr2c(var,
ns)
294 <<
", which depends on:\n";
296 for(expr_sett::iterator it=influence.begin();
300 std::cout <<
expr2c(*it,
ns) <<
'\n';
304 for(expr_sett::iterator it=influence.begin();
308 if(it->id()==ID_index ||
309 it->id()==ID_dereference)
317 exprs.push_back(*it);
318 parameters.push_back(exprs);
321 parameters.push_back(exprs);
327 parameters.push_back(exprs);
335 parameters.push_back(exprs);
346 for(std::vector<expr_listt>::iterator it=parameters.begin();
347 it!=parameters.end();
352 coefficients.insert(std::make_pair(*it, coeff.
symbol_expr()));
364 std::map<exprt, int> values;
366 for(expr_sett::iterator it=influence.begin();
374 std::cout <<
"Fitting polynomial over " << values.size()
378 for(
int n=0; n<=2; n++)
380 for(expr_sett::iterator it=influence.begin();
394 for(expr_sett::iterator it=influence.begin();
404 std::cout <<
"Fitting polynomial with program:\n";
423 catch(
const std::string &s)
425 std::cout <<
"Error in fitting polynomial SAT check: " << s <<
'\n';
429 std::cout <<
"Error in fitting polynomial SAT check: " << s <<
'\n';
470 std::cout <<
"Fitting constant, eval'd to: "
480 mon.terms.push_back(term);
481 mon.coeff=mp.to_long();
488 catch(
const std::string &s)
490 std::cout <<
"Error in fitting polynomial SAT check: " << s <<
'\n';
494 std::cout <<
"Error in fitting polynomial SAT check: " << s <<
'\n';
503 std::map<exprt, int> &values,
504 std::set<std::pair<expr_listt, exprt> > &coefficients,
513 for(std::map<exprt, int>::iterator it=values.begin();
517 typet this_type=it->first.type();
518 if(this_type.
id()==ID_pointer)
521 std::cout <<
"Overriding pointer type\n";
540 for(std::map<exprt, int>::iterator it=values.begin();
548 for(
int i=0; i < num_unwindings; i++)
550 program.
append(loop_body);
556 for(std::set<std::pair<expr_listt, exprt> >::iterator it=coefficients.begin();
557 it!=coefficients.end();
560 int concrete_value=1;
562 for(expr_listt::const_iterator e_it=it->first.begin();
563 e_it!=it->first.end();
570 concrete_value *= num_unwindings;
574 std::map<exprt, int>::iterator v_it=values.find(e);
576 if(v_it!=values.end())
578 concrete_value *= v_it->second;
612 assumption->guard=polynomial_holds;
623 for(goto_programt::instructionst::reverse_iterator r_it=orig_body.rbegin();
624 r_it!=orig_body.rend();
627 if(r_it->is_assign())
638 for(expr_sett::iterator s_it=lhs_syms.begin();
639 s_it!=lhs_syms.end();
642 if(cone.find(*s_it)!=cone.end())
646 body.push_front(*r_it);
647 cone.erase(assignment.
lhs());
657 std::map<exprt, polynomialt> polynomials,
672 std::vector<exprt> polynomials_hold;
677 for(std::map<exprt, polynomialt>::iterator it=polynomials.begin();
678 it!=polynomials.end();
681 const equal_exprt holds(it->first, it->second.to_expr());
684 polynomials_hold.push_back(holds);
689 codet inc_loop_counter=
695 for(std::vector<exprt>::iterator it=polynomials_hold.begin();
696 it!=polynomials_hold.end();
703 std::cout <<
"Checking following program for inductiveness:\n";
713 std::cout <<
"Not inductive!\n";
722 catch(
const std::string &s)
724 std::cout <<
"Error in inductiveness SAT check: " << s <<
'\n';
729 std::cout <<
"Error in inductiveness SAT check: " << s <<
'\n';
736 std::map<exprt, polynomialt> &polynomials,
744 for(std::map<exprt, polynomialt>::iterator it=polynomials.begin();
745 it!=polynomials.end();
748 it->second.substitute(substitution);
759 for(expr_sett::iterator it=modified.begin();
767 vars.erase(loop_counter_name);
769 for(find_symbols_sett::iterator it=vars.begin();
792 for(patht::reverse_iterator r_it=path.rbegin();
805 if(lhs.
id()==ID_symbol)
809 else if(lhs.
id()==ID_index ||
810 lhs.
id()==ID_dereference)
819 else if(t->is_assume() || t->is_assert())
828 if(!r_it->guard.is_true() && !r_it->guard.is_nil())