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.r279-smll-167863549800234.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 ltsminxred
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 r279-smll-167863549800234
=====================================================================

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

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=ltsminxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ParamProductionCell-PT-1
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 16:08:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2023-03-15 16:08:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 16:08:45] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2023-03-15 16:08:45] [INFO ] Transformed 231 places.
[2023-03-15 16:08:45] [INFO ] Transformed 202 transitions.
[2023-03-15 16:08:45] [INFO ] Found NUPN structural information;
[2023-03-15 16:08:45] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 304 ms.
Built sparse matrix representations for Structural reductions in 13 ms.24344KB 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 54 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 54 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 25 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 16:08:45] [INFO ] Computed 59 place invariants in 29 ms
[2023-03-15 16:08:46] [INFO ] Implicit Places using invariants in 454 ms returned []
[2023-03-15 16:08:46] [INFO ] Invariant cache hit.
[2023-03-15 16:08:46] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 16:08:46] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
[2023-03-15 16:08:46] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-15 16:08:46] [INFO ] Invariant cache hit.
[2023-03-15 16:08:46] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 1394 ms. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2061 ms (no deadlock found). (steps per millisecond=606 )
Random directed walk for 1250001 steps, including 0 resets, run took 1853 ms (no deadlock found). (steps per millisecond=674 )
[2023-03-15 16:08:50] [INFO ] Invariant cache hit.
[2023-03-15 16:08:51] [INFO ] [Real]Absence check using 35 positive place invariants in 60 ms returned sat
[2023-03-15 16:08:51] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 213 ms returned sat
[2023-03-15 16:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 16:08:52] [INFO ] [Real]Absence check using state equation in 1382 ms returned sat
[2023-03-15 16:08:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 16:08:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2023-03-15 16:08:52] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 39 ms returned sat
[2023-03-15 16:08:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 16:08:53] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2023-03-15 16:08:53] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 16:08:53] [INFO ] [Nat]Added 68 Read/Feed constraints in 38 ms returned sat
[2023-03-15 16:08:53] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 5 ms to minimize.
[2023-03-15 16:08:53] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 2 ms to minimize.
[2023-03-15 16:08:54] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 1 ms to minimize.
[2023-03-15 16:08:54] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2023-03-15 16:08:54] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2023-03-15 16:08:54] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 1 ms to minimize.
[2023-03-15 16:08:54] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2023-03-15 16:08:54] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 1 ms to minimize.
[2023-03-15 16:08:55] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 1 ms to minimize.
[2023-03-15 16:08:55] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 1 ms to minimize.
[2023-03-15 16:08:55] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 1 ms to minimize.
[2023-03-15 16:08:55] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 1 ms to minimize.
[2023-03-15 16:08:55] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 1 ms to minimize.
[2023-03-15 16:08:56] [INFO ] Deduced a trap composed of 57 places in 155 ms of which 1 ms to minimize.
[2023-03-15 16:08:56] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 1 ms to minimize.
[2023-03-15 16:08:56] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2023-03-15 16:08:56] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2023-03-15 16:08:56] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2999 ms
[2023-03-15 16:08:56] [INFO ] Computed and/alt/rep : 196/512/196 causal constraints (skipped 5 transitions) in 25 ms.
[2023-03-15 16:08:58] [INFO ] Added : 169 causal constraints over 34 iterations in 1513 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
Parikh directed walk for 29800 steps, including 590 resets, run took 140 ms. (steps per millisecond=212 )
Random directed walk for 500000 steps, including 0 resets, run took 978 ms (no deadlock found). (steps per millisecond=511 )
Random walk for 500000 steps, including 0 resets, run took 1146 ms (no deadlock found). (steps per millisecond=436 )
Random directed walk for 500000 steps, including 0 resets, run took 683 ms (no deadlock found). (steps per millisecond=732 )
Random walk for 500000 steps, including 0 resets, run took 1165 ms (no deadlock found). (steps per millisecond=429 )
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 21 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-15 16:09:02] [INFO ] Invariant cache hit.
[2023-03-15 16:09:02] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-15 16:09:02] [INFO ] Invariant cache hit.
[2023-03-15 16:09:02] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 16:09:02] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-15 16:09:02] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 16:09:02] [INFO ] Invariant cache hit.
[2023-03-15 16:09:03] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 920 ms. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1951 ms (no deadlock found). (steps per millisecond=640 )
Random directed walk for 1250002 steps, including 0 resets, run took 1734 ms (no deadlock found). (steps per millisecond=720 )
[2023-03-15 16:09:06] [INFO ] Invariant cache hit.
[2023-03-15 16:09:07] [INFO ] [Real]Absence check using 35 positive place invariants in 36 ms returned sat
[2023-03-15 16:09:07] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 233 ms returned sat
[2023-03-15 16:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 16:09:08] [INFO ] [Real]Absence check using state equation in 1380 ms returned sat
[2023-03-15 16:09:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 16:09:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2023-03-15 16:09:08] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 39 ms returned sat
[2023-03-15 16:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 16:09:09] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2023-03-15 16:09:09] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 16:09:09] [INFO ] [Nat]Added 68 Read/Feed constraints in 39 ms returned sat
[2023-03-15 16:09:09] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 1 ms to minimize.
[2023-03-15 16:09:09] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 1 ms to minimize.
[2023-03-15 16:09:09] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2023-03-15 16:09:09] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2023-03-15 16:09:10] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2023-03-15 16:09:10] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 1 ms to minimize.
[2023-03-15 16:09:10] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2023-03-15 16:09:10] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 1 ms to minimize.
[2023-03-15 16:09:10] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 1 ms to minimize.
[2023-03-15 16:09:11] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 1 ms to minimize.
[2023-03-15 16:09:11] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 1 ms to minimize.
[2023-03-15 16:09:11] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2023-03-15 16:09:11] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 0 ms to minimize.
[2023-03-15 16:09:11] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 0 ms to minimize.
[2023-03-15 16:09:11] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 0 ms to minimize.
[2023-03-15 16:09:12] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2023-03-15 16:09:12] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 8 ms to minimize.
[2023-03-15 16:09:12] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2934 ms
[2023-03-15 16:09:12] [INFO ] Computed and/alt/rep : 196/512/196 causal constraints (skipped 5 transitions) in 31 ms.
[2023-03-15 16:09:13] [INFO ] Added : 169 causal constraints over 34 iterations in 1440 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
Parikh directed walk for 29800 steps, including 583 resets, run took 99 ms. (steps per millisecond=301 )
Random directed walk for 500000 steps, including 0 resets, run took 918 ms (no deadlock found). (steps per millisecond=544 )
Random walk for 500000 steps, including 0 resets, run took 673 ms (no deadlock found). (steps per millisecond=742 )
Random directed walk for 500000 steps, including 0 resets, run took 610 ms (no deadlock found). (steps per millisecond=819 )
Random walk for 500000 steps, including 0 resets, run took 683 ms (no deadlock found). (steps per millisecond=732 )
[2023-03-15 16:09:17] [INFO ] Flatten gal took : 88 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 1 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 23 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 16:09:17] [INFO ] Computed 59 place invariants in 10 ms
[2023-03-15 16:09:17] [INFO ] Implicit Places using invariants in 567 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 574 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 20 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 16:09:17] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-15 16:09:17] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-15 16:09:17] [INFO ] Invariant cache hit.
[2023-03-15 16:09:17] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 16:09:18] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 423 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 1040 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 905 ms. (steps per millisecond=11 ) properties (out of 86) seen :62
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 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 44 ms. (steps per millisecond=22 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 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 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 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 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 37 ms. (steps per millisecond=27 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 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 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 31 ms. (steps per millisecond=32 ) 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 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 37 ms. (steps per millisecond=27 ) 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 19 ms. (steps per millisecond=52 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 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 22 ms. (steps per millisecond=45 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) 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 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
Running SMT prover for 24 properties.
[2023-03-15 16:09:19] [INFO ] Invariant cache hit.
[2023-03-15 16:09:19] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-15 16:09:20] [INFO ] After 433ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-15 16:09:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 16:09:20] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-15 16:09:20] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 16:09:20] [INFO ] After 243ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-03-15 16:09:20] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2023-03-15 16:09:20] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-15 16:09:21] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2023-03-15 16:09:21] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2023-03-15 16:09:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 197 ms
[2023-03-15 16:09:21] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2023-03-15 16:09:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 58 ms
[2023-03-15 16:09:21] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-15 16:09:21] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2023-03-15 16:09:21] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2023-03-15 16:09:21] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2023-03-15 16:09:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 205 ms
[2023-03-15 16:09:21] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2023-03-15 16:09:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-15 16:09:21] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2023-03-15 16:09:21] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2023-03-15 16:09:21] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2023-03-15 16:09:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 177 ms
[2023-03-15 16:09:21] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2023-03-15 16:09:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 61 ms
[2023-03-15 16:09:21] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
[2023-03-15 16:09:21] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2023-03-15 16:09:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 97 ms
[2023-03-15 16:09:21] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2023-03-15 16:09:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-15 16:09:21] [INFO ] After 1223ms SMT Verify possible using trap constraints in natural domain returned unsat :24 sat :0
[2023-03-15 16:09:21] [INFO ] After 1648ms SMT Verify possible using all constraints in natural domain returned unsat :24 sat :0
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 36879 ms.
ITS solved all properties within timeout

BK_STOP 1678896562932

--------------------
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="ltsminxred"
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 ltsminxred"
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 r279-smll-167863549800234"
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 ;