#include "serializer.h"
#include "deserializer.h"
#include "encodinggraph.h"
+#include "ordergraph.h"
+#include "orderedge.h"
+#include "orderanalysis.h"
+#include "elementopt.h"
+#include <time.h>
+#include <stdarg.h>
CSolver::CSolver() :
boolTrue(BooleanEdge(new BooleanConst(true))),
/** This function tears down the solver and the entire AST */
CSolver::~CSolver() {
+ //serialize();
uint size = allBooleans.getSize();
for (uint i = 0; i < size; i++) {
delete allBooleans.get(i);
size = allElements.getSize();
for (uint i = 0; i < size; i++) {
- Element* el = allElements.get(i);
+ Element *el = allElements.get(i);
delete el;
}
for (uint i = 0; i < size; i++) {
delete allOrders.get(i);
}
-
size = allFunctions.getSize();
for (uint i = 0; i < size; i++) {
delete allFunctions.get(i);
delete satEncoder;
}
+void CSolver::resetSolver() {
+ //serialize();
+ uint size = allBooleans.getSize();
+ for (uint i = 0; i < size; i++) {
+ delete allBooleans.get(i);
+ }
+
+ size = allSets.getSize();
+ for (uint i = 0; i < size; i++) {
+ delete allSets.get(i);
+ }
+
+ size = allElements.getSize();
+ for (uint i = 0; i < size; i++) {
+ Element *el = allElements.get(i);
+ delete el;
+ }
+
+ size = allTables.getSize();
+ for (uint i = 0; i < size; i++) {
+ delete allTables.get(i);
+ }
+
+ size = allPredicates.getSize();
+ for (uint i = 0; i < size; i++) {
+ delete allPredicates.get(i);
+ }
+
+ size = allOrders.getSize();
+ for (uint i = 0; i < size; i++) {
+ delete allOrders.get(i);
+ }
+ size = allFunctions.getSize();
+ for (uint i = 0; i < size; i++) {
+ delete allFunctions.get(i);
+ }
+ delete boolTrue.getBoolean();
+ allBooleans.clear();
+ allSets.clear();
+ allElements.clear();
+ allTables.clear();
+ allPredicates.clear();
+ allOrders.clear();
+ allFunctions.clear();
+ constraints.reset();
+ activeOrders.reset();
+ boolMap.reset();
+ elemMap.reset();
+
+ boolTrue = BooleanEdge(new BooleanConst(true));
+ boolFalse = boolTrue.negate();
+ unsat = false;
+ elapsedTime = 0;
+ tuner = NULL;
+ satEncoder->resetSATEncoder();
+
+}
+
CSolver *CSolver::clone() {
CSolver *copy = new CSolver();
CloneMap map;
return copy;
}
-CSolver* CSolver::deserialize(const char * file){
+CSolver *CSolver::deserialize(const char *file) {
model_print("deserializing ...\n");
Deserializer deserializer(file);
return deserializer.deserialize();
void CSolver::serialize() {
model_print("serializing ...\n");
- printConstraints();
- Serializer serializer("dump");
+ char buffer[255];
+ long long nanotime = getTimeNano();
+ int numchars = sprintf(buffer, "DUMP%llu", nanotime);
+ Serializer serializer(buffer);
SetIteratorBooleanEdge *it = getConstraints();
while (it->hasNext()) {
BooleanEdge b = it->next();
return set;
}
+bool CSolver::itemExistInSet(Set *set, uint64_t item){
+ return set->exists(item);
+}
+
VarType CSolver::getSetVarType(Set *set) {
return set->getType();
}
return element;
}
+void CSolver::mustHaveValue(Element *element){
+ element->getElementEncoding()->anyValue = true;
+}
+
Set *CSolver::getElementRange (Element *element) {
return element->getRange();
}
}
}
+
Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, BooleanEdge overflowstatus) {
Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
Element *e = elemMap.get(element);
}
}
-Function *CSolver::createFunctionOperator(ArithOp op, Set **domain, uint numDomain, Set *range,OverFlowBehavior overflowbehavior) {
- Function *function = new FunctionOperator(op, domain, numDomain, range, overflowbehavior);
+Function *CSolver::createFunctionOperator(ArithOp op, Set *range, OverFlowBehavior overflowbehavior) {
+ Function *function = new FunctionOperator(op, range, overflowbehavior);
allFunctions.push(function);
return function;
}
-Predicate *CSolver::createPredicateOperator(CompOp op, Set **domain, uint numDomain) {
- Predicate *predicate = new PredicateOperator(op, domain,numDomain);
+Predicate *CSolver::createPredicateOperator(CompOp op) {
+ Predicate *predicate = new PredicateOperator(op);
allPredicates.push(predicate);
return predicate;
}
return predicate;
}
-Table *CSolver::createTable(Set **domains, uint numDomain, Set *range) {
- Table *table = new Table(domains,numDomain,range);
+Table *CSolver::createTable(Set *range) {
+ Table *table = new Table(range);
allTables.push(table);
return table;
}
-Table *CSolver::createTableForPredicate(Set **domains, uint numDomain) {
- return createTable(domains, numDomain, NULL);
+Table *CSolver::createTableForPredicate() {
+ return createTable(NULL);
}
void CSolver::addTableEntry(Table *table, uint64_t *inputs, uint inputSize, uint64_t result) {
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;
+static int booleanEdgeCompares(const void *p1, const void *p2) {
+ BooleanEdge be1 = *(BooleanEdge const *) p1;
+ BooleanEdge be2 = *(BooleanEdge const *) p2;
+ uint64_t b1 = be1->id;
+ uint64_t b2 = be2->id;
if (b1 < b2)
return -1;
else if (b1 == b2)
}
case SATC_IFF: {
for (uint i = 0; i < 2; i++) {
- if (array[i]->type == BOOLCONST) {
- if (isTrue(array[i])) { // It can be undefined
- return array[1 - i];
- } else if (isFalse(array[i])) {
- newarray[0] = array[1 - i];
- return applyLogicalOperation(SATC_NOT, newarray, 1);
- }
+ if (isTrue(array[i])) { // It can be undefined
+ return array[1 - i];
+ } else if (isFalse(array[i])) {
+ newarray[0] = array[1 - i];
+ return applyLogicalOperation(SATC_NOT, newarray, 1);
} else if (array[i]->type == LOGICOP) {
BooleanLogic *b = (BooleanLogic *)array[i].getBoolean();
if (b->replaced) {
if (((BooleanLogic *)b.getBoolean())->replaced)
return rewriteLogicalOperation(op, array, asize);
}
- if (b->type == BOOLCONST) {
- if (isTrue(b))
- continue;
- else {
- return boolFalse;
- }
+ if (isTrue(b))
+ continue;
+ else if (isFalse(b)) {
+ return boolFalse;
} else
newarray[newindex++] = b;
}
} else if (newindex == 1) {
return newarray[0];
} else {
- bsdqsort(newarray, newindex, sizeof(BooleanEdge), ptrcompares);
+ bsdqsort(newarray, newindex, sizeof(BooleanEdge), booleanEdgeCompares);
array = newarray;
asize = newindex;
}
}
BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
- ASSERT(first != second);
+ // ASSERT(first != second);
+ if (first == second)
+ return getBooleanFalse();
+
+ bool negate = false;
+ if (order->type == SATC_TOTAL) {
+ if (first > second) {
+ uint64_t tmp = first;
+ first = second;
+ second = tmp;
+ negate = true;
+ }
+ }
Boolean *constraint = new BooleanOrder(order, first, second);
- allBooleans.push(constraint);
- return BooleanEdge(constraint);
+ Boolean *b = boolMap.get(constraint);
+
+ if (b == NULL) {
+ allBooleans.push(constraint);
+ boolMap.put(constraint, constraint);
+ constraint->updateParents();
+ if (order->graph != NULL) {
+ OrderGraph *graph = order->graph;
+ OrderNode *from = graph->lookupOrderNodeFromOrderGraph(first);
+ if (from != NULL) {
+ OrderNode *to = graph->lookupOrderNodeFromOrderGraph(second);
+ if (to != NULL) {
+ OrderEdge *edge = graph->lookupOrderEdgeFromOrderGraph(from, to);
+ OrderEdge *invedge;
+
+ if (edge != NULL && edge->mustPos) {
+ replaceBooleanWithTrueNoRemove(constraint);
+ } else if (edge != NULL && edge->mustNeg) {
+ replaceBooleanWithFalseNoRemove(constraint);
+ } else if ((invedge = graph->lookupOrderEdgeFromOrderGraph(to, from)) != NULL
+ && invedge->mustPos) {
+ replaceBooleanWithFalseNoRemove(constraint);
+ }
+ }
+ }
+ }
+ } else {
+ delete constraint;
+ constraint = b;
+ }
+
+ BooleanEdge be = BooleanEdge(constraint);
+ return negate ? be.negate() : be;
}
void CSolver::addConstraint(BooleanEdge constraint) {
-#ifdef TRACE_DEBUG
- model_println("****New Constraint******");
-#endif
- if(constraint.isNegated())
- model_print("!");
- constraint.getBoolean()->print();
if (isTrue(constraint))
return;
else if (isFalse(constraint)) {
return order;
}
+/** Computes static ordering information to allow isTrue/isFalse
+ queries on newly created orders to work. */
+
+void CSolver::inferFixedOrder(Order *order) {
+ if (order->graph != NULL) {
+ delete order->graph;
+ }
+ order->graph = buildMustOrderGraph(order);
+ reachMustAnalysis(this, order->graph, true);
+}
+
+void CSolver::inferFixedOrders() {
+ SetIteratorOrder *orderit = activeOrders.iterator();
+ while (orderit->hasNext()) {
+ Order *order = orderit->next();
+ inferFixedOrder(order);
+ }
+}
+
+#define NANOSEC 1000000000.0
int CSolver::solve() {
+ long long starttime = getTimeNano();
bool deleteTuner = false;
if (tuner == NULL) {
tuner = new DefaultTuner();
deleteTuner = true;
}
- long long startTime = getTimeNano();
- computePolarities(this);
+ {
+ SetIteratorOrder *orderit = activeOrders.iterator();
+ while (orderit->hasNext()) {
+ Order *order = orderit->next();
+ if (order->graph != NULL) {
+ delete order->graph;
+ order->graph = NULL;
+ }
+ }
+ delete orderit;
+ }
+ computePolarities(this);
+ long long time2 = getTimeNano();
+ model_print("Polarity time: %f\n", (time2 - starttime) / NANOSEC);
Preprocess pp(this);
pp.doTransform();
+ long long time3 = getTimeNano();
+ model_print("Preprocess time: %f\n", (time3 - time2) / NANOSEC);
DecomposeOrderTransform dot(this);
dot.doTransform();
+ long long time4 = getTimeNano();
+ model_print("Decompose Order: %f\n", (time4 - time3) / NANOSEC);
IntegerEncodingTransform iet(this);
iet.doTransform();
+ ElementOpt eop(this);
+ eop.doTransform();
+
EncodingGraph eg(this);
eg.buildGraph();
eg.encode();
-// printConstraints();
+
naiveEncodingDecision(this);
+ long long time5 = getTimeNano();
+ model_print("Encoding Graph Time: %f\n", (time5 - time4) / NANOSEC);
+
+ long long startTime = getTimeNano();
satEncoder->encodeAllSATEncoder(this);
+ long long endTime = getTimeNano();
+
+ elapsedTime = endTime - startTime;
+ model_print("Elapse Encode time: %f\n", elapsedTime / NANOSEC);
+
model_print("Is problem UNSAT after encoding: %d\n", unsat);
int result = unsat ? IS_UNSAT : satEncoder->solve();
- model_print("Result Computed in CSolver: %d\n", result);
- long long finishTime = getTimeNano();
- elapsedTime = finishTime - startTime;
+ model_print("Result Computed in SAT solver: %d\n", result);
+
if (deleteTuner) {
delete tuner;
tuner = NULL;
model_print("\n");
}
delete it;
+}
+void CSolver::printConstraint(BooleanEdge b) {
+ if (b.isNegated())
+ model_print("!");
+ b->print();
+ model_print("\n");
}
uint64_t CSolver::getElementValue(Element *element) {
autotuner->tune();
delete autotuner;
}
+
+//Set* CSolver::addItemsToRange(Element* element, uint num, ...){
+// va_list args;
+// va_start(args, num);
+// element->getRange()
+// uint setSize = set->getSize();
+// uint newSize = setSize+ num;
+// uint64_t members[newSize];
+// for(uint i=0; i<setSize; i++){
+// members[i] = set->getElement(i);
+// }
+// for( uint i=0; i< num; i++){
+// uint64_t arg = va_arg(args, uint64_t);
+// members[setSize+i] = arg;
+// }
+// va_end(args);
+// return createSet(set->getType(), members, newSize);
+//}
projects / satune.git / blobdiff