+ void infer_predicates(FuncInst * next_inst, ModelAction * next_act, HashTable<void *, ModelAction *, uintptr_t, 0> * loc_act_map, SnapVector<struct half_pred_expr *> * half_pred_expressions);
+ void generate_predicates(Predicate ** curr_pred, FuncInst * next_inst, SnapVector<struct half_pred_expr *> * half_pred_expressions);
+ bool amend_predicate_expr(Predicate ** curr_pred, FuncInst * next_inst, ModelAction * next_act);
+
+ /* Store action_lists when calls to update_tree are deferred */
+ SnapList<action_list_t *> * action_list_buffer;
+
+ /* Set of locations read by this FuncNode */
+ loc_set_t * read_locations;
+
+ /* Set of locations written to by this FuncNode */
+ loc_set_t * write_locations;
+
+ /* Keeps track of locations that have the same values written to */
+ HashTable<uint64_t, loc_set_t *, uint64_t, 0, snapshot_malloc, snapshot_calloc, snapshot_free, int64_hash> * val_loc_map;
+
+ /* Keeps track of locations that may share the same value as key, deduced from val_loc_map */
+ HashTable<void *, loc_set_t *, uintptr_t, 0> * loc_may_equal_map;
+
+ // value_set_t * values_may_read_from;
+
+ /* Run-time position in the predicate tree for each thread */
+ ModelVector<Predicate *> predicate_tree_position;
+
+ /* Store the relation between this FuncNode and other FuncNodes */
+ HashTable<FuncNode *, edge_type_t, uintptr_t, 0, model_malloc, model_calloc, model_free> edge_table;
+
+ /* FuncNodes that follow this node */
+ ModelList<FuncNode *> out_edges;