Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r537-tall-167987254900139.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
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 r537-tall-167987254900139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.7K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Mar 23 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 121K Mar 31 16:48 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 1680812918841

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-03
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 20:28:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2023-04-06 20:28:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 20:28:40] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-04-06 20:28:40] [INFO ] Transformed 117 places.
[2023-04-06 20:28:40] [INFO ] Transformed 216 transitions.
[2023-04-06 20:28:40] [INFO ] Found NUPN structural information;
[2023-04-06 20:28:40] [INFO ] Parsed PT model containing 117 places and 216 transitions and 900 arcs in 114 ms.
Built sparse matrix representations for Structural reductions in 7 ms.30635KB 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 28 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 28 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 12 ms. Remains 117 /117 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-04-06 20:28:40] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
// Phase 1: matrix 153 rows 117 cols
[2023-04-06 20:28:40] [INFO ] Computed 10 invariants in 14 ms
[2023-04-06 20:28:40] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-04-06 20:28:40] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
[2023-04-06 20:28:40] [INFO ] Invariant cache hit.
[2023-04-06 20:28:40] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-06 20:28:40] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-04-06 20:28:40] [INFO ] Redundant transitions in 7 ms returned []
[2023-04-06 20:28:40] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
[2023-04-06 20:28:40] [INFO ] Invariant cache hit.
[2023-04-06 20:28:41] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 474 ms. Remains : 117/117 places, 216/216 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1087 ms (no deadlock found). (steps per millisecond=1149 )
Random directed walk for 1250002 steps, including 0 resets, run took 886 ms (no deadlock found). (steps per millisecond=1410 )
[2023-04-06 20:28:43] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
[2023-04-06 20:28:43] [INFO ] Invariant cache hit.
[2023-04-06 20:28:43] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-04-06 20:28:43] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-06 20:28:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 20:28:43] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-04-06 20:28:43] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 20:28:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-04-06 20:28:43] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-06 20:28:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 20:28:43] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-04-06 20:28:43] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-06 20:28:43] [INFO ] [Nat]Added 56 Read/Feed constraints in 12 ms returned sat
[2023-04-06 20:28:43] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 4 ms to minimize.
[2023-04-06 20:28:43] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2023-04-06 20:28:43] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2023-04-06 20:28:43] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2023-04-06 20:28:43] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-04-06 20:28:43] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-04-06 20:28:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 358 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 117/117 places, 216/216 transitions.
Drop transitions 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 1 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 14 ms. Remains 78 /117 variables (removed 39) and now considering 177/216 (removed 39) transitions.
[2023-04-06 20:28:43] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
// Phase 1: matrix 114 rows 78 cols
[2023-04-06 20:28:43] [INFO ] Computed 10 invariants in 2 ms
[2023-04-06 20:28:43] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-04-06 20:28:43] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2023-04-06 20:28:43] [INFO ] Invariant cache hit.
[2023-04-06 20:28:43] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-06 20:28:43] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-04-06 20:28:43] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2023-04-06 20:28:43] [INFO ] Invariant cache hit.
[2023-04-06 20:28:43] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 78/117 places, 177/216 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 295 ms. Remains : 78/117 places, 177/216 transitions.
Initial state reduction rules removed 3 formulas.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 174) seen :84
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 90) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 88) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 87) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 86) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 84) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 84) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 84) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 79) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 78) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 74) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 72) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 71) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 69) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 67) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Running SMT prover for 61 properties.
[2023-04-06 20:28:44] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2023-04-06 20:28:44] [INFO ] Invariant cache hit.
[2023-04-06 20:28:45] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-04-06 20:28:45] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 3 ms returned sat
[2023-04-06 20:28:45] [INFO ] After 634ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:61
[2023-04-06 20:28:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-04-06 20:28:45] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-06 20:28:46] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :61
[2023-04-06 20:28:46] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-06 20:28:46] [INFO ] After 325ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :61
[2023-04-06 20:28:46] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-06 20:28:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-04-06 20:28:46] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-04-06 20:28:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-04-06 20:28:46] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2023-04-06 20:28:46] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2023-04-06 20:28:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2023-04-06 20:28:46] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-04-06 20:28:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-04-06 20:28:46] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2023-04-06 20:28:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-04-06 20:28:47] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2023-04-06 20:28:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-04-06 20:28:47] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2023-04-06 20:28:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-04-06 20:28:47] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2023-04-06 20:28:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-04-06 20:28:47] [INFO ] After 1251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :61
Attempting to minimize the solution found.
Minimization took 324 ms.
[2023-04-06 20:28:47] [INFO ] After 2093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :61
Fused 61 Parikh solutions to 58 different solutions.
Parikh walk visited 0 properties in 1087 ms.
Support contains 38 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 177/177 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 74 transition count 165
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 74 transition count 165
Applied a total of 8 rules in 10 ms. Remains 74 /78 variables (removed 4) and now considering 165/177 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 74/78 places, 165/177 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 23754 ms. (steps per millisecond=42 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 667 ms. (steps per millisecond=149 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 664 ms. (steps per millisecond=150 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 667 ms. (steps per millisecond=149 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=226 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 674 ms. (steps per millisecond=148 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 647 ms. (steps per millisecond=154 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 685 ms. (steps per millisecond=145 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 693 ms. (steps per millisecond=144 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 675 ms. (steps per millisecond=148 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 692 ms. (steps per millisecond=144 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 682 ms. (steps per millisecond=146 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 667 ms. (steps per millisecond=149 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 677 ms. (steps per millisecond=147 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 675 ms. (steps per millisecond=148 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 680 ms. (steps per millisecond=147 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 683 ms. (steps per millisecond=146 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 683 ms. (steps per millisecond=146 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 680 ms. (steps per millisecond=147 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=147 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 643 ms. (steps per millisecond=155 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 667 ms. (steps per millisecond=149 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 662 ms. (steps per millisecond=151 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 652 ms. (steps per millisecond=153 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 660 ms. (steps per millisecond=151 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 673 ms. (steps per millisecond=148 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 630 ms. (steps per millisecond=158 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 618 ms. (steps per millisecond=161 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 675 ms. (steps per millisecond=148 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 676 ms. (steps per millisecond=147 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 654 ms. (steps per millisecond=152 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 589 ms. (steps per millisecond=169 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 585 ms. (steps per millisecond=170 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 635 ms. (steps per millisecond=157 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 671 ms. (steps per millisecond=149 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 637 ms. (steps per millisecond=156 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 638 ms. (steps per millisecond=156 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=147 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 632 ms. (steps per millisecond=158 ) properties (out of 61) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 650 ms. (steps per millisecond=153 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 664 ms. (steps per millisecond=150 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 568 ms. (steps per millisecond=176 ) properties (out of 60) seen :5
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 601 ms. (steps per millisecond=166 ) properties (out of 55) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 556 ms. (steps per millisecond=179 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 625 ms. (steps per millisecond=160 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 613 ms. (steps per millisecond=163 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 602 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 643 ms. (steps per millisecond=155 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 634 ms. (steps per millisecond=157 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 664 ms. (steps per millisecond=150 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 641 ms. (steps per millisecond=156 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=155 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 653 ms. (steps per millisecond=153 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 647 ms. (steps per millisecond=154 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 555 ms. (steps per millisecond=180 ) properties (out of 54) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 627 ms. (steps per millisecond=159 ) properties (out of 53) seen :5
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 616 ms. (steps per millisecond=162 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 618 ms. (steps per millisecond=161 ) properties (out of 48) seen :0
Running SMT prover for 48 properties.
[2023-04-06 20:29:49] [INFO ] Flow matrix only has 102 transitions (discarded 63 similar events)
// Phase 1: matrix 102 rows 74 cols
[2023-04-06 20:29:49] [INFO ] Computed 10 invariants in 5 ms
[2023-04-06 20:29:49] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-04-06 20:29:49] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-06 20:29:49] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:48
[2023-04-06 20:29:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-04-06 20:29:49] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-06 20:29:50] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :48
[2023-04-06 20:29:50] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-04-06 20:29:50] [INFO ] After 248ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :48
[2023-04-06 20:29:50] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-06 20:29:50] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-04-06 20:29:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2023-04-06 20:29:50] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 20:29:50] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2023-04-06 20:29:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2023-04-06 20:29:50] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2023-04-06 20:29:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-04-06 20:29:50] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 15 ms to minimize.
[2023-04-06 20:29:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-04-06 20:29:50] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2023-04-06 20:29:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-04-06 20:29:50] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2023-04-06 20:29:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-04-06 20:29:51] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2023-04-06 20:29:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-04-06 20:29:51] [INFO ] After 1119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :48
Attempting to minimize the solution found.
Minimization took 278 ms.
[2023-04-06 20:29:51] [INFO ] After 1783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :48
Parikh walk visited 0 properties in 896 ms.
Support contains 34 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 165/165 transitions.
Applied a total of 0 rules in 10 ms. Remains 74 /74 variables (removed 0) and now considering 165/165 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 74/74 places, 165/165 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 24300 ms. (steps per millisecond=41 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 622 ms. (steps per millisecond=160 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 615 ms. (steps per millisecond=162 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 627 ms. (steps per millisecond=159 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 634 ms. (steps per millisecond=157 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=170 ) properties (out of 48) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 614 ms. (steps per millisecond=162 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 604 ms. (steps per millisecond=165 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=170 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 603 ms. (steps per millisecond=165 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 596 ms. (steps per millisecond=167 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 603 ms. (steps per millisecond=165 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 601 ms. (steps per millisecond=166 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 613 ms. (steps per millisecond=163 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 598 ms. (steps per millisecond=167 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 596 ms. (steps per millisecond=167 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 583 ms. (steps per millisecond=171 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 604 ms. (steps per millisecond=165 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 581 ms. (steps per millisecond=172 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 611 ms. (steps per millisecond=163 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 601 ms. (steps per millisecond=166 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 601 ms. (steps per millisecond=166 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=170 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 588 ms. (steps per millisecond=170 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 601 ms. (steps per millisecond=166 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 602 ms. (steps per millisecond=166 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 589 ms. (steps per millisecond=169 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 581 ms. (steps per millisecond=172 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 603 ms. (steps per millisecond=165 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 601 ms. (steps per millisecond=166 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 601 ms. (steps per millisecond=166 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 605 ms. (steps per millisecond=165 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 616 ms. (steps per millisecond=162 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 591 ms. (steps per millisecond=169 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 534 ms. (steps per millisecond=187 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 569 ms. (steps per millisecond=175 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 445 ms. (steps per millisecond=224 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=273 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=267 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=274 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=274 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 376 ms. (steps per millisecond=265 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 369 ms. (steps per millisecond=271 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=271 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=257 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 382 ms. (steps per millisecond=261 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=267 ) properties (out of 46) seen :0
Finished probabilistic random walk after 21925 steps, run visited all 46 properties in 131 ms. (steps per millisecond=167 )
Probabilistic random walk after 21925 steps, saw 5773 distinct states, run finished after 131 ms. (steps per millisecond=167 ) properties seen :46
Parikh walk visited 0 properties in 0 ms.
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 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 0 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 7 ms. Remains 78 /117 variables (removed 39) and now considering 177/216 (removed 39) transitions.
[2023-04-06 20:30:41] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
// Phase 1: matrix 114 rows 78 cols
[2023-04-06 20:30:41] [INFO ] Computed 10 invariants in 4 ms
[2023-04-06 20:30:41] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-04-06 20:30:41] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2023-04-06 20:30:41] [INFO ] Invariant cache hit.
[2023-04-06 20:30:42] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-06 20:30:42] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-04-06 20:30:42] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2023-04-06 20:30:42] [INFO ] Invariant cache hit.
[2023-04-06 20:30:42] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 78/117 places, 177/216 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 290 ms. Remains : 78/117 places, 177/216 transitions.
Unable to solve all queries for examination Liveness. Remains :177 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 177 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 121841 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running EisenbergMcGuire (PT), instance 03
Examination Liveness
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Liveness.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 117 places, 216 transitions, 900 arcs.
(potential((tk(P13)>=1) & (tk(P4)>=1)))
(potential((tk(P13)>=1) & (tk(P6)>=1)))
(potential((tk(P14)>=1) & (tk(P7)>=1)))
(potential((tk(P14)>=1) & (tk(P9)>=1)))
(potential((tk(P15)>=1) & (tk(P10)>=1)))
(potential((tk(P15)>=1) & (tk(P12)>=1)))
(potential((tk(P16)>=1) & (tk(P1)>=1)))
(potential((tk(P16)>=1) & (tk(P2)>=1)))
(potential((tk(P16)>=1) & (tk(P3)>=1)))
(potential((tk(P17)>=1) & (tk(P1)>=1)))
(potential((tk(P17)>=1) & (tk(P2)>=1)))
(potential((tk(P17)>=1) & (tk(P3)>=1)))
(potential((tk(P18)>=1) & (tk(P1)>=1)))
(potential((tk(P18)>=1) & (tk(P2)>=1)))
(potential((tk(P18)>=1) & (tk(P3)>=1)))
(potential((tk(P20)>=1)))
(potential((tk(P21)>=1)))
(potential((tk(P22)>=1)))
(potential((tk(P24)>=1)))
(potential((tk(P25)>=1)))
(potential((tk(P26)>=1)))
(potential((tk(P19)>=1)))
(potential((tk(P23)>=1)))
(potential((tk(P27)>=1)))
(potential((tk(P28)>=1) & (tk(P8)>=1)))
(potential((tk(P28)>=1) & (tk(P9)>=1)))
(potential((tk(P29)>=1) & (tk(P11)>=1)))
(potential((tk(P29)>=1) & (tk(P12)>=1)))
(potential((tk(P30)>=1) & (tk(P5)>=1)))
(potential((tk(P30)>=1) & (tk(P6)>=1)))
(potential((tk(P31)>=1) & (tk(P11)>=1)))
(potential((tk(P31)>=1) & (tk(P12)>=1)))
(potential((tk(P32)>=1) & (tk(P5)>=1)))
(potential((tk(P32)>=1) & (tk(P6)>=1)))
(potential((tk(P33)>=1) & (tk(P8)>=1)))
(potential((tk(P33)>=1) & (tk(P9)>=1)))
(potential((tk(P28)>=1) & (tk(P7)>=1)))
(potential((tk(P29)>=1) & (tk(P10)>=1)))
(potential((tk(P30)>=1) & (tk(P4)>=1)))
(potential((tk(P31)>=1) & (tk(P10)>=1)))
(potential((tk(P32)>=1) & (tk(P4)>=1)))
(potential((tk(P33)>=1) & (tk(P7)>=1)))
(potential((tk(P34)>=1) & (tk(P1)>=1)))
(potential((tk(P34)>=1) & (tk(P2)>=1)))
(potential((tk(P34)>=1) & (tk(P3)>=1)))
(potential((tk(P35)>=1) & (tk(P1)>=1)))
(potential((tk(P35)>=1) & (tk(P2)>=1)))
(potential((tk(P35)>=1) & (tk(P3)>=1)))
(potential((tk(P36)>=1) & (tk(P1)>=1)))
(potential((tk(P36)>=1) & (tk(P2)>=1)))
(potential((tk(P36)>=1) & (tk(P3)>=1)))
(potential((tk(P37)>=1) & (tk(P1)>=1)))
(potential((tk(P37)>=1) & (tk(P2)>=1)))
(potential((tk(P37)>=1) & (tk(P3)>=1)))
(potential((tk(P38)>=1) & (tk(P1)>=1)))
(potential((tk(P38)>=1) & (tk(P2)>=1)))
(potential((tk(P38)>=1) & (tk(P3)>=1)))
(potential((tk(P39)>=1) & (tk(P1)>=1)))
(potential((tk(P39)>=1) & (tk(P2)>=1)))
(potential((tk(P39)>=1) & (tk(P3)>=1)))
(potential((tk(P40)>=1)))
(potential((tk(P41)>=1)))
(potential((tk(P42)>=1)))
(potential((tk(P43)>=1)))
(potential((tk(P44)>=1)))
(potential((tk(P45)>=1)))
(potential((tk(P52)>=1) & (tk(P5)>=1)))
(potential((tk(P53)>=1) & (tk(P8)>=1)))
(potential((tk(P54)>=1) & (tk(P11)>=1)))
(potential((tk(P55)>=1)))
(potential((tk(P56)>=1)))
(potential((tk(P57)>=1)))
(potential((tk(P58)>=1) & (tk(P6)>=1)))
(potential((tk(P59)>=1) & (tk(P7)>=1)))
(potential((tk(P59)>=1) & (tk(P8)>=1)))
(potential((tk(P60)>=1) & (tk(P10)>=1)))
(potential((tk(P60)>=1) & (tk(P11)>=1)))
(potential((tk(P62)>=1) & (tk(P4)>=1)))
(potential((tk(P62)>=1) & (tk(P5)>=1)))
(potential((tk(P63)>=1) & (tk(P9)>=1)))
(potential((tk(P64)>=1) & (tk(P10)>=1)))
(potential((tk(P64)>=1) & (tk(P11)>=1)))
(potential((tk(P66)>=1) & (tk(P4)>=1)))
(potential((tk(P66)>=1) & (tk(P5)>=1)))
(potential((tk(P67)>=1) & (tk(P7)>=1)))
(potential((tk(P67)>=1) & (tk(P8)>=1)))
(potential((tk(P68)>=1) & (tk(P12)>=1)))
(potential((tk(P61)>=1)))
(potential((tk(P65)>=1)))
(potential((tk(P69)>=1)))
(potential((tk(P59)>=1) & (tk(P9)>=1)))
(potential((tk(P60)>=1) & (tk(P12)>=1)))
(potential((tk(P62)>=1) & (tk(P6)>=1)))
(potential((tk(P64)>=1) & (tk(P12)>=1)))
(potential((tk(P66)>=1) & (tk(P6)>=1)))
(potential((tk(P67)>=1) & (tk(P9)>=1)))
(potential((tk(P70)>=1)))
(potential((tk(P71)>=1)))
(potential((tk(P72)>=1)))
(potential((tk(P73)>=1)))
(potential((tk(P74)>=1)))
(potential((tk(P75)>=1)))
(potential((tk(P76)>=1)))
(potential((tk(P77)>=1)))
(potential((tk(P78)>=1)))
(potential((tk(P81)>=1) & (tk(P1)>=1) & (tk(P6)>=1)))
(potential((tk(P81)>=1) & (tk(P2)>=1) & (tk(P7)>=1)))
(potential((tk(P81)>=1) & (tk(P3)>=1) & (tk(P10)>=1)))
(potential((tk(P84)>=1) & (tk(P1)>=1) & (tk(P4)>=1)))
(potential((tk(P84)>=1) & (tk(P2)>=1) & (tk(P9)>=1)))
(potential((tk(P84)>=1) & (tk(P3)>=1) & (tk(P10)>=1)))
(potential((tk(P87)>=1) & (tk(P1)>=1) & (tk(P4)>=1)))
(potential((tk(P87)>=1) & (tk(P2)>=1) & (tk(P7)>=1)))
(potential((tk(P87)>=1) & (tk(P3)>=1) & (tk(P12)>=1)))
(potential((tk(P79)>=1) & (tk(P1)>=1) & (tk(P6)>=1)))
(potential((tk(P79)>=1) & (tk(P2)>=1) & (tk(P8)>=1)))
(potential((tk(P79)>=1) & (tk(P2)>=1) & (tk(P9)>=1)))
(potential((tk(P79)>=1) & (tk(P3)>=1) & (tk(P10)>=1)))
(potential((tk(P79)>=1) & (tk(P3)>=1) & (tk(P11)>=1)))
(potential((tk(P79)>=1) & (tk(P3)>=1) & (tk(P12)>=1)))
(potential((tk(P80)>=1) & (tk(P1)>=1) & (tk(P6)>=1)))
(potential((tk(P80)>=1) & (tk(P2)>=1) & (tk(P7)>=1)))
(potential((tk(P80)>=1) & (tk(P2)>=1) & (tk(P8)>=1)))
(potential((tk(P80)>=1) & (tk(P2)>=1) & (tk(P9)>=1)))
(potential((tk(P80)>=1) & (tk(P3)>=1) & (tk(P11)>=1)))
(potential((tk(P80)>=1) & (tk(P3)>=1) & (tk(P12)>=1)))
(potential((tk(P81)>=1) & (tk(P2)>=1) & (tk(P8)>=1)))
(potential((tk(P81)>=1) & (tk(P2)>=1) & (tk(P9)>=1)))
(potential((tk(P81)>=1) & (tk(P3)>=1) & (tk(P11)>=1)))
(potential((tk(P81)>=1) & (tk(P3)>=1) & (tk(P12)>=1)))
(potential((tk(P82)>=1) & (tk(P1)>=1) & (tk(P5)>=1)))
(potential((tk(P82)>=1) & (tk(P1)>=1) & (tk(P6)>=1)))
(potential((tk(P82)>=1) & (tk(P2)>=1) & (tk(P9)>=1)))
(potential((tk(P82)>=1) & (tk(P3)>=1) & (tk(P10)>=1)))
(potential((tk(P82)>=1) & (tk(P3)>=1) & (tk(P11)>=1)))
(potential((tk(P82)>=1) & (tk(P3)>=1) & (tk(P12)>=1)))
(potential((tk(P83)>=1) & (tk(P1)>=1) & (tk(P4)>=1)))
(potential((tk(P83)>=1) & (tk(P1)>=1) & (tk(P5)>=1)))
(potential((tk(P83)>=1) & (tk(P1)>=1) & (tk(P6)>=1)))
(potential((tk(P83)>=1) & (tk(P2)>=1) & (tk(P9)>=1)))
(potential((tk(P83)>=1) & (tk(P3)>=1) & (tk(P11)>=1)))
(potential((tk(P83)>=1) & (tk(P3)>=1) & (tk(P12)>=1)))
(potential((tk(P84)>=1) & (tk(P1)>=1) & (tk(P5)>=1)))
(potential((tk(P84)>=1) & (tk(P1)>=1) & (tk(P6)>=1)))
(potential((tk(P84)>=1) & (tk(P3)>=1) & (tk(P11)>=1)))
(potential((tk(P84)>=1) & (tk(P3)>=1) & (tk(P12)>=1)))
(potential((tk(P85)>=1) & (tk(P1)>=1) & (tk(P5)>=1)))
(potential((tk(P85)>=1) & (tk(P1)>=1) & (tk(P6)>=1)))
(potential((tk(P85)>=1) & (tk(P2)>=1) & (tk(P7)>=1)))
(potential((tk(P85)>=1) & (tk(P2)>=1) & (tk(P8)>=1)))
(potential((tk(P85)>=1) & (tk(P2)>=1) & (tk(P9)>=1)))
(potential((tk(P85)>=1) & (tk(P3)>=1) & (tk(P12)>=1)))
(potential((tk(P86)>=1) & (tk(P1)>=1) & (tk(P4)>=1)))
(potential((tk(P86)>=1) & (tk(P1)>=1) & (tk(P5)>=1)))
(potential((tk(P86)>=1) & (tk(P1)>=1) & (tk(P6)>=1)))
(potential((tk(P86)>=1) & (tk(P2)>=1) & (tk(P8)>=1)))
(potential((tk(P86)>=1) & (tk(P2)>=1) & (tk(P9)>=1)))
(potential((tk(P86)>=1) & (tk(P3)>=1) & (tk(P12)>=1)))
(potential((tk(P87)>=1) & (tk(P1)>=1) & (tk(P5)>=1)))
(potential((tk(P87)>=1) & (tk(P1)>=1) & (tk(P6)>=1)))
(potential((tk(P87)>=1) & (tk(P2)>=1) & (tk(P8)>=1)))
(potential((tk(P87)>=1) & (tk(P2)>=1) & (tk(P9)>=1)))
(potential((tk(P88)>=1) & (tk(P1)>=1)))
(potential((tk(P88)>=1) & (tk(P2)>=1)))
(potential((tk(P88)>=1) & (tk(P3)>=1)))
(potential((tk(P89)>=1) & (tk(P1)>=1)))
(potential((tk(P89)>=1) & (tk(P2)>=1)))
(potential((tk(P89)>=1) & (tk(P3)>=1)))
(potential((tk(P90)>=1) & (tk(P1)>=1)))
(potential((tk(P90)>=1) & (tk(P2)>=1)))
(potential((tk(P90)>=1) & (tk(P3)>=1)))
(potential((tk(P115)>=1)))
(potential((tk(P116)>=1)))
(potential((tk(P117)>=1)))
(potential((tk(P91)>=1) & (tk(P1)>=1)))
(potential((tk(P92)>=1) & (tk(P2)>=1)))
(potential((tk(P93)>=1) & (tk(P3)>=1)))
(potential((tk(P95)>=1) & (tk(P7)>=1)))
(potential((tk(P96)>=1) & (tk(P10)>=1)))
(potential((tk(P97)>=1) & (tk(P4)>=1)))
(potential((tk(P99)>=1) & (tk(P10)>=1)))
(potential((tk(P100)>=1) & (tk(P4)>=1)))
(potential((tk(P101)>=1) & (tk(P7)>=1)))
(potential((tk(P94)>=1) & (tk(P6)>=1)))
(potential((tk(P95)>=1) & (tk(P8)>=1)))
(potential((tk(P95)>=1) & (tk(P9)>=1)))
(potential((tk(P96)>=1) & (tk(P11)>=1)))
(potential((tk(P96)>=1) & (tk(P12)>=1)))
(potential((tk(P97)>=1) & (tk(P5)>=1)))
(potential((tk(P97)>=1) & (tk(P6)>=1)))
(potential((tk(P98)>=1) & (tk(P9)>=1)))
(potential((tk(P99)>=1) & (tk(P11)>=1)))
(potential((tk(P99)>=1) & (tk(P12)>=1)))
(potential((tk(P100)>=1) & (tk(P5)>=1)))
(potential((tk(P100)>=1) & (tk(P6)>=1)))
(potential((tk(P101)>=1) & (tk(P8)>=1)))
(potential((tk(P101)>=1) & (tk(P9)>=1)))
(potential((tk(P102)>=1) & (tk(P12)>=1)))
(potential((tk(P46)>=1)))
(potential((tk(P47)>=1)))
(potential((tk(P48)>=1)))
(potential((tk(P49)>=1)))
(potential((tk(P50)>=1)))
(potential((tk(P51)>=1)))
(potential((tk(P103)>=1) & (tk(P1)>=1)))
(potential((tk(P104)>=1) & (tk(P1)>=1)))
(potential((tk(P105)>=1) & (tk(P1)>=1)))
(potential((tk(P106)>=1) & (tk(P2)>=1)))
(potential((tk(P107)>=1) & (tk(P2)>=1)))
(potential((tk(P108)>=1) & (tk(P2)>=1)))
(potential((tk(P109)>=1) & (tk(P3)>=1)))
(potential((tk(P110)>=1) & (tk(P3)>=1)))
(potential((tk(P111)>=1) & (tk(P3)>=1)))
(potential((tk(P112)>=1) & (tk(P6)>=1)))
(potential((tk(P113)>=1) & (tk(P9)>=1)))
(potential((tk(P114)>=1) & (tk(P12)>=1)))
FORMULA Liveness TRUE TECHNIQUES IMPLICIT_RELATION DECISION_DIAGRAMS SATURATION

BK_STOP 1680813473902

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML

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="smartxred"
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-5348"
echo " Executing tool smartxred"
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 r537-tall-167987254900139"
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 ;