Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r167-smll-171636275100094.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is EisenbergMcGuire-PT-03, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-smll-171636275100094
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 12 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Apr 12 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 121K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1716474806168

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
Liveness PT
Running Version 202405141337
[2024-05-23 14:33:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-23 14:33:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:33:29] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2024-05-23 14:33:29] [INFO ] Transformed 117 places.
[2024-05-23 14:33:29] [INFO ] Transformed 216 transitions.
[2024-05-23 14:33:29] [INFO ] Found NUPN structural information;
[2024-05-23 14:33:29] [INFO ] Parsed PT model containing 117 places and 216 transitions and 900 arcs in 409 ms.
Built sparse matrix representations for Structural reductions in 11 ms.17861KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 117/117 places, 216/216 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 59 ms. Remains 117 /117 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 94 ms. Remains : 117/117 places, 216/216 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 117/117 places, 216/216 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 40 ms. Remains 117 /117 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-23 14:33:29] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
// Phase 1: matrix 153 rows 117 cols
[2024-05-23 14:33:29] [INFO ] Computed 10 invariants in 26 ms
[2024-05-23 14:33:30] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-05-23 14:33:30] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
[2024-05-23 14:33:30] [INFO ] Invariant cache hit.
[2024-05-23 14:33:30] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 14:33:30] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
[2024-05-23 14:33:30] [INFO ] Redundant transitions in 17 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-23 14:33:30] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
[2024-05-23 14:33:30] [INFO ] Invariant cache hit.
[2024-05-23 14:33:30] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-23 14:33:32] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 30 ms to minimize.
[2024-05-23 14:33:32] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 4 ms to minimize.
[2024-05-23 14:33:33] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 3 ms to minimize.
[2024-05-23 14:33:33] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-05-23 14:33:33] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 3 ms to minimize.
[2024-05-23 14:33:33] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-05-23 14:33:33] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 3 ms to minimize.
[2024-05-23 14:33:33] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-23 14:33:34] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-05-23 14:33:34] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-05-23 14:33:34] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 3 ms to minimize.
[2024-05-23 14:33:34] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-05-23 14:33:34] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 3 ms to minimize.
[2024-05-23 14:33:34] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-23 14:33:34] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-23 14:33:34] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-05-23 14:33:34] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-23 14:33:35] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-23 14:33:35] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 3 ms to minimize.
[2024-05-23 14:33:35] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-23 14:33:36] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-23 14:33:36] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
[2024-05-23 14:33:37] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-23 14:33:37] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 2 ms to minimize.
[2024-05-23 14:33:37] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-05-23 14:33:37] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-23 14:33:37] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-23 14:33:37] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-23 14:33:37] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-23 14:33:37] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 10/157 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-23 14:33:39] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
[2024-05-23 14:33:39] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2024-05-23 14:33:39] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-23 14:33:40] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 153/270 variables, 117/278 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 56/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (OVERLAPS) 0/270 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 334 constraints, problems are : Problem set: 0 solved, 213 unsolved in 23902 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 34/161 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 153/270 variables, 117/278 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 56/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 213/547 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-23 14:33:59] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 4 ms to minimize.
[2024-05-23 14:34:00] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 3 ms to minimize.
[2024-05-23 14:34:00] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-23 14:34:00] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 4/551 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-23 14:34:06] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-23 14:34:09] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (OVERLAPS) 0/270 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 553 constraints, problems are : Problem set: 0 solved, 213 unsolved in 29881 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 40/40 constraints]
After SMT, in 54159ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 54210ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 55118 ms. Remains : 117/117 places, 216/216 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1608 ms (no deadlock found). (steps per millisecond=777 )
Random directed walk for 1250000 steps, including 0 resets, run took 1179 ms (no deadlock found). (steps per millisecond=1060 )
[2024-05-23 14:34:27] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
[2024-05-23 14:34:27] [INFO ] Invariant cache hit.
[2024-05-23 14:34:27] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-05-23 14:34:27] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-23 14:34:27] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-05-23 14:34:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 14:34:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-05-23 14:34:27] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-23 14:34:27] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-23 14:34:28] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 14:34:28] [INFO ] [Nat]Added 56 Read/Feed constraints in 29 ms returned sat
[2024-05-23 14:34:28] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 2 ms to minimize.
[2024-05-23 14:34:28] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 3 ms to minimize.
[2024-05-23 14:34:28] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 3 ms to minimize.
[2024-05-23 14:34:28] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 2 ms to minimize.
[2024-05-23 14:34:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 501 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 117/117 places, 216/216 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 117 transition count 213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 114 transition count 213
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 6 place count 114 transition count 183
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 66 place count 84 transition count 183
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 78 place count 78 transition count 177
Applied a total of 78 rules in 52 ms. Remains 78 /117 variables (removed 39) and now considering 177/216 (removed 39) transitions.
[2024-05-23 14:34:28] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
// Phase 1: matrix 114 rows 78 cols
[2024-05-23 14:34:28] [INFO ] Computed 10 invariants in 9 ms
[2024-05-23 14:34:28] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-23 14:34:28] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2024-05-23 14:34:28] [INFO ] Invariant cache hit.
[2024-05-23 14:34:28] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 14:34:29] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-05-23 14:34:29] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2024-05-23 14:34:29] [INFO ] Invariant cache hit.
[2024-05-23 14:34:29] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-23 14:34:30] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
[2024-05-23 14:34:30] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-23 14:34:30] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-05-23 14:34:30] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-23 14:34:30] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-23 14:34:30] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-23 14:34:30] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 3 ms to minimize.
[2024-05-23 14:34:30] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-23 14:34:30] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-05-23 14:34:31] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-23 14:34:31] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-23 14:34:31] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-23 14:34:31] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2024-05-23 14:34:31] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
[2024-05-23 14:34:31] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:34:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 14:34:31] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:34:31] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
[2024-05-23 14:34:31] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-23 14:34:31] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-23 14:34:32] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-23 14:34:32] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-23 14:34:33] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-23 14:34:33] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-23 14:34:34] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-05-23 14:34:34] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-23 14:34:34] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-23 14:34:35] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 114/192 variables, 78/194 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 56/250 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-23 14:34:40] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/192 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 13 (OVERLAPS) 0/192 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 251 constraints, problems are : Problem set: 0 solved, 174 unsolved in 17848 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 29/117 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 114/192 variables, 78/195 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 56/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 174/425 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-23 14:34:51] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 426 constraints, problems are : Problem set: 0 solved, 174 unsolved in 11846 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 30/30 constraints]
After SMT, in 29776ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 29784ms
Starting structural reductions in LIVENESS mode, iteration 1 : 78/117 places, 177/216 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 30388 ms. Remains : 78/117 places, 177/216 transitions.
Initial state reduction rules removed 3 formulas.
RANDOM walk for 40000 steps (8 resets) in 5395 ms. (7 steps per ms) remains 91/174 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 86/91 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 82/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 77/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 67/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 65/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 64/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 62/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
[2024-05-23 14:35:01] [INFO ] Flatten gal took : 201 ms
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 61/61 properties
[2024-05-23 14:35:01] [INFO ] Flatten gal took : 100 ms
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 55/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
[2024-05-23 14:35:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12065335191489608936.gal : 36 ms
[2024-05-23 14:35:01] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2024-05-23 14:35:01] [INFO ] Invariant cache hit.
[2024-05-23 14:35:01] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 14:35:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2275732672697211166.prop : 3 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/ReachabilityCardinality12065335191489608936.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2275732672697211166.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/ReachabilityCardinality2275732672697211166.prop.
SDD proceeding with computation,55 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,55 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,55 properties remain. new max is 16
SDD size :5 after 15
SDD proceeding with computation,55 properties remain. new max is 32
SDD size :15 after 18
SDD proceeding with computation,55 properties remain. new max is 64
SDD size :18 after 22
SDD proceeding with computation,55 properties remain. new max is 128
SDD size :22 after 45
Reachability property qltransition_82 is true.
SDD proceeding with computation,54 properties remain. new max is 128
SDD size :45 after 123
Reachability property qltransition_35 is true.
SDD proceeding with computation,53 properties remain. new max is 128
SDD size :123 after 554
SDD proceeding with computation,53 properties remain. new max is 256
SDD size :554 after 614
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 55 unsolved
SDD proceeding with computation,53 properties remain. new max is 512
SDD size :614 after 796
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/39 constraints. Problems are: Problem set: 2 solved, 53 unsolved
Reachability property qltransition_65 is true.
Reachability property qltransition_64 is true.
SDD proceeding with computation,51 properties remain. new max is 512
SDD size :796 after 1358
Reachability property qltransition_53 is true.
Reachability property qltransition_52 is true.
Reachability property qltransition_50 is true.
Reachability property qltransition_38 is true.
Reachability property qltransition_23 is true.
SDD proceeding with computation,46 properties remain. new max is 512
SDD size :1358 after 1830
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 9 solved, 46 unsolved
Reachability property qltransition_169 is true.
Reachability property qltransition_167 is true.
Reachability property qltransition_86 is true.
Reachability property qltransition_44 is true.
SDD proceeding with computation,42 properties remain. new max is 512
SDD size :1830 after 2291
Reachability property qltransition_67 is true.
Reachability property qltransition_66 is true.
Reachability property qltransition_61 is true.
Reachability property qltransition_60 is true.
SDD proceeding with computation,38 properties remain. new max is 512
SDD size :2291 after 2943
At refinement iteration 3 (OVERLAPS) 40/78 variables, 6/45 constraints. Problems are: Problem set: 13 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 40/85 constraints. Problems are: Problem set: 17 solved, 38 unsolved
Reachability property qltransition_151 is true.
Reachability property qltransition_150 is true.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 3/88 constraints. Problems are: Problem set: 19 solved, 36 unsolved
SDD proceeding with computation,36 properties remain. new max is 512
SDD size :2943 after 3448
Reachability property qltransition_170 is true.
Reachability property qltransition_141 is true.
Reachability property qltransition_135 is true.
Reachability property qltransition_34 is true.
Reachability property qltransition_19 is true.
SDD proceeding with computation,31 properties remain. new max is 512
SDD size :3448 after 4000
[2024-05-23 14:35:02] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 1 ms to minimize.
Reachability property qltransition_162 is true.
Reachability property qltransition_159 is true.
Reachability property qltransition_87 is true.
SDD proceeding with computation,28 properties remain. new max is 512
SDD size :4000 after 4206
Reachability property qltransition_166 is true.
Reachability property qltransition_165 is true.
Reachability property qltransition_163 is true.
Reachability property qltransition_147 is true.
Reachability property qltransition_145 is true.
Reachability property qltransition_91 is true.
Reachability property qltransition_84 is true.
Reachability property qltransition_55 is true.
SDD proceeding with computation,20 properties remain. new max is 512
SDD size :4206 after 5188
Reachability property qltransition_153 is true.
Reachability property qltransition_76 is true.
SDD proceeding with computation,18 properties remain. new max is 512
SDD size :5188 after 5411
SDD proceeding with computation,18 properties remain. new max is 1024
SDD size :5411 after 5660
Reachability property qltransition_139 is true.
Reachability property qltransition_70 is true.
Reachability property qltransition_59 is true.
[2024-05-23 14:35:03] [INFO ] Deduced a trap composed of 26 places in 491 ms of which 1 ms to minimize.
Reachability property qltransition_42 is true.
Reachability property qltransition_41 is true.
Reachability property qltransition_40 is true.
Reachability property qltransition_37 is true.
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :5660 after 6756
Reachability property qltransition_148 is true.
Reachability property qltransition_140 is true.
Reachability property qltransition_137 is true.
Reachability property qltransition_136 is true.
Reachability property qltransition_95 is true.
Reachability property qltransition_74 is true.
Reachability property qltransition_71 is true.
Reachability property qltransition_49 is true.
Reachability property qltransition_48 is true.
Reachability property qltransition_43 is true.
Reachability property qltransition_36 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 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,7888,1.80196,43056,2,8814,82,104484,6,0,492,84986,0
Total reachable state count : 7888

Verifying 55 reachability properties.
Reachability property qltransition_19 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
qltransition\_19,10,1.80317,43056,2,150,82,104484,7,0,498,84986,0
Reachability property qltransition_23 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
qltransition\_23,9,1.80495,43056,2,160,82,104484,8,0,503,84986,0
Reachability property qltransition_34 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
qltransition\_34,2,1.80548,43056,2,97,82,104484,9,0,509,84986,0
Reachability property qltransition_35 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
qltransition\_35,7,1.80605,43056,2,123,82,104484,10,0,513,84986,0
Reachability property qltransition_36 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
qltransition\_36,10,1.80657,43056,2,164,82,104484,11,0,517,84986,0
Reachability property qltransition_37 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
qltransition\_37,48,1.80754,43056,2,302,82,104484,12,0,521,84986,0
Reachability property qltransition_38 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
qltransition\_38,94,1.80828,43056,2,530,82,104484,13,0,524,84986,0
Reachability property qltransition_40 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
qltransition\_40,6,1.80887,43056,2,105,82,104484,14,0,530,84986,0
Reachability property qltransition_41 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
qltransition\_41,14,1.80987,43056,2,141,82,104484,15,0,531,84986,0
Reachability property qltransition_42 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
qltransition\_42,21,1.81101,43056,2,174,82,104484,16,0,532,84986,0
Reachability property qltransition_43 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
qltransition\_43,12,1.81158,43056,2,153,82,104484,17,0,534,84986,0
Reachability property qltransition_44 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
qltransition\_44,76,1.81213,43056,2,411,82,104484,18,0,535,84986,0
Reachability property qltransition_48 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
qltransition\_48,8,1.81276,43056,2,160,82,104484,19,0,539,84986,0
Reachability property qltransition_49 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
qltransition\_49,16,1.81471,43056,2,162,82,104484,20,0,541,84986,0
Reachability property qltransition_50 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
qltransition\_50,47,1.81591,43056,2,425,82,104484,21,0,542,84986,0
Reachability property qltransition_52 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
qltransition\_52,2,1.81657,43056,2,81,82,104484,22,0,550,84986,0
Reachability property qltransition_53 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
qltransition\_53,2,1.81719,43056,2,108,82,104484,23,0,554,84986,0
Reachability property qltransition_55 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
qltransition\_55,6,1.81841,43056,2,165,82,104484,24,0,556,84986,0
Reachability property qltransition_59 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
qltransition\_59,5,1.81992,43056,2,147,82,104484,25,0,560,84986,0
Reachability property qltransition_60 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
qltransition\_60,14,1.82069,43056,2,192,82,104484,26,0,562,84986,0
Reachability property qltransition_61 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
qltransition\_61,21,1.82139,43056,2,282,82,104484,27,0,564,84986,0
Reachability property qltransition_64 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
qltransition\_64,3,1.8222,43056,2,87,82,104484,28,0,567,84986,0
Reachability property qltransition_65 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
qltransition\_65,2,1.82292,43056,2,81,82,104484,29,0,568,84986,0
Reachability property qltransition_66 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
qltransition\_66,8,1.8239,43056,2,169,82,104484,30,0,570,84986,0
Reachability property qltransition_67 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
qltransition\_67,19,1.82471,43056,2,239,82,104484,31,0,572,84986,0
Reachability property qltransition_70 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
qltransition\_70,5,1.82512,43056,2,141,82,104484,32,0,575,84986,0
Reachability property qltransition_71 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
qltransition\_71,9,1.82576,43056,2,188,82,104484,33,0,576,84986,0
Reachability property qltransition_74 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
qltransition\_74,7,1.82612,43056,2,184,82,104484,34,0,579,84986,0
Reachability property qltransition_76 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
qltransition\_76,27,1.82652,43056,2,279,82,104484,35,0,582,84986,0
Reachability property qltransition_82 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
qltransition\_82,1,1.82688,43056,2,79,82,104484,36,0,585,84986,0
Reachability property qltransition_84 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
qltransition\_84,44,1.82726,43056,2,298,82,104484,37,0,588,84986,0
Reachability property qltransition_86 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
qltransition\_86,2,1.82878,43056,2,81,82,104484,38,0,591,84986,0
Reachability property qltransition_87 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
qltransition\_87,1,1.82921,43056,2,79,82,104484,39,0,594,84986,0
Reachability property qltransition_91 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
qltransition\_91,1,1.8296,43056,2,79,82,104484,40,0,597,84986,0
Reachability property qltransition_95 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
qltransition\_95,6,1.82994,43056,2,185,82,104484,41,0,600,84986,0
Reachability property qltransition_135 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
qltransition\_135,3,1.83066,43056,2,122,82,104484,42,0,603,84986,0
Reachability property qltransition_136 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
qltransition\_136,36,1.8313,43056,2,275,82,104484,43,0,605,84986,0
Reachability property qltransition_137 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
qltransition\_137,26,1.83182,43056,2,263,82,104484,44,0,606,84986,0
Reachability property qltransition_139 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
qltransition\_139,1,1.83223,43056,2,79,82,104484,45,0,607,84986,0
Reachability property qltransition_140 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
qltransition\_140,9,1.83312,43056,2,188,82,104484,46,0,609,84986,0
Reachability property qltransition_141 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
qltransition\_141,4,1.83388,43056,2,105,82,104484,47,0,610,84986,0
Reachability property qltransition_145 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
qltransition\_145,28,1.83467,43056,2,353,82,104484,48,0,614,84986,0
Reachability property qltransition_147 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
qltransition\_147,23,1.8352,43056,2,271,82,104484,49,0,615,84986,0
Reachability property qltransition_148 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
qltransition\_148,7,1.83563,43056,2,184,82,104484,50,0,617,84986,0
Reachability property qltransition_150 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
qltransition\_150,10,1.83635,43056,2,184,82,104484,51,0,621,84986,0
Reachability property qltransition_151 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
qltransition\_151,19,1.83701,43056,2,239,82,104484,52,0,623,84986,0
Reachability property qltransition_153 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
qltransition\_153,7,1.83767,43056,2,185,82,104484,53,0,625,84986,0
Reachability property qltransition_159 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
qltransition\_159,2,1.83807,43056,2,81,82,104484,54,0,628,84986,0
Reachability property qltransition_162 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
qltransition\_162,12,1.8384,43056,2,164,82,104484,55,0,631,84986,0
Reachability property qltransition_163 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
qltransition\_163,1,1.83902,43056,2,79,82,104484,56,0,636,84986,0
Reachability property qltransition_165 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
qltransition\_165,1,1.83951,43056,2,79,82,104484,57,0,637,84986,0
Reachability property qltransition_166 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
qltransition\_166,1,1.8402,43056,2,79,82,104484,58,0,640,84986,0
Reachability property qltransition_167 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
qltransition\_167,2,1.84139,43056,2,121,82,104484,59,0,643,84986,0
Reachability property qltransition_169 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
qltransition\_169,2,1.84235,43056,2,82,82,104484,60,0,644,84986,0
Reachability property qltransition_170 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
qltransition\_170,8,1.84272,43056,2,191,82,104484,61,0,647,84986,0
[2024-05-23 14:35:03] [INFO ] Deduced a trap composed of 31 places in 464 ms of which 1 ms to minimize.
[2024-05-23 14:35:03] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
[2024-05-23 14:35:03] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-23 14:35:03] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:35:03] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 14:35:04] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-23 14:35:04] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-23 14:35:04] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-23 14:35:04] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-23 14:35:04] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-23 14:35:04] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-23 14:35:04] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-23 14:35:04] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:35:04] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-23 14:35:04] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
After SMT solving in domain Real declared 78/192 variables, and 105 constraints, problems are : Problem set: 55 solved, 0 unsolved in 3072 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/78 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 17/17 constraints]
After SMT, in 3163ms problems are : Problem set: 55 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Able to resolve query QuasiLiveness after proving 177 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 117/117 places, 216/216 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 117 transition count 213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 114 transition count 213
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 6 place count 114 transition count 183
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 66 place count 84 transition count 183
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 78 place count 78 transition count 177
Applied a total of 78 rules in 34 ms. Remains 78 /117 variables (removed 39) and now considering 177/216 (removed 39) transitions.
[2024-05-23 14:35:04] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2024-05-23 14:35:04] [INFO ] Invariant cache hit.
[2024-05-23 14:35:05] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-23 14:35:05] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2024-05-23 14:35:05] [INFO ] Invariant cache hit.
[2024-05-23 14:35:05] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 14:35:05] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-05-23 14:35:05] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2024-05-23 14:35:05] [INFO ] Invariant cache hit.
[2024-05-23 14:35:05] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-23 14:35:06] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-05-23 14:35:06] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-23 14:35:06] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-23 14:35:06] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-05-23 14:35:06] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-23 14:35:07] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2024-05-23 14:35:07] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-23 14:35:07] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-23 14:35:07] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
[2024-05-23 14:35:07] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-05-23 14:35:07] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-23 14:35:07] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
[2024-05-23 14:35:07] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-23 14:35:07] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:35:07] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:35:07] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-23 14:35:07] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-23 14:35:08] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-23 14:35:08] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:35:08] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-23 14:35:09] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-05-23 14:35:09] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-23 14:35:09] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-23 14:35:10] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-23 14:35:10] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-23 14:35:10] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-23 14:35:10] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-23 14:35:11] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 114/192 variables, 78/194 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 56/250 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-23 14:35:16] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/192 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 13 (OVERLAPS) 0/192 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 251 constraints, problems are : Problem set: 0 solved, 174 unsolved in 15824 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 29/117 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 114/192 variables, 78/195 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 56/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 174/425 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-23 14:35:24] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 426 constraints, problems are : Problem set: 0 solved, 174 unsolved in 9304 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 30/30 constraints]
After SMT, in 25256ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 25260ms
Starting structural reductions in LIVENESS mode, iteration 1 : 78/117 places, 177/216 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 25916 ms. Remains : 78/117 places, 177/216 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
[2024-05-23 14:35:30] [INFO ] Flatten gal took : 20 ms
[2024-05-23 14:35:30] [INFO ] Flatten gal took : 16 ms
[2024-05-23 14:35:30] [INFO ] Time to serialize gal into /tmp/CTLFireability14985639535045721704.gal : 5 ms
[2024-05-23 14:35:30] [INFO ] Time to serialize properties into /tmp/CTLFireability11914371061748306291.ctl : 4 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14985639535045721704.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11914371061748306291.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8222,1.54442,41144,2,8445,5,99898,6,0,492,92167,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-23 14:35:33] [INFO ] Flatten gal took : 14 ms
[2024-05-23 14:35:33] [INFO ] Applying decomposition
[2024-05-23 14:35:33] [INFO ] Flatten gal took : 13 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/graph15828078055270070571.txt' '-o' '/tmp/graph15828078055270070571.bin' '-w' '/tmp/graph15828078055270070571.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15828078055270070571.bin' '-l' '-1' '-v' '-w' '/tmp/graph15828078055270070571.weights' '-q' '0' '-e' '0.001'
[2024-05-23 14:35:33] [INFO ] Decomposing Gal with order
[2024-05-23 14:35:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 14:35:34] [INFO ] Removed a total of 251 redundant transitions.
[2024-05-23 14:35:34] [INFO ] Flatten gal took : 81 ms
[2024-05-23 14:35:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 20 ms.
[2024-05-23 14:35:34] [INFO ] Time to serialize gal into /tmp/CTLFireability11987026571086856536.gal : 9 ms
[2024-05-23 14:35:34] [INFO ] Time to serialize properties into /tmp/CTLFireability17959459216290623067.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11987026571086856536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17959459216290623067.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8222,0.873815,25180,1246,305,29965,1405,555,98820,88,14658,0


Converting to forward existential form...Done !
original formula: AG(EF(((((i0.u0.turn_0==1)&&(i2.u11.flag_0_idle==1))&&((i7.i1.u22.flag_1_idle==1)&&(i4.i1.u23.flag_2_idle==1)))&&(((i7.i1.u15.p04_0==1)&&...195
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((i0.u0.turn_0==1)&&(i2.u11.flag_0_idle==1))&&((i7.i1.u22.flag_1_idle==1)&&(i4....255
Reverse transition relation is NOT exact ! Due to transitions t04_0_idle, t04_0_active, t04_1_idle, t04_1_active, t04_2_idle, t04_2_active, t07_0_1, t07_0_...1885
(forward)formula 0,1,2.03032,41812,1,0,59920,5495,2314,154936,350,27882,229284
Formula is TRUE !

***************************************

Able to resolve query Liveness after proving 1 properties.
FORMULA Liveness TRUE TECHNIQUES RANDOM_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL QUASI_LIVE_REVERSIBLE INITIAL_STATE USE_NUPN
Total runtime 127483 ms.

BK_STOP 1716474936283

--------------------
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
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="EisenbergMcGuire-PT-03"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5568"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-03, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-smll-171636275100094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-03.tgz
mv EisenbergMcGuire-PT-03 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;