X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=src%2Fcsolver.cc;h=a02227e0b82ddedcb52c063ae99bb3611fa8fa2d;hb=081e954fa3566ad9a2522ca45bef8e29472d2a72;hp=e844e792eb305c4cc1c53cb59022326de8a71113;hpb=a81fa2318fde9ebaa3a0cf1604ab23ed85c3a9a7;p=satune.git

diff --git a/src/csolver.cc b/src/csolver.cc
index e844e79..a02227e 100644
--- a/src/csolver.cc
+++ b/src/csolver.cc
@@ -25,14 +25,24 @@
 #include "ordergraph.h"
 #include "orderedge.h"
 #include "orderanalysis.h"
+#include "elementopt.h"
+#include "varorderingopt.h"
 #include <time.h>
+#include <stdarg.h>
+#include "alloyinterpreter.h"
+#include "smtinterpreter.h"
+#include "mathsatinterpreter.h"
+#include "smtratinterpreter.h"
 
 CSolver::CSolver() :
 	boolTrue(BooleanEdge(new BooleanConst(true))),
 	boolFalse(boolTrue.negate()),
 	unsat(false),
+	booleanVarUsed(false),
 	tuner(NULL),
-	elapsedTime(0)
+	elapsedTime(0),
+	satsolverTimeout(NOTIMEOUT),
+	interpreter(NULL)
 {
 	satEncoder = new SATEncoder(this);
 }
@@ -40,7 +50,7 @@ CSolver::CSolver() :
 /** This function tears down the solver and the entire AST */
 
 CSolver::~CSolver() {
-	serialize();
+	//serialize();
 	uint size = allBooleans.getSize();
 	for (uint i = 0; i < size; i++) {
 		delete allBooleans.get(i);
@@ -53,7 +63,7 @@ CSolver::~CSolver() {
 
 	size = allElements.getSize();
 	for (uint i = 0; i < size; i++) {
-                Element* el = allElements.get(i);
+		Element *el = allElements.get(i);
 		delete el;
 	}
 
@@ -76,10 +86,73 @@ CSolver::~CSolver() {
 		delete allFunctions.get(i);
 	}
 
+	if (interpreter != NULL) {
+		delete interpreter;
+	}
+
 	delete boolTrue.getBoolean();
 	delete satEncoder;
 }
 
+void CSolver::resetSolver() {
+	//serialize();
+	uint size = allBooleans.getSize();
+	for (uint i = 0; i < size; i++) {
+		delete allBooleans.get(i);
+	}
+
+	size = allSets.getSize();
+	for (uint i = 0; i < size; i++) {
+		delete allSets.get(i);
+	}
+
+	size = allElements.getSize();
+	for (uint i = 0; i < size; i++) {
+		Element *el = allElements.get(i);
+		delete el;
+	}
+
+	size = allTables.getSize();
+	for (uint i = 0; i < size; i++) {
+		delete allTables.get(i);
+	}
+
+	size = allPredicates.getSize();
+	for (uint i = 0; i < size; i++) {
+		delete allPredicates.get(i);
+	}
+
+	size = allOrders.getSize();
+	for (uint i = 0; i < size; i++) {
+		delete allOrders.get(i);
+	}
+	size = allFunctions.getSize();
+	for (uint i = 0; i < size; i++) {
+		delete allFunctions.get(i);
+	}
+	delete boolTrue.getBoolean();
+	allBooleans.clear();
+	allSets.clear();
+	allElements.clear();
+	allTables.clear();
+	allPredicates.clear();
+	allOrders.clear();
+	allFunctions.clear();
+	constraints.reset();
+	activeOrders.reset();
+	boolMap.reset();
+	elemMap.reset();
+
+	boolTrue = BooleanEdge(new BooleanConst(true));
+	boolFalse = boolTrue.negate();
+	unsat = false;
+	booleanVarUsed = false;
+	elapsedTime = 0;
+	tuner = NULL;
+	satEncoder->resetSATEncoder();
+
+}
+
 CSolver *CSolver::clone() {
 	CSolver *copy = new CSolver();
 	CloneMap map;
@@ -92,17 +165,17 @@ CSolver *CSolver::clone() {
 	return copy;
 }
 
-CSolver* CSolver::deserialize(const char * file){
-	model_print("deserializing ...\n");
-	Deserializer deserializer(file);
+CSolver *CSolver::deserialize(const char *file, InterpreterType itype) {
+	model_print("deserializing %s ...\n", file);
+	Deserializer deserializer(file, itype);
 	return deserializer.deserialize();
 }
 
 void CSolver::serialize() {
 	model_print("serializing ...\n");
 	char buffer[255];
-	long long nanotime=getTimeNano();
-	int numchars=sprintf(buffer, "DUMP%llu", nanotime);
+	long long nanotime = getTimeNano();
+	int numchars = sprintf(buffer, "DUMP%llu", nanotime);
 	Serializer serializer(buffer);
 	SetIteratorBooleanEdge *it = getConstraints();
 	while (it->hasNext()) {
@@ -124,6 +197,10 @@ Set *CSolver::createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange
 	return set;
 }
 
+bool CSolver::itemExistInSet(Set *set, uint64_t item) {
+	return set->exists(item);
+}
+
 VarType CSolver::getSetVarType(Set *set) {
 	return set->getType();
 }
@@ -159,6 +236,10 @@ Element *CSolver::getElementVar(Set *set) {
 	return element;
 }
 
+void CSolver::mustHaveValue(Element *element) {
+	element->anyValue = true;
+}
+
 Set *CSolver::getElementRange (Element *element) {
 	return element->getRange();
 }
@@ -196,14 +277,14 @@ Element *CSolver::applyFunction(Function *function, Element **array, uint numArr
 	}
 }
 
-Function *CSolver::createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,OverFlowBehavior overflowbehavior) {
-	Function *function = new FunctionOperator(op, domain, numDomain, range, overflowbehavior);
+Function *CSolver::createFunctionOperator(ArithOp op, Set *range, OverFlowBehavior overflowbehavior) {
+	Function *function = new FunctionOperator(op, range, overflowbehavior);
 	allFunctions.push(function);
 	return function;
 }
 
-Predicate *CSolver::createPredicateOperator(CompOp op, Set **domain, uint numDomain) {
-	Predicate *predicate = new PredicateOperator(op, domain,numDomain);
+Predicate *CSolver::createPredicateOperator(CompOp op) {
+	Predicate *predicate = new PredicateOperator(op);
 	allPredicates.push(predicate);
 	return predicate;
 }
@@ -214,14 +295,14 @@ Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavio
 	return predicate;
 }
 
-Table *CSolver::createTable(Set **domains, uint numDomain, Set *range) {
-	Table *table = new Table(domains,numDomain,range);
+Table *CSolver::createTable(Set *range) {
+	Table *table = new Table(range);
 	allTables.push(table);
 	return table;
 }
 
-Table *CSolver::createTableForPredicate(Set **domains, uint numDomain) {
-	return createTable(domains, numDomain, NULL);
+Table *CSolver::createTableForPredicate() {
+	return createTable(NULL);
 }
 
 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
@@ -237,6 +318,8 @@ Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
 BooleanEdge CSolver::getBooleanVar(VarType type) {
 	Boolean *boolean = new BooleanVar(type);
 	allBooleans.push(boolean);
+	if (!booleanVarUsed)
+		booleanVarUsed = true;
 	return BooleanEdge(boolean);
 }
 
@@ -284,9 +367,11 @@ BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg) {
 	return applyLogicalOperation(op, array, 1);
 }
 
-static int ptrcompares(const void *p1, const void *p2) {
-	uintptr_t b1 = *(uintptr_t const *) p1;
-	uintptr_t b2 = *(uintptr_t const *) p2;
+static int booleanEdgeCompares(const void *p1, const void *p2) {
+	BooleanEdge be1 = *(BooleanEdge const *) p1;
+	BooleanEdge be2 = *(BooleanEdge const *) p2;
+	uint64_t b1 = be1->id;
+	uint64_t b2 = be2->id;
 	if (b1 < b2)
 		return -1;
 	else if (b1 == b2)
@@ -310,81 +395,109 @@ BooleanEdge CSolver::rewriteLogicalOperation(LogicOp op, BooleanEdge *array, uin
 	return applyLogicalOperation(op, newarray, asize);
 }
 
+BooleanEdge CSolver::applyExactlyOneConstraint (BooleanEdge *array, uint asize){
+	BooleanEdge newarray[asize + 1];
+
+	newarray[asize] = applyLogicalOperation(SATC_OR, array, asize);
+	for (uint i=0; i< asize; i++){
+		BooleanEdge oprand1 = array[i];
+		BooleanEdge carray [asize -1];
+		uint index = 0;
+		for( uint j =0; j< asize; j++){
+			if(i != j){
+				BooleanEdge oprand2 = applyLogicalOperation(SATC_NOT, array[j]);
+				carray[index++] = applyLogicalOperation(SATC_IMPLIES, oprand1, oprand2);
+			}
+		}
+		ASSERT(index == asize -1);
+		newarray[i] = applyLogicalOperation(SATC_AND, carray, asize-1);
+	}
+	return applyLogicalOperation(SATC_AND, newarray, asize+1);
+}
+
 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
-	BooleanEdge newarray[asize];
-	switch (op) {
-	case SATC_NOT: {
-		return array[0].negate();
-	}
-	case SATC_IFF: {
-		for (uint i = 0; i < 2; i++) {
-			if (isTrue(array[i])) {	// It can be undefined
-				return array[1 - i];
-			} else if (isFalse(array[i])) {
-				newarray[0] = array[1 - i];
-				return applyLogicalOperation(SATC_NOT, newarray, 1);
-			} else if (array[i]->type == LOGICOP) {
-				BooleanLogic *b = (BooleanLogic *)array[i].getBoolean();
-				if (b->replaced) {
-					return rewriteLogicalOperation(op, array, asize);
+	if (!useInterpreter()) {
+		BooleanEdge newarray[asize];
+		switch (op) {
+		case SATC_NOT: {
+			return array[0].negate();
+		}
+		case SATC_IFF: {
+			for (uint i = 0; i < 2; i++) {
+				if (isTrue(array[i])) {	// It can be undefined
+					return array[1 - i];
+				} else if (isFalse(array[i])) {
+					newarray[0] = array[1 - i];
+					return applyLogicalOperation(SATC_NOT, newarray, 1);
+				} else if (array[i]->type == LOGICOP) {
+					BooleanLogic *b = (BooleanLogic *)array[i].getBoolean();
+					if (b->replaced) {
+						return rewriteLogicalOperation(op, array, asize);
+					}
 				}
 			}
+			break;
 		}
-		break;
-	}
-	case SATC_OR: {
-		for (uint i = 0; i < asize; i++) {
-			newarray[i] = applyLogicalOperation(SATC_NOT, array[i]);
+		case SATC_OR: {
+			for (uint i = 0; i < asize; i++) {
+				newarray[i] = applyLogicalOperation(SATC_NOT, array[i]);
+			}
+			return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_AND, newarray, asize));
 		}
-		return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_AND, newarray, asize));
-	}
-	case SATC_AND: {
-		uint newindex = 0;
-		for (uint i = 0; i < asize; i++) {
-			BooleanEdge b = array[i];
-			if (b->type == LOGICOP) {
-				if (((BooleanLogic *)b.getBoolean())->replaced)
-					return rewriteLogicalOperation(op, array, asize);
+		case SATC_AND: {
+			uint newindex = 0;
+			for (uint i = 0; i < asize; i++) {
+				BooleanEdge b = array[i];
+				if (b->type == LOGICOP) {
+					if (((BooleanLogic *)b.getBoolean())->replaced)
+						return rewriteLogicalOperation(op, array, asize);
+				}
+				if (isTrue(b))
+					continue;
+				else if (isFalse(b)) {
+					return boolFalse;
+				} else
+					newarray[newindex++] = b;
+			}
+			if (newindex == 0) {
+				return boolTrue;
+			} else if (newindex == 1) {
+				return newarray[0];
+			} else {
+				bsdqsort(newarray, newindex, sizeof(BooleanEdge), booleanEdgeCompares);
+				array = newarray;
+				asize = newindex;
 			}
-			if (isTrue(b))
-				continue;
-			else if (isFalse(b)) {
-				return boolFalse;
-			} else
-				newarray[newindex++] = b;
+			break;
+		}
+		case SATC_XOR: {
+			//handle by translation
+			return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_IFF, array, asize));
+		}
+		case SATC_IMPLIES: {
+			//handle by translation
+			return applyLogicalOperation(SATC_OR, applyLogicalOperation(SATC_NOT, array[0]), array[1]);
 		}
-		if (newindex == 0) {
-			return boolTrue;
-		} else if (newindex == 1) {
-			return newarray[0];
-		} else {
-			bsdqsort(newarray, newindex, sizeof(BooleanEdge), ptrcompares);
-			array = newarray;
-			asize = newindex;
 		}
-		break;
-	}
-	case SATC_XOR: {
-		//handle by translation
-		return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_IFF, array, asize));
-	}
-	case SATC_IMPLIES: {
-		//handle by translation
-		return applyLogicalOperation(SATC_OR, applyLogicalOperation(SATC_NOT, array[0]), array[1]);
-	}
-	}
 
-	ASSERT(asize != 0);
-	Boolean *boolean = new BooleanLogic(this, op, array, asize);
-	Boolean *b = boolMap.get(boolean);
-	if (b == NULL) {
-		boolean->updateParents();
-		boolMap.put(boolean, boolean);
+		ASSERT(asize != 0);
+		Boolean *boolean = new BooleanLogic(this, op, array, asize);
+		Boolean *b = boolMap.get(boolean);
+		if (b == NULL) {
+			boolean->updateParents();
+			boolMap.put(boolean, boolean);
+			allBooleans.push(boolean);
+			return BooleanEdge(boolean);
+		} else {
+			delete boolean;
+			return BooleanEdge(b);
+		}
+	} else {
+		ASSERT(asize != 0);
+		Boolean *boolean = new BooleanLogic(this, op, array, asize);
 		allBooleans.push(boolean);
 		return BooleanEdge(boolean);
-	} else {
-		delete boolean;
-		return BooleanEdge(b);
+
 	}
 }
 
@@ -403,72 +516,83 @@ BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t seco
 		}
 	}
 	Boolean *constraint = new BooleanOrder(order, first, second);
-	Boolean *b = boolMap.get(constraint);
-
-	if (b == NULL) {
-		allBooleans.push(constraint);
-		boolMap.put(constraint, constraint);
-		constraint->updateParents();
-		if (order->graph != NULL) {
-			OrderGraph *graph=order->graph;
-			OrderNode *from=graph->lookupOrderNodeFromOrderGraph(first);
-			if (from != NULL) {
-				OrderNode *to=graph->lookupOrderNodeFromOrderGraph(second);
-				if (to != NULL) {
-					OrderEdge *edge=graph->lookupOrderEdgeFromOrderGraph(from, to);
-					OrderEdge *invedge;
-
-					if (edge != NULL && edge->mustPos) {
-						replaceBooleanWithTrueNoRemove(constraint);
-					} else if (edge != NULL && edge->mustNeg) {
-						replaceBooleanWithFalseNoRemove(constraint);
-					} else if ((invedge=graph->lookupOrderEdgeFromOrderGraph(to, from)) != NULL
-										 && invedge->mustPos) {
-						replaceBooleanWithFalseNoRemove(constraint);
+	if (!useInterpreter() ) {
+		Boolean *b = boolMap.get(constraint);
+
+		if (b == NULL) {
+			allBooleans.push(constraint);
+			boolMap.put(constraint, constraint);
+			constraint->updateParents();
+			if ( order->graph != NULL) {
+				OrderGraph *graph = order->graph;
+				OrderNode *from = graph->lookupOrderNodeFromOrderGraph(first);
+				if (from != NULL) {
+					OrderNode *to = graph->lookupOrderNodeFromOrderGraph(second);
+					if (to != NULL) {
+						OrderEdge *edge = graph->lookupOrderEdgeFromOrderGraph(from, to);
+						OrderEdge *invedge;
+
+						if (edge != NULL && edge->mustPos) {
+							replaceBooleanWithTrueNoRemove(constraint);
+						} else if (edge != NULL && edge->mustNeg) {
+							replaceBooleanWithFalseNoRemove(constraint);
+						} else if ((invedge = graph->lookupOrderEdgeFromOrderGraph(to, from)) != NULL
+											 && invedge->mustPos) {
+							replaceBooleanWithFalseNoRemove(constraint);
+						}
 					}
 				}
 			}
+		} else {
+			delete constraint;
+			constraint = b;
 		}
-	} else {
-		delete constraint;
-		constraint = b;
 	}
-
 	BooleanEdge be = BooleanEdge(constraint);
 	return negate ? be.negate() : be;
 }
 
 void CSolver::addConstraint(BooleanEdge constraint) {
-	if (isTrue(constraint))
-		return;
-	else if (isFalse(constraint)) {
-		int t = 0;
-		setUnSAT();
-	}
-	else {
-		if (constraint->type == LOGICOP) {
-			BooleanLogic *b = (BooleanLogic *) constraint.getBoolean();
-			if (!constraint.isNegated()) {
-				if (b->op == SATC_AND) {
-					for (uint i = 0; i < b->inputs.getSize(); i++) {
-						addConstraint(b->inputs.get(i));
+	if (!useInterpreter()) {
+		if (isTrue(constraint))
+			return;
+		else if (isFalse(constraint)) {
+			setUnSAT();
+		}
+		else {
+			if (constraint->type == LOGICOP) {
+				BooleanLogic *b = (BooleanLogic *) constraint.getBoolean();
+				if (!constraint.isNegated()) {
+					if (b->op == SATC_AND) {
+						uint size = b->inputs.getSize();
+						//Handle potential concurrent modification
+						BooleanEdge array[size];
+						for (uint i = 0; i < size; i++) {
+							array[i] = b->inputs.get(i);
+						}
+						for (uint i = 0; i < size; i++) {
+							addConstraint(array[i]);
+						}
+						return;
 					}
+				}
+				if (b->replaced) {
+					addConstraint(doRewrite(constraint));
 					return;
 				}
 			}
-			if (b->replaced) {
-				addConstraint(doRewrite(constraint));
-				return;
+			constraints.add(constraint);
+			Boolean *ptr = constraint.getBoolean();
+
+			if (ptr->boolVal == BV_UNSAT) {
+				setUnSAT();
 			}
-		}
-		constraints.add(constraint);
-		Boolean *ptr = constraint.getBoolean();
 
-		if (ptr->boolVal == BV_UNSAT) {
-			setUnSAT();
+			replaceBooleanWithTrueNoRemove(constraint);
+			constraint->parents.clear();
 		}
-
-		replaceBooleanWithTrueNoRemove(constraint);
+	} else {
+		constraints.add(constraint);
 		constraint->parents.clear();
 	}
 }
@@ -481,7 +605,7 @@ Order *CSolver::createOrder(OrderType type, Set *set) {
 }
 
 /** Computes static ordering information to allow isTrue/isFalse
-		queries on newly created orders to work. */
+    queries on newly created orders to work. */
 
 void CSolver::inferFixedOrder(Order *order) {
 	if (order->graph != NULL) {
@@ -490,7 +614,7 @@ void CSolver::inferFixedOrder(Order *order) {
 	order->graph = buildMustOrderGraph(order);
 	reachMustAnalysis(this, order->graph, true);
 }
-	
+
 void CSolver::inferFixedOrders() {
 	SetIteratorOrder *orderit = activeOrders.iterator();
 	while (orderit->hasNext()) {
@@ -499,63 +623,80 @@ void CSolver::inferFixedOrders() {
 	}
 }
 
-#define NANOSEC 1000000000.0
 int CSolver::solve() {
-	long long starttime = getTimeNano();	
+	if (isUnSAT()) {
+		return IS_UNSAT;
+	}
+	long long startTime = getTimeNano();
 	bool deleteTuner = false;
 	if (tuner == NULL) {
 		tuner = new DefaultTuner();
 		deleteTuner = true;
 	}
+	int result = IS_INDETER;
+	if (useInterpreter()) {
+		interpreter->encode();
+		model_print("Problem encoded in Interpreter\n");
+		result = interpreter->solve();
+		model_print("Problem solved by Interpreter\n");
+	} else {
 
-
-	{
-		SetIteratorOrder *orderit = activeOrders.iterator();
-		while (orderit->hasNext()) {
-			Order *order = orderit->next();
-			if (order->graph != NULL) {
-				delete order->graph;
-				order->graph = NULL;
+		{
+			SetIteratorOrder *orderit = activeOrders.iterator();
+			while (orderit->hasNext()) {
+				Order *order = orderit->next();
+				if (order->graph != NULL) {
+					delete order->graph;
+					order->graph = NULL;
+				}
 			}
+			delete orderit;
 		}
-		delete orderit;
-	}
-
-	computePolarities(this);
-	long long time2 = getTimeNano();
-	model_print("Polarity time: %f\n", (time2-starttime)/NANOSEC);
-	Preprocess pp(this);
-	pp.doTransform();
-	long long time3 = getTimeNano();
-	model_print("Preprocess time: %f\n", (time3-time2)/NANOSEC);
-	
-	DecomposeOrderTransform dot(this);
-	dot.doTransform();
-	long long time4 = getTimeNano();
-	model_print("Decompose Order: %f\n", (time4-time3)/NANOSEC);
-
-	IntegerEncodingTransform iet(this);
-	iet.doTransform();
-
-	EncodingGraph eg(this);
-	eg.buildGraph();
-	eg.encode();
-
-	naiveEncodingDecision(this);
-	long long time5 = getTimeNano();
-	model_print("Encoding Graph Time: %f\n", (time5-time4)/NANOSEC);
-	
-	long long startTime = getTimeNano();
-	satEncoder->encodeAllSATEncoder(this);
-	long long endTime = getTimeNano();
-
-	elapsedTime = endTime - startTime;
-	model_print("Elapse Encode time: %f\n", elapsedTime/NANOSEC);
-	
-	model_print("Is problem UNSAT after encoding: %d\n", unsat);
-	int result = unsat ? IS_UNSAT : satEncoder->solve();
-	model_print("Result Computed in CSolver: %d\n", result);
-	
+		computePolarities(this);
+		long long time1 = getTimeNano();
+		model_print("Polarity time: %f\n", (time1 - startTime) / NANOSEC);
+		Preprocess pp(this);
+		pp.doTransform();
+		long long time2 = getTimeNano();
+		model_print("Preprocess time: %f\n", (time2 - time1) / NANOSEC);
+
+		DecomposeOrderTransform dot(this);
+		dot.doTransform();
+		time1 = getTimeNano();
+		model_print("Decompose Order: %f\n", (time1 - time2) / NANOSEC);
+
+		IntegerEncodingTransform iet(this);
+		iet.doTransform();
+
+		ElementOpt eop(this);
+		eop.doTransform();
+
+		EncodingGraph eg(this);
+		eg.encode();
+
+		naiveEncodingDecision(this);
+		//	eg.validate();
+
+		VarOrderingOpt bor(this, satEncoder);
+		bor.doTransform();
+
+		time2 = getTimeNano();
+		model_print("Encoding Graph Time: %f\n", (time2 - time1) / NANOSEC);
+
+		satEncoder->encodeAllSATEncoder(this);
+		time1 = getTimeNano();
+
+		model_print("Elapse Encode time: %f\n", (time1 - startTime) / NANOSEC);
+
+		model_print("Is problem UNSAT after encoding: %d\n", unsat);
+
+
+		result = unsat ? IS_UNSAT : satEncoder->solve(satsolverTimeout);
+		model_print("Result Computed in SAT solver:\t%s\n", result == IS_SAT ? "SAT" : result == IS_INDETER ? "INDETERMINATE" : " UNSAT");
+		time2 = getTimeNano();
+		elapsedTime = time2 - startTime;
+		model_print("CSOLVER solve time: %f\n", elapsedTime / NANOSEC);
+	}
 	if (deleteTuner) {
 		delete tuner;
 		tuner = NULL;
@@ -563,23 +704,43 @@ int CSolver::solve() {
 	return result;
 }
 
+void CSolver::setInterpreter(InterpreterType type) {
+	if (interpreter == NULL) {
+		switch (type) {
+		case SATUNE:
+			break;
+		case ALLOY: {
+			interpreter = new AlloyInterpreter(this);
+			break;
+		} case Z3: {
+			interpreter = new SMTInterpreter(this);
+			break;
+		}
+		case MATHSAT: {
+			interpreter = new MathSATInterpreter(this);
+			break;
+		}
+		case SMTRAT: {
+			interpreter = new SMTRatInterpreter(this);
+			break;
+		}
+		default:
+			ASSERT(0);
+		}
+	}
+}
+
 void CSolver::printConstraints() {
 	SetIteratorBooleanEdge *it = getConstraints();
 	while (it->hasNext()) {
 		BooleanEdge b = it->next();
-		if (b.isNegated())
-			model_print("!");
-		b->print();
-		model_print("\n");
+		b.print();
 	}
 	delete it;
 }
 
 void CSolver::printConstraint(BooleanEdge b) {
-	if (b.isNegated())
-		model_print("!");
-	b->print();
-	model_print("\n");
+	b.print();
 }
 
 uint64_t CSolver::getElementValue(Element *element) {
@@ -587,7 +748,8 @@ uint64_t CSolver::getElementValue(Element *element) {
 	case ELEMSET:
 	case ELEMCONST:
 	case ELEMFUNCRETURN:
-		return getElementValueSATTranslator(this, element);
+		return useInterpreter() ? interpreter->getValue(element) :
+					 getElementValueSATTranslator(this, element);
 	default:
 		ASSERT(0);
 	}
@@ -598,7 +760,8 @@ bool CSolver::getBooleanValue(BooleanEdge bedge) {
 	Boolean *boolean = bedge.getBoolean();
 	switch (boolean->type) {
 	case BOOLEANVAR:
-		return getBooleanVariableValueSATTranslator(this, boolean);
+		return useInterpreter() ? interpreter->getBooleanValue(boolean) :
+					 getBooleanVariableValueSATTranslator(this, boolean);
 	default:
 		ASSERT(0);
 	}
@@ -619,3 +782,5 @@ void CSolver::autoTune(uint budget) {
 	autotuner->tune();
 	delete autotuner;
 }
+
+