+ ASSERT(child->get_func_inst() == inst);
+
+ return child;
+}
+
+/* Evaluate predicate expressions against the given inst_act_map */
+ConcretePredicate * Predicate::evaluate(inst_act_map_t * inst_act_map, thread_id_t tid)
+{
+ ConcretePredicate * concrete = new ConcretePredicate(tid);
+ PredExprSetIter * it = pred_expressions.iterator();
+
+ while (it->hasNext()) {
+ struct pred_expr * ptr = it->next();
+ uint64_t value = 0;
+
+ switch(ptr->token) {
+ case NOPREDICATE:
+ break;
+ case EQUALITY:
+ FuncInst * to_be_compared;
+ ModelAction * last_act;
+
+ to_be_compared = ptr->func_inst;
+ last_act = inst_act_map->get(to_be_compared);
+ value = last_act->get_reads_from_value();
+ break;
+ case NULLITY:
+ break;
+ default:
+ break;
+ }
+
+ concrete->add_expression(ptr->token, value, ptr->value);
+ }
+
+ return concrete;
+}
+
+void Predicate::print_predicate()
+{
+ model_print("\"%p\" [shape=box, label=\"", this);
+ if (entry_predicate) {
+ model_print("entry node\"];\n");
+ return;
+ }
+
+ if (exit_predicate) {
+ model_print("exit node\"];\n");
+ return;
+ }
+
+ model_print("depth: %u; weight: %g\n", depth, weight);
+
+ func_inst->print();
+
+ if (pred_expressions.getSize() == 0)
+ model_print("predicate unset\n");
+
+ PredExprSetIter * it = pred_expressions.iterator();
+ while (it->hasNext()) {
+ struct pred_expr * expr = it->next();
+ FuncInst * inst = expr->func_inst;
+ switch (expr->token) {
+ case NOPREDICATE:
+ break;
+ case EQUALITY:
+ model_print("predicate token: equality, position: %s, value: %d\n", inst->get_position(), expr->value);
+ break;
+ case NULLITY:
+ model_print("predicate token: nullity, value: %d\n", expr->value);
+ break;
+ default:
+ model_print("unknown predicate token\n");
+ break;
+ }
+ }
+
+ if (does_write) {
+ model_print("Does write\n");
+ }
+
+ double prob = (double) store_visible_count / total_checking_count;
+ model_print("Total checks: %d, visible count: %d; prob: %f\n", total_checking_count, store_visible_count, prob);
+ model_print("Exploration count: %d", exploration_count);
+ model_print("\"];\n");
+}
+
+void Predicate::print_pred_subtree()
+{
+ print_predicate();
+ for (uint i = 0;i < children.size();i++) {
+ Predicate * child = children[i];
+ child->print_pred_subtree();
+ model_print("\"%p\" -> \"%p\"\n", this, child);
+ }
+
+ PredSetIter * it = backedges.iterator();
+ while (it->hasNext()) {
+ Predicate * backedge = it->next();
+ model_print("\"%p\" -> \"%p\"[style=dashed, color=grey]\n", this, backedge);
+ }
+
+ if (exit) {
+ model_print("\"%p\" -> \"%p\"[style=dashed, color=red]\n", this, exit);
+ }