Correct test case
[satune.git] / src / csolver.cc
1 #include "csolver.h"
2 #include "set.h"
3 #include "mutableset.h"
4 #include "element.h"
5 #include "boolean.h"
6 #include "predicate.h"
7 #include "order.h"
8 #include "table.h"
9 #include "function.h"
10 #include "satencoder.h"
11 #include "sattranslator.h"
12 #include "tunable.h"
13 #include "polarityassignment.h"
14 #include "decomposeordertransform.h"
15 #include "autotuner.h"
16 #include "astops.h"
17 #include "structs.h"
18 #include "orderresolver.h"
19 #include "integerencoding.h"
20 #include "qsort.h"
21 #include "preprocess.h"
22 #include "serializer.h"
23 #include "deserializer.h"
24 #include "encodinggraph.h"
25
26 CSolver::CSolver() :
27         boolTrue(BooleanEdge(new BooleanConst(true))),
28         boolFalse(boolTrue.negate()),
29         unsat(false),
30         tuner(NULL),
31         elapsedTime(0)
32 {
33         satEncoder = new SATEncoder(this);
34 }
35
36 /** This function tears down the solver and the entire AST */
37
38 CSolver::~CSolver() {
39         uint size = allBooleans.getSize();
40         for (uint i = 0; i < size; i++) {
41                 delete allBooleans.get(i);
42         }
43
44         size = allSets.getSize();
45         for (uint i = 0; i < size; i++) {
46                 delete allSets.get(i);
47         }
48
49         size = allElements.getSize();
50         for (uint i = 0; i < size; i++) {
51                 delete allElements.get(i);
52         }
53
54         size = allTables.getSize();
55         for (uint i = 0; i < size; i++) {
56                 delete allTables.get(i);
57         }
58
59         size = allPredicates.getSize();
60         for (uint i = 0; i < size; i++) {
61                 delete allPredicates.get(i);
62         }
63
64         size = allOrders.getSize();
65         for (uint i = 0; i < size; i++) {
66                 delete allOrders.get(i);
67         }
68
69         size = allFunctions.getSize();
70         for (uint i = 0; i < size; i++) {
71                 delete allFunctions.get(i);
72         }
73
74         delete boolTrue.getBoolean();
75         delete satEncoder;
76 }
77
78 CSolver *CSolver::clone() {
79         CSolver *copy = new CSolver();
80         CloneMap map;
81         SetIteratorBooleanEdge *it = getConstraints();
82         while (it->hasNext()) {
83                 BooleanEdge b = it->next();
84                 copy->addConstraint(cloneEdge(copy, &map, b));
85         }
86         delete it;
87         return copy;
88 }
89
90 void CSolver::serialize() {
91         model_print("serializing ...\n");
92         {
93                 Serializer serializer("dump");
94                 SetIteratorBooleanEdge *it = getConstraints();
95                 while (it->hasNext()) {
96                         BooleanEdge b = it->next();
97                         serializeBooleanEdge(&serializer, b);
98                 }
99                 delete it;
100         }
101         model_print("deserializing ...\n");
102         {
103                 Deserializer deserializer("dump");
104                 deserializer.deserialize();
105         }
106         
107 }
108
109 Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) {
110         Set *set = new Set(type, elements, numelements);
111         allSets.push(set);
112         return set;
113 }
114
115 Set *CSolver::createRangeSet(VarType type, uint64_t lowrange, uint64_t highrange) {
116         Set *set = new Set(type, lowrange, highrange);
117         allSets.push(set);
118         return set;
119 }
120
121 VarType CSolver::getSetVarType(Set *set){
122         return set->getType();
123 }
124
125 Element *CSolver::createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange) {
126         Set *s = createRangeSet(type, lowrange, highrange);
127         return getElementVar(s);
128 }
129
130 MutableSet *CSolver::createMutableSet(VarType type) {
131         MutableSet *set = new MutableSet(type);
132         allSets.push(set);
133         return set;
134 }
135
136 void CSolver::addItem(MutableSet *set, uint64_t element) {
137         set->addElementMSet(element);
138 }
139
140 uint64_t CSolver::createUniqueItem(MutableSet *set) {
141         uint64_t element = set->getNewUniqueItem();
142         set->addElementMSet(element);
143         return element;
144 }
145
146 void CSolver::finalizeMutableSet(MutableSet* set){
147         set->finalize();
148 }
149
150 Element *CSolver::getElementVar(Set *set) {
151         Element *element = new ElementSet(set);
152         allElements.push(element);
153         return element;
154 }
155
156 Set* CSolver::getElementRange (Element* element){
157         return element->getRange();
158 }
159
160
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);
166         if (e == NULL) {
167                 allSets.push(set);
168                 allElements.push(element);
169                 elemMap.put(element, element);
170                 return element;
171         } else {
172                 delete set;
173                 delete element;
174                 return e;
175         }
176 }
177
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);
181         if (e == NULL) {
182                 element->updateParents();
183                 allElements.push(element);
184                 elemMap.put(element, element);
185                 return element;
186         } else {
187                 delete element;
188                 return e;
189         }
190 }
191
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);
195         return function;
196 }
197
198 Predicate *CSolver::createPredicateOperator(CompOp op, Set **domain, uint numDomain) {
199         Predicate *predicate = new PredicateOperator(op, domain,numDomain);
200         allPredicates.push(predicate);
201         return predicate;
202 }
203
204 Predicate *CSolver::createPredicateTable(Table *table, UndefinedBehavior behavior) {
205         Predicate *predicate = new PredicateTable(table, behavior);
206         allPredicates.push(predicate);
207         return predicate;
208 }
209
210 Table *CSolver::createTable(Set **domains, uint numDomain, Set *range) {
211         Table *table = new Table(domains,numDomain,range);
212         allTables.push(table);
213         return table;
214 }
215
216 Table *CSolver::createTableForPredicate(Set **domains, uint numDomain) {
217         return createTable(domains, numDomain, NULL);
218 }
219
220 void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
221         table->addNewTableEntry(inputs, inputSize, result);
222 }
223
224 Function *CSolver::completeTable(Table *table, UndefinedBehavior behavior) {
225         Function *function = new FunctionTable(table, behavior);
226         allFunctions.push(function);
227         return function;
228 }
229
230 BooleanEdge CSolver::getBooleanVar(VarType type) {
231         Boolean *boolean = new BooleanVar(type);
232         allBooleans.push(boolean);
233         return BooleanEdge(boolean);
234 }
235
236 BooleanEdge CSolver::getBooleanTrue() {
237         return boolTrue;
238 }
239
240 BooleanEdge CSolver::getBooleanFalse() {
241         return boolFalse;
242 }
243
244 BooleanEdge CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
245         return applyPredicateTable(predicate, inputs, numInputs, BooleanEdge(NULL));
246 }
247
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);
251         if (b == NULL) {
252                 boolean->updateParents();
253                 boolMap.put(boolean, boolean);
254                 allBooleans.push(boolean);
255                 return BooleanEdge(boolean);
256         } else {
257                 delete boolean;
258                 return BooleanEdge(b);
259         }
260 }
261
262 bool CSolver::isTrue(BooleanEdge b) {
263         return b.isNegated()?b->isFalse():b->isTrue();
264 }
265
266 bool CSolver::isFalse(BooleanEdge b) {
267         return b.isNegated()?b->isTrue():b->isFalse();
268 }
269
270 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg1, BooleanEdge arg2) {
271         BooleanEdge array[] = {arg1, arg2};
272         return applyLogicalOperation(op, array, 2);
273 }
274
275 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg) {
276         BooleanEdge array[] = {arg};
277         return applyLogicalOperation(op, array, 1);
278 }
279
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;
283         if (b1 < b2)
284                 return -1;
285         else if (b1 == b2)
286                 return 0;
287         else
288                 return 1;
289 }
290
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]);
300                                 i--;//Check again
301                         }
302                 }
303         }
304         return applyLogicalOperation(op, newarray, asize);*/
305 }
306
307 BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
308         BooleanEdge newarray[asize];
309         switch (op) {
310         case SATC_NOT: {
311                 return array[0].negate();
312         }
313         case SATC_IFF: {
314                 for (uint i = 0; i < 2; i++) {
315                         if (array[i]->type == BOOLCONST) {
316                                 if (isTrue(array[i])) { // It can be undefined
317                                         return array[1 - i];
318                                 } else if(isFalse(array[i])) {
319                                         newarray[0] = array[1 - i];
320                                         return applyLogicalOperation(SATC_NOT, newarray, 1);
321                                 }
322                         } else if (array[i]->type == LOGICOP) {
323                                 BooleanLogic *b =(BooleanLogic *)array[i].getBoolean();
324                                 if (b->replaced) {
325                                         return rewriteLogicalOperation(op, array, asize);
326                                 }
327                         }
328                 }
329                 break;
330         }
331         case SATC_OR: {
332                 for (uint i =0; i <asize; i++) {
333                         newarray[i] = applyLogicalOperation(SATC_NOT, array[i]);
334                 }
335                 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_AND, newarray, asize));
336         }
337         case SATC_AND: {
338                 uint newindex = 0;
339                 for (uint i = 0; i < asize; i++) {
340                         BooleanEdge b = array[i];
341 //                        model_print("And: Argument %u:", i);
342 //                        if(b.isNegated())
343 //                                model_print("!");
344 //                        b->print();
345                         if (b->type == LOGICOP) {
346                                 if (((BooleanLogic *)b.getBoolean())->replaced)
347                                         return rewriteLogicalOperation(op, array, asize);
348                         }
349                         if (b->type == BOOLCONST) {
350                                 if (isTrue(b))
351                                         continue;
352                                 else{
353                                         return boolFalse;
354                                 }
355                         } else
356                                 newarray[newindex++] = b;
357                 }
358                 if (newindex == 0) {
359                         return boolTrue;
360                 } else if (newindex == 1) {
361                         return newarray[0];
362                 } else {
363                         bsdqsort(newarray, newindex, sizeof(BooleanEdge), ptrcompares);
364                         array = newarray;
365                         asize = newindex;
366                 }
367                 break;
368         }
369         case SATC_XOR: {
370                 //handle by translation
371                 return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_IFF, array, asize));
372         }
373         case SATC_IMPLIES: {
374                 //handle by translation
375 //                model_print("Implies: first:");
376 //                if(array[0].isNegated())
377 //                        model_print("!");
378 //                array[0]->print();
379 //                model_print("Implies: second:");
380 //                if(array[1].isNegated())
381 //                        model_print("!");
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]);
385         }
386         }
387
388         ASSERT(asize != 0);
389         Boolean *boolean = new BooleanLogic(this, op, array, asize);
390         /*      Boolean *b = boolMap.get(boolean);
391         if (b == NULL) {
392                 boolean->updateParents();
393                 boolMap.put(boolean, boolean);
394                 allBooleans.push(boolean);
395                 return BooleanEdge(boolean);
396         } else {
397         delete boolean;*/
398                 return BooleanEdge(boolean);
399                 /*      }*/
400 }
401
402 BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
403 #ifdef TRACE_DEBUG
404         model_println("Creating order: From:%lu => To:%lu", first, second);
405 #endif
406         if(first == second)
407                 return boolFalse;
408         Boolean *constraint = new BooleanOrder(order, first, second);
409         allBooleans.push(constraint);
410         return BooleanEdge(constraint);
411 }
412
413 void CSolver::addConstraint(BooleanEdge constraint) {
414 #ifdef TRACE_DEBUG
415         model_println("****New Constraint******");
416 #endif
417         if(constraint.isNegated())
418                 model_print("!");
419         constraint.getBoolean()->print();
420         if (isTrue(constraint))
421                 return;
422         else if (isFalse(constraint)){
423                 int t=0;
424 #ifdef TRACE_DEBUG
425                 model_println("Adding constraint which is false :|");
426 #endif
427                 setUnSAT();
428         }
429         else {
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++) {
435 #ifdef TRACE_DEBUG
436                                                 model_println("In loop");
437 #endif
438                                                 addConstraint(b->inputs.get(i));
439                                         }
440                                         return;
441                                 }
442                         }
443                         if (b->replaced) {
444 #ifdef TRACE_DEBUG
445                                 model_println("While rewriting");
446 #endif
447                                 addConstraint(doRewrite(constraint));
448                                 return;
449                         }
450                 }
451                 constraints.add(constraint);
452                 Boolean *ptr=constraint.getBoolean();
453                 
454                 if (ptr->boolVal == BV_UNSAT){
455 #ifdef TRACE_DEBUG
456                         model_println("BooleanValue is Set to UnSAT");
457 #endif
458                         setUnSAT();
459                 }
460                 
461                 replaceBooleanWithTrueNoRemove(constraint);
462                 constraint->parents.clear();
463         }
464 }
465
466 Order *CSolver::createOrder(OrderType type, Set *set) {
467         Order *order = new Order(type, set);
468         allOrders.push(order);
469         activeOrders.add(order);
470         return order;
471 }
472
473 int CSolver::solve() {
474         bool deleteTuner = false;
475         if (tuner == NULL) {
476                 tuner = new DefaultTuner();
477                 deleteTuner = true;
478         }
479
480         long long startTime = getTimeNano();
481         computePolarities(this);
482
483 //      Preprocess pp(this);
484 //      pp.doTransform();
485         
486 //      DecomposeOrderTransform dot(this);
487 //      dot.doTransform();
488
489 //      IntegerEncodingTransform iet(this);
490 //      iet.doTransform();
491
492 //      EncodingGraph eg(this);
493 //      eg.buildGraph();
494 //      eg.encode();
495         
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;
503         if (deleteTuner) {
504                 delete tuner;
505                 tuner = NULL;
506         }
507         return result;
508 }
509
510 uint64_t CSolver::getElementValue(Element *element) {
511         switch (element->type) {
512         case ELEMSET:
513         case ELEMCONST:
514         case ELEMFUNCRETURN:
515                 return getElementValueSATTranslator(this, element);
516         default:
517                 ASSERT(0);
518         }
519         exit(-1);
520 }
521
522 bool CSolver::getBooleanValue(BooleanEdge bedge) {
523         Boolean *boolean=bedge.getBoolean();
524         switch (boolean->type) {
525         case BOOLEANVAR:
526                 return getBooleanVariableValueSATTranslator(this, boolean);
527         default:
528                 ASSERT(0);
529         }
530         exit(-1);
531 }
532
533 bool CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
534         return order->encoding.resolver->resolveOrder(first, second);
535 }
536
537 long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
538
539 long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
540
541 void CSolver::autoTune(uint budget) {
542         AutoTuner *autotuner = new AutoTuner(budget);
543         autotuner->addProblem(this);
544         autotuner->tune();
545         delete autotuner;
546 }