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-167863548600234.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 ParamProductionCell-PT-1, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r277-smll-167863548600234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 7.6K Feb 26 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 174K 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 1678877244218

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=ParamProductionCell-PT-1
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 10:47:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2023-03-15 10:47:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:47:26] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-15 10:47:26] [INFO ] Transformed 231 places.
[2023-03-15 10:47:26] [INFO ] Transformed 202 transitions.
[2023-03-15 10:47:26] [INFO ] Found NUPN structural information;
[2023-03-15 10:47:26] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 209 ms.
Built sparse matrix representations for Structural reductions in 9 ms.16847KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 231/231 places, 202/202 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 37 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 37 ms. Remains : 231/231 places, 202/202 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 231/231 places, 202/202 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 17 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 10:47:27] [INFO ] Computed 59 place invariants in 25 ms
[2023-03-15 10:47:27] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-15 10:47:27] [INFO ] Invariant cache hit.
[2023-03-15 10:47:27] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 10:47:27] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2023-03-15 10:47:27] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-15 10:47:27] [INFO ] Invariant cache hit.
[2023-03-15 10:47:28] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 1068 ms. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2112 ms (no deadlock found). (steps per millisecond=591 )
Random directed walk for 1250000 steps, including 0 resets, run took 1600 ms (no deadlock found). (steps per millisecond=781 )
[2023-03-15 10:47:31] [INFO ] Invariant cache hit.
[2023-03-15 10:47:32] [INFO ] [Real]Absence check using 35 positive place invariants in 39 ms returned sat
[2023-03-15 10:47:32] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 133 ms returned sat
[2023-03-15 10:47:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:47:33] [INFO ] [Real]Absence check using state equation in 881 ms returned sat
[2023-03-15 10:47:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:47:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2023-03-15 10:47:33] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 37 ms returned sat
[2023-03-15 10:47:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:47:33] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2023-03-15 10:47:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 10:47:33] [INFO ] [Nat]Added 68 Read/Feed constraints in 27 ms returned sat
[2023-03-15 10:47:33] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 8 ms to minimize.
[2023-03-15 10:47:34] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 1 ms to minimize.
[2023-03-15 10:47:34] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2023-03-15 10:47:34] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2023-03-15 10:47:34] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2023-03-15 10:47:34] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2023-03-15 10:47:34] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2023-03-15 10:47:34] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2023-03-15 10:47:34] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2023-03-15 10:47:35] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2023-03-15 10:47:35] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2023-03-15 10:47:35] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2023-03-15 10:47:35] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 0 ms to minimize.
[2023-03-15 10:47:35] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 0 ms to minimize.
[2023-03-15 10:47:35] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 0 ms to minimize.
[2023-03-15 10:47:35] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2023-03-15 10:47:35] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2023-03-15 10:47:35] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1982 ms
[2023-03-15 10:47:35] [INFO ] Computed and/alt/rep : 196/512/196 causal constraints (skipped 5 transitions) in 18 ms.
[2023-03-15 10:47:37] [INFO ] Added : 169 causal constraints over 34 iterations in 1252 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
Parikh directed walk for 29800 steps, including 584 resets, run took 87 ms. (steps per millisecond=342 )
Random directed walk for 500000 steps, including 0 resets, run took 642 ms (no deadlock found). (steps per millisecond=778 )
Random walk for 500000 steps, including 0 resets, run took 704 ms (no deadlock found). (steps per millisecond=710 )
Random directed walk for 500000 steps, including 0 resets, run took 640 ms (no deadlock found). (steps per millisecond=781 )
Random walk for 500000 steps, including 0 resets, run took 699 ms (no deadlock found). (steps per millisecond=715 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 231/231 places, 202/202 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 11 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-15 10:47:39] [INFO ] Invariant cache hit.
[2023-03-15 10:47:40] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-15 10:47:40] [INFO ] Invariant cache hit.
[2023-03-15 10:47:40] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 10:47:40] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-15 10:47:40] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-15 10:47:40] [INFO ] Invariant cache hit.
[2023-03-15 10:47:40] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 660 ms. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1837 ms (no deadlock found). (steps per millisecond=680 )
Random directed walk for 1250001 steps, including 0 resets, run took 1608 ms (no deadlock found). (steps per millisecond=777 )
[2023-03-15 10:47:44] [INFO ] Invariant cache hit.
[2023-03-15 10:47:44] [INFO ] [Real]Absence check using 35 positive place invariants in 36 ms returned sat
[2023-03-15 10:47:44] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 138 ms returned sat
[2023-03-15 10:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:47:45] [INFO ] [Real]Absence check using state equation in 907 ms returned sat
[2023-03-15 10:47:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:47:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 20 ms returned sat
[2023-03-15 10:47:45] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 50 ms returned sat
[2023-03-15 10:47:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:47:45] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2023-03-15 10:47:45] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 10:47:45] [INFO ] [Nat]Added 68 Read/Feed constraints in 27 ms returned sat
[2023-03-15 10:47:45] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2023-03-15 10:47:46] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2023-03-15 10:47:46] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2023-03-15 10:47:46] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2023-03-15 10:47:46] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2023-03-15 10:47:46] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2023-03-15 10:47:46] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2023-03-15 10:47:46] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 0 ms to minimize.
[2023-03-15 10:47:46] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 0 ms to minimize.
[2023-03-15 10:47:46] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 0 ms to minimize.
[2023-03-15 10:47:47] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2023-03-15 10:47:47] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2023-03-15 10:47:47] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 0 ms to minimize.
[2023-03-15 10:47:47] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 0 ms to minimize.
[2023-03-15 10:47:47] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2023-03-15 10:47:47] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 2 ms to minimize.
[2023-03-15 10:47:47] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 6 ms to minimize.
[2023-03-15 10:47:47] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1882 ms
[2023-03-15 10:47:47] [INFO ] Computed and/alt/rep : 196/512/196 causal constraints (skipped 5 transitions) in 16 ms.
[2023-03-15 10:47:48] [INFO ] Added : 169 causal constraints over 34 iterations in 1080 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
Parikh directed walk for 29800 steps, including 617 resets, run took 62 ms. (steps per millisecond=480 )
Random directed walk for 500002 steps, including 0 resets, run took 651 ms (no deadlock found). (steps per millisecond=768 )
Random walk for 500000 steps, including 0 resets, run took 895 ms (no deadlock found). (steps per millisecond=558 )
Random directed walk for 500000 steps, including 0 resets, run took 651 ms (no deadlock found). (steps per millisecond=768 )
Random walk for 500000 steps, including 0 resets, run took 707 ms (no deadlock found). (steps per millisecond=707 )
[2023-03-15 10:47:52] [INFO ] Flatten gal took : 87 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 231/231 places, 202/202 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 64 place count 199 transition count 170
Applied a total of 64 rules in 20 ms. Remains 199 /231 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 199 cols
[2023-03-15 10:47:52] [INFO ] Computed 59 place invariants in 27 ms
[2023-03-15 10:47:52] [INFO ] Implicit Places using invariants in 378 ms returned [1, 2, 9, 14, 15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 71, 77, 78, 80, 93, 94, 96, 98, 99, 122, 137, 138, 140, 142, 143, 166, 168, 169, 172, 173, 178, 179, 181, 190]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 381 ms to find 46 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 153/231 places, 170/202 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 153 transition count 145
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 128 transition count 145
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 50 place count 128 transition count 136
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 68 place count 119 transition count 136
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
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 164 place count 71 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 70 transition count 87
Applied a total of 166 rules in 16 ms. Remains 70 /153 variables (removed 83) and now considering 87/170 (removed 83) transitions.
// Phase 1: matrix 87 rows 70 cols
[2023-03-15 10:47:52] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-15 10:47:52] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-15 10:47:52] [INFO ] Invariant cache hit.
[2023-03-15 10:47:52] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 10:47:52] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 70/231 places, 87/202 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 710 ms. Remains : 70/231 places, 87/202 transitions.
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=14 ) properties (out of 86) seen :62
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2023-03-15 10:47:54] [INFO ] Invariant cache hit.
[2023-03-15 10:47:54] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-15 10:47:54] [INFO ] After 387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-15 10:47:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-15 10:47:55] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-15 10:47:55] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 10:47:55] [INFO ] After 168ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-03-15 10:47:55] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2023-03-15 10:47:55] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-15 10:47:55] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-15 10:47:55] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2023-03-15 10:47:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 175 ms
[2023-03-15 10:47:55] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2023-03-15 10:47:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-15 10:47:55] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-15 10:47:55] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2023-03-15 10:47:55] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2023-03-15 10:47:55] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2023-03-15 10:47:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 149 ms
[2023-03-15 10:47:55] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2023-03-15 10:47:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-15 10:47:55] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2023-03-15 10:47:55] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2023-03-15 10:47:55] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2023-03-15 10:47:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 127 ms
[2023-03-15 10:47:55] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2023-03-15 10:47:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-15 10:47:55] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-15 10:47:55] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2023-03-15 10:47:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 70 ms
[2023-03-15 10:47:55] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2023-03-15 10:47:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-15 10:47:55] [INFO ] After 898ms SMT Verify possible using trap constraints in natural domain returned unsat :24 sat :0
[2023-03-15 10:47:55] [INFO ] After 1241ms SMT Verify possible using all constraints in natural domain returned unsat :24 sat :0
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 29163 ms.
ITS solved all properties within timeout

BK_STOP 1678877276737

--------------------
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

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="ParamProductionCell-PT-1"
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 ParamProductionCell-PT-1, 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-167863548600234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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