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 Set *CSolver::getElementRange (Element *element) {
226 return element->getRange();
230 Element *CSolver::getElementConst(VarType type, uint64_t value) {
231 uint64_t array[] = {value};
232 Set *set = new Set(type, array, 1);
233 Element *element = new ElementConst(value, set);
234 Element *e = elemMap.get(element);
237 allElements.push(element);
238 elemMap.put(element, element);
248 Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, BooleanEdge overflowstatus) {
249 Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
250 Element *e = elemMap.get(element);
252 element->updateParents();
253 allElements.push(element);
254 elemMap.put(element, element);
262 Function *CSolver::createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,OverFlowBehavior overflowbehavior) {
263 Function *function = new FunctionOperator(op, domain, numDomain, range, overflowbehavior);
264 allFunctions.push(function);
268 Predicate *CSolver::createPredicateOperator(CompOp op, Set **domain, uint numDomain) {
269 Predicate *predicate = new PredicateOperator(op, domain,numDomain);
270 allPredicates.push(predicate);
274 Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavior) {
275 Predicate *predicate = new PredicateTable(table, behavior);
276 allPredicates.push(predicate);
280 Table *CSolver::createTable(Set **domains, uint numDomain, Set *range) {
281 Table *table = new Table(domains,numDomain,range);
282 allTables.push(table);
286 Table *CSolver::createTableForPredicate(Set **domains, uint numDomain) {
287 return createTable(domains, numDomain, NULL);
290 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
291 table->addNewTableEntry(inputs, inputSize, result);
294 Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
295 Function *function = new FunctionTable(table, behavior);
296 allFunctions.push(function);
300 BooleanEdge CSolver::getBooleanVar(VarType type) {
301 Boolean *boolean = new BooleanVar(type);
302 allBooleans.push(boolean);
303 return BooleanEdge(boolean);
306 BooleanEdge CSolver::getBooleanTrue() {
310 BooleanEdge CSolver::getBooleanFalse() {
314 BooleanEdge CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
315 return applyPredicateTable(predicate, inputs, numInputs, BooleanEdge(NULL));
318 BooleanEdge CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, BooleanEdge undefinedStatus) {
319 BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
320 Boolean *b = boolMap.get(boolean);
322 boolean->updateParents();
323 boolMap.put(boolean, boolean);
324 allBooleans.push(boolean);
325 return BooleanEdge(boolean);
328 return BooleanEdge(b);
332 bool CSolver::isTrue(BooleanEdge b) {
333 return b.isNegated() ? b->isFalse() : b->isTrue();
336 bool CSolver::isFalse(BooleanEdge b) {
337 return b.isNegated() ? b->isTrue() : b->isFalse();
340 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg1, BooleanEdge arg2) {
341 BooleanEdge array[] = {arg1, arg2};
342 return applyLogicalOperation(op, array, 2);
345 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg) {
346 BooleanEdge array[] = {arg};
347 return applyLogicalOperation(op, array, 1);
350 static int ptrcompares(const void *p1, const void *p2) {
351 uintptr_t b1 = *(uintptr_t const *) p1;
352 uintptr_t b2 = *(uintptr_t const *) p2;
361 BooleanEdge CSolver::rewriteLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
362 BooleanEdge newarray[asize];
363 memcpy(newarray, array, asize * sizeof(BooleanEdge));
364 for (uint i = 0; i < asize; i++) {
365 BooleanEdge b = newarray[i];
366 if (b->type == LOGICOP) {
367 if (((BooleanLogic *) b.getBoolean())->replaced) {
368 newarray[i] = doRewrite(newarray[i]);
373 return applyLogicalOperation(op, newarray, asize);
376 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
377 BooleanEdge newarray[asize];
380 return array[0].negate();
383 for (uint i = 0; i < 2; i++) {
384 if (isTrue(array[i])) { // It can be undefined
386 } else if (isFalse(array[i])) {
387 newarray[0] = array[1 - i];
388 return applyLogicalOperation(SATC_NOT, newarray, 1);
389 } else if (array[i]->type == LOGICOP) {
390 BooleanLogic *b = (BooleanLogic *)array[i].getBoolean();
392 return rewriteLogicalOperation(op, array, asize);
399 for (uint i = 0; i < asize; i++) {
400 newarray[i] = applyLogicalOperation(SATC_NOT, array[i]);
402 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_AND, newarray, asize));
406 for (uint i = 0; i < asize; i++) {
407 BooleanEdge b = array[i];
408 if (b->type == LOGICOP) {
409 if (((BooleanLogic *)b.getBoolean())->replaced)
410 return rewriteLogicalOperation(op, array, asize);
414 else if (isFalse(b)) {
417 newarray[newindex++] = b;
421 } else if (newindex == 1) {
424 bsdqsort(newarray, newindex, sizeof(BooleanEdge), ptrcompares);
431 //handle by translation
432 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_IFF, array, asize));
435 //handle by translation
436 return applyLogicalOperation(SATC_OR, applyLogicalOperation(SATC_NOT, array[0]), array[1]);
441 Boolean *boolean = new BooleanLogic(this, op, array, asize);
442 Boolean *b = boolMap.get(boolean);
444 boolean->updateParents();
445 boolMap.put(boolean, boolean);
446 allBooleans.push(boolean);
447 return BooleanEdge(boolean);
450 return BooleanEdge(b);
454 BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
455 // ASSERT(first != second);
457 return getBooleanFalse();
460 if (order->type == SATC_TOTAL) {
461 if (first > second) {
462 uint64_t tmp = first;
468 Boolean *constraint = new BooleanOrder(order, first, second);
469 Boolean *b = boolMap.get(constraint);
472 allBooleans.push(constraint);
473 boolMap.put(constraint, constraint);
474 constraint->updateParents();
475 if (order->graph != NULL) {
476 OrderGraph *graph = order->graph;
477 OrderNode *from = graph->lookupOrderNodeFromOrderGraph(first);
479 OrderNode *to = graph->lookupOrderNodeFromOrderGraph(second);
481 OrderEdge *edge = graph->lookupOrderEdgeFromOrderGraph(from, to);
484 if (edge != NULL && edge->mustPos) {
485 replaceBooleanWithTrueNoRemove(constraint);
486 } else if (edge != NULL && edge->mustNeg) {
487 replaceBooleanWithFalseNoRemove(constraint);
488 } else if ((invedge = graph->lookupOrderEdgeFromOrderGraph(to, from)) != NULL
489 && invedge->mustPos) {
490 replaceBooleanWithFalseNoRemove(constraint);
500 BooleanEdge be = BooleanEdge(constraint);
501 return negate ? be.negate() : be;
504 void CSolver::addConstraint(BooleanEdge constraint) {
505 if (isTrue(constraint))
507 else if (isFalse(constraint)) {
512 if (constraint->type == LOGICOP) {
513 BooleanLogic *b = (BooleanLogic *) constraint.getBoolean();
514 if (!constraint.isNegated()) {
515 if (b->op == SATC_AND) {
516 for (uint i = 0; i < b->inputs.getSize(); i++) {
517 addConstraint(b->inputs.get(i));
523 addConstraint(doRewrite(constraint));
527 constraints.add(constraint);
528 Boolean *ptr = constraint.getBoolean();
530 if (ptr->boolVal == BV_UNSAT) {
534 replaceBooleanWithTrueNoRemove(constraint);
535 constraint->parents.clear();
539 Order *CSolver::createOrder(OrderType type, Set *set) {
540 Order *order = new Order(type, set);
541 allOrders.push(order);
542 activeOrders.add(order);
546 /** Computes static ordering information to allow isTrue/isFalse
547 queries on newly created orders to work. */
549 void CSolver::inferFixedOrder(Order *order) {
550 if (order->graph != NULL) {
553 order->graph = buildMustOrderGraph(order);
554 reachMustAnalysis(this, order->graph, true);
557 void CSolver::inferFixedOrders() {
558 SetIteratorOrder *orderit = activeOrders.iterator();
559 while (orderit->hasNext()) {
560 Order *order = orderit->next();
561 inferFixedOrder(order);
565 #define NANOSEC 1000000000.0
566 int CSolver::solve() {
567 long long starttime = getTimeNano();
568 bool deleteTuner = false;
570 tuner = new DefaultTuner();
576 SetIteratorOrder *orderit = activeOrders.iterator();
577 while (orderit->hasNext()) {
578 Order *order = orderit->next();
579 if (order->graph != NULL) {
586 computePolarities(this);
587 long long time2 = getTimeNano();
588 model_print("Polarity time: %f\n", (time2 - starttime) / NANOSEC);
591 long long time3 = getTimeNano();
592 model_print("Preprocess time: %f\n", (time3 - time2) / NANOSEC);
594 DecomposeOrderTransform dot(this);
596 long long time4 = getTimeNano();
597 model_print("Decompose Order: %f\n", (time4 - time3) / NANOSEC);
599 IntegerEncodingTransform iet(this);
602 EncodingGraph eg(this);
606 naiveEncodingDecision(this);
607 long long time5 = getTimeNano();
608 model_print("Encoding Graph Time: %f\n", (time5 - time4) / NANOSEC);
610 long long startTime = getTimeNano();
611 satEncoder->encodeAllSATEncoder(this);
612 long long endTime = getTimeNano();
614 elapsedTime = endTime - startTime;
615 model_print("Elapse Encode time: %f\n", elapsedTime / NANOSEC);
617 model_print("Is problem UNSAT after encoding: %d\n", unsat);
618 int result = unsat ? IS_UNSAT : satEncoder->solve();
619 model_print("Result Computed in CSolver: %d\n", result);
628 void CSolver::printConstraints() {
629 SetIteratorBooleanEdge *it = getConstraints();
630 while (it->hasNext()) {
631 BooleanEdge b = it->next();
640 void CSolver::printConstraint(BooleanEdge b) {
647 uint64_t CSolver::getElementValue(Element *element) {
648 switch (element->type) {
652 return getElementValueSATTranslator(this, element);
659 bool CSolver::getBooleanValue(BooleanEdge bedge) {
660 Boolean *boolean = bedge.getBoolean();
661 switch (boolean->type) {
663 return getBooleanVariableValueSATTranslator(this, boolean);
670 bool CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
671 return order->encoding.resolver->resolveOrder(first, second);
674 long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
676 long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
678 void CSolver::autoTune(uint budget) {
679 AutoTuner *autotuner = new AutoTuner(budget);
680 autotuner->addProblem(this);
685 //Set* CSolver::addItemsToRange(Element* element, uint num, ...){
687 // va_start(args, num);
688 // element->getRange()
689 // uint setSize = set->getSize();
690 // uint newSize = setSize+ num;
691 // uint64_t members[newSize];
692 // for(uint i=0; i<setSize; i++){
693 // members[i] = set->getElement(i);
695 // for( uint i=0; i< num; i++){
696 // uint64_t arg = va_arg(args, uint64_t);
697 // members[setSize+i] = arg;
700 // return createSet(set->getType(), members, newSize);