test: add the new for_init_search required functions in test/*/config.ml

test/coloring/config.ml

@@ -13,3 +13,4 @@ let potential = Some clash_number
 (* let potential = None *)
 let legitimate = None
 let fault = None 
+let for_init_search = None

test/dijkstra-ring/ring.dot

 digraph ring7 {
  graph [k=3]  
 
- root [algo="root.ml" init="{root=1;v=0}" ]
- p2   [algo="p.ml" init="{root=0;v=0}" ]
- p3   [algo="p.ml" init="{root=0;v=0}" ]
- p4   [algo="p.ml" init="{root=0;v=0}" ]
- p5   [algo="p.ml" init="{root=0;v=0}" ]
- p6   [algo="p.ml" init="{root=0;v=0}" ]
- p7   [algo="p.ml" init="{root=0;v=0}" ]
- p8   [algo="p.ml" init="{root=0;v=0}" ]
+ root [algo="root.ml" init="{root=1;c=1}" ]
+ p2   [algo="p.ml" init="{root=0;c=3}" ]
+ p3   [algo="p.ml" init="{root=0;c=3}" ]
+ p4   [algo="p.ml" init="{root=0;c=2}" ]
+ p5   [algo="p.ml" init="{root=0;c=2}" ]
+ p6   [algo="p.ml" init="{root=0;c=1}" ]
+ p7   [algo="p.ml" init="{root=0;c=1}" ]
+ p8   [algo="p.ml" init="{root=0;c=0}" ]
 
  root -> p2 -> p3 -> p4 -> p5 -> p6 -> p7 -> p8 -> root 
 }

test/dijkstra-ring/state.ml

 
-
-type t = { root: bool ; v : int } (* semi-anonymous network: we know who is the root! *)
+(* semi-anonymous network: each node knows if its neighbors is the root! *)
+type t = { root: bool ; v : int } 
 let to_string s = Printf.sprintf "c=%i" s.v
 let first = ref true
 let (of_string: (string -> t) option) =
     Some (fun s ->
-        try (* if the root node is not explicitly set in the dot file, we
-               consider the first one to be the root *)
-          Scanf.sscanf s "{root=%d;v=%d}" (fun i1 i2 -> { root = i1<>0; v = i2 } )
+      let res =
+        try Scanf.sscanf s "{root=%d;c=%d}" (fun i1 i2 -> { root = i1<>0; v = i2 } )
         with
-          _  ->
-          try
+          e1  ->
+          try (* if the root node is not explicitly set in the dot file, we
+                 consider the first one to be the root *)
             let res = Scanf.sscanf s "c=%d" (fun i -> { root = !first; v = i } ) in
             first := false;
             res
           with
-            _  ->
-              Printf.printf "state.m: Unable to parse the initial state in the .dot: '%s'\n%!" s;
+            e2  ->
+              Printf.printf
+                "state.ml: can't parse the initial state in the .dot: '%s'\n%s\n%s\n%!" s
+                (Printexc.to_string e1) (Printexc.to_string_default e2) ;
               assert false
+      in
+      (* Printf.printf "state.ml: { root = %b ; c = %d }\n%!" res.root res.v; *)
+      res
+    
     )
     
 let copy x = x

test/k-clustering/config.ml

@@ -42,3 +42,4 @@ let potential = Some pf
 
 let legitimate = None (* None => only silent configuration are legitimate *)
 let fault = None (* None => the simulation stop once a legitimate configuration is reached *)
+let for_init_search = None

test/rsp-tree/config.ml

@@ -6,3 +6,4 @@
 let potential = None (* None => only -sd, -cd, -lcd, -dd, or -custd are possible *)
 let legitimate = None (* None => only silent configuration are legitimate *)
 let fault = None (* None => the simulation stop once a legitimate configuration is reached *)
+let for_init_search = None

test/st-KK06-algo1/config.ml

@@ -6,3 +6,4 @@
 let potential = None (* None => only -sd, -cd, -lcd, -dd, or -custd are possible *)
 let legitimate = None (* None => only silent configuration are legitimate *)
 let fault = None (* None => the simulation stop once a legitimate configuration is reached *)
+let for_init_search = None

test/toy-example-a5sf/config.ml

@@ -39,3 +39,4 @@ let potential = Some pf
 
 let legitimate = None (* None => only silent configuration are legitimate *)
 let fault = None (* None => the simulation stop once a legitimate configuration is reached *)
+let for_init_search = None

test/toy-example-sum/config.ml

@@ -52,3 +52,4 @@ let potential_combined: State.t Algo.potential_fun =
 let potential = Some potential_combined
 let legitimate = None (* None => only silent configuration are legitimate *)
 let fault = None (* None => the simulation stop once a legitimate configuration is reached *)
+let for_init_search = None