+ void update_tree(action_list_t * act_list);
+ void update_inst_tree(func_inst_list_t * inst_list);
+ void update_predicate_tree(action_list_t * act_list);
+ bool follow_branch(Predicate ** curr_pred, FuncInst * next_inst, ModelAction * next_act, SnapVector<Predicate *> * unset_predicates);
+
+ void incr_exit_count() { exit_count++; }
+ uint32_t get_exit_count() { return exit_count; }
+
+ SnapList<action_list_t *> * get_action_list_buffer() { return action_list_buffer; }
+
+ void add_to_val_loc_map(uint64_t val, void * loc);
+ void add_to_val_loc_map(value_set_t * values, void * loc);
+ void update_loc_may_equal_map(void * new_loc, loc_set_t * old_locations);
+
+ void init_predicate_tree_position(thread_id_t tid);
+ void set_predicate_tree_position(thread_id_t tid, Predicate * pred);
+ Predicate * get_predicate_tree_position(thread_id_t tid);
+
+ void init_inst_act_map(thread_id_t tid);
+ void reset_inst_act_map(thread_id_t tid);
+ void update_inst_act_map(thread_id_t tid, ModelAction * read_act);
+ inst_act_map_t * get_inst_act_map(thread_id_t tid);
+
+ void add_out_edge(FuncNode * other);
+ ModelList<FuncNode *> * get_out_edges() { return &out_edges; }
+ int compute_distance(FuncNode * target, int max_step = MAX_DIST);
+
+ void print_predicate_tree();
+ void print_val_loc_map();
+ void print_last_read(thread_id_t tid);