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.r297-tall-167873950900799.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 ProductionCell-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950900799
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.4K Feb 25 14:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 14:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 14:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 14:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 14:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 14:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 43K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME ProductionCell-PT-none-ReachabilityFireability-00
FORMULA_NAME ProductionCell-PT-none-ReachabilityFireability-01
FORMULA_NAME ProductionCell-PT-none-ReachabilityFireability-02
FORMULA_NAME ProductionCell-PT-none-ReachabilityFireability-03
FORMULA_NAME ProductionCell-PT-none-ReachabilityFireability-04
FORMULA_NAME ProductionCell-PT-none-ReachabilityFireability-05
FORMULA_NAME ProductionCell-PT-none-ReachabilityFireability-06
FORMULA_NAME ProductionCell-PT-none-ReachabilityFireability-07
FORMULA_NAME ProductionCell-PT-none-ReachabilityFireability-08
FORMULA_NAME ProductionCell-PT-none-ReachabilityFireability-09
FORMULA_NAME ProductionCell-PT-none-ReachabilityFireability-10
FORMULA_NAME ProductionCell-PT-none-ReachabilityFireability-11
FORMULA_NAME ProductionCell-PT-none-ReachabilityFireability-12
FORMULA_NAME ProductionCell-PT-none-ReachabilityFireability-13
FORMULA_NAME ProductionCell-PT-none-ReachabilityFireability-14
FORMULA_NAME ProductionCell-PT-none-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679653736338

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ProductionCell-PT-none
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 10:28:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 10:28:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 10:28:58] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2023-03-24 10:28:58] [INFO ] Transformed 176 places.
[2023-03-24 10:28:58] [INFO ] Transformed 134 transitions.
[2023-03-24 10:28:58] [INFO ] Found NUPN structural information;
[2023-03-24 10:28:58] [INFO ] Parsed PT model containing 176 places and 134 transitions and 513 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 16) seen :12
FORMULA ProductionCell-PT-none-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ProductionCell-PT-none-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ProductionCell-PT-none-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ProductionCell-PT-none-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ProductionCell-PT-none-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ProductionCell-PT-none-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ProductionCell-PT-none-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ProductionCell-PT-none-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ProductionCell-PT-none-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ProductionCell-PT-none-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ProductionCell-PT-none-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ProductionCell-PT-none-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :1
FORMULA ProductionCell-PT-none-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 134 rows 176 cols
[2023-03-24 10:28:59] [INFO ] Computed 50 place invariants in 20 ms
[2023-03-24 10:28:59] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-24 10:28:59] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned sat
[2023-03-24 10:28:59] [INFO ] [Nat]Absence check using 32 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-24 10:28:59] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-24 10:28:59] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 6 ms to minimize.
[2023-03-24 10:28:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-24 10:28:59] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2023-03-24 10:29:00] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2023-03-24 10:29:00] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
[2023-03-24 10:29:00] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2023-03-24 10:29:00] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2023-03-24 10:29:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 262 ms
[2023-03-24 10:29:00] [INFO ] After 548ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-24 10:29:00] [INFO ] After 795ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA ProductionCell-PT-none-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 37 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 134/134 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 176 transition count 114
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 41 rules applied. Total rules applied 41 place count 155 transition count 114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 41 place count 155 transition count 113
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 43 place count 154 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 44 place count 153 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 45 place count 153 transition count 112
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 53 place count 149 transition count 108
Applied a total of 53 rules in 41 ms. Remains 149 /176 variables (removed 27) and now considering 108/134 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 149/176 places, 108/134 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1242811 steps, run timeout after 3001 ms. (steps per millisecond=414 ) properties seen :{1=1}
Probabilistic random walk after 1242811 steps, saw 786676 distinct states, run finished after 3001 ms. (steps per millisecond=414 ) properties seen :1
FORMULA ProductionCell-PT-none-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 108 rows 149 cols
[2023-03-24 10:29:03] [INFO ] Computed 49 place invariants in 8 ms
[2023-03-24 10:29:03] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 10:29:03] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-24 10:29:03] [INFO ] [Nat]Absence check using 32 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-24 10:29:03] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 10:29:03] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2023-03-24 10:29:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-24 10:29:03] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-24 10:29:03] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 19 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 108/108 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 149 transition count 102
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 142 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 141 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 141 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 140 transition count 100
Applied a total of 17 rules in 32 ms. Remains 140 /149 variables (removed 9) and now considering 100/108 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 140/149 places, 100/108 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1543464 steps, run timeout after 3001 ms. (steps per millisecond=514 ) properties seen :{}
Probabilistic random walk after 1543464 steps, saw 876346 distinct states, run finished after 3002 ms. (steps per millisecond=514 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 100 rows 140 cols
[2023-03-24 10:29:06] [INFO ] Computed 48 place invariants in 8 ms
[2023-03-24 10:29:06] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 10:29:07] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-24 10:29:07] [INFO ] [Nat]Absence check using 33 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-24 10:29:07] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 10:29:07] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-24 10:29:07] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 19 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 140/140 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-24 10:29:07] [INFO ] Invariant cache hit.
[2023-03-24 10:29:07] [INFO ] Implicit Places using invariants in 99 ms returned [23, 31, 36, 82, 83, 84, 99, 103, 104, 107]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 101 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 130/140 places, 100/100 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 129 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 129 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 128 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 128 transition count 97
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 125 transition count 94
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 125 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 124 transition count 93
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 93
Applied a total of 13 rules in 23 ms. Remains 124 /130 variables (removed 6) and now considering 93/100 (removed 7) transitions.
// Phase 1: matrix 93 rows 124 cols
[2023-03-24 10:29:07] [INFO ] Computed 38 place invariants in 2 ms
[2023-03-24 10:29:07] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-24 10:29:07] [INFO ] Invariant cache hit.
[2023-03-24 10:29:07] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 124/140 places, 93/100 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 349 ms. Remains : 124/140 places, 93/100 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1457441 steps, run timeout after 3001 ms. (steps per millisecond=485 ) properties seen :{}
Probabilistic random walk after 1457441 steps, saw 825691 distinct states, run finished after 3004 ms. (steps per millisecond=485 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 10:29:10] [INFO ] Invariant cache hit.
[2023-03-24 10:29:10] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 10:29:10] [INFO ] [Nat]Absence check using 31 positive place invariants in 6 ms returned sat
[2023-03-24 10:29:10] [INFO ] [Nat]Absence check using 31 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 10:29:10] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 10:29:10] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2023-03-24 10:29:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-24 10:29:10] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-24 10:29:10] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 19 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 93/93 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 93/93 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 124/124 places, 93/93 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 93/93 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2023-03-24 10:29:10] [INFO ] Invariant cache hit.
[2023-03-24 10:29:10] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-24 10:29:10] [INFO ] Invariant cache hit.
[2023-03-24 10:29:11] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-24 10:29:11] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-24 10:29:11] [INFO ] Invariant cache hit.
[2023-03-24 10:29:11] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 306 ms. Remains : 124/124 places, 93/93 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 93/93 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-24 10:29:11] [INFO ] Invariant cache hit.
[2023-03-24 10:29:11] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 10:29:11] [INFO ] [Nat]Absence check using 31 positive place invariants in 5 ms returned sat
[2023-03-24 10:29:11] [INFO ] [Nat]Absence check using 31 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-24 10:29:11] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 10:29:11] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2023-03-24 10:29:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-24 10:29:11] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-24 10:29:11] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-24 10:29:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-24 10:29:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 124 places, 93 transitions and 390 arcs took 2 ms.
[2023-03-24 10:29:11] [INFO ] Flatten gal took : 37 ms
Total runtime 13267 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/540/inv_0_ --inv-par
FORMULA ProductionCell-PT-none-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679653808800

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name ProductionCell-PT-none-ReachabilityFireability-07
rfs formula type AG
rfs formula formula --invariant=/tmp/540/inv_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 124 places, 93 transitions and 390 arcs
pnml2lts-sym: Petri net ProductionCell_PT_none analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 93->81 groups
pnml2lts-sym: Regrouping took 0.030 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 124; there are 81 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/540/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 22.800 real 85.890 user 5.010 sys
pnml2lts-sym: max token count: 1

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="ProductionCell-PT-none"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 ProductionCell-PT-none, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950900799"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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