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.r277-smll-167863548900384.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 lolaxred
Input is Peterson-PT-3, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r277-smll-167863548900384
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 29K Feb 25 22:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Feb 25 22:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Feb 25 22:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 194K Feb 25 22:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 93K Feb 25 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 439K Feb 25 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Feb 25 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 283K Feb 25 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 143K Mar 5 18:23 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 1678883375149

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=lolaxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-3
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 12:29:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2023-03-15 12:29:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 12:29:38] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2023-03-15 12:29:38] [INFO ] Transformed 244 places.
[2023-03-15 12:29:38] [INFO ] Transformed 332 transitions.
[2023-03-15 12:29:38] [INFO ] Found NUPN structural information;
[2023-03-15 12:29:38] [INFO ] Completing missing partition info from NUPN : creating a component with [TestAlone_1_2_3, TestAlone_2_2_3]
[2023-03-15 12:29:38] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 238 ms.
Built sparse matrix representations for Structural reductions in 9 ms.25342KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 244/244 places, 332/332 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 42 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 42 ms. Remains : 244/244 places, 332/332 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 244/244 places, 332/332 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 20 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-15 12:29:38] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-15 12:29:38] [INFO ] Computed 15 place invariants in 34 ms
[2023-03-15 12:29:39] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-15 12:29:39] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-15 12:29:39] [INFO ] Invariant cache hit.
[2023-03-15 12:29:39] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-15 12:29:39] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
[2023-03-15 12:29:39] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-15 12:29:39] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-15 12:29:39] [INFO ] Invariant cache hit.
[2023-03-15 12:29:39] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 1248 ms. Remains : 244/244 places, 332/332 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1573 ms (no deadlock found). (steps per millisecond=794 )
Random directed walk for 1250002 steps, including 0 resets, run took 1368 ms (no deadlock found). (steps per millisecond=913 )
[2023-03-15 12:29:42] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-15 12:29:42] [INFO ] Invariant cache hit.
[2023-03-15 12:29:42] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2023-03-15 12:29:42] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 23 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2023-03-15 12:29:42] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2023-03-15 12:29:42] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-15 12:29:43] [INFO ] Implicit Places using invariants in 119 ms returned [81, 82, 83, 84]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 121 ms to find 4 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 84/244 places, 176/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 147 ms. Remains : 84/244 places, 176/332 transitions.
Discarding 4 transitions out of 176. Remains 172
Incomplete random walk after 10000 steps, including 2 resets, run finished after 723 ms. (steps per millisecond=13 ) properties (out of 172) seen :106
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 66) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 60) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 58) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 53) 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 53) 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 53) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 48) 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 48) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 46) 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 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 46) 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 46) 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 46) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 44) 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 44) 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 44) 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 44) 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 44) 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 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 44) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 42) 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 42) 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 42) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 41) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 39) 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 39) 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 39) 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 39) 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 39) 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 39) seen :0
Running SMT prover for 39 properties.
[2023-03-15 12:29:44] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 84 cols
[2023-03-15 12:29:44] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 12:29:44] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-15 12:29:45] [INFO ] After 1018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:39
[2023-03-15 12:29:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 12:29:46] [INFO ] After 336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :39
[2023-03-15 12:29:46] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-15 12:29:46] [INFO ] After 295ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :39
[2023-03-15 12:29:46] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 5 ms to minimize.
[2023-03-15 12:29:46] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2023-03-15 12:29:46] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2023-03-15 12:29:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 188 ms
[2023-03-15 12:29:46] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2023-03-15 12:29:46] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2023-03-15 12:29:46] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2023-03-15 12:29:46] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2023-03-15 12:29:46] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2023-03-15 12:29:47] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2023-03-15 12:29:47] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2023-03-15 12:29:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 420 ms
[2023-03-15 12:29:47] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2023-03-15 12:29:47] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2023-03-15 12:29:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2023-03-15 12:29:47] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2023-03-15 12:29:47] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2023-03-15 12:29:47] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2023-03-15 12:29:47] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2023-03-15 12:29:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 224 ms
[2023-03-15 12:29:47] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2023-03-15 12:29:47] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2023-03-15 12:29:47] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2023-03-15 12:29:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 169 ms
[2023-03-15 12:29:47] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2023-03-15 12:29:47] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2023-03-15 12:29:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2023-03-15 12:29:47] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2023-03-15 12:29:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-15 12:29:47] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2023-03-15 12:29:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-15 12:29:47] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2023-03-15 12:29:48] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2023-03-15 12:29:48] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2023-03-15 12:29:48] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2023-03-15 12:29:48] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2023-03-15 12:29:48] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2023-03-15 12:29:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 261 ms
[2023-03-15 12:29:48] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2023-03-15 12:29:48] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2023-03-15 12:29:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2023-03-15 12:29:48] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2023-03-15 12:29:48] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2023-03-15 12:29:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2023-03-15 12:29:48] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2023-03-15 12:29:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-15 12:29:48] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 8 ms to minimize.
[2023-03-15 12:29:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-15 12:29:48] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2023-03-15 12:29:48] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2023-03-15 12:29:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2023-03-15 12:29:48] [INFO ] After 2863ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :39
Attempting to minimize the solution found.
Minimization took 390 ms.
[2023-03-15 12:29:49] [INFO ] After 3949ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :39
Parikh walk visited 1 properties in 1039 ms.
Support contains 43 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 84/84 places, 176/176 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 29737 ms. (steps per millisecond=33 ) properties (out of 38) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 616 ms. (steps per millisecond=162 ) properties (out of 37) 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 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 633 ms. (steps per millisecond=157 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 725 ms. (steps per millisecond=137 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 725 ms. (steps per millisecond=137 ) properties (out of 37) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 878 ms. (steps per millisecond=113 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 722 ms. (steps per millisecond=138 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 665 ms. (steps per millisecond=150 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 691 ms. (steps per millisecond=144 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 715 ms. (steps per millisecond=139 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 721 ms. (steps per millisecond=138 ) properties (out of 36) 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 36) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 631 ms. (steps per millisecond=158 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 483 ms. (steps per millisecond=207 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 503 ms. (steps per millisecond=198 ) properties (out of 34) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 677 ms. (steps per millisecond=147 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 648 ms. (steps per millisecond=154 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 734 ms. (steps per millisecond=136 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 718 ms. (steps per millisecond=139 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 670 ms. (steps per millisecond=149 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 665 ms. (steps per millisecond=150 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 718 ms. (steps per millisecond=139 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 715 ms. (steps per millisecond=139 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 705 ms. (steps per millisecond=141 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 717 ms. (steps per millisecond=139 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 698 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 707 ms. (steps per millisecond=141 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 703 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 705 ms. (steps per millisecond=141 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 716 ms. (steps per millisecond=139 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 714 ms. (steps per millisecond=140 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 713 ms. (steps per millisecond=140 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 706 ms. (steps per millisecond=141 ) properties (out of 32) 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 32) seen :0
Running SMT prover for 32 properties.
[2023-03-15 12:30:44] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
[2023-03-15 12:30:44] [INFO ] Invariant cache hit.
[2023-03-15 12:30:44] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-15 12:30:44] [INFO ] After 532ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-15 12:30:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-15 12:30:45] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-03-15 12:30:45] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-15 12:30:45] [INFO ] After 349ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :32
[2023-03-15 12:30:45] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2023-03-15 12:30:45] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2023-03-15 12:30:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2023-03-15 12:30:46] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2023-03-15 12:30:46] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2023-03-15 12:30:46] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2023-03-15 12:30:46] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2023-03-15 12:30:46] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2023-03-15 12:30:46] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2023-03-15 12:30:46] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2023-03-15 12:30:46] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2023-03-15 12:30:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 530 ms
[2023-03-15 12:30:46] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2023-03-15 12:30:46] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2023-03-15 12:30:46] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2023-03-15 12:30:46] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2023-03-15 12:30:46] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2023-03-15 12:30:46] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2023-03-15 12:30:46] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2023-03-15 12:30:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 369 ms
[2023-03-15 12:30:46] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 13 ms to minimize.
[2023-03-15 12:30:46] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2023-03-15 12:30:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2023-03-15 12:30:47] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2023-03-15 12:30:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-15 12:30:47] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2023-03-15 12:30:47] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2023-03-15 12:30:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2023-03-15 12:30:47] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2023-03-15 12:30:47] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2023-03-15 12:30:47] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2023-03-15 12:30:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 163 ms
[2023-03-15 12:30:47] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2023-03-15 12:30:47] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2023-03-15 12:30:47] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2023-03-15 12:30:47] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2023-03-15 12:30:47] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2023-03-15 12:30:47] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2023-03-15 12:30:47] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2023-03-15 12:30:47] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2023-03-15 12:30:47] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2023-03-15 12:30:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 541 ms
[2023-03-15 12:30:48] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2023-03-15 12:30:48] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2023-03-15 12:30:48] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2023-03-15 12:30:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 200 ms
[2023-03-15 12:30:48] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2023-03-15 12:30:48] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2023-03-15 12:30:48] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2023-03-15 12:30:48] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2023-03-15 12:30:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 302 ms
[2023-03-15 12:30:48] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2023-03-15 12:30:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-15 12:30:48] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2023-03-15 12:30:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-15 12:30:49] [INFO ] After 3622ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 466 ms.
[2023-03-15 12:30:49] [INFO ] After 4796ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Parikh walk visited 2 properties in 861 ms.
Support contains 38 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 84/84 places, 176/176 transitions.
Interrupted random walk after 909561 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 648 ms. (steps per millisecond=154 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 700 ms. (steps per millisecond=142 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 731 ms. (steps per millisecond=136 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 553 ms. (steps per millisecond=180 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 512 ms. (steps per millisecond=195 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 620 ms. (steps per millisecond=161 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 655 ms. (steps per millisecond=152 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 849 ms. (steps per millisecond=117 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 713 ms. (steps per millisecond=140 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 706 ms. (steps per millisecond=141 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 713 ms. (steps per millisecond=140 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 723 ms. (steps per millisecond=138 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 718 ms. (steps per millisecond=139 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 695 ms. (steps per millisecond=143 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 522 ms. (steps per millisecond=191 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 645 ms. (steps per millisecond=155 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 689 ms. (steps per millisecond=145 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 730 ms. (steps per millisecond=136 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 738 ms. (steps per millisecond=135 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 724 ms. (steps per millisecond=138 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 727 ms. (steps per millisecond=137 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 741 ms. (steps per millisecond=134 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 708 ms. (steps per millisecond=141 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 723 ms. (steps per millisecond=138 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 710 ms. (steps per millisecond=140 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 745 ms. (steps per millisecond=134 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 734 ms. (steps per millisecond=136 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 717 ms. (steps per millisecond=139 ) properties (out of 30) seen :0
Finished probabilistic random walk after 121825 steps, run visited all 30 properties in 1032 ms. (steps per millisecond=118 )
Probabilistic random walk after 121825 steps, saw 24599 distinct states, run finished after 1032 ms. (steps per millisecond=118 ) properties seen :30
Able to resolve query QuasiLiveness after proving 172 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 12 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2023-03-15 12:31:42] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2023-03-15 12:31:42] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-15 12:31:42] [INFO ] Implicit Places using invariants in 110 ms returned [81, 82, 83, 84]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 111 ms to find 4 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 84/244 places, 176/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 125 ms. Remains : 84/244 places, 176/332 transitions.
Discarding 4 transitions out of 176. Remains 172
Unable to solve all queries for examination Liveness. Remains :172 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 172 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 124067 ms.
starting LoLA
BK_INPUT Peterson-PT-3
BK_EXAMINATION: Liveness
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
GlobalProperty: Liveness

FORMULA Liveness FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678883503246

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: LAUNCH SYMM
lola: ..... NotAlone_1_3_2: false
lola: INDIVIDUAL RESULTS
lola: TurnDiff_2_1_0: void (by not produced)
lola: TurnDiff_2_1_1: void (by not produced)
lola: TurnDiff_2_1_2: void (by not produced)
lola: Alone1_0_1_0: void (by not produced)
lola: Alone1_0_1_1: void (by not produced)
lola: Alone1_0_1_2: void (by not produced)
lola: UpdateTurn_3_2_0: void (by not produced)
lola: UpdateTurn_3_2_1: void (by not produced)
lola: UpdateTurn_3_2_2: void (by not produced)
lola: Alone1_3_0_0: void (by not produced)
lola: Alone1_3_0_1: void (by not produced)
lola: Alone1_3_0_2: void (by not produced)
lola: NotAlone_2_3_0: void (by not produced)
lola: NotAlone_2_3_1: void (by not produced)
lola: NotAlone_2_3_2: void (by not produced)
lola: Alone1_0_2_0: void (by not produced)
lola: Alone1_0_2_1: void (by not produced)
lola: Alone1_0_2_2: void (by not produced)
lola: UpdateTurn_3_3_0: void (by not produced)
lola: UpdateTurn_3_3_1: void (by not produced)
lola: UpdateTurn_3_3_2: void (by not produced)
lola: TurnDiff_2_3_0: void (by not produced)
lola: TurnDiff_2_3_1: void (by not produced)
lola: TurnDiff_2_3_2: void (by not produced)
lola: Alone1_3_1_0: void (by not produced)
lola: Alone1_3_1_1: void (by not produced)
lola: Alone1_3_1_2: void (by not produced)
lola: Alone1_0_3_0: void (by not produced)
lola: Alone1_0_3_1: void (by not produced)
lola: Alone1_0_3_2: void (by not produced)
lola: UpdateTurn_1_0_0: void (by not produced)
lola: UpdateTurn_1_0_1: void (by not produced)
lola: UpdateTurn_1_0_2: void (by not produced)
lola: Alone1_3_2_0: void (by not produced)
lola: Alone1_3_2_1: void (by not produced)
lola: Alone1_3_2_2: void (by not produced)
lola: NotAlone_0_1_0: void (by not produced)
lola: NotAlone_0_1_1: void (by not produced)
lola: NotAlone_0_1_2: void (by not produced)
lola: UpdateTurn_1_1_0: void (by not produced)
lola: UpdateTurn_1_1_1: void (by not produced)
lola: UpdateTurn_1_1_2: void (by not produced)
lola: NotAlone_3_0_0: void (by not produced)
lola: NotAlone_3_0_1: void (by not produced)
lola: NotAlone_3_0_2: void (by not produced)
lola: TurnDiff_0_1_0: void (by not produced)
lola: TurnDiff_0_1_1: void (by not produced)
lola: TurnDiff_0_1_2: void (by not produced)
lola: NotAlone_0_2_0: void (by not produced)
lola: NotAlone_0_2_1: void (by not produced)
lola: NotAlone_0_2_2: void (by not produced)
lola: UpdateTurn_1_2_0: void (by not produced)
lola: UpdateTurn_1_2_1: void (by not produced)
lola: UpdateTurn_1_2_2: void (by not produced)
lola: BecomeIdle_0: void (by not produced)
lola: BecomeIdle_1: void (by not produced)
lola: BecomeIdle_2: void (by not produced)
lola: BecomeIdle_3: void (by not produced)
lola: TurnDiff_3_0_0: void (by not produced)
lola: TurnDiff_3_0_1: void (by not produced)
lola: TurnDiff_3_0_2: void (by not produced)
lola: NotAlone_3_1_0: void (by not produced)
lola: NotAlone_3_1_1: void (by not produced)
lola: NotAlone_3_1_2: void (by not produced)
lola: TurnDiff_0_2_0: void (by not produced)
lola: TurnDiff_0_2_1: void (by not produced)
lola: TurnDiff_0_2_2: void (by not produced)
lola: Alone1_1_0_0: void (by not produced)
lola: Alone1_1_0_1: void (by not produced)
lola: Alone1_1_0_2: void (by not produced)
lola: NotAlone_0_3_0: void (by not produced)
lola: NotAlone_0_3_1: void (by not produced)
lola: NotAlone_0_3_2: void (by not produced)
lola: UpdateTurn_1_3_0: void (by not produced)
lola: UpdateTurn_1_3_1: void (by not produced)
lola: UpdateTurn_1_3_2: void (by not produced)
lola: TurnDiff_3_1_0: void (by not produced)
lola: TurnDiff_3_1_1: void (by not produced)
lola: TurnDiff_3_1_2: void (by not produced)
lola: NotAlone_3_2_0: void (by not produced)
lola: NotAlone_3_2_1: void (by not produced)
lola: NotAlone_3_2_2: void (by not produced)
lola: TurnDiff_0_3_0: void (by not produced)
lola: TurnDiff_0_3_1: void (by not produced)
lola: TurnDiff_0_3_2: void (by not produced)
lola: TurnDiff_3_2_0: void (by not produced)
lola: TurnDiff_3_2_1: void (by not produced)
lola: TurnDiff_3_2_2: void (by not produced)
lola: Alone1_1_2_0: void (by not produced)
lola: Alone1_1_2_1: void (by not produced)
lola: Alone1_1_2_2: void (by not produced)
lola: Ask_0: void (by not produced)
lola: Ask_1: void (by not produced)
lola: Ask_2: void (by not produced)
lola: Ask_3: void (by not produced)
lola: Alone1_1_3_0: void (by not produced)
lola: Alone1_1_3_1: void (by not produced)
lola: Alone1_1_3_2: void (by not produced)
lola: NotAlone_1_0_0: void (by not produced)
lola: NotAlone_1_0_1: void (by not produced)
lola: NotAlone_1_0_2: void (by not produced)
lola: UpdateTurn_2_0_0: void (by not produced)
lola: UpdateTurn_2_0_1: void (by not produced)
lola: UpdateTurn_2_0_2: void (by not produced)
lola: TurnDiff_1_0_0: void (by not produced)
lola: TurnDiff_1_0_1: void (by not produced)
lola: TurnDiff_1_0_2: void (by not produced)
lola: UpdateTurn_2_1_0: void (by not produced)
lola: UpdateTurn_2_1_1: void (by not produced)
lola: UpdateTurn_2_1_2: void (by not produced)
lola: TurnEqual_0_0: void (by not produced)
lola: TurnEqual_0_1: void (by not produced)
lola: TurnEqual_0_2: void (by not produced)
lola: NotAlone_1_2_0: void (by not produced)
lola: NotAlone_1_2_1: void (by not produced)
lola: NotAlone_1_2_2: void (by not produced)
lola: UpdateTurn_2_2_0: void (by not produced)
lola: UpdateTurn_2_2_1: void (by not produced)
lola: UpdateTurn_2_2_2: void (by not produced)
lola: TurnEqual_1_0: void (by not produced)
lola: TurnEqual_1_1: void (by not produced)
lola: TurnEqual_1_2: void (by not produced)
lola: TurnDiff_1_2_0: void (by not produced)
lola: TurnDiff_1_2_1: void (by not produced)
lola: TurnDiff_1_2_2: void (by not produced)
lola: Alone1_2_0_0: void (by not produced)
lola: Alone1_2_0_1: void (by not produced)
lola: Alone1_2_0_2: void (by not produced)
lola: NotAlone_1_3_0: void (by not produced)
lola: NotAlone_1_3_1: void (by not produced)
lola: NotAlone_1_3_2: false (by goal oriented search)
lola: UpdateTurn_2_3_0: void (by not produced)
lola: UpdateTurn_2_3_1: void (by not produced)
lola: UpdateTurn_2_3_2: void (by not produced)
lola: TurnEqual_2_0: void (by not produced)
lola: TurnEqual_2_1: void (by not produced)
lola: TurnEqual_2_2: void (by not produced)
lola: TurnDiff_1_3_0: void (by not produced)
lola: TurnDiff_1_3_1: void (by not produced)
lola: TurnDiff_1_3_2: void (by not produced)
lola: Alone1_2_1_0: void (by not produced)
lola: Alone1_2_1_1: void (by not produced)
lola: Alone1_2_1_2: void (by not produced)
lola: UpdateTurn_0_0_0: void (by not produced)
lola: UpdateTurn_0_0_1: void (by not produced)
lola: UpdateTurn_0_0_2: void (by not produced)
lola: TurnEqual_3_0: void (by not produced)
lola: TurnEqual_3_1: void (by not produced)
lola: TurnEqual_3_2: void (by not produced)
lola: UpdateTurn_0_1_0: void (by not produced)
lola: UpdateTurn_0_1_1: void (by not produced)
lola: UpdateTurn_0_1_2: void (by not produced)
lola: Alone1_2_3_0: void (by not produced)
lola: Alone1_2_3_1: void (by not produced)
lola: Alone1_2_3_2: void (by not produced)
lola: NotAlone_2_0_0: void (by not produced)
lola: NotAlone_2_0_1: void (by not produced)
lola: NotAlone_2_0_2: void (by not produced)
lola: UpdateTurn_3_0_0: void (by not produced)
lola: UpdateTurn_3_0_1: void (by not produced)
lola: UpdateTurn_3_0_2: void (by not produced)
lola: UpdateTurn_0_2_0: void (by not produced)
lola: UpdateTurn_0_2_1: void (by not produced)
lola: UpdateTurn_0_2_2: void (by not produced)
lola: TurnDiff_2_0_0: void (by not produced)
lola: TurnDiff_2_0_1: void (by not produced)
lola: TurnDiff_2_0_2: void (by not produced)
lola: NotAlone_2_1_0: void (by not produced)
lola: NotAlone_2_1_1: void (by not produced)
lola: NotAlone_2_1_2: void (by not produced)
lola: UpdateTurn_3_1_0: void (by not produced)
lola: UpdateTurn_3_1_1: void (by not produced)
lola: UpdateTurn_3_1_2: void (by not produced)
lola: UpdateTurn_0_3_0: void (by not produced)
lola: UpdateTurn_0_3_1: void (by not produced)
lola: UpdateTurn_0_3_2: void (by not produced)
lola: The net is not live
lola: Example for violating transition: NotAlone_1_3_2

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="Peterson-PT-3"
export BK_EXAMINATION="Liveness"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is Peterson-PT-3, 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 r277-smll-167863548900384"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 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 ;