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"
32 boolTrue(BooleanEdge(new BooleanConst(true))),
33 boolFalse(boolTrue.negate()),
38 satEncoder = new SATEncoder(this);
41 /** This function tears down the solver and the entire AST */
45 uint size = allBooleans.getSize();
46 for (uint i = 0; i < size; i++) {
47 delete allBooleans.get(i);
50 size = allSets.getSize();
51 for (uint i = 0; i < size; i++) {
52 delete allSets.get(i);
55 size = allElements.getSize();
56 for (uint i = 0; i < size; i++) {
57 Element *el = allElements.get(i);
61 size = allTables.getSize();
62 for (uint i = 0; i < size; i++) {
63 delete allTables.get(i);
66 size = allPredicates.getSize();
67 for (uint i = 0; i < size; i++) {
68 delete allPredicates.get(i);
71 size = allOrders.getSize();
72 for (uint i = 0; i < size; i++) {
73 delete allOrders.get(i);
75 size = allFunctions.getSize();
76 for (uint i = 0; i < size; i++) {
77 delete allFunctions.get(i);
80 delete boolTrue.getBoolean();
84 void CSolver::resetSolver() {
86 uint size = allBooleans.getSize();
87 for (uint i = 0; i < size; i++) {
88 delete allBooleans.get(i);
91 size = allSets.getSize();
92 for (uint i = 0; i < size; i++) {
93 delete allSets.get(i);
96 size = allElements.getSize();
97 for (uint i = 0; i < size; i++) {
98 Element *el = allElements.get(i);
102 size = allTables.getSize();
103 for (uint i = 0; i < size; i++) {
104 delete allTables.get(i);
107 size = allPredicates.getSize();
108 for (uint i = 0; i < size; i++) {
109 delete allPredicates.get(i);
112 size = allOrders.getSize();
113 for (uint i = 0; i < size; i++) {
114 delete allOrders.get(i);
116 size = allFunctions.getSize();
117 for (uint i = 0; i < size; i++) {
118 delete allFunctions.get(i);
120 delete boolTrue.getBoolean();
125 allPredicates.clear();
127 allFunctions.clear();
129 activeOrders.reset();
133 boolTrue = BooleanEdge(new BooleanConst(true));
134 boolFalse = boolTrue.negate();
138 satEncoder->resetSATEncoder();
142 CSolver *CSolver::clone() {
143 CSolver *copy = new CSolver();
145 SetIteratorBooleanEdge *it = getConstraints();
146 while (it->hasNext()) {
147 BooleanEdge b = it->next();
148 copy->addConstraint(cloneEdge(copy, &map, b));
154 CSolver *CSolver::deserialize(const char *file) {
155 model_print("deserializing ...\n");
156 Deserializer deserializer(file);
157 return deserializer.deserialize();
160 void CSolver::serialize() {
161 model_print("serializing ...\n");
163 long long nanotime = getTimeNano();
164 int numchars = sprintf(buffer, "DUMP%llu", nanotime);
165 Serializer serializer(buffer);
166 SetIteratorBooleanEdge *it = getConstraints();
167 while (it->hasNext()) {
168 BooleanEdge b = it->next();
169 serializeBooleanEdge(&serializer, b, true);
174 Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) {
175 Set *set = new Set(type, elements, numelements);
180 Set *CSolver::createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange) {
181 Set *set = new Set(type, lowrange, highrange);
186 bool CSolver::itemExistInSet(Set *set, uint64_t item){
187 return set->exists(item);
190 VarType CSolver::getSetVarType(Set *set) {
191 return set->getType();
194 Element *CSolver::createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange) {
195 Set *s = createRangeSet(type, lowrange, highrange);
196 return getElementVar(s);
199 MutableSet *CSolver::createMutableSet(VarType type) {
200 MutableSet *set = new MutableSet(type);
205 void CSolver::addItem(MutableSet *set, uint64_t element) {
206 set->addElementMSet(element);
209 uint64_t CSolver::createUniqueItem(MutableSet *set) {
210 uint64_t element = set->getNewUniqueItem();
211 set->addElementMSet(element);
215 void CSolver::finalizeMutableSet(MutableSet *set) {
219 Element *CSolver::getElementVar(Set *set) {
220 Element *element = new ElementSet(set);
221 allElements.push(element);
225 void CSolver::mustHaveValue(Element *element){
226 element->getElementEncoding()->anyValue = true;
229 Set *CSolver::getElementRange (Element *element) {
230 return element->getRange();
234 Element *CSolver::getElementConst(VarType type, uint64_t value) {
235 uint64_t array[] = {value};
236 Set *set = new Set(type, array, 1);
237 Element *element = new ElementConst(value, set);
238 Element *e = elemMap.get(element);
241 allElements.push(element);
242 elemMap.put(element, element);
252 Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, BooleanEdge overflowstatus) {
253 Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
254 Element *e = elemMap.get(element);
256 element->updateParents();
257 allElements.push(element);
258 elemMap.put(element, element);
266 Function *CSolver::createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,OverFlowBehavior overflowbehavior) {
267 Function *function = new FunctionOperator(op, domain, numDomain, range, overflowbehavior);
268 allFunctions.push(function);
272 Predicate *CSolver::createPredicateOperator(CompOp op, Set **domain, uint numDomain) {
273 Predicate *predicate = new PredicateOperator(op, domain,numDomain);
274 allPredicates.push(predicate);
278 Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavior) {
279 Predicate *predicate = new PredicateTable(table, behavior);
280 allPredicates.push(predicate);
284 Table *CSolver::createTable(Set **domains, uint numDomain, Set *range) {
285 Table *table = new Table(domains,numDomain,range);
286 allTables.push(table);
290 Table *CSolver::createTableForPredicate(Set **domains, uint numDomain) {
291 return createTable(domains, numDomain, NULL);
294 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
295 table->addNewTableEntry(inputs, inputSize, result);
298 Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
299 Function *function = new FunctionTable(table, behavior);
300 allFunctions.push(function);
304 BooleanEdge CSolver::getBooleanVar(VarType type) {
305 Boolean *boolean = new BooleanVar(type);
306 allBooleans.push(boolean);
307 return BooleanEdge(boolean);
310 BooleanEdge CSolver::getBooleanTrue() {
314 BooleanEdge CSolver::getBooleanFalse() {
318 BooleanEdge CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
319 return applyPredicateTable(predicate, inputs, numInputs, BooleanEdge(NULL));
322 BooleanEdge CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, BooleanEdge undefinedStatus) {
323 BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
324 Boolean *b = boolMap.get(boolean);
326 boolean->updateParents();
327 boolMap.put(boolean, boolean);
328 allBooleans.push(boolean);
329 return BooleanEdge(boolean);
332 return BooleanEdge(b);
336 bool CSolver::isTrue(BooleanEdge b) {
337 return b.isNegated() ? b->isFalse() : b->isTrue();
340 bool CSolver::isFalse(BooleanEdge b) {
341 return b.isNegated() ? b->isTrue() : b->isFalse();
344 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg1, BooleanEdge arg2) {
345 BooleanEdge array[] = {arg1, arg2};
346 return applyLogicalOperation(op, array, 2);
349 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg) {
350 BooleanEdge array[] = {arg};
351 return applyLogicalOperation(op, array, 1);
354 static int booleanEdgeCompares(const void *p1, const void *p2) {
355 BooleanEdge be1 = *(BooleanEdge const *) p1;
356 BooleanEdge be2 = *(BooleanEdge const *) p2;
357 uint64_t b1 = be1->id;
358 uint64_t b2 = be2->id;
367 BooleanEdge CSolver::rewriteLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
368 BooleanEdge newarray[asize];
369 memcpy(newarray, array, asize * sizeof(BooleanEdge));
370 for (uint i = 0; i < asize; i++) {
371 BooleanEdge b = newarray[i];
372 if (b->type == LOGICOP) {
373 if (((BooleanLogic *) b.getBoolean())->replaced) {
374 newarray[i] = doRewrite(newarray[i]);
379 return applyLogicalOperation(op, newarray, asize);
382 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
383 BooleanEdge newarray[asize];
386 return array[0].negate();
389 for (uint i = 0; i < 2; i++) {
390 if (isTrue(array[i])) { // It can be undefined
392 } else if (isFalse(array[i])) {
393 newarray[0] = array[1 - i];
394 return applyLogicalOperation(SATC_NOT, newarray, 1);
395 } else if (array[i]->type == LOGICOP) {
396 BooleanLogic *b = (BooleanLogic *)array[i].getBoolean();
398 return rewriteLogicalOperation(op, array, asize);
405 for (uint i = 0; i < asize; i++) {
406 newarray[i] = applyLogicalOperation(SATC_NOT, array[i]);
408 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_AND, newarray, asize));
412 for (uint i = 0; i < asize; i++) {
413 BooleanEdge b = array[i];
414 if (b->type == LOGICOP) {
415 if (((BooleanLogic *)b.getBoolean())->replaced)
416 return rewriteLogicalOperation(op, array, asize);
420 else if (isFalse(b)) {
423 newarray[newindex++] = b;
427 } else if (newindex == 1) {
430 bsdqsort(newarray, newindex, sizeof(BooleanEdge), booleanEdgeCompares);
437 //handle by translation
438 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_IFF, array, asize));
441 //handle by translation
442 return applyLogicalOperation(SATC_OR, applyLogicalOperation(SATC_NOT, array[0]), array[1]);
447 Boolean *boolean = new BooleanLogic(this, op, array, asize);
448 Boolean *b = boolMap.get(boolean);
450 boolean->updateParents();
451 boolMap.put(boolean, boolean);
452 allBooleans.push(boolean);
453 return BooleanEdge(boolean);
456 return BooleanEdge(b);
460 BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
461 // ASSERT(first != second);
463 return getBooleanFalse();
466 if (order->type == SATC_TOTAL) {
467 if (first > second) {
468 uint64_t tmp = first;
474 Boolean *constraint = new BooleanOrder(order, first, second);
475 Boolean *b = boolMap.get(constraint);
478 allBooleans.push(constraint);
479 boolMap.put(constraint, constraint);
480 constraint->updateParents();
481 if (order->graph != NULL) {
482 OrderGraph *graph = order->graph;
483 OrderNode *from = graph->lookupOrderNodeFromOrderGraph(first);
485 OrderNode *to = graph->lookupOrderNodeFromOrderGraph(second);
487 OrderEdge *edge = graph->lookupOrderEdgeFromOrderGraph(from, to);
490 if (edge != NULL && edge->mustPos) {
491 replaceBooleanWithTrueNoRemove(constraint);
492 } else if (edge != NULL && edge->mustNeg) {
493 replaceBooleanWithFalseNoRemove(constraint);
494 } else if ((invedge = graph->lookupOrderEdgeFromOrderGraph(to, from)) != NULL
495 && invedge->mustPos) {
496 replaceBooleanWithFalseNoRemove(constraint);
506 BooleanEdge be = BooleanEdge(constraint);
507 return negate ? be.negate() : be;
510 void CSolver::addConstraint(BooleanEdge constraint) {
511 if (isTrue(constraint))
513 else if (isFalse(constraint)) {
518 if (constraint->type == LOGICOP) {
519 BooleanLogic *b = (BooleanLogic *) constraint.getBoolean();
520 if (!constraint.isNegated()) {
521 if (b->op == SATC_AND) {
522 for (uint i = 0; i < b->inputs.getSize(); i++) {
523 addConstraint(b->inputs.get(i));
529 addConstraint(doRewrite(constraint));
533 constraints.add(constraint);
534 Boolean *ptr = constraint.getBoolean();
536 if (ptr->boolVal == BV_UNSAT) {
540 replaceBooleanWithTrueNoRemove(constraint);
541 constraint->parents.clear();
545 Order *CSolver::createOrder(OrderType type, Set *set) {
546 Order *order = new Order(type, set);
547 allOrders.push(order);
548 activeOrders.add(order);
552 /** Computes static ordering information to allow isTrue/isFalse
553 queries on newly created orders to work. */
555 void CSolver::inferFixedOrder(Order *order) {
556 if (order->graph != NULL) {
559 order->graph = buildMustOrderGraph(order);
560 reachMustAnalysis(this, order->graph, true);
563 void CSolver::inferFixedOrders() {
564 SetIteratorOrder *orderit = activeOrders.iterator();
565 while (orderit->hasNext()) {
566 Order *order = orderit->next();
567 inferFixedOrder(order);
571 #define NANOSEC 1000000000.0
572 int CSolver::solve() {
573 long long starttime = getTimeNano();
574 bool deleteTuner = false;
576 tuner = new DefaultTuner();
582 SetIteratorOrder *orderit = activeOrders.iterator();
583 while (orderit->hasNext()) {
584 Order *order = orderit->next();
585 if (order->graph != NULL) {
592 computePolarities(this);
593 long long time2 = getTimeNano();
594 model_print("Polarity time: %f\n", (time2 - starttime) / NANOSEC);
597 long long time3 = getTimeNano();
598 model_print("Preprocess time: %f\n", (time3 - time2) / NANOSEC);
600 DecomposeOrderTransform dot(this);
602 long long time4 = getTimeNano();
603 model_print("Decompose Order: %f\n", (time4 - time3) / NANOSEC);
605 IntegerEncodingTransform iet(this);
608 EncodingGraph eg(this);
612 naiveEncodingDecision(this);
613 long long time5 = getTimeNano();
614 model_print("Encoding Graph Time: %f\n", (time5 - time4) / NANOSEC);
616 long long startTime = getTimeNano();
617 satEncoder->encodeAllSATEncoder(this);
618 long long endTime = getTimeNano();
620 elapsedTime = endTime - startTime;
621 model_print("Elapse Encode time: %f\n", elapsedTime / NANOSEC);
623 model_print("Is problem UNSAT after encoding: %d\n", unsat);
624 int result = unsat ? IS_UNSAT : satEncoder->solve();
625 model_print("Result Computed in SAT solver: %d\n", result);
634 void CSolver::printConstraints() {
635 SetIteratorBooleanEdge *it = getConstraints();
636 while (it->hasNext()) {
637 BooleanEdge b = it->next();
646 void CSolver::printConstraint(BooleanEdge b) {
653 uint64_t CSolver::getElementValue(Element *element) {
654 switch (element->type) {
658 return getElementValueSATTranslator(this, element);
665 bool CSolver::getBooleanValue(BooleanEdge bedge) {
666 Boolean *boolean = bedge.getBoolean();
667 switch (boolean->type) {
669 return getBooleanVariableValueSATTranslator(this, boolean);
676 bool CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
677 return order->encoding.resolver->resolveOrder(first, second);
680 long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
682 long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
684 void CSolver::autoTune(uint budget) {
685 AutoTuner *autotuner = new AutoTuner(budget);
686 autotuner->addProblem(this);
691 //Set* CSolver::addItemsToRange(Element* element, uint num, ...){
693 // va_start(args, num);
694 // element->getRange()
695 // uint setSize = set->getSize();
696 // uint newSize = setSize+ num;
697 // uint64_t members[newSize];
698 // for(uint i=0; i<setSize; i++){
699 // members[i] = set->getElement(i);
701 // for( uint i=0; i< num; i++){
702 // uint64_t arg = va_arg(args, uint64_t);
703 // members[setSize+i] = arg;
706 // return createSet(set->getType(), members, newSize);