Experiments with SAT-based simulation.

src/sat/satoko/satoko.h

@@ -76,6 +76,7 @@ struct satoko_stats {
 
     long n_decisions;
     long n_propagations;
+    long n_propagations_all;
     long n_inspects;
     long n_conflicts;
     long n_conflicts_all;

src/sat/satoko/solver.c

@@ -620,6 +620,7 @@ unsigned solver_propagate(solver_t *s)
         watch_list_shrink(ws, j - watch_list_array(ws));
     }
     s->stats.n_propagations += n_propagations;
+    s->stats.n_propagations_all += n_propagations;
     s->n_props_simplify -= n_propagations;
     return conf_cref;
 }

src/sat/satoko/solver_api.c

@@ -45,9 +45,11 @@ static inline int clause_is_satisfied(solver_t *s, struct clause *clause)
 
 static inline void solver_clean_stats(solver_t *s)
 {
-    int n_conflicts_all = s->stats.n_conflicts_all;
+    long n_conflicts_all = s->stats.n_conflicts_all;
+    long n_propagations_all = s->stats.n_propagations_all;
     memset(&(s->stats), 0, sizeof(struct satoko_stats));
     s->stats.n_conflicts_all = n_conflicts_all;
+    s->stats.n_propagations_all = n_propagations_all;
 }
 
 static inline void print_opts(solver_t *s)