3 #include "mutableset.h"
10 #include "satencoder.h"
11 #include "sattranslator.h"
13 #include "polarityassignment.h"
14 #include "decomposeordertransform.h"
15 #include "autotuner.h"
18 #include "orderresolver.h"
19 #include "integerencoding.h"
21 #include "preprocess.h"
22 #include "serializer.h"
23 #include "deserializer.h"
24 #include "encodinggraph.h"
25 #include "ordergraph.h"
26 #include "orderedge.h"
27 #include "orderanalysis.h"
28 #include "elementopt.h"
29 #include "varorderingopt.h"
32 #include "alloyinterpreter.h"
33 #include "smtinterpreter.h"
34 #include "mathsatinterpreter.h"
35 #include "smtratinterpreter.h"
38 boolTrue(BooleanEdge(new BooleanConst(true))),
39 boolFalse(boolTrue.negate()),
41 booleanVarUsed(false),
44 satsolverTimeout(NOTIMEOUT),
47 satEncoder = new SATEncoder(this);
50 /** This function tears down the solver and the entire AST */
54 uint size = allBooleans.getSize();
55 for (uint i = 0; i < size; i++) {
56 delete allBooleans.get(i);
59 size = allSets.getSize();
60 for (uint i = 0; i < size; i++) {
61 delete allSets.get(i);
64 size = allElements.getSize();
65 for (uint i = 0; i < size; i++) {
66 Element *el = allElements.get(i);
70 size = allTables.getSize();
71 for (uint i = 0; i < size; i++) {
72 delete allTables.get(i);
75 size = allPredicates.getSize();
76 for (uint i = 0; i < size; i++) {
77 delete allPredicates.get(i);
80 size = allOrders.getSize();
81 for (uint i = 0; i < size; i++) {
82 delete allOrders.get(i);
84 size = allFunctions.getSize();
85 for (uint i = 0; i < size; i++) {
86 delete allFunctions.get(i);
89 if(interpreter != NULL){
93 delete boolTrue.getBoolean();
97 void CSolver::resetSolver() {
99 uint size = allBooleans.getSize();
100 for (uint i = 0; i < size; i++) {
101 delete allBooleans.get(i);
104 size = allSets.getSize();
105 for (uint i = 0; i < size; i++) {
106 delete allSets.get(i);
109 size = allElements.getSize();
110 for (uint i = 0; i < size; i++) {
111 Element *el = allElements.get(i);
115 size = allTables.getSize();
116 for (uint i = 0; i < size; i++) {
117 delete allTables.get(i);
120 size = allPredicates.getSize();
121 for (uint i = 0; i < size; i++) {
122 delete allPredicates.get(i);
125 size = allOrders.getSize();
126 for (uint i = 0; i < size; i++) {
127 delete allOrders.get(i);
129 size = allFunctions.getSize();
130 for (uint i = 0; i < size; i++) {
131 delete allFunctions.get(i);
133 delete boolTrue.getBoolean();
138 allPredicates.clear();
140 allFunctions.clear();
142 activeOrders.reset();
146 boolTrue = BooleanEdge(new BooleanConst(true));
147 boolFalse = boolTrue.negate();
149 booleanVarUsed = false;
152 satEncoder->resetSATEncoder();
156 CSolver *CSolver::clone() {
157 CSolver *copy = new CSolver();
159 SetIteratorBooleanEdge *it = getConstraints();
160 while (it->hasNext()) {
161 BooleanEdge b = it->next();
162 copy->addConstraint(cloneEdge(copy, &map, b));
168 CSolver *CSolver::deserialize(const char *file, InterpreterType itype) {
169 model_print("deserializing %s ...\n", file);
170 Deserializer deserializer(file, itype);
171 return deserializer.deserialize();
174 void CSolver::serialize() {
175 model_print("serializing ...\n");
177 long long nanotime = getTimeNano();
178 int numchars = sprintf(buffer, "DUMP%llu", nanotime);
179 Serializer serializer(buffer);
180 SetIteratorBooleanEdge *it = getConstraints();
181 while (it->hasNext()) {
182 BooleanEdge b = it->next();
183 serializeBooleanEdge(&serializer, b, true);
188 Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) {
189 Set *set = new Set(type, elements, numelements);
194 Set *CSolver::createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange) {
195 Set *set = new Set(type, lowrange, highrange);
200 bool CSolver::itemExistInSet(Set *set, uint64_t item) {
201 return set->exists(item);
204 VarType CSolver::getSetVarType(Set *set) {
205 return set->getType();
208 Element *CSolver::createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange) {
209 Set *s = createRangeSet(type, lowrange, highrange);
210 return getElementVar(s);
213 MutableSet *CSolver::createMutableSet(VarType type) {
214 MutableSet *set = new MutableSet(type);
219 void CSolver::addItem(MutableSet *set, uint64_t element) {
220 set->addElementMSet(element);
223 uint64_t CSolver::createUniqueItem(MutableSet *set) {
224 uint64_t element = set->getNewUniqueItem();
225 set->addElementMSet(element);
229 void CSolver::finalizeMutableSet(MutableSet *set) {
233 Element *CSolver::getElementVar(Set *set) {
234 Element *element = new ElementSet(set);
235 allElements.push(element);
239 void CSolver::mustHaveValue(Element *element) {
240 element->anyValue = true;
243 Set *CSolver::getElementRange (Element *element) {
244 return element->getRange();
248 Element *CSolver::getElementConst(VarType type, uint64_t value) {
249 uint64_t array[] = {value};
250 Set *set = new Set(type, array, 1);
251 Element *element = new ElementConst(value, set);
252 Element *e = elemMap.get(element);
255 allElements.push(element);
256 elemMap.put(element, element);
266 Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, BooleanEdge overflowstatus) {
267 ASSERT(numArrays == 2);
268 Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
269 Element *e = elemMap.get(element);
271 element->updateParents();
272 allElements.push(element);
273 elemMap.put(element, element);
281 Function *CSolver::createFunctionOperator(ArithOp op, Set *range, OverFlowBehavior overflowbehavior) {
282 Function *function = new FunctionOperator(op, range, overflowbehavior);
283 allFunctions.push(function);
287 Predicate *CSolver::createPredicateOperator(CompOp op) {
288 Predicate *predicate = new PredicateOperator(op);
289 allPredicates.push(predicate);
293 Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavior) {
294 Predicate *predicate = new PredicateTable(table, behavior);
295 allPredicates.push(predicate);
299 Table *CSolver::createTable(Set *range) {
300 Table *table = new Table(range);
301 allTables.push(table);
305 Table *CSolver::createTableForPredicate() {
306 return createTable(NULL);
309 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
310 table->addNewTableEntry(inputs, inputSize, result);
313 Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
314 Function *function = new FunctionTable(table, behavior);
315 allFunctions.push(function);
319 BooleanEdge CSolver::getBooleanVar(VarType type) {
320 Boolean *boolean = new BooleanVar(type);
321 allBooleans.push(boolean);
323 booleanVarUsed = true;
324 return BooleanEdge(boolean);
327 BooleanEdge CSolver::getBooleanTrue() {
331 BooleanEdge CSolver::getBooleanFalse() {
335 BooleanEdge CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
336 return applyPredicateTable(predicate, inputs, numInputs, BooleanEdge(NULL));
339 BooleanEdge CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, BooleanEdge undefinedStatus) {
340 BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
341 Boolean *b = boolMap.get(boolean);
343 boolean->updateParents();
344 boolMap.put(boolean, boolean);
345 allBooleans.push(boolean);
346 return BooleanEdge(boolean);
349 return BooleanEdge(b);
353 bool CSolver::isTrue(BooleanEdge b) {
354 return b.isNegated() ? b->isFalse() : b->isTrue();
357 bool CSolver::isFalse(BooleanEdge b) {
358 return b.isNegated() ? b->isTrue() : b->isFalse();
361 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg1, BooleanEdge arg2) {
362 BooleanEdge array[] = {arg1, arg2};
363 return applyLogicalOperation(op, array, 2);
366 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg) {
367 BooleanEdge array[] = {arg};
368 return applyLogicalOperation(op, array, 1);
371 static int booleanEdgeCompares(const void *p1, const void *p2) {
372 BooleanEdge be1 = *(BooleanEdge const *) p1;
373 BooleanEdge be2 = *(BooleanEdge const *) p2;
374 uint64_t b1 = be1->id;
375 uint64_t b2 = be2->id;
384 BooleanEdge CSolver::rewriteLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
385 BooleanEdge newarray[asize];
386 memcpy(newarray, array, asize * sizeof(BooleanEdge));
387 for (uint i = 0; i < asize; i++) {
388 BooleanEdge b = newarray[i];
389 if (b->type == LOGICOP) {
390 if (((BooleanLogic *) b.getBoolean())->replaced) {
391 newarray[i] = doRewrite(newarray[i]);
396 return applyLogicalOperation(op, newarray, asize);
399 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
400 if(!useInterpreter()){
401 BooleanEdge newarray[asize];
404 return array[0].negate();
407 for (uint i = 0; i < 2; i++) {
408 if (isTrue(array[i])) { // It can be undefined
410 } else if (isFalse(array[i])) {
411 newarray[0] = array[1 - i];
412 return applyLogicalOperation(SATC_NOT, newarray, 1);
413 } else if (array[i]->type == LOGICOP) {
414 BooleanLogic *b = (BooleanLogic *)array[i].getBoolean();
416 return rewriteLogicalOperation(op, array, asize);
423 for (uint i = 0; i < asize; i++) {
424 newarray[i] = applyLogicalOperation(SATC_NOT, array[i]);
426 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_AND, newarray, asize));
430 for (uint i = 0; i < asize; i++) {
431 BooleanEdge b = array[i];
432 if (b->type == LOGICOP) {
433 if (((BooleanLogic *)b.getBoolean())->replaced)
434 return rewriteLogicalOperation(op, array, asize);
438 else if (isFalse(b)) {
441 newarray[newindex++] = b;
445 } else if (newindex == 1) {
448 bsdqsort(newarray, newindex, sizeof(BooleanEdge), booleanEdgeCompares);
455 //handle by translation
456 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_IFF, array, asize));
459 //handle by translation
460 return applyLogicalOperation(SATC_OR, applyLogicalOperation(SATC_NOT, array[0]), array[1]);
465 Boolean *boolean = new BooleanLogic(this, op, array, asize);
466 Boolean *b = boolMap.get(boolean);
468 boolean->updateParents();
469 boolMap.put(boolean, boolean);
470 allBooleans.push(boolean);
471 return BooleanEdge(boolean);
474 return BooleanEdge(b);
478 Boolean *boolean = new BooleanLogic(this, op, array, asize);
479 allBooleans.push(boolean);
480 return BooleanEdge(boolean);
485 BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
486 // ASSERT(first != second);
488 return getBooleanFalse();
491 if (order->type == SATC_TOTAL) {
492 if (first > second) {
493 uint64_t tmp = first;
499 Boolean *constraint = new BooleanOrder(order, first, second);
500 if (!useInterpreter() ){
501 Boolean *b = boolMap.get(constraint);
504 allBooleans.push(constraint);
505 boolMap.put(constraint, constraint);
506 constraint->updateParents();
507 if ( order->graph != NULL) {
508 OrderGraph *graph = order->graph;
509 OrderNode *from = graph->lookupOrderNodeFromOrderGraph(first);
511 OrderNode *to = graph->lookupOrderNodeFromOrderGraph(second);
513 OrderEdge *edge = graph->lookupOrderEdgeFromOrderGraph(from, to);
516 if (edge != NULL && edge->mustPos) {
517 replaceBooleanWithTrueNoRemove(constraint);
518 } else if (edge != NULL && edge->mustNeg) {
519 replaceBooleanWithFalseNoRemove(constraint);
520 } else if ((invedge = graph->lookupOrderEdgeFromOrderGraph(to, from)) != NULL
521 && invedge->mustPos) {
522 replaceBooleanWithFalseNoRemove(constraint);
532 BooleanEdge be = BooleanEdge(constraint);
533 return negate ? be.negate() : be;
536 void CSolver::addConstraint(BooleanEdge constraint) {
537 if(!useInterpreter()){
538 if (isTrue(constraint))
540 else if (isFalse(constraint)) {
544 if (constraint->type == LOGICOP) {
545 BooleanLogic *b = (BooleanLogic *) constraint.getBoolean();
546 if (!constraint.isNegated()) {
547 if (b->op == SATC_AND) {
548 uint size = b->inputs.getSize();
549 //Handle potential concurrent modification
550 BooleanEdge array[size];
551 for (uint i = 0; i < size; i++) {
552 array[i] = b->inputs.get(i);
554 for (uint i = 0; i < size; i++) {
555 addConstraint(array[i]);
561 addConstraint(doRewrite(constraint));
565 constraints.add(constraint);
566 Boolean *ptr = constraint.getBoolean();
568 if (ptr->boolVal == BV_UNSAT) {
572 replaceBooleanWithTrueNoRemove(constraint);
573 constraint->parents.clear();
576 constraints.add(constraint);
577 constraint->parents.clear();
581 Order *CSolver::createOrder(OrderType type, Set *set) {
582 Order *order = new Order(type, set);
583 allOrders.push(order);
584 activeOrders.add(order);
588 /** Computes static ordering information to allow isTrue/isFalse
589 queries on newly created orders to work. */
591 void CSolver::inferFixedOrder(Order *order) {
592 if (order->graph != NULL) {
595 order->graph = buildMustOrderGraph(order);
596 reachMustAnalysis(this, order->graph, true);
599 void CSolver::inferFixedOrders() {
600 SetIteratorOrder *orderit = activeOrders.iterator();
601 while (orderit->hasNext()) {
602 Order *order = orderit->next();
603 inferFixedOrder(order);
607 int CSolver::solve() {
608 long long startTime = getTimeNano();
609 bool deleteTuner = false;
611 tuner = new DefaultTuner();
614 int result = IS_INDETER;
615 if(useInterpreter()){
616 interpreter->encode();
617 model_print("Problem encoded in Interpreter\n");
618 result = interpreter->solve();
619 model_print("Problem solved by Interpreter\n");
623 SetIteratorOrder *orderit = activeOrders.iterator();
624 while (orderit->hasNext()) {
625 Order *order = orderit->next();
626 if (order->graph != NULL) {
633 computePolarities(this);
634 long long time1 = getTimeNano();
635 model_print("Polarity time: %f\n", (time1 - startTime) / NANOSEC);
638 long long time2 = getTimeNano();
639 model_print("Preprocess time: %f\n", (time2 - time1) / NANOSEC);
641 DecomposeOrderTransform dot(this);
643 time1 = getTimeNano();
644 model_print("Decompose Order: %f\n", (time1 - time2) / NANOSEC);
646 IntegerEncodingTransform iet(this);
649 ElementOpt eop(this);
652 EncodingGraph eg(this);
655 naiveEncodingDecision(this);
658 VarOrderingOpt bor(this, satEncoder);
661 time2 = getTimeNano();
662 model_print("Encoding Graph Time: %f\n", (time2 - time1) / NANOSEC);
664 satEncoder->encodeAllSATEncoder(this);
665 time1 = getTimeNano();
667 model_print("Elapse Encode time: %f\n", (time1 - startTime) / NANOSEC);
669 model_print("Is problem UNSAT after encoding: %d\n", unsat);
672 result = unsat ? IS_UNSAT : satEncoder->solve(satsolverTimeout);
673 model_print("Result Computed in SAT solver:\t%s\n", result == IS_SAT ? "SAT" : result == IS_INDETER ? "INDETERMINATE" : " UNSAT");
674 time2 = getTimeNano();
675 elapsedTime = time2 - startTime;
676 model_print("CSOLVER solve time: %f\n", elapsedTime / NANOSEC);
685 void CSolver::setInterpreter(InterpreterType type){
686 if(interpreter == NULL){
691 interpreter = new AlloyInterpreter(this);
694 interpreter = new SMTInterpreter(this);
698 interpreter = new MathSATInterpreter(this);
702 interpreter = new SMTRatInterpreter(this);
711 void CSolver::printConstraints() {
712 SetIteratorBooleanEdge *it = getConstraints();
713 while (it->hasNext()) {
714 BooleanEdge b = it->next();
720 void CSolver::printConstraint(BooleanEdge b) {
724 uint64_t CSolver::getElementValue(Element *element) {
725 switch (element->type) {
729 return useInterpreter()? interpreter->getValue(element):
730 getElementValueSATTranslator(this, element);
737 bool CSolver::getBooleanValue(BooleanEdge bedge) {
738 Boolean *boolean = bedge.getBoolean();
739 switch (boolean->type) {
741 return useInterpreter()? interpreter->getBooleanValue(boolean):
742 getBooleanVariableValueSATTranslator(this, boolean);
749 bool CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
750 return order->encoding.resolver->resolveOrder(first, second);
753 long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
755 long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
757 void CSolver::autoTune(uint budget) {
758 AutoTuner *autotuner = new AutoTuner(budget);
759 autotuner->addProblem(this);