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"
35 boolTrue(BooleanEdge(new BooleanConst(true))),
36 boolFalse(boolTrue.negate()),
38 booleanVarUsed(false),
41 satsolverTimeout(NOTIMEOUT),
44 satEncoder = new SATEncoder(this);
47 /** This function tears down the solver and the entire AST */
51 uint size = allBooleans.getSize();
52 for (uint i = 0; i < size; i++) {
53 delete allBooleans.get(i);
56 size = allSets.getSize();
57 for (uint i = 0; i < size; i++) {
58 delete allSets.get(i);
61 size = allElements.getSize();
62 for (uint i = 0; i < size; i++) {
63 Element *el = allElements.get(i);
67 size = allTables.getSize();
68 for (uint i = 0; i < size; i++) {
69 delete allTables.get(i);
72 size = allPredicates.getSize();
73 for (uint i = 0; i < size; i++) {
74 delete allPredicates.get(i);
77 size = allOrders.getSize();
78 for (uint i = 0; i < size; i++) {
79 delete allOrders.get(i);
81 size = allFunctions.getSize();
82 for (uint i = 0; i < size; i++) {
83 delete allFunctions.get(i);
86 delete boolTrue.getBoolean();
90 void CSolver::resetSolver() {
92 uint size = allBooleans.getSize();
93 for (uint i = 0; i < size; i++) {
94 delete allBooleans.get(i);
97 size = allSets.getSize();
98 for (uint i = 0; i < size; i++) {
99 delete allSets.get(i);
102 size = allElements.getSize();
103 for (uint i = 0; i < size; i++) {
104 Element *el = allElements.get(i);
108 size = allTables.getSize();
109 for (uint i = 0; i < size; i++) {
110 delete allTables.get(i);
113 size = allPredicates.getSize();
114 for (uint i = 0; i < size; i++) {
115 delete allPredicates.get(i);
118 size = allOrders.getSize();
119 for (uint i = 0; i < size; i++) {
120 delete allOrders.get(i);
122 size = allFunctions.getSize();
123 for (uint i = 0; i < size; i++) {
124 delete allFunctions.get(i);
126 delete boolTrue.getBoolean();
131 allPredicates.clear();
133 allFunctions.clear();
135 activeOrders.reset();
139 boolTrue = BooleanEdge(new BooleanConst(true));
140 boolFalse = boolTrue.negate();
142 booleanVarUsed = false;
145 satEncoder->resetSATEncoder();
149 CSolver *CSolver::clone() {
150 CSolver *copy = new CSolver();
152 SetIteratorBooleanEdge *it = getConstraints();
153 while (it->hasNext()) {
154 BooleanEdge b = it->next();
155 copy->addConstraint(cloneEdge(copy, &map, b));
161 CSolver *CSolver::deserialize(const char *file) {
162 model_print("deserializing %s ...\n", file);
163 Deserializer deserializer(file);
164 return deserializer.deserialize();
167 void CSolver::serialize() {
168 model_print("serializing ...\n");
170 long long nanotime = getTimeNano();
171 int numchars = sprintf(buffer, "DUMP%llu", nanotime);
172 Serializer serializer(buffer);
173 SetIteratorBooleanEdge *it = getConstraints();
174 while (it->hasNext()) {
175 BooleanEdge b = it->next();
176 serializeBooleanEdge(&serializer, b, true);
181 Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) {
182 Set *set = new Set(type, elements, numelements);
187 Set *CSolver::createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange) {
188 Set *set = new Set(type, lowrange, highrange);
193 bool CSolver::itemExistInSet(Set *set, uint64_t item) {
194 return set->exists(item);
197 VarType CSolver::getSetVarType(Set *set) {
198 return set->getType();
201 Element *CSolver::createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange) {
202 Set *s = createRangeSet(type, lowrange, highrange);
203 return getElementVar(s);
206 MutableSet *CSolver::createMutableSet(VarType type) {
207 MutableSet *set = new MutableSet(type);
212 void CSolver::addItem(MutableSet *set, uint64_t element) {
213 set->addElementMSet(element);
216 uint64_t CSolver::createUniqueItem(MutableSet *set) {
217 uint64_t element = set->getNewUniqueItem();
218 set->addElementMSet(element);
222 void CSolver::finalizeMutableSet(MutableSet *set) {
226 Element *CSolver::getElementVar(Set *set) {
227 Element *element = new ElementSet(set);
228 allElements.push(element);
232 void CSolver::mustHaveValue(Element *element) {
233 element->anyValue = true;
236 Set *CSolver::getElementRange (Element *element) {
237 return element->getRange();
241 Element *CSolver::getElementConst(VarType type, uint64_t value) {
242 uint64_t array[] = {value};
243 Set *set = new Set(type, array, 1);
244 Element *element = new ElementConst(value, set);
245 Element *e = elemMap.get(element);
248 allElements.push(element);
249 elemMap.put(element, element);
259 Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, BooleanEdge overflowstatus) {
260 ASSERT(numArrays == 2);
261 Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
262 Element *e = elemMap.get(element);
264 element->updateParents();
265 allElements.push(element);
266 elemMap.put(element, element);
274 Function *CSolver::createFunctionOperator(ArithOp op, Set *range, OverFlowBehavior overflowbehavior) {
275 Function *function = new FunctionOperator(op, range, overflowbehavior);
276 allFunctions.push(function);
280 Predicate *CSolver::createPredicateOperator(CompOp op) {
281 Predicate *predicate = new PredicateOperator(op);
282 allPredicates.push(predicate);
286 Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavior) {
287 Predicate *predicate = new PredicateTable(table, behavior);
288 allPredicates.push(predicate);
292 Table *CSolver::createTable(Set *range) {
293 Table *table = new Table(range);
294 allTables.push(table);
298 Table *CSolver::createTableForPredicate() {
299 return createTable(NULL);
302 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
303 table->addNewTableEntry(inputs, inputSize, result);
306 Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
307 Function *function = new FunctionTable(table, behavior);
308 allFunctions.push(function);
312 BooleanEdge CSolver::getBooleanVar(VarType type) {
313 Boolean *boolean = new BooleanVar(type);
314 allBooleans.push(boolean);
316 booleanVarUsed = true;
317 return BooleanEdge(boolean);
320 BooleanEdge CSolver::getBooleanTrue() {
324 BooleanEdge CSolver::getBooleanFalse() {
328 BooleanEdge CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
329 return applyPredicateTable(predicate, inputs, numInputs, BooleanEdge(NULL));
332 BooleanEdge CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, BooleanEdge undefinedStatus) {
333 BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
334 Boolean *b = boolMap.get(boolean);
336 boolean->updateParents();
337 boolMap.put(boolean, boolean);
338 allBooleans.push(boolean);
339 return BooleanEdge(boolean);
342 return BooleanEdge(b);
346 bool CSolver::isTrue(BooleanEdge b) {
347 return b.isNegated() ? b->isFalse() : b->isTrue();
350 bool CSolver::isFalse(BooleanEdge b) {
351 return b.isNegated() ? b->isTrue() : b->isFalse();
354 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg1, BooleanEdge arg2) {
355 BooleanEdge array[] = {arg1, arg2};
356 return applyLogicalOperation(op, array, 2);
359 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg) {
360 BooleanEdge array[] = {arg};
361 return applyLogicalOperation(op, array, 1);
364 static int booleanEdgeCompares(const void *p1, const void *p2) {
365 BooleanEdge be1 = *(BooleanEdge const *) p1;
366 BooleanEdge be2 = *(BooleanEdge const *) p2;
367 uint64_t b1 = be1->id;
368 uint64_t b2 = be2->id;
377 BooleanEdge CSolver::rewriteLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
378 BooleanEdge newarray[asize];
379 memcpy(newarray, array, asize * sizeof(BooleanEdge));
380 for (uint i = 0; i < asize; i++) {
381 BooleanEdge b = newarray[i];
382 if (b->type == LOGICOP) {
383 if (((BooleanLogic *) b.getBoolean())->replaced) {
384 newarray[i] = doRewrite(newarray[i]);
389 return applyLogicalOperation(op, newarray, asize);
392 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
393 BooleanEdge newarray[asize];
396 return array[0].negate();
399 for (uint i = 0; i < 2; i++) {
400 if (isTrue(array[i])) { // It can be undefined
402 } else if (isFalse(array[i])) {
403 newarray[0] = array[1 - i];
404 return applyLogicalOperation(SATC_NOT, newarray, 1);
405 } else if (array[i]->type == LOGICOP) {
406 BooleanLogic *b = (BooleanLogic *)array[i].getBoolean();
408 return rewriteLogicalOperation(op, array, asize);
415 for (uint i = 0; i < asize; i++) {
416 newarray[i] = applyLogicalOperation(SATC_NOT, array[i]);
418 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_AND, newarray, asize));
422 for (uint i = 0; i < asize; i++) {
423 BooleanEdge b = array[i];
424 if (b->type == LOGICOP) {
425 if (((BooleanLogic *)b.getBoolean())->replaced)
426 return rewriteLogicalOperation(op, array, asize);
430 else if (isFalse(b)) {
433 newarray[newindex++] = b;
437 } else if (newindex == 1) {
440 bsdqsort(newarray, newindex, sizeof(BooleanEdge), booleanEdgeCompares);
447 //handle by translation
448 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_IFF, array, asize));
451 //handle by translation
452 return applyLogicalOperation(SATC_OR, applyLogicalOperation(SATC_NOT, array[0]), array[1]);
457 Boolean *boolean = new BooleanLogic(this, op, array, asize);
458 Boolean *b = boolMap.get(boolean);
460 boolean->updateParents();
461 boolMap.put(boolean, boolean);
462 allBooleans.push(boolean);
463 return BooleanEdge(boolean);
466 return BooleanEdge(b);
470 BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
471 // ASSERT(first != second);
473 return getBooleanFalse();
476 if (order->type == SATC_TOTAL) {
477 if (first > second) {
478 uint64_t tmp = first;
484 Boolean *constraint = new BooleanOrder(order, first, second);
485 Boolean *b = boolMap.get(constraint);
488 allBooleans.push(constraint);
489 boolMap.put(constraint, constraint);
490 constraint->updateParents();
491 if (order->graph != NULL) {
492 OrderGraph *graph = order->graph;
493 OrderNode *from = graph->lookupOrderNodeFromOrderGraph(first);
495 OrderNode *to = graph->lookupOrderNodeFromOrderGraph(second);
497 OrderEdge *edge = graph->lookupOrderEdgeFromOrderGraph(from, to);
500 if (edge != NULL && edge->mustPos) {
501 replaceBooleanWithTrueNoRemove(constraint);
502 } else if (edge != NULL && edge->mustNeg) {
503 replaceBooleanWithFalseNoRemove(constraint);
504 } else if ((invedge = graph->lookupOrderEdgeFromOrderGraph(to, from)) != NULL
505 && invedge->mustPos) {
506 replaceBooleanWithFalseNoRemove(constraint);
516 BooleanEdge be = BooleanEdge(constraint);
517 return negate ? be.negate() : be;
520 void CSolver::addConstraint(BooleanEdge constraint) {
521 if (isTrue(constraint))
523 else if (isFalse(constraint)) {
527 if (constraint->type == LOGICOP) {
528 BooleanLogic *b = (BooleanLogic *) constraint.getBoolean();
529 if (!constraint.isNegated()) {
530 if (b->op == SATC_AND) {
531 uint size = b->inputs.getSize();
532 //Handle potential concurrent modification
533 BooleanEdge array[size];
534 for (uint i = 0; i < size; i++) {
535 array[i] = b->inputs.get(i);
537 for (uint i = 0; i < size; i++) {
538 addConstraint(array[i]);
544 addConstraint(doRewrite(constraint));
548 constraints.add(constraint);
549 Boolean *ptr = constraint.getBoolean();
551 if (ptr->boolVal == BV_UNSAT) {
555 replaceBooleanWithTrueNoRemove(constraint);
556 constraint->parents.clear();
560 Order *CSolver::createOrder(OrderType type, Set *set) {
561 Order *order = new Order(type, set);
562 allOrders.push(order);
563 activeOrders.add(order);
567 /** Computes static ordering information to allow isTrue/isFalse
568 queries on newly created orders to work. */
570 void CSolver::inferFixedOrder(Order *order) {
571 if (order->graph != NULL) {
574 order->graph = buildMustOrderGraph(order);
575 reachMustAnalysis(this, order->graph, true);
578 void CSolver::inferFixedOrders() {
579 SetIteratorOrder *orderit = activeOrders.iterator();
580 while (orderit->hasNext()) {
581 Order *order = orderit->next();
582 inferFixedOrder(order);
586 int CSolver::solve() {
587 long long startTime = getTimeNano();
588 bool deleteTuner = false;
590 tuner = new DefaultTuner();
596 SetIteratorOrder *orderit = activeOrders.iterator();
597 while (orderit->hasNext()) {
598 Order *order = orderit->next();
599 if (order->graph != NULL) {
606 computePolarities(this);
607 long long time1 = getTimeNano();
608 model_print("Polarity time: %f\n", (time1 - startTime) / NANOSEC);
611 long long time2 = getTimeNano();
612 model_print("Preprocess time: %f\n", (time2 - time1) / NANOSEC);
614 DecomposeOrderTransform dot(this);
616 time1 = getTimeNano();
617 model_print("Decompose Order: %f\n", (time1 - time2) / NANOSEC);
619 IntegerEncodingTransform iet(this);
622 ElementOpt eop(this);
625 EncodingGraph eg(this);
628 naiveEncodingDecision(this);
631 VarOrderingOpt bor(this, satEncoder);
634 time2 = getTimeNano();
635 model_print("Encoding Graph Time: %f\n", (time2 - time1) / NANOSEC);
637 satEncoder->encodeAllSATEncoder(this);
638 time1 = getTimeNano();
640 model_print("Elapse Encode time: %f\n", (time1 - startTime) / NANOSEC);
642 model_print("Is problem UNSAT after encoding: %d\n", unsat);
643 int result = IS_INDETER;
644 if(alloyEncoder != NULL){
645 alloyEncoder->encode();
646 result = alloyEncoder->solve();
648 result = unsat ? IS_UNSAT : satEncoder->solve(satsolverTimeout);
649 model_print("Result Computed in SAT solver:\t%s\n", result == IS_SAT ? "SAT" : result == IS_INDETER ? "INDETERMINATE" : " UNSAT");
650 time2 = getTimeNano();
651 elapsedTime = time2 - startTime;
652 model_print("CSOLVER solve time: %f\n", elapsedTime / NANOSEC);
661 void CSolver::setAlloyEncoder(){
662 alloyEncoder = new AlloyEnc(this);
665 void CSolver::printConstraints() {
666 SetIteratorBooleanEdge *it = getConstraints();
667 while (it->hasNext()) {
668 BooleanEdge b = it->next();
674 void CSolver::printConstraint(BooleanEdge b) {
678 uint64_t CSolver::getElementValue(Element *element) {
679 switch (element->type) {
683 return useAlloyCompiler()? alloyEncoder->getValue(element):
684 getElementValueSATTranslator(this, element);
691 bool CSolver::getBooleanValue(BooleanEdge bedge) {
692 Boolean *boolean = bedge.getBoolean();
693 switch (boolean->type) {
695 return useAlloyCompiler()? alloyEncoder->getBooleanValue(boolean):
696 getBooleanVariableValueSATTranslator(this, boolean);
703 bool CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
704 return order->encoding.resolver->resolveOrder(first, second);
707 long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
709 long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
711 void CSolver::autoTune(uint budget) {
712 AutoTuner *autotuner = new AutoTuner(budget);
713 autotuner->addProblem(this);