#include "../sat/sat.h"
#include "AbsRefine_CounterExample.h"
+#include "../printer/printers.h"
const bool debug_counterexample = false;
return;
}
+ bm->PLPrintNodeSet.clear();
+ bm->NodeLetVarMap.clear();
+ bm->NodeLetVarVec.clear();
+ bm->NodeLetVarMap1.clear();
+
// Take a copy of the counterexample map, 'cause TermToConstTermUsingModel
// changes it. Which breaks the iterator otherwise.
const ASTNodeMap c(CounterExampleMap);
f[1].GetKind() == BVCONST))
{
os << "ASSERT( ";
- f.PL_Print(os,0);
+ printer::PL_Print1(os,f,0,false);
if(BOOLEAN_TYPE == f.GetType())
{
os << "<=>";
{
ASTNode rhs = TermToConstTermUsingModel(se, false);
assert(rhs.isConstant());
- rhs.PL_Print(os, 0);
+ printer::PL_Print1(os,rhs,0,false);
}
else
{
- se.PL_Print(os, 0);
+ printer::PL_Print1(os,se,0,false);
}
os << " );" << endl;
}
ostream& PL_Print(ostream &os,
const BEEV::ASTNode& n, int indentation=0);
+ void PL_Print1(ostream& os, const ASTNode& n,int indentation, bool letize);
+
+
ostream& Lisp_Print(ostream &os,
const BEEV::ASTNode& n, int indentation=0);
ostream& Lisp_Print_indent(ostream &os,