About the Execution of LTSMin+red for BART-COL-002
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
771.212 | 13000.00 | 35719.00 | 52.40 | TFTFFTTFFFTFFFTT | normal |
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.r009-oct2-167813598300690.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 BART-COL-002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598300690
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.2K Feb 26 04:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 04:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 03:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 03:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 04:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 04:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 04:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 04:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 184K Mar 5 18:22 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 BART-COL-002-CTLFireability-00
FORMULA_NAME BART-COL-002-CTLFireability-01
FORMULA_NAME BART-COL-002-CTLFireability-02
FORMULA_NAME BART-COL-002-CTLFireability-03
FORMULA_NAME BART-COL-002-CTLFireability-04
FORMULA_NAME BART-COL-002-CTLFireability-05
FORMULA_NAME BART-COL-002-CTLFireability-06
FORMULA_NAME BART-COL-002-CTLFireability-07
FORMULA_NAME BART-COL-002-CTLFireability-08
FORMULA_NAME BART-COL-002-CTLFireability-09
FORMULA_NAME BART-COL-002-CTLFireability-10
FORMULA_NAME BART-COL-002-CTLFireability-11
FORMULA_NAME BART-COL-002-CTLFireability-12
FORMULA_NAME BART-COL-002-CTLFireability-13
FORMULA_NAME BART-COL-002-CTLFireability-14
FORMULA_NAME BART-COL-002-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678643051015
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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-COL-002
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:44:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:44:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:44:13] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-12 17:44:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 17:44:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1161 ms
[2023-03-12 17:44:15] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2023-03-12 17:44:15] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 10865 PT places and 2.814459024E9 transition bindings in 99 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
[2023-03-12 17:44:15] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 4 ms.
[2023-03-12 17:44:15] [INFO ] Skeletonized 1 HLPN properties in 1 ms. Removed 15 properties that had guard overlaps.
Computed a total of 4 stabilizing places and 2 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
Arc [2:1*[(MOD (ADD $tsp 1) 6), $ds2]] contains successor/predecessor on variables of sort speed
Symmetric sort wr.t. initial and guards and successors and join/free detected :trainid
Symmetric sort wr.t. initial detected :trainid
Symmetric sort wr.t. initial and guards detected :trainid
Applying symmetric unfolding of full symmetric sort :trainid domain size was 2
[2023-03-12 17:44:16] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 1580 ms.
[2023-03-12 17:44:16] [INFO ] Unfolded 16 HLPN properties in 2 ms.
[2023-03-12 17:44:16] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:44:16] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:44:16] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:44:16] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:44:16] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:44:16] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:44:16] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:44:16] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:44:16] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:44:16] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:44:16] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:44:16] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:44:16] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:44:16] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:44:16] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:44:16] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:44:16] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:44:16] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 17:44:16] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 1 ms
Reduce places removed 10487 places and 121 transitions.
Support contains 132 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 7 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2023-03-12 17:44:16] [INFO ] Computed 1 place invariants in 7 ms
[2023-03-12 17:44:17] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-12 17:44:17] [INFO ] Invariant cache hit.
[2023-03-12 17:44:17] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
[2023-03-12 17:44:17] [INFO ] Invariant cache hit.
[2023-03-12 17:44:18] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1359 ms. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2023-03-12 17:44:18] [INFO ] Flatten gal took : 50 ms
[2023-03-12 17:44:18] [INFO ] Flatten gal took : 47 ms
[2023-03-12 17:44:18] [INFO ] Input system was already deterministic with 202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 23) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 17:44:19] [INFO ] Invariant cache hit.
[2023-03-12 17:44:19] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BART-COL-002-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 17:44:19] [INFO ] Flatten gal took : 15 ms
[2023-03-12 17:44:19] [INFO ] Flatten gal took : 21 ms
[2023-03-12 17:44:19] [INFO ] Input system was already deterministic with 202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 132/132 places, 202/202 transitions.
[2023-03-12 17:44:19] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:44:19] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:44:19] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 132/132 places, 202/202 transitions.
[2023-03-12 17:44:19] [INFO ] Flatten gal took : 8 ms
[2023-03-12 17:44:19] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:44:19] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 132/132 places, 202/202 transitions.
[2023-03-12 17:44:19] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:44:20] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 132/132 places, 202/202 transitions.
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:44:20] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 100 transition count 170
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 100 transition count 170
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 91 place count 73 transition count 143
Iterating global reduction 0 with 27 rules applied. Total rules applied 118 place count 73 transition count 143
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 122 place count 69 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 126 place count 69 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 66 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 66 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 135 place count 63 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 138 place count 63 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 141 place count 60 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 144 place count 60 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 57 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 57 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 153 place count 54 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 156 place count 54 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 158 place count 52 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 160 place count 52 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 162 place count 50 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 164 place count 50 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 49 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 49 transition count 119
Applied a total of 166 rules in 28 ms. Remains 49 /132 variables (removed 83) and now considering 119/202 (removed 83) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 49/132 places, 119/202 transitions.
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 4 ms
[2023-03-12 17:44:20] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Graph (trivial) has 44 edges and 132 vertex of which 6 / 132 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 127 transition count 196
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 10 rules applied. Total rules applied 12 place count 126 transition count 187
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 21 place count 117 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 117 transition count 185
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 115 transition count 185
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 30 place count 110 transition count 180
Iterating global reduction 3 with 5 rules applied. Total rules applied 35 place count 110 transition count 180
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 38 place count 107 transition count 177
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 107 transition count 177
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 104 transition count 174
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 104 transition count 174
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 50 place count 101 transition count 171
Iterating global reduction 3 with 3 rules applied. Total rules applied 53 place count 101 transition count 171
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 99 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 99 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 59 place count 97 transition count 167
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 97 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 96 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 96 transition count 166
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 77 place count 89 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 89 transition count 158
Applied a total of 78 rules in 38 ms. Remains 89 /132 variables (removed 43) and now considering 158/202 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 89/132 places, 158/202 transitions.
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 4 ms
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 4 ms
[2023-03-12 17:44:20] [INFO ] Input system was already deterministic with 158 transitions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 0 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 132/132 places, 202/202 transitions.
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:44:20] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 132/132 places, 202/202 transitions.
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:44:20] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 132/132 places, 202/202 transitions.
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:44:20] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 132/132 places, 202/202 transitions.
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:44:20] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 200
Reduce places removed 2 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 11 rules applied. Total rules applied 13 place count 130 transition count 191
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 22 place count 121 transition count 191
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 22 place count 121 transition count 187
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 111 transition count 181
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 111 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 111 transition count 180
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 46 place count 108 transition count 177
Iterating global reduction 4 with 3 rules applied. Total rules applied 49 place count 108 transition count 177
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 52 place count 105 transition count 174
Iterating global reduction 4 with 3 rules applied. Total rules applied 55 place count 105 transition count 174
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 58 place count 102 transition count 171
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 102 transition count 171
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 63 place count 100 transition count 169
Iterating global reduction 4 with 2 rules applied. Total rules applied 65 place count 100 transition count 169
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 67 place count 98 transition count 167
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 98 transition count 167
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 97 transition count 166
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 97 transition count 166
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 83 place count 91 transition count 160
Applied a total of 83 rules in 16 ms. Remains 91 /132 variables (removed 41) and now considering 160/202 (removed 42) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 91/132 places, 160/202 transitions.
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 4 ms
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 4 ms
[2023-03-12 17:44:20] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 3 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 90/132 places, 160/202 transitions.
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 4 ms
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 4 ms
[2023-03-12 17:44:20] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 0 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 132/132 places, 202/202 transitions.
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:44:20] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 2 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 129/132 places, 199/202 transitions.
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:44:20] [INFO ] Input system was already deterministic with 199 transitions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 132/132 places, 202/202 transitions.
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:44:20] [INFO ] Input system was already deterministic with 202 transitions.
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 16 ms
[2023-03-12 17:44:20] [INFO ] Flatten gal took : 29 ms
[2023-03-12 17:44:20] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 49 ms.
[2023-03-12 17:44:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 132 places, 202 transitions and 404 arcs took 1 ms.
Total runtime 7017 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 --ctl=/tmp/489/ctl_0_ --ctl=/tmp/489/ctl_1_ --ctl=/tmp/489/ctl_2_ --ctl=/tmp/489/ctl_3_ --ctl=/tmp/489/ctl_4_ --ctl=/tmp/489/ctl_5_ --ctl=/tmp/489/ctl_6_ --ctl=/tmp/489/ctl_7_ --ctl=/tmp/489/ctl_8_ --ctl=/tmp/489/ctl_9_ --ctl=/tmp/489/ctl_10_ --ctl=/tmp/489/ctl_11_ --ctl=/tmp/489/ctl_12_ --ctl=/tmp/489/ctl_13_ --ctl=/tmp/489/ctl_14_ --mu-par --mu-opt
FORMULA BART-COL-002-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BART-COL-002-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BART-COL-002-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BART-COL-002-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BART-COL-002-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BART-COL-002-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BART-COL-002-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BART-COL-002-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BART-COL-002-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BART-COL-002-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BART-COL-002-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BART-COL-002-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BART-COL-002-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BART-COL-002-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BART-COL-002-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
BK_STOP 1678643064015
--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name BART-COL-002-CTLFireability-00
ctl formula formula --ctl=/tmp/489/ctl_0_
ctl formula name BART-COL-002-CTLFireability-01
ctl formula formula --ctl=/tmp/489/ctl_1_
ctl formula name BART-COL-002-CTLFireability-02
ctl formula formula --ctl=/tmp/489/ctl_2_
ctl formula name BART-COL-002-CTLFireability-03
ctl formula formula --ctl=/tmp/489/ctl_3_
ctl formula name BART-COL-002-CTLFireability-04
ctl formula formula --ctl=/tmp/489/ctl_4_
ctl formula name BART-COL-002-CTLFireability-05
ctl formula formula --ctl=/tmp/489/ctl_5_
ctl formula name BART-COL-002-CTLFireability-07
ctl formula formula --ctl=/tmp/489/ctl_6_
ctl formula name BART-COL-002-CTLFireability-08
ctl formula formula --ctl=/tmp/489/ctl_7_
ctl formula name BART-COL-002-CTLFireability-09
ctl formula formula --ctl=/tmp/489/ctl_8_
ctl formula name BART-COL-002-CTLFireability-10
ctl formula formula --ctl=/tmp/489/ctl_9_
ctl formula name BART-COL-002-CTLFireability-11
ctl formula formula --ctl=/tmp/489/ctl_10_
ctl formula name BART-COL-002-CTLFireability-12
ctl formula formula --ctl=/tmp/489/ctl_11_
ctl formula name BART-COL-002-CTLFireability-13
ctl formula formula --ctl=/tmp/489/ctl_12_
ctl formula name BART-COL-002-CTLFireability-14
ctl formula formula --ctl=/tmp/489/ctl_13_
ctl formula name BART-COL-002-CTLFireability-15
ctl formula formula --ctl=/tmp/489/ctl_14_
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 132 places, 202 transitions and 404 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 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: 202->202 groups
pnml2lts-sym: Regrouping took 0.020 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 132; there are 202 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: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 1555 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.060 real 0.200 user 0.030 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.010 user 0.000 sys
pnml2lts-sym: state space has 8778 states, 786 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/489/ctl_14_ holds for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_13_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/489/ctl_3_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_4_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_5_ holds for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_12_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_2_ holds for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_0_ holds for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_11_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_7_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_6_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_8_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_10_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_9_ holds for the initial state
pnml2lts-sym: group_next: 2020 nodes total
pnml2lts-sym: group_explored: 1818 nodes, 1212 short vectors total
pnml2lts-sym: max token count: 2
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BART-COL-002"
export BK_EXAMINATION="CTLFireability"
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 BART-COL-002, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813598300690"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BART-COL-002.tgz
mv BART-COL-002 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;