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"
27 boolTrue(BooleanEdge(new BooleanConst(true))),
28 boolFalse(boolTrue.negate()),
33 satEncoder = new SATEncoder(this);
36 /** This function tears down the solver and the entire AST */
39 uint size = allBooleans.getSize();
40 for (uint i = 0; i < size; i++) {
41 delete allBooleans.get(i);
44 size = allSets.getSize();
45 for (uint i = 0; i < size; i++) {
46 delete allSets.get(i);
49 size = allElements.getSize();
50 for (uint i = 0; i < size; i++) {
51 Element* el = allElements.get(i);
55 size = allTables.getSize();
56 for (uint i = 0; i < size; i++) {
57 delete allTables.get(i);
60 size = allPredicates.getSize();
61 for (uint i = 0; i < size; i++) {
62 delete allPredicates.get(i);
65 size = allOrders.getSize();
66 for (uint i = 0; i < size; i++) {
67 delete allOrders.get(i);
70 size = allFunctions.getSize();
71 for (uint i = 0; i < size; i++) {
72 delete allFunctions.get(i);
75 delete boolTrue.getBoolean();
79 CSolver *CSolver::clone() {
80 CSolver *copy = new CSolver();
82 SetIteratorBooleanEdge *it = getConstraints();
83 while (it->hasNext()) {
84 BooleanEdge b = it->next();
85 copy->addConstraint(cloneEdge(copy, &map, b));
91 CSolver* CSolver::deserialize(const char * file){
92 model_print("deserializing ...\n");
93 Deserializer deserializer(file);
94 return deserializer.deserialize();
97 void CSolver::serialize() {
98 model_print("serializing ...\n");
99 Serializer serializer("dump");
100 SetIteratorBooleanEdge *it = getConstraints();
101 while (it->hasNext()) {
102 BooleanEdge b = it->next();
103 serializeBooleanEdge(&serializer, b);
108 Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) {
109 Set *set = new Set(type, elements, numelements);
114 Set *CSolver::createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange) {
115 Set *set = new Set(type, lowrange, highrange);
120 VarType CSolver::getSetVarType(Set *set) {
121 return set->getType();
124 Element *CSolver::createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange) {
125 Set *s = createRangeSet(type, lowrange, highrange);
126 return getElementVar(s);
129 MutableSet *CSolver::createMutableSet(VarType type) {
130 MutableSet *set = new MutableSet(type);
135 void CSolver::addItem(MutableSet *set, uint64_t element) {
136 set->addElementMSet(element);
139 uint64_t CSolver::createUniqueItem(MutableSet *set) {
140 uint64_t element = set->getNewUniqueItem();
141 set->addElementMSet(element);
145 void CSolver::finalizeMutableSet(MutableSet *set) {
149 Element *CSolver::getElementVar(Set *set) {
150 Element *element = new ElementSet(set);
151 allElements.push(element);
155 Set *CSolver::getElementRange (Element *element) {
156 return element->getRange();
160 Element *CSolver::getElementConst(VarType type, uint64_t value) {
161 uint64_t array[] = {value};
162 Set *set = new Set(type, array, 1);
163 Element *element = new ElementConst(value, set);
164 Element *e = elemMap.get(element);
167 allElements.push(element);
168 elemMap.put(element, element);
177 Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, BooleanEdge overflowstatus) {
178 Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
179 Element *e = elemMap.get(element);
181 element->updateParents();
182 allElements.push(element);
183 elemMap.put(element, element);
191 Function *CSolver::createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,OverFlowBehavior overflowbehavior) {
192 Function *function = new FunctionOperator(op, domain, numDomain, range, overflowbehavior);
193 allFunctions.push(function);
197 Predicate *CSolver::createPredicateOperator(CompOp op, Set **domain, uint numDomain) {
198 Predicate *predicate = new PredicateOperator(op, domain,numDomain);
199 allPredicates.push(predicate);
203 Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavior) {
204 Predicate *predicate = new PredicateTable(table, behavior);
205 allPredicates.push(predicate);
209 Table *CSolver::createTable(Set **domains, uint numDomain, Set *range) {
210 Table *table = new Table(domains,numDomain,range);
211 allTables.push(table);
215 Table *CSolver::createTableForPredicate(Set **domains, uint numDomain) {
216 return createTable(domains, numDomain, NULL);
219 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
220 table->addNewTableEntry(inputs, inputSize, result);
223 Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
224 Function *function = new FunctionTable(table, behavior);
225 allFunctions.push(function);
229 BooleanEdge CSolver::getBooleanVar(VarType type) {
230 Boolean *boolean = new BooleanVar(type);
231 allBooleans.push(boolean);
232 return BooleanEdge(boolean);
235 BooleanEdge CSolver::getBooleanTrue() {
239 BooleanEdge CSolver::getBooleanFalse() {
243 BooleanEdge CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
244 return applyPredicateTable(predicate, inputs, numInputs, BooleanEdge(NULL));
247 BooleanEdge CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, BooleanEdge undefinedStatus) {
248 BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
249 Boolean *b = boolMap.get(boolean);
251 boolean->updateParents();
252 boolMap.put(boolean, boolean);
253 allBooleans.push(boolean);
254 return BooleanEdge(boolean);
257 return BooleanEdge(b);
261 bool CSolver::isTrue(BooleanEdge b) {
262 return b.isNegated() ? b->isFalse() : b->isTrue();
265 bool CSolver::isFalse(BooleanEdge b) {
266 return b.isNegated() ? b->isTrue() : b->isFalse();
269 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg1, BooleanEdge arg2) {
270 BooleanEdge array[] = {arg1, arg2};
271 return applyLogicalOperation(op, array, 2);
274 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg) {
275 BooleanEdge array[] = {arg};
276 return applyLogicalOperation(op, array, 1);
279 static int ptrcompares(const void *p1, const void *p2) {
280 uintptr_t b1 = *(uintptr_t const *) p1;
281 uintptr_t b2 = *(uintptr_t const *) p2;
290 BooleanEdge CSolver::rewriteLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
291 BooleanEdge newarray[asize];
292 memcpy(newarray, array, asize * sizeof(BooleanEdge));
293 for (uint i = 0; i < asize; i++) {
294 BooleanEdge b = newarray[i];
295 if (b->type == LOGICOP) {
296 if (((BooleanLogic *) b.getBoolean())->replaced) {
297 newarray[i] = doRewrite(newarray[i]);
302 return applyLogicalOperation(op, newarray, asize);
305 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
306 BooleanEdge newarray[asize];
309 return array[0].negate();
312 for (uint i = 0; i < 2; i++) {
313 if (array[i]->type == BOOLCONST) {
314 if (isTrue(array[i])) { // It can be undefined
316 } else if (isFalse(array[i])) {
317 newarray[0] = array[1 - i];
318 return applyLogicalOperation(SATC_NOT, newarray, 1);
320 } else if (array[i]->type == LOGICOP) {
321 BooleanLogic *b = (BooleanLogic *)array[i].getBoolean();
323 return rewriteLogicalOperation(op, array, asize);
330 for (uint i = 0; i < asize; i++) {
331 newarray[i] = applyLogicalOperation(SATC_NOT, array[i]);
333 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_AND, newarray, asize));
337 for (uint i = 0; i < asize; i++) {
338 BooleanEdge b = array[i];
339 if (b->type == LOGICOP) {
340 if (((BooleanLogic *)b.getBoolean())->replaced)
341 return rewriteLogicalOperation(op, array, asize);
343 if (b->type == BOOLCONST) {
350 newarray[newindex++] = b;
354 } else if (newindex == 1) {
357 bsdqsort(newarray, newindex, sizeof(BooleanEdge), ptrcompares);
364 //handle by translation
365 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_IFF, array, asize));
368 //handle by translation
369 return applyLogicalOperation(SATC_OR, applyLogicalOperation(SATC_NOT, array[0]), array[1]);
374 Boolean *boolean = new BooleanLogic(this, op, array, asize);
375 Boolean *b = boolMap.get(boolean);
377 boolean->updateParents();
378 boolMap.put(boolean, boolean);
379 allBooleans.push(boolean);
380 return BooleanEdge(boolean);
383 return BooleanEdge(b);
387 BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
388 ASSERT(first != second);
389 Boolean *constraint = new BooleanOrder(order, first, second);
390 allBooleans.push(constraint);
391 return BooleanEdge(constraint);
394 void CSolver::addConstraint(BooleanEdge constraint) {
396 model_println("****New Constraint******");
398 if (isTrue(constraint))
400 else if (isFalse(constraint)) {
405 if (constraint->type == LOGICOP) {
406 BooleanLogic *b = (BooleanLogic *) constraint.getBoolean();
407 if (!constraint.isNegated()) {
408 if (b->op == SATC_AND) {
409 for (uint i = 0; i < b->inputs.getSize(); i++) {
410 addConstraint(b->inputs.get(i));
416 addConstraint(doRewrite(constraint));
420 constraints.add(constraint);
421 Boolean *ptr = constraint.getBoolean();
423 if (ptr->boolVal == BV_UNSAT) {
427 replaceBooleanWithTrueNoRemove(constraint);
428 constraint->parents.clear();
432 Order *CSolver::createOrder(OrderType type, Set *set) {
433 Order *order = new Order(type, set);
434 allOrders.push(order);
435 activeOrders.add(order);
439 int CSolver::solve() {
440 bool deleteTuner = false;
442 tuner = new DefaultTuner();
446 long long startTime = getTimeNano();
447 computePolarities(this);
452 DecomposeOrderTransform dot(this);
455 IntegerEncodingTransform iet(this);
458 EncodingGraph eg(this);
462 naiveEncodingDecision(this);
463 satEncoder->encodeAllSATEncoder(this);
464 model_print("Is problem UNSAT after encoding: %d\n", unsat);
465 int result = unsat ? IS_UNSAT : satEncoder->solve();
466 model_print("Result Computed in CSolver: %d\n", result);
467 long long finishTime = getTimeNano();
468 elapsedTime = finishTime - startTime;
476 void CSolver::printConstraints() {
477 SetIteratorBooleanEdge *it = getConstraints();
478 while (it->hasNext()) {
479 BooleanEdge b = it->next();
489 uint64_t CSolver::getElementValue(Element *element) {
490 switch (element->type) {
494 return getElementValueSATTranslator(this, element);
501 bool CSolver::getBooleanValue(BooleanEdge bedge) {
502 Boolean *boolean = bedge.getBoolean();
503 switch (boolean->type) {
505 return getBooleanVariableValueSATTranslator(this, boolean);
512 bool CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
513 return order->encoding.resolver->resolveOrder(first, second);
516 long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
518 long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
520 void CSolver::autoTune(uint budget) {
521 AutoTuner *autotuner = new AutoTuner(budget);
522 autotuner->addProblem(this);