Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r195-tall-174889278300097.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is SafeBus-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r195-tall-174889278300097
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 15K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 203K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 166K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 791K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 303K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SafeBus-PT-06-UpperBounds-00
FORMULA_NAME SafeBus-PT-06-UpperBounds-01
FORMULA_NAME SafeBus-PT-06-UpperBounds-02
FORMULA_NAME SafeBus-PT-06-UpperBounds-03
FORMULA_NAME SafeBus-PT-06-UpperBounds-04
FORMULA_NAME SafeBus-PT-06-UpperBounds-05
FORMULA_NAME SafeBus-PT-06-UpperBounds-06
FORMULA_NAME SafeBus-PT-06-UpperBounds-07
FORMULA_NAME SafeBus-PT-06-UpperBounds-08
FORMULA_NAME SafeBus-PT-06-UpperBounds-09
FORMULA_NAME SafeBus-PT-06-UpperBounds-10
FORMULA_NAME SafeBus-PT-06-UpperBounds-11
FORMULA_NAME SafeBus-PT-06-UpperBounds-12
FORMULA_NAME SafeBus-PT-06-UpperBounds-13
FORMULA_NAME SafeBus-PT-06-UpperBounds-14
FORMULA_NAME SafeBus-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748952949207

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-03 12:15:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 12:15:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 12:15:50] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2025-06-03 12:15:50] [INFO ] Transformed 144 places.
[2025-06-03 12:15:50] [INFO ] Transformed 451 transitions.
[2025-06-03 12:15:50] [INFO ] Found NUPN structural information;
[2025-06-03 12:15:50] [INFO ] Parsed PT model containing 144 places and 451 transitions and 2968 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 6 places and 0 transitions.
FORMULA SafeBus-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0] Max Struct:[6, 6, 6, 1, 6, 36, 6, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA SafeBus-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 6, 6, 1, 6, 36, 6, 1, 1, 1, 1, 1]
[2025-06-03 12:15:50] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2025-06-03 12:15:50] [INFO ] Computed 29 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 6, 6, 1, 6, 36, 6, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 77 ms. (128 steps per ms)
FORMULA SafeBus-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60003 steps (12 resets) in 162 ms. (368 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 5, 1, 5, 6, 1] Max Struct:[6, 6, 6, 6, 36, 6]
[2025-06-03 12:15:50] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2025-06-03 12:15:50] [INFO ] Invariant cache hit.
[2025-06-03 12:15:51] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned unsat
[2025-06-03 12:15:51] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-06-03 12:15:51] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-03 12:15:51] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-06-03 12:15:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:15:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-06-03 12:15:51] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-03 12:15:51] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2025-06-03 12:15:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 12:15:51] [INFO ] [Nat]Added 43 Read/Feed constraints in 62 ms returned sat
[2025-06-03 12:15:51] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 32 ms.
[2025-06-03 12:15:51] [INFO ] Added : 2 causal constraints over 1 iterations in 152 ms. Result :sat
Minimization took 133 ms.
[2025-06-03 12:15:51] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned unsat
[2025-06-03 12:15:51] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-06-03 12:15:51] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-03 12:15:52] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2025-06-03 12:15:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:15:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-06-03 12:15:52] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 12:15:52] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2025-06-03 12:15:52] [INFO ] [Nat]Added 43 Read/Feed constraints in 41 ms returned sat
[2025-06-03 12:15:52] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 26 ms.
[2025-06-03 12:15:52] [INFO ] Added : 1 causal constraints over 1 iterations in 65 ms. Result :sat
Minimization took 115 ms.
[2025-06-03 12:15:52] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-06-03 12:15:52] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 3 ms returned unsat
[2025-06-03 12:15:52] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-06-03 12:15:52] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 5, 1, 5, 6, 1] Max Struct:[1, 6, 1, 6, 6, 1]
FORMULA SafeBus-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 48 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 138/138 places, 451/451 transitions.
[2025-06-03 12:15:52] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2025-06-03 12:15:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (2 resets) in 2323 ms. (430 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1667 ms. (1199 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5] Max Struct:[6, 6]
[2025-06-03 12:15:56] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2025-06-03 12:15:56] [INFO ] Invariant cache hit.
[2025-06-03 12:15:56] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-06-03 12:15:56] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 12:15:56] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2025-06-03 12:15:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:15:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-06-03 12:15:56] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 12:15:56] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2025-06-03 12:15:56] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 12:15:56] [INFO ] [Nat]Added 43 Read/Feed constraints in 56 ms returned sat
[2025-06-03 12:15:57] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 24 ms.
[2025-06-03 12:15:57] [INFO ] Added : 2 causal constraints over 1 iterations in 62 ms. Result :sat
Minimization took 107 ms.
[2025-06-03 12:15:57] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-03 12:15:57] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 12:15:57] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-06-03 12:15:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:15:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-06-03 12:15:57] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-03 12:15:57] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2025-06-03 12:15:57] [INFO ] [Nat]Added 43 Read/Feed constraints in 38 ms returned sat
[2025-06-03 12:15:57] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 26 ms.
[2025-06-03 12:15:57] [INFO ] Added : 1 causal constraints over 1 iterations in 60 ms. Result :sat
Minimization took 100 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 17 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 138/138 places, 451/451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 18 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2025-06-03 12:15:57] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2025-06-03 12:15:57] [INFO ] Invariant cache hit.
[2025-06-03 12:15:58] [INFO ] Implicit Places using invariants in 326 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 337 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 132/138 places, 451/451 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 565
Applied a total of 12 rules in 52 ms. Remains 126 /132 variables (removed 6) and now considering 565/451 (removed -114) transitions.
[2025-06-03 12:15:58] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
// Phase 1: matrix 356 rows 126 cols
[2025-06-03 12:15:58] [INFO ] Computed 23 invariants in 6 ms
[2025-06-03 12:15:58] [INFO ] Implicit Places using invariants in 245 ms returned []
[2025-06-03 12:15:58] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2025-06-03 12:15:58] [INFO ] Invariant cache hit.
[2025-06-03 12:15:58] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 12:15:58] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 126/138 places, 565/451 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1128 ms. Remains : 126/138 places, 565/451 transitions.
[2025-06-03 12:15:58] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2025-06-03 12:15:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (2 resets) in 3070 ms. (325 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 1978 ms. (1010 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5] Max Struct:[6, 6]
[2025-06-03 12:16:03] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2025-06-03 12:16:03] [INFO ] Invariant cache hit.
[2025-06-03 12:16:03] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-03 12:16:03] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 12:16:03] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2025-06-03 12:16:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:16:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-03 12:16:04] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 12:16:04] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-06-03 12:16:04] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 12:16:04] [INFO ] [Nat]Added 43 Read/Feed constraints in 78 ms returned sat
[2025-06-03 12:16:04] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 51 ms.
[2025-06-03 12:16:04] [INFO ] Added : 7 causal constraints over 2 iterations in 112 ms. Result :sat
Minimization took 582 ms.
[2025-06-03 12:16:04] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-03 12:16:04] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 12:16:05] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-06-03 12:16:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:16:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-03 12:16:05] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 12:16:05] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-06-03 12:16:05] [INFO ] [Nat]Added 43 Read/Feed constraints in 110 ms returned sat
[2025-06-03 12:16:05] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 43 ms.
[2025-06-03 12:16:05] [INFO ] Added : 0 causal constraints over 0 iterations in 68 ms. Result :sat
Minimization took 652 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 565/565 transitions.
Applied a total of 0 rules in 25 ms. Remains 126 /126 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 126/126 places, 565/565 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 565/565 transitions.
Applied a total of 0 rules in 22 ms. Remains 126 /126 variables (removed 0) and now considering 565/565 (removed 0) transitions.
[2025-06-03 12:16:06] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2025-06-03 12:16:06] [INFO ] Invariant cache hit.
[2025-06-03 12:16:06] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-06-03 12:16:06] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2025-06-03 12:16:06] [INFO ] Invariant cache hit.
[2025-06-03 12:16:06] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 12:16:06] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
[2025-06-03 12:16:06] [INFO ] Redundant transitions in 36 ms returned []
Running 559 sub problems to find dead transitions.
[2025-06-03 12:16:07] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2025-06-03 12:16:07] [INFO ] Invariant cache hit.
[2025-06-03 12:16:07] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 559 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2025-06-03 12:16:10] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 8 ms to minimize.
[2025-06-03 12:16:10] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2025-06-03 12:16:11] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2025-06-03 12:16:11] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2025-06-03 12:16:11] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2025-06-03 12:16:11] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2025-06-03 12:16:11] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2025-06-03 12:16:12] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2025-06-03 12:16:12] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2025-06-03 12:16:12] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2025-06-03 12:16:12] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2025-06-03 12:16:12] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2025-06-03 12:16:12] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2025-06-03 12:16:12] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2025-06-03 12:16:12] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 15/164 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2025-06-03 12:16:15] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 1 ms to minimize.
[2025-06-03 12:16:16] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2025-06-03 12:16:16] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 1 ms to minimize.
[2025-06-03 12:16:16] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2025-06-03 12:16:16] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
[2025-06-03 12:16:16] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 6/170 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2025-06-03 12:16:18] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2025-06-03 12:16:18] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2025-06-03 12:16:18] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2025-06-03 12:16:19] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2025-06-03 12:16:19] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2025-06-03 12:16:19] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2025-06-03 12:16:19] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2025-06-03 12:16:19] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 8/178 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2025-06-03 12:16:21] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2025-06-03 12:16:21] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2025-06-03 12:16:21] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 3/181 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/181 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 8 (OVERLAPS) 356/482 variables, 126/307 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 43/350 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/350 constraints. Problems are: Problem set: 36 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 350 constraints, problems are : Problem set: 36 solved, 523 unsolved in 30035 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 36 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 32/181 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2025-06-03 12:16:42] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/182 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/182 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/308 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/351 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/874 constraints. Problems are: Problem set: 36 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 874 constraints, problems are : Problem set: 36 solved, 523 unsolved in 30019 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/559 constraints, Known Traps: 33/33 constraints]
After SMT, in 61670ms problems are : Problem set: 36 solved, 523 unsolved
Search for dead transitions found 36 dead transitions in 61687ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 126/126 places, 529/565 transitions.
Applied a total of 0 rules in 19 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2025-06-03 12:17:08] [INFO ] Redundant transitions in 9 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62551 ms. Remains : 126/126 places, 529/565 transitions.
[2025-06-03 12:17:08] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2025-06-03 12:17:08] [INFO ] Computed 23 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (2 resets) in 2983 ms. (335 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1961 ms. (1019 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5] Max Struct:[6, 6]
[2025-06-03 12:17:13] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:17:13] [INFO ] Invariant cache hit.
[2025-06-03 12:17:13] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-03 12:17:13] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 12:17:13] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-06-03 12:17:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:17:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-03 12:17:13] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 10 ms returned sat
[2025-06-03 12:17:13] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-06-03 12:17:13] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 12:17:14] [INFO ] [Nat]Added 43 Read/Feed constraints in 98 ms returned sat
[2025-06-03 12:17:14] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 31 ms.
[2025-06-03 12:17:14] [INFO ] Added : 6 causal constraints over 2 iterations in 91 ms. Result :sat
Minimization took 391 ms.
[2025-06-03 12:17:14] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-03 12:17:14] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 12:17:14] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-06-03 12:17:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:17:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-03 12:17:14] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 12:17:14] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-06-03 12:17:14] [INFO ] [Nat]Added 43 Read/Feed constraints in 58 ms returned sat
[2025-06-03 12:17:14] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 35 ms.
[2025-06-03 12:17:14] [INFO ] Added : 1 causal constraints over 1 iterations in 74 ms. Result :sat
Minimization took 372 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 18 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 19 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2025-06-03 12:17:15] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:17:15] [INFO ] Invariant cache hit.
[2025-06-03 12:17:15] [INFO ] Implicit Places using invariants in 250 ms returned []
[2025-06-03 12:17:15] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:17:15] [INFO ] Invariant cache hit.
[2025-06-03 12:17:15] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 12:17:16] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
[2025-06-03 12:17:16] [INFO ] Redundant transitions in 3 ms returned []
Running 523 sub problems to find dead transitions.
[2025-06-03 12:17:16] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:17:16] [INFO ] Invariant cache hit.
[2025-06-03 12:17:16] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2025-06-03 12:17:19] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2025-06-03 12:17:19] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 3 ms to minimize.
[2025-06-03 12:17:19] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 3 ms to minimize.
[2025-06-03 12:17:20] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 1 ms to minimize.
[2025-06-03 12:17:20] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2025-06-03 12:17:20] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2025-06-03 12:17:20] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2025-06-03 12:17:20] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2025-06-03 12:17:20] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2025-06-03 12:17:20] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2025-06-03 12:17:21] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2025-06-03 12:17:21] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2025-06-03 12:17:21] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
[2025-06-03 12:17:21] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2025-06-03 12:17:21] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 15/164 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2025-06-03 12:17:24] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 1 ms to minimize.
[2025-06-03 12:17:24] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2025-06-03 12:17:24] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2025-06-03 12:17:24] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2025-06-03 12:17:24] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2025-06-03 12:17:25] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2025-06-03 12:17:25] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2025-06-03 12:17:25] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2025-06-03 12:17:25] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 3 ms to minimize.
[2025-06-03 12:17:25] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2025-06-03 12:17:25] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 11/175 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2025-06-03 12:17:27] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2025-06-03 12:17:29] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (OVERLAPS) 356/482 variables, 126/303 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 43/346 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 346 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30024 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 28/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2025-06-03 12:17:51] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2025-06-03 12:17:51] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2025-06-03 12:17:51] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2025-06-03 12:17:51] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2025-06-03 12:17:52] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/308 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/351 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/874 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 874 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30021 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 33/33 constraints]
After SMT, in 61188ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 61196ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62036 ms. Remains : 126/126 places, 529/529 transitions.
RANDOM walk for 40000 steps (8 resets) in 1190 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
[2025-06-03 12:18:18] [INFO ] Flatten gal took : 173 ms
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
[2025-06-03 12:18:18] [INFO ] Flatten gal took : 87 ms
[2025-06-03 12:18:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14386902394982920410.gal : 22 ms
[2025-06-03 12:18:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6269447143647027583.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14386902394982920410.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6269447143647027583.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6269447143647027583.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 16
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :16 after 58
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :58 after 196
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :196 after 423
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :423 after 528
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :528 after 2085
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2085 after 3787
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :3787 after 9257
Interrupted probabilistic random walk after 342682 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 4
Probabilistic random walk after 342682 steps, saw 154166 distinct states, run finished after 3004 ms. (steps per millisecond=114 ) properties seen :0
[2025-06-03 12:18:21] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:18:21] [INFO ] Invariant cache hit.
[2025-06-03 12:18:21] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 65/77 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 65/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 40/117 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 40/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/119 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 5/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 355/479 variables, 124/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 42/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/482 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/482 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 318 constraints, problems are : Problem set: 0 solved, 4 unsolved in 448 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 65/77 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 65/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 40/117 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 40/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/119 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 5/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 355/479 variables, 124/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 42/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX1 is UNSAT
Problem MIN1 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 4/316 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :9257 after 96224
[2025-06-03 12:18:21] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2025-06-03 12:18:22] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2025-06-03 12:18:22] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2025-06-03 12:18:22] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2025-06-03 12:18:22] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2025-06-03 12:18:22] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2025-06-03 12:18:22] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2025-06-03 12:18:22] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2025-06-03 12:18:22] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2025-06-03 12:18:22] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 10/326 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 0/326 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 3/482 variables, 2/328 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 2/330 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 1/331 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 1/332 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/482 variables, 0/332 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/482 variables, 0/332 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 332 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1430 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 1892ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 117 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 18 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 126/126 places, 529/529 transitions.
RANDOM walk for 40000 steps (8 resets) in 399 ms. (100 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :96224 after 105501
Interrupted probabilistic random walk after 509158 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :0 out of 2
Probabilistic random walk after 509158 steps, saw 223954 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
[2025-06-03 12:18:26] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:18:26] [INFO ] Invariant cache hit.
[2025-06-03 12:18:26] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 70/76 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 41/117 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 41/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/119 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 355/479 variables, 124/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 42/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/482 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/482 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 318 constraints, problems are : Problem set: 0 solved, 2 unsolved in 300 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 70/76 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 41/117 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 41/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/119 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 355/479 variables, 124/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 42/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 3/482 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/482 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 320 constraints, problems are : Problem set: 0 solved, 2 unsolved in 310 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 622ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 110 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 18 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 17 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2025-06-03 12:18:27] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:18:27] [INFO ] Invariant cache hit.
[2025-06-03 12:18:27] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-06-03 12:18:27] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:18:27] [INFO ] Invariant cache hit.
[2025-06-03 12:18:27] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 12:18:27] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2025-06-03 12:18:27] [INFO ] Redundant transitions in 4 ms returned []
Running 523 sub problems to find dead transitions.
[2025-06-03 12:18:27] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:18:27] [INFO ] Invariant cache hit.
[2025-06-03 12:18:27] [INFO ] State equation strengthened by 43 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :105501 after 130482
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2025-06-03 12:18:30] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2025-06-03 12:18:30] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2025-06-03 12:18:30] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2025-06-03 12:18:31] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2025-06-03 12:18:31] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 1 ms to minimize.
[2025-06-03 12:18:31] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2025-06-03 12:18:32] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2025-06-03 12:18:32] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2025-06-03 12:18:32] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2025-06-03 12:18:32] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2025-06-03 12:18:32] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2025-06-03 12:18:32] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 0 ms to minimize.
[2025-06-03 12:18:32] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
[2025-06-03 12:18:32] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 1 ms to minimize.
[2025-06-03 12:18:32] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 15/164 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2025-06-03 12:18:35] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2025-06-03 12:18:36] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2025-06-03 12:18:36] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2025-06-03 12:18:36] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2025-06-03 12:18:36] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2025-06-03 12:18:36] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2025-06-03 12:18:36] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2025-06-03 12:18:36] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2025-06-03 12:18:36] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2025-06-03 12:18:36] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2025-06-03 12:18:36] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 11/175 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2025-06-03 12:18:38] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :130482 after 193861
[2025-06-03 12:18:40] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (OVERLAPS) 356/482 variables, 126/303 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,4 properties remain. new max is 131072
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 43/346 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD size :193861 after 571845
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 346 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30024 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 28/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2025-06-03 12:19:03] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2025-06-03 12:19:03] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2025-06-03 12:19:03] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2025-06-03 12:19:03] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2025-06-03 12:19:04] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Detected timeout of ITS tools.
[2025-06-03 12:19:08] [INFO ] Flatten gal took : 41 ms
[2025-06-03 12:19:08] [INFO ] Applying decomposition
[2025-06-03 12:19:08] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11834727493739087045.txt' '-o' '/tmp/graph11834727493739087045.bin' '-w' '/tmp/graph11834727493739087045.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11834727493739087045.bin' '-l' '-1' '-v' '-w' '/tmp/graph11834727493739087045.weights' '-q' '0' '-e' '0.001'
[2025-06-03 12:19:08] [INFO ] Decomposing Gal with order
[2025-06-03 12:19:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 12:19:08] [INFO ] Removed a total of 77 redundant transitions.
[2025-06-03 12:19:08] [INFO ] Flatten gal took : 95 ms
[2025-06-03 12:19:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 6 ms.
[2025-06-03 12:19:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13630079613810472951.gal : 7 ms
[2025-06-03 12:19:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3560084822889353816.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13630079613810472951.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3560084822889353816.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3560084822889353816.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :14 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 24
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :24 after 37
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :37 after 51
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :51 after 95
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :95 after 1304
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1304 after 2342
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2342 after 2963
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2963 after 22949
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :100573 after 112729
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/308 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :112729 after 133015
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/351 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :405407 after 478979
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/874 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 874 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30020 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 33/33 constraints]
After SMT, in 61091ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 61096ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61861 ms. Remains : 126/126 places, 529/529 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 126 transition count 356
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 197 place count 102 transition count 332
Iterating global reduction 1 with 24 rules applied. Total rules applied 221 place count 102 transition count 332
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 224 place count 100 transition count 331
Graph (trivial) has 19 edges and 100 vertex of which 8 / 100 are part of one of the 1 SCC in 1 ms
Free SCC test removed 7 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 225 place count 93 transition count 331
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 163 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 388 place count 93 transition count 168
Applied a total of 388 rules in 26 ms. Remains 93 /126 variables (removed 33) and now considering 168/529 (removed 361) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 168 rows 93 cols
[2025-06-03 12:19:28] [INFO ] Computed 22 invariants in 1 ms
[2025-06-03 12:19:29] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-03 12:19:29] [INFO ] [Real]Absence check using 9 positive and 13 generalized place invariants in 3 ms returned sat
[2025-06-03 12:19:29] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-06-03 12:19:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-03 12:19:29] [INFO ] [Nat]Absence check using 9 positive and 13 generalized place invariants in 3 ms returned sat
[2025-06-03 12:19:29] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-03 12:19:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 12:19:29] [INFO ] After 24ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-03 12:19:29] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-03 12:19:29] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-03 12:19:29] [INFO ] Flatten gal took : 13 ms
[2025-06-03 12:19:29] [INFO ] Flatten gal took : 9 ms
[2025-06-03 12:19:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5047955127452185632.gal : 3 ms
[2025-06-03 12:19:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9303837517668658604.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5047955127452185632.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9303837517668658604.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9303837517668658604.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 24
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :24 after 47
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :47 after 86
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :86 after 535
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :535 after 715
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :715 after 1805
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1805 after 3619
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3619 after 9462
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :9462 after 10473
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :10473 after 17390
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :17390 after 73525
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :478979 after 2.16731e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,323274,8.66001,209596,2,68803,19,632594,6,0,543,529064,0
Total reachable state count : 323274

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,8.72183,209596,2,94,19,632594,7,0,574,529064,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,8.80028,209596,2,94,19,632594,8,0,604,529064,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 9125 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA SafeBus-PT-06-UpperBounds-05 5 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[5] Max Struct:[6]
Starting property specific reduction for SafeBus-PT-06-UpperBounds-02
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
[2025-06-03 12:19:38] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2025-06-03 12:19:38] [INFO ] Computed 23 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2 resets) in 33 ms. (294 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[6]
[2025-06-03 12:19:38] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:19:38] [INFO ] Invariant cache hit.
[2025-06-03 12:19:38] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-03 12:19:38] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 12:19:38] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2025-06-03 12:19:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:19:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-03 12:19:38] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 12:19:38] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2025-06-03 12:19:38] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 12:19:38] [INFO ] [Nat]Added 43 Read/Feed constraints in 96 ms returned sat
[2025-06-03 12:19:38] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 44 ms.
[2025-06-03 12:19:38] [INFO ] Added : 6 causal constraints over 2 iterations in 111 ms. Result :sat
Minimization took 408 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[6]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 16 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 126/126 places, 529/529 transitions.
[2025-06-03 12:19:39] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:19:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 2811 ms. (355 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1043 ms. (957 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[6]
[2025-06-03 12:19:43] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:19:43] [INFO ] Invariant cache hit.
[2025-06-03 12:19:43] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-03 12:19:43] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 12:19:43] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2025-06-03 12:19:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:19:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-03 12:19:43] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-03 12:19:43] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-06-03 12:19:43] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 12:19:43] [INFO ] [Nat]Added 43 Read/Feed constraints in 104 ms returned sat
[2025-06-03 12:19:43] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 23 ms.
[2025-06-03 12:19:43] [INFO ] Added : 6 causal constraints over 2 iterations in 85 ms. Result :sat
Minimization took 413 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[6]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 16 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 17 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2025-06-03 12:19:44] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:19:44] [INFO ] Invariant cache hit.
[2025-06-03 12:19:44] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-06-03 12:19:44] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:19:44] [INFO ] Invariant cache hit.
[2025-06-03 12:19:44] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 12:19:44] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
[2025-06-03 12:19:44] [INFO ] Redundant transitions in 4 ms returned []
Running 523 sub problems to find dead transitions.
[2025-06-03 12:19:44] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:19:44] [INFO ] Invariant cache hit.
[2025-06-03 12:19:44] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2025-06-03 12:19:47] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2025-06-03 12:19:47] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2025-06-03 12:19:47] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2025-06-03 12:19:48] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2025-06-03 12:19:48] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2025-06-03 12:19:48] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2025-06-03 12:19:49] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2025-06-03 12:19:49] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2025-06-03 12:19:49] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2025-06-03 12:19:49] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2025-06-03 12:19:49] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2025-06-03 12:19:49] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
[2025-06-03 12:19:49] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 1 ms to minimize.
[2025-06-03 12:19:49] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2025-06-03 12:19:49] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 15/164 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2025-06-03 12:19:52] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
[2025-06-03 12:19:53] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2025-06-03 12:19:53] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2025-06-03 12:19:53] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2025-06-03 12:19:53] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2025-06-03 12:19:53] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2025-06-03 12:19:53] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2025-06-03 12:19:53] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2025-06-03 12:19:53] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2025-06-03 12:19:53] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2025-06-03 12:19:53] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 11/175 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2025-06-03 12:19:55] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2025-06-03 12:19:58] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (OVERLAPS) 356/482 variables, 126/303 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 43/346 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 346 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30014 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 28/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2025-06-03 12:20:20] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2025-06-03 12:20:20] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2025-06-03 12:20:20] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2025-06-03 12:20:20] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2025-06-03 12:20:21] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/308 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/351 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/874 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 874 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30016 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 33/33 constraints]
After SMT, in 61168ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 61175ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61929 ms. Remains : 126/126 places, 529/529 transitions.
[2025-06-03 12:20:46] [INFO ] Flatten gal took : 63 ms
[2025-06-03 12:20:46] [INFO ] Flatten gal took : 36 ms
[2025-06-03 12:20:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16389820914627564344.gal : 5 ms
[2025-06-03 12:20:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17902646372108427397.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16389820914627564344.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17902646372108427397.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (8 resets) in 243 ms. (163 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality17902646372108427397.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 16
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :16 after 58
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :58 after 196
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :196 after 423
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :423 after 528
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :528 after 2085
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2085 after 3787
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3787 after 9257
Interrupted probabilistic random walk after 410380 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 2
Probabilistic random walk after 410380 steps, saw 182673 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
[2025-06-03 12:20:49] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:20:49] [INFO ] Invariant cache hit.
[2025-06-03 12:20:49] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 70/76 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 41/117 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 41/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/119 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 355/479 variables, 124/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 42/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/482 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/482 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 318 constraints, problems are : Problem set: 0 solved, 2 unsolved in 284 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 70/76 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 41/117 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 41/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/119 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 355/479 variables, 124/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 42/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 3/482 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/482 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 320 constraints, problems are : Problem set: 0 solved, 2 unsolved in 368 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 698ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 146 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 16 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 126/126 places, 529/529 transitions.
RANDOM walk for 40000 steps (8 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :9257 after 96224
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :96224 after 105501
Interrupted probabilistic random walk after 420823 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 2
Probabilistic random walk after 420823 steps, saw 187220 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
[2025-06-03 12:20:53] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:20:53] [INFO ] Invariant cache hit.
[2025-06-03 12:20:53] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 70/76 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 41/117 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 41/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/119 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 355/479 variables, 124/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 42/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/482 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/482 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 318 constraints, problems are : Problem set: 0 solved, 2 unsolved in 294 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 70/76 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 41/117 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 41/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/119 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 355/479 variables, 124/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 42/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 3/482 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/482 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 320 constraints, problems are : Problem set: 0 solved, 2 unsolved in 302 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 625ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 81 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 17 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 16 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2025-06-03 12:20:53] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:20:53] [INFO ] Invariant cache hit.
[2025-06-03 12:20:54] [INFO ] Implicit Places using invariants in 523 ms returned []
[2025-06-03 12:20:54] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:20:54] [INFO ] Invariant cache hit.
[2025-06-03 12:20:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 12:20:54] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
[2025-06-03 12:20:54] [INFO ] Redundant transitions in 3 ms returned []
Running 523 sub problems to find dead transitions.
[2025-06-03 12:20:54] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-03 12:20:54] [INFO ] Invariant cache hit.
[2025-06-03 12:20:54] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2025-06-03 12:20:57] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2025-06-03 12:20:57] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2025-06-03 12:20:57] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :105501 after 130482
[2025-06-03 12:20:58] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2025-06-03 12:20:58] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2025-06-03 12:20:58] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2025-06-03 12:20:59] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2025-06-03 12:20:59] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2025-06-03 12:20:59] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2025-06-03 12:20:59] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2025-06-03 12:20:59] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2025-06-03 12:20:59] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 0 ms to minimize.
[2025-06-03 12:20:59] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 0 ms to minimize.
[2025-06-03 12:20:59] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2025-06-03 12:21:00] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 15/164 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2025-06-03 12:21:03] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 1 ms to minimize.
[2025-06-03 12:21:03] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2025-06-03 12:21:03] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2025-06-03 12:21:03] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2025-06-03 12:21:03] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2025-06-03 12:21:03] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2025-06-03 12:21:03] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2025-06-03 12:21:03] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2025-06-03 12:21:03] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2025-06-03 12:21:04] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2025-06-03 12:21:04] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 11/175 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2025-06-03 12:21:06] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2025-06-03 12:21:08] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :130482 after 193861
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (OVERLAPS) 356/482 variables, 126/303 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 43/346 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :193861 after 571845
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 346 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30021 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 28/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2025-06-03 12:21:30] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2025-06-03 12:21:30] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2025-06-03 12:21:30] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2025-06-03 12:21:30] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2025-06-03 12:21:31] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Detected timeout of ITS tools.
[2025-06-03 12:21:36] [INFO ] Flatten gal took : 28 ms
[2025-06-03 12:21:36] [INFO ] Applying decomposition
[2025-06-03 12:21:36] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7613024785266678266.txt' '-o' '/tmp/graph7613024785266678266.bin' '-w' '/tmp/graph7613024785266678266.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7613024785266678266.bin' '-l' '-1' '-v' '-w' '/tmp/graph7613024785266678266.weights' '-q' '0' '-e' '0.001'
[2025-06-03 12:21:36] [INFO ] Decomposing Gal with order
[2025-06-03 12:21:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 12:21:36] [INFO ] Removed a total of 77 redundant transitions.
[2025-06-03 12:21:36] [INFO ] Flatten gal took : 42 ms
[2025-06-03 12:21:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 2 ms.
[2025-06-03 12:21:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16945915757970818127.gal : 4 ms
[2025-06-03 12:21:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10408806431813493805.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16945915757970818127.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10408806431813493805.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10408806431813493805.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :14 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 24
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :24 after 37
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :37 after 51
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :51 after 95
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :95 after 1304
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1304 after 2342
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2342 after 2963
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2963 after 22949
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :100573 after 112729
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :112729 after 133015
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/308 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/351 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :405407 after 478979
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/874 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 874 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30014 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 33/33 constraints]
After SMT, in 61240ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 61245ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62293 ms. Remains : 126/126 places, 529/529 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 126 transition count 356
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 197 place count 102 transition count 332
Iterating global reduction 1 with 24 rules applied. Total rules applied 221 place count 102 transition count 332
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 224 place count 100 transition count 331
Graph (trivial) has 19 edges and 100 vertex of which 8 / 100 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 225 place count 93 transition count 331
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 163 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 388 place count 93 transition count 168
Applied a total of 388 rules in 9 ms. Remains 93 /126 variables (removed 33) and now considering 168/529 (removed 361) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 168 rows 93 cols
[2025-06-03 12:21:56] [INFO ] Computed 22 invariants in 1 ms
[2025-06-03 12:21:56] [INFO ] [Real]Absence check using 9 positive place invariants in 51 ms returned sat
[2025-06-03 12:21:56] [INFO ] [Real]Absence check using 9 positive and 13 generalized place invariants in 4 ms returned sat
[2025-06-03 12:21:56] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-06-03 12:21:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-03 12:21:56] [INFO ] [Nat]Absence check using 9 positive and 13 generalized place invariants in 3 ms returned sat
[2025-06-03 12:21:56] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-03 12:21:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 12:21:56] [INFO ] After 14ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-03 12:21:56] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-03 12:21:56] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-03 12:21:56] [INFO ] Flatten gal took : 6 ms
[2025-06-03 12:21:56] [INFO ] Flatten gal took : 6 ms
[2025-06-03 12:21:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11125963176661998294.gal : 1 ms
[2025-06-03 12:21:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16383474675989850062.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11125963176661998294.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16383474675989850062.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16383474675989850062.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 24
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :24 after 47
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :47 after 86
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :86 after 535
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :535 after 715
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :715 after 1805
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1805 after 3619
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3619 after 9462
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :9462 after 10473
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :10473 after 17390
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :17390 after 73525
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,323274,7.79748,209540,2,68803,19,632594,6,0,543,529064,0
Total reachable state count : 323274

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,7.858,209540,2,94,19,632594,7,0,574,529064,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,7.94904,209540,2,94,19,632594,8,0,604,529064,0
Over-approximation ignoring read arcs solved 0 properties in 8396 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[6]
Ending property specific reduction for SafeBus-PT-06-UpperBounds-02 in 146485 ms.
[2025-06-03 12:22:04] [INFO ] Flatten gal took : 21 ms
[2025-06-03 12:22:04] [INFO ] Applying decomposition
[2025-06-03 12:22:04] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph943636064911444509.txt' '-o' '/tmp/graph943636064911444509.bin' '-w' '/tmp/graph943636064911444509.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph943636064911444509.bin' '-l' '-1' '-v' '-w' '/tmp/graph943636064911444509.weights' '-q' '0' '-e' '0.001'
[2025-06-03 12:22:04] [INFO ] Decomposing Gal with order
[2025-06-03 12:22:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 12:22:04] [INFO ] Removed a total of 1193 redundant transitions.
[2025-06-03 12:22:04] [INFO ] Flatten gal took : 129 ms
[2025-06-03 12:22:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 202 labels/synchronizations in 20 ms.
[2025-06-03 12:22:04] [INFO ] Time to serialize gal into /tmp/UpperBounds971709198138407913.gal : 6 ms
[2025-06-03 12:22:04] [INFO ] Time to serialize properties into /tmp/UpperBounds198467372282398877.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds971709198138407913.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds198467372282398877.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...302
Loading property file /tmp/UpperBounds198467372282398877.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,6.44639e+06,123.671,2440300,2,193336,5,5.89702e+06,6,0,810,6.85359e+06,0
Total reachable state count : 6446388

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property SafeBus-PT-06-UpperBounds-02 :0 <= gi2.gu6.wait_msg_1+gi2.gu6.wait_msg_2+gi2.gu6.wait_msg_3+gi2.gu6.wait_msg_4+gi2.gu6.wait_msg_5+gi2.gu6.w...169
FORMULA SafeBus-PT-06-UpperBounds-02 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SafeBus-PT-06-UpperBounds-02,0,123.886,2440300,1,0,7,5.89702e+06,9,1,1128,6.85359e+06,4
Total runtime 498705 ms.

BK_STOP 1748953449167

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SafeBus-PT-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is SafeBus-PT-06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r195-tall-174889278300097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-06.tgz
mv SafeBus-PT-06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;