#include "sattranslator.h"
#include "tunable.h"
#include "polarityassignment.h"
-#include "analyzer.h"
+#include "decomposeordertransform.h"
#include "autotuner.h"
+#include "astops.h"
+#include "structs.h"
+#include "orderresolver.h"
+#include "integerencoding.h"
+#include <stdlib.h>
CSolver::CSolver() :
+ boolTrue(new BooleanConst(true)),
+ boolFalse(new BooleanConst(false)),
unsat(false),
tuner(NULL),
elapsedTime(0)
delete allFunctions.get(i);
}
+ delete boolTrue;
+ delete boolFalse;
delete satEncoder;
}
CSolver *CSolver::clone() {
CSolver *copy = new CSolver();
CloneMap map;
- HSIteratorBoolean *it = getConstraints();
+ SetIteratorBoolean *it = getConstraints();
while (it->hasNext()) {
Boolean *b = it->next();
copy->addConstraint(b->clone(copy, &map));
return set;
}
+Element *CSolver::createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange) {
+ Set *s = createRangeSet(type, lowrange, highrange);
+ return getElementVar(s);
+}
+
MutableSet *CSolver::createMutableSet(VarType type) {
MutableSet *set = new MutableSet(type);
allSets.push(set);
return boolean;
}
+Boolean *CSolver::getBooleanTrue() {
+ return boolTrue;
+}
+
+Boolean *CSolver::getBooleanFalse() {
+ return boolFalse;
+}
+
Boolean *CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
return applyPredicateTable(predicate, inputs, numInputs, NULL);
}
Boolean *CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, Boolean *undefinedStatus) {
BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
- Boolean * b = boolMap.get(boolean);
+ Boolean *b = boolMap.get(boolean);
if (b == NULL) {
boolMap.put(boolean, boolean);
allBooleans.push(boolean);
}
}
+bool CSolver::isTrue(Boolean *b) {
+ return b->isTrue();
+}
+
+bool CSolver::isFalse(Boolean *b) {
+ return b->isFalse();
+}
+
+Boolean *CSolver::applyLogicalOperation(LogicOp op, Boolean *arg1, Boolean *arg2) {
+ Boolean *array[] = {arg1, arg2};
+ return applyLogicalOperation(op, array, 2);
+}
+
+Boolean *CSolver::applyLogicalOperation(LogicOp op, Boolean *arg) {
+ Boolean *array[] = {arg};
+ return applyLogicalOperation(op, array, 1);
+}
+
+static int ptrcompares(const void *p1, const void *p2) {
+ uintptr_t b1 = *(uintptr_t const *) p1;
+ uintptr_t b2 = *(uintptr_t const *) p2;
+ if (b1 < b2)
+ return -1;
+ else if (b1 == b2)
+ return 0;
+ else
+ return 1;
+}
+
Boolean *CSolver::applyLogicalOperation(LogicOp op, Boolean **array, uint asize) {
+ Boolean *newarray[asize];
+ switch (op) {
+ case SATC_NOT: {
+ if (array[0]->type == LOGICOP && ((BooleanLogic *)array[0])->op == SATC_NOT) {
+ return ((BooleanLogic *) array[0])->inputs.get(0);
+ } else if (array[0]->type == BOOLCONST) {
+ return array[0]->isTrue() ? boolFalse : boolTrue;
+ }
+ break;
+ }
+ case SATC_IFF: {
+ for (uint i = 0; i < 2; i++) {
+ if (array[i]->type == BOOLCONST) {
+ if (array[i]->isTrue()) {
+ return array[1 - i];
+ } else {
+ newarray[0] = array[1 - i];
+ return applyLogicalOperation(SATC_NOT, newarray, 1);
+ }
+ }
+ }
+ break;
+ }
+ case SATC_OR: {
+ for (uint i =0; i <asize; i++) {
+ newarray[i] = applyLogicalOperation(SATC_NOT, array[i]);
+ }
+ return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_AND, newarray, asize));
+ }
+ case SATC_AND: {
+ uint newindex = 0;
+ for (uint i = 0; i < asize; i++) {
+ Boolean *b = array[i];
+ if (b->type == BOOLCONST) {
+ if (b->isTrue())
+ continue;
+ else
+ return boolFalse;
+ } else
+ newarray[newindex++] = b;
+ }
+ if (newindex == 0) {
+ return boolTrue;
+ } else if (newindex == 1) {
+ return newarray[0];
+ } else {
+ qsort(newarray, asize, sizeof(Boolean *), ptrcompares);
+ array = newarray;
+ asize = newindex;
+ }
+ break;
+ }
+ case SATC_XOR: {
+ //handle by translation
+ return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_IFF, array, asize));
+ }
+ case SATC_IMPLIES: {
+ //handle by translation
+ return applyLogicalOperation(SATC_OR, applyLogicalOperation(SATC_NOT, array[0]), array[1]);
+ }
+ }
+
+ ASSERT(asize != 0);
Boolean *boolean = new BooleanLogic(this, op, array, asize);
Boolean *b = boolMap.get(boolean);
if (b == NULL) {
boolMap.put(boolean, boolean);
allBooleans.push(boolean);
- return boolean;
+ return boolean;
} else {
delete boolean;
return b;
}
void CSolver::addConstraint(Boolean *constraint) {
- constraints.add(constraint);
+ if (constraint == boolTrue)
+ return;
+ else if (constraint == boolFalse)
+ setUnSAT();
+ else {
+ if (constraint->type == LOGICOP) {
+ BooleanLogic *b=(BooleanLogic *) constraint;
+ if (b->op==SATC_AND) {
+ for(uint i=0;i<b->inputs.getSize();i++) {
+ addConstraint(b->inputs.get(i));
+ }
+ return;
+ }
+ }
+
+ constraints.add(constraint);
+ }
}
Order *CSolver::createOrder(OrderType type, Set *set) {
Order *order = new Order(type, set);
allOrders.push(order);
+ activeOrders.add(order);
return order;
}
-int CSolver::startEncoding() {
+int CSolver::solve() {
bool deleteTuner = false;
if (tuner == NULL) {
tuner = new DefaultTuner();
deleteTuner = true;
}
-
+
long long startTime = getTimeNano();
computePolarities(this);
- orderAnalysis(this);
+
+ DecomposeOrderTransform dot(this);
+ dot.doTransform();
+
+ //This leaks like crazy
+ // IntegerEncodingTransform iet(this);
+ //iet.doTransform();
+
naiveEncodingDecision(this);
satEncoder->encodeAllSATEncoder(this);
int result = unsat ? IS_UNSAT : satEncoder->solve();
exit(-1);
}
-HappenedBefore CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
- return getOrderConstraintValueSATTranslator(this, order, first, second);
+bool CSolver::getOrderConstraintValue(Order *order, uint64_t first, uint64_t second) {
+ return order->encoding.resolver->resolveOrder(first, second);
}
long long CSolver::getEncodeTime() { return satEncoder->getEncodeTime(); }
long long CSolver::getSolveTime() { return satEncoder->getSolveTime(); }
void CSolver::autoTune(uint budget) {
- AutoTuner * autotuner=new AutoTuner(budget);
+ AutoTuner *autotuner = new AutoTuner(budget);
autotuner->addProblem(this);
autotuner->tune();
delete autotuner;
projects / satune.git / blobdiff