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 delete allElements.get(i);
54 size = allTables.getSize();
55 for (uint i = 0; i < size; i++) {
56 delete allTables.get(i);
59 size = allPredicates.getSize();
60 for (uint i = 0; i < size; i++) {
61 delete allPredicates.get(i);
64 size = allOrders.getSize();
65 for (uint i = 0; i < size; i++) {
66 delete allOrders.get(i);
69 size = allFunctions.getSize();
70 for (uint i = 0; i < size; i++) {
71 delete allFunctions.get(i);
74 delete boolTrue.getBoolean();
78 CSolver *CSolver::clone() {
79 CSolver *copy = new CSolver();
81 SetIteratorBooleanEdge *it = getConstraints();
82 while (it->hasNext()) {
83 BooleanEdge b = it->next();
84 copy->addConstraint(cloneEdge(copy, &map, b));
90 void CSolver::serialize() {
91 model_print("serializing ...\n");
93 Serializer serializer("dump");
94 SetIteratorBooleanEdge *it = getConstraints();
95 while (it->hasNext()) {
96 BooleanEdge b = it->next();
97 serializeBooleanEdge(&serializer, b);
101 model_print("deserializing ...\n");
103 Deserializer deserializer("dump");
104 deserializer.deserialize();
109 Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) {
110 Set *set = new Set(type, elements, numelements);
115 Set *CSolver::createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange) {
116 Set *set = new Set(type, lowrange, highrange);
121 VarType CSolver::getSetVarType(Set *set){
122 return set->getType();
125 Element *CSolver::createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange) {
126 Set *s = createRangeSet(type, lowrange, highrange);
127 return getElementVar(s);
130 MutableSet *CSolver::createMutableSet(VarType type) {
131 MutableSet *set = new MutableSet(type);
136 void CSolver::addItem(MutableSet *set, uint64_t element) {
137 set->addElementMSet(element);
140 uint64_t CSolver::createUniqueItem(MutableSet *set) {
141 uint64_t element = set->getNewUniqueItem();
142 set->addElementMSet(element);
146 void CSolver::finalizeMutableSet(MutableSet* set){
150 Element *CSolver::getElementVar(Set *set) {
151 Element *element = new ElementSet(set);
152 allElements.push(element);
156 Set* CSolver::getElementRange (Element* element){
157 return element->getRange();
161 Element *CSolver::getElementConst(VarType type, uint64_t value) {
162 uint64_t array[] = {value};
163 Set *set = new Set(type, array, 1);
164 Element *element = new ElementConst(value, set);
165 Element *e = elemMap.get(element);
168 allElements.push(element);
169 elemMap.put(element, element);
178 Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, BooleanEdge overflowstatus) {
179 Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
180 Element *e = elemMap.get(element);
182 element->updateParents();
183 allElements.push(element);
184 elemMap.put(element, element);
192 Function *CSolver::createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,OverFlowBehavior overflowbehavior) {
193 Function *function = new FunctionOperator(op, domain, numDomain, range, overflowbehavior);
194 allFunctions.push(function);
198 Predicate *CSolver::createPredicateOperator(CompOp op, Set **domain, uint numDomain) {
199 Predicate *predicate = new PredicateOperator(op, domain,numDomain);
200 allPredicates.push(predicate);
204 Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavior) {
205 Predicate *predicate = new PredicateTable(table, behavior);
206 allPredicates.push(predicate);
210 Table *CSolver::createTable(Set **domains, uint numDomain, Set *range) {
211 Table *table = new Table(domains,numDomain,range);
212 allTables.push(table);
216 Table *CSolver::createTableForPredicate(Set **domains, uint numDomain) {
217 return createTable(domains, numDomain, NULL);
220 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
221 table->addNewTableEntry(inputs, inputSize, result);
224 Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
225 Function *function = new FunctionTable(table, behavior);
226 allFunctions.push(function);
230 BooleanEdge CSolver::getBooleanVar(VarType type) {
231 Boolean *boolean = new BooleanVar(type);
232 allBooleans.push(boolean);
233 return BooleanEdge(boolean);
236 BooleanEdge CSolver::getBooleanTrue() {
240 BooleanEdge CSolver::getBooleanFalse() {
244 BooleanEdge CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
245 return applyPredicateTable(predicate, inputs, numInputs, BooleanEdge(NULL));
248 BooleanEdge CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, BooleanEdge undefinedStatus) {
249 BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
250 Boolean *b = boolMap.get(boolean);
252 boolean->updateParents();
253 boolMap.put(boolean, boolean);
254 allBooleans.push(boolean);
255 return BooleanEdge(boolean);
258 return BooleanEdge(b);
262 bool CSolver::isTrue(BooleanEdge b) {
263 return b.isNegated()?b->isFalse():b->isTrue();
266 bool CSolver::isFalse(BooleanEdge b) {
267 return b.isNegated()?b->isTrue():b->isFalse();
270 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg1, BooleanEdge arg2) {
271 BooleanEdge array[] = {arg1, arg2};
272 return applyLogicalOperation(op, array, 2);
275 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg) {
276 BooleanEdge array[] = {arg};
277 return applyLogicalOperation(op, array, 1);
280 static int ptrcompares(const void *p1, const void *p2) {
281 uintptr_t b1 = *(uintptr_t const *) p1;
282 uintptr_t b2 = *(uintptr_t const *) p2;
291 BooleanEdge CSolver::rewriteLogicalOperation(LogicOp op, BooleanEdge * array, uint asize) {
292 return applyLogicalOperation(op, array, asize);
293 /* BooleanEdge newarray[asize];
294 memcpy(newarray, array, asize * sizeof(BooleanEdge));
295 for(uint i=0; i < asize; i++) {
296 BooleanEdge b=newarray[i];
297 if (b->type == LOGICOP) {
298 if (((BooleanLogic *) b.getBoolean())->replaced) {
299 newarray[i] = doRewrite(newarray[i]);
304 return applyLogicalOperation(op, newarray, asize);*/
307 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
308 BooleanEdge newarray[asize];
311 return array[0].negate();
314 for (uint i = 0; i < 2; i++) {
315 if (array[i]->type == BOOLCONST) {
316 if (isTrue(array[i])) { // It can be undefined
318 } else if(isFalse(array[i])) {
319 newarray[0] = array[1 - i];
320 return applyLogicalOperation(SATC_NOT, newarray, 1);
322 } else if (array[i]->type == LOGICOP) {
323 BooleanLogic *b =(BooleanLogic *)array[i].getBoolean();
325 return rewriteLogicalOperation(op, array, asize);
332 for (uint i =0; i <asize; i++) {
333 newarray[i] = applyLogicalOperation(SATC_NOT, array[i]);
335 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_AND, newarray, asize));
339 for (uint i = 0; i < asize; i++) {
340 BooleanEdge b = array[i];
341 // model_print("And: Argument %u:", i);
345 if (b->type == LOGICOP) {
346 if (((BooleanLogic *)b.getBoolean())->replaced)
347 return rewriteLogicalOperation(op, array, asize);
349 if (b->type == BOOLCONST) {
356 newarray[newindex++] = b;
360 } else if (newindex == 1) {
363 bsdqsort(newarray, newindex, sizeof(BooleanEdge), ptrcompares);
370 //handle by translation
371 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_IFF, array, asize));
374 //handle by translation
375 // model_print("Implies: first:");
376 // if(array[0].isNegated())
378 // array[0]->print();
379 // model_print("Implies: second:");
380 // if(array[1].isNegated())
382 // array[1]->print();
383 // model_println("##### OK let's get the operation done");
384 return applyLogicalOperation(SATC_OR, applyLogicalOperation(SATC_NOT, array[0]), array[1]);
389 Boolean *boolean = new BooleanLogic(this, op, array, asize);
390 /* Boolean *b = boolMap.get(boolean);
392 boolean->updateParents();
393 boolMap.put(boolean, boolean);
394 allBooleans.push(boolean);
395 return BooleanEdge(boolean);
398 return BooleanEdge(boolean);
402 BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
404 model_println("Creating order: From:%lu => To:%lu", first, second);
408 Boolean *constraint = new BooleanOrder(order, first, second);
409 allBooleans.push(constraint);
410 return BooleanEdge(constraint);
413 void CSolver::addConstraint(BooleanEdge constraint) {
415 model_println("****New Constraint******");
417 if(constraint.isNegated())
419 constraint.getBoolean()->print();
420 if (isTrue(constraint))
422 else if (isFalse(constraint)){
425 model_println("Adding constraint which is false :|");
430 if (constraint->type == LOGICOP) {
431 BooleanLogic *b=(BooleanLogic *) constraint.getBoolean();
432 if (!constraint.isNegated()) {
433 if (b->op==SATC_AND) {
434 for(uint i=0;i<b->inputs.getSize();i++) {
436 model_println("In loop");
438 addConstraint(b->inputs.get(i));
445 model_println("While rewriting");
447 addConstraint(doRewrite(constraint));
451 constraints.add(constraint);
452 Boolean *ptr=constraint.getBoolean();
454 if (ptr->boolVal == BV_UNSAT){
456 model_println("BooleanValue is Set to UnSAT");
461 replaceBooleanWithTrueNoRemove(constraint);
462 constraint->parents.clear();
466 Order *CSolver::createOrder(OrderType type, Set *set) {
467 Order *order = new Order(type, set);
468 allOrders.push(order);
469 activeOrders.add(order);
473 int CSolver::solve() {
474 bool deleteTuner = false;
476 tuner = new DefaultTuner();
480 long long startTime = getTimeNano();
481 computePolarities(this);
483 // Preprocess pp(this);
486 // DecomposeOrderTransform dot(this);
487 // dot.doTransform();
489 // IntegerEncodingTransform iet(this);
490 // iet.doTransform();
492 // EncodingGraph eg(this);
496 naiveEncodingDecision(this);
497 satEncoder->encodeAllSATEncoder(this);
498 model_println("Is problem UNSAT after encoding: %d", unsat);
499 int result = unsat ? IS_UNSAT : satEncoder->solve();
500 model_println("Result Computed in CSolver: %d", result);
501 long long finishTime = getTimeNano();
502 elapsedTime = finishTime - startTime;
510 uint64_t CSolver::getElementValue(Element *element) {
511 switch (element->type) {
515 return getElementValueSATTranslator(this, element);
522 bool CSolver::getBooleanValue(BooleanEdge bedge) {
523 Boolean *boolean=bedge.getBoolean();
524 switch (boolean->type) {
526 return getBooleanVariableValueSATTranslator(this, boolean);
533 bool CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
534 return order->encoding.resolver->resolveOrder(first, second);
537 long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
539 long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
541 void CSolver::autoTune(uint budget) {
542 AutoTuner *autotuner = new AutoTuner(budget);
543 autotuner->addProblem(this);