About the Execution of Marcie+red for SmartHome-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5983.655 | 37327.00 | 46722.00 | 960.30 | FFFTTTTFFTTTTTTT | 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.r458-smll-167912650000217.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 marciexred
Input is SmartHome-PT-09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650000217
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.9K Feb 26 05:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 05:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 05:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 05:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 17:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 05:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 05:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 05:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 05:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 64K 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 SmartHome-PT-09-CTLCardinality-00
FORMULA_NAME SmartHome-PT-09-CTLCardinality-01
FORMULA_NAME SmartHome-PT-09-CTLCardinality-02
FORMULA_NAME SmartHome-PT-09-CTLCardinality-03
FORMULA_NAME SmartHome-PT-09-CTLCardinality-04
FORMULA_NAME SmartHome-PT-09-CTLCardinality-05
FORMULA_NAME SmartHome-PT-09-CTLCardinality-06
FORMULA_NAME SmartHome-PT-09-CTLCardinality-07
FORMULA_NAME SmartHome-PT-09-CTLCardinality-08
FORMULA_NAME SmartHome-PT-09-CTLCardinality-09
FORMULA_NAME SmartHome-PT-09-CTLCardinality-10
FORMULA_NAME SmartHome-PT-09-CTLCardinality-11
FORMULA_NAME SmartHome-PT-09-CTLCardinality-12
FORMULA_NAME SmartHome-PT-09-CTLCardinality-13
FORMULA_NAME SmartHome-PT-09-CTLCardinality-14
FORMULA_NAME SmartHome-PT-09-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679311596738
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=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-09
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 11:26:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 11:26:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:26:39] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-20 11:26:39] [INFO ] Transformed 253 places.
[2023-03-20 11:26:39] [INFO ] Transformed 293 transitions.
[2023-03-20 11:26:39] [INFO ] Found NUPN structural information;
[2023-03-20 11:26:39] [INFO ] Parsed PT model containing 253 places and 293 transitions and 664 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 29 places in 7 ms
Reduce places removed 29 places and 30 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SmartHome-PT-09-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 263/263 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 221 transition count 263
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 42 place count 182 transition count 224
Iterating global reduction 1 with 39 rules applied. Total rules applied 81 place count 182 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 85 place count 182 transition count 220
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 89 place count 178 transition count 216
Iterating global reduction 2 with 4 rules applied. Total rules applied 93 place count 178 transition count 216
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 96 place count 175 transition count 213
Iterating global reduction 2 with 3 rules applied. Total rules applied 99 place count 175 transition count 213
Applied a total of 99 rules in 71 ms. Remains 175 /224 variables (removed 49) and now considering 213/263 (removed 50) transitions.
// Phase 1: matrix 213 rows 175 cols
[2023-03-20 11:26:40] [INFO ] Computed 7 place invariants in 19 ms
[2023-03-20 11:26:40] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-20 11:26:40] [INFO ] Invariant cache hit.
[2023-03-20 11:26:40] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
[2023-03-20 11:26:40] [INFO ] Invariant cache hit.
[2023-03-20 11:26:41] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 175/224 places, 213/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1158 ms. Remains : 175/224 places, 213/263 transitions.
Support contains 67 out of 175 places after structural reductions.
[2023-03-20 11:26:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 11:26:41] [INFO ] Flatten gal took : 97 ms
FORMULA SmartHome-PT-09-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 11:26:41] [INFO ] Flatten gal took : 35 ms
[2023-03-20 11:26:41] [INFO ] Input system was already deterministic with 213 transitions.
Support contains 59 out of 175 places (down from 67) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 722 ms. (steps per millisecond=13 ) properties (out of 42) seen :34
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 11:26:42] [INFO ] Invariant cache hit.
[2023-03-20 11:26:43] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-20 11:26:43] [INFO ] After 123ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-20 11:26:43] [INFO ] After 154ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 11:26:43] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 11:26:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-20 11:26:43] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 11:26:43] [INFO ] After 335ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-20 11:26:43] [INFO ] After 599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 27 ms.
Support contains 7 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 213/213 transitions.
Graph (trivial) has 165 edges and 175 vertex of which 61 / 175 are part of one of the 6 SCC in 7 ms
Free SCC test removed 55 places
Drop transitions removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Graph (complete) has 183 edges and 120 vertex of which 117 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 117 transition count 89
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 51 rules applied. Total rules applied 99 place count 74 transition count 81
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 106 place count 70 transition count 78
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 109 place count 67 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 109 place count 67 transition count 73
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 119 place count 62 transition count 73
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 127 place count 54 transition count 65
Iterating global reduction 4 with 8 rules applied. Total rules applied 135 place count 54 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 137 place count 54 transition count 63
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 137 place count 54 transition count 62
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 139 place count 53 transition count 62
Performed 22 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 183 place count 31 transition count 37
Drop transitions removed 10 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 51 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 12 rules applied. Total rules applied 195 place count 30 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 196 place count 29 transition count 25
Reduce places removed 4 places and 0 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 6 with 5 rules applied. Total rules applied 201 place count 25 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 202 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 202 place count 24 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 206 place count 22 transition count 22
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 8 with 2 rules applied. Total rules applied 208 place count 21 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 209 place count 21 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 210 place count 20 transition count 20
Applied a total of 210 rules in 67 ms. Remains 20 /175 variables (removed 155) and now considering 20/213 (removed 193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 20/175 places, 20/213 transitions.
Finished random walk after 92 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=46 )
[2023-03-20 11:26:43] [INFO ] Flatten gal took : 23 ms
[2023-03-20 11:26:43] [INFO ] Flatten gal took : 22 ms
[2023-03-20 11:26:43] [INFO ] Input system was already deterministic with 213 transitions.
Computed a total of 47 stabilizing places and 46 stable transitions
Graph (complete) has 268 edges and 175 vertex of which 171 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 213/213 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 172 transition count 213
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 150 transition count 191
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 150 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 150 transition count 189
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 57 place count 142 transition count 181
Iterating global reduction 2 with 8 rules applied. Total rules applied 65 place count 142 transition count 181
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 72 place count 135 transition count 174
Iterating global reduction 2 with 7 rules applied. Total rules applied 79 place count 135 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 135 transition count 173
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 83 place count 132 transition count 170
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 132 transition count 170
Applied a total of 86 rules in 28 ms. Remains 132 /175 variables (removed 43) and now considering 170/213 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 132/175 places, 170/213 transitions.
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 16 ms
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 16 ms
[2023-03-20 11:26:44] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 213/213 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 171 transition count 213
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 30 place count 145 transition count 187
Iterating global reduction 1 with 26 rules applied. Total rules applied 56 place count 145 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 145 transition count 185
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 68 place count 135 transition count 175
Iterating global reduction 2 with 10 rules applied. Total rules applied 78 place count 135 transition count 175
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 85 place count 128 transition count 168
Iterating global reduction 2 with 7 rules applied. Total rules applied 92 place count 128 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 128 transition count 167
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 98 place count 123 transition count 162
Iterating global reduction 3 with 5 rules applied. Total rules applied 103 place count 123 transition count 162
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 122 transition count 161
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 122 transition count 161
Applied a total of 105 rules in 24 ms. Remains 122 /175 variables (removed 53) and now considering 161/213 (removed 52) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 122/175 places, 161/213 transitions.
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 13 ms
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 14 ms
[2023-03-20 11:26:44] [INFO ] Input system was already deterministic with 161 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 213/213 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 171 transition count 213
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 29 place count 146 transition count 188
Iterating global reduction 1 with 25 rules applied. Total rules applied 54 place count 146 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 146 transition count 186
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 66 place count 136 transition count 176
Iterating global reduction 2 with 10 rules applied. Total rules applied 76 place count 136 transition count 176
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 83 place count 129 transition count 169
Iterating global reduction 2 with 7 rules applied. Total rules applied 90 place count 129 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 129 transition count 168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 125 transition count 164
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 125 transition count 164
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 124 transition count 163
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 124 transition count 163
Applied a total of 101 rules in 23 ms. Remains 124 /175 variables (removed 51) and now considering 163/213 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 124/175 places, 163/213 transitions.
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 13 ms
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 14 ms
[2023-03-20 11:26:44] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 213/213 transitions.
Graph (trivial) has 174 edges and 175 vertex of which 80 / 175 are part of one of the 6 SCC in 1 ms
Free SCC test removed 74 places
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Graph (complete) has 173 edges and 101 vertex of which 97 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 96 transition count 83
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 42 rules applied. Total rules applied 79 place count 61 transition count 76
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 83 place count 58 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 57 transition count 75
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 84 place count 57 transition count 69
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 96 place count 51 transition count 69
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 103 place count 44 transition count 62
Iterating global reduction 4 with 7 rules applied. Total rules applied 110 place count 44 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 112 place count 44 transition count 60
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 144 place count 28 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 146 place count 28 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 150 place count 26 transition count 40
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 159 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 160 place count 25 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 160 place count 25 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 162 place count 24 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 163 place count 23 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 164 place count 22 transition count 29
Applied a total of 164 rules in 32 ms. Remains 22 /175 variables (removed 153) and now considering 29/213 (removed 184) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 22/175 places, 29/213 transitions.
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 3 ms
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 2 ms
[2023-03-20 11:26:44] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 213/213 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 171 transition count 213
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 29 place count 146 transition count 188
Iterating global reduction 1 with 25 rules applied. Total rules applied 54 place count 146 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 146 transition count 186
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 66 place count 136 transition count 176
Iterating global reduction 2 with 10 rules applied. Total rules applied 76 place count 136 transition count 176
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 83 place count 129 transition count 169
Iterating global reduction 2 with 7 rules applied. Total rules applied 90 place count 129 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 129 transition count 168
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 96 place count 124 transition count 163
Iterating global reduction 3 with 5 rules applied. Total rules applied 101 place count 124 transition count 163
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 123 transition count 162
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 123 transition count 162
Applied a total of 103 rules in 30 ms. Remains 123 /175 variables (removed 52) and now considering 162/213 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 123/175 places, 162/213 transitions.
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 13 ms
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 13 ms
[2023-03-20 11:26:44] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 213/213 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 173 transition count 213
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 152 transition count 192
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 152 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 152 transition count 191
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 51 place count 146 transition count 185
Iterating global reduction 2 with 6 rules applied. Total rules applied 57 place count 146 transition count 185
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 142 transition count 181
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 142 transition count 181
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 140 transition count 179
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 140 transition count 179
Applied a total of 69 rules in 20 ms. Remains 140 /175 variables (removed 35) and now considering 179/213 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 140/175 places, 179/213 transitions.
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 13 ms
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 13 ms
[2023-03-20 11:26:44] [INFO ] Input system was already deterministic with 179 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 213/213 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 172 transition count 213
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 148 transition count 189
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 148 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 148 transition count 187
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 61 place count 140 transition count 179
Iterating global reduction 2 with 8 rules applied. Total rules applied 69 place count 140 transition count 179
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 74 place count 135 transition count 174
Iterating global reduction 2 with 5 rules applied. Total rules applied 79 place count 135 transition count 174
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 83 place count 131 transition count 170
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 131 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 130 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 130 transition count 169
Applied a total of 89 rules in 21 ms. Remains 130 /175 variables (removed 45) and now considering 169/213 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 130/175 places, 169/213 transitions.
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 12 ms
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 12 ms
[2023-03-20 11:26:44] [INFO ] Input system was already deterministic with 169 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 213/213 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 172 transition count 213
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 153 transition count 194
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 153 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 153 transition count 193
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 50 place count 145 transition count 185
Iterating global reduction 2 with 8 rules applied. Total rules applied 58 place count 145 transition count 185
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 62 place count 141 transition count 181
Iterating global reduction 2 with 4 rules applied. Total rules applied 66 place count 141 transition count 181
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 137 transition count 177
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 137 transition count 177
Applied a total of 74 rules in 27 ms. Remains 137 /175 variables (removed 38) and now considering 177/213 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 137/175 places, 177/213 transitions.
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 13 ms
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 13 ms
[2023-03-20 11:26:44] [INFO ] Input system was already deterministic with 177 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 213/213 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 171 transition count 213
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 23 place count 152 transition count 194
Iterating global reduction 1 with 19 rules applied. Total rules applied 42 place count 152 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 152 transition count 192
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 52 place count 144 transition count 184
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 144 transition count 184
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 65 place count 139 transition count 179
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 139 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 139 transition count 178
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 74 place count 136 transition count 175
Iterating global reduction 3 with 3 rules applied. Total rules applied 77 place count 136 transition count 175
Applied a total of 77 rules in 14 ms. Remains 136 /175 variables (removed 39) and now considering 175/213 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 136/175 places, 175/213 transitions.
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:26:44] [INFO ] Input system was already deterministic with 175 transitions.
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 11 ms
[2023-03-20 11:26:44] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:26:44] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-20 11:26:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 175 places, 213 transitions and 481 arcs took 1 ms.
Total runtime 5130 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 175 NrTr: 213 NrArc: 481)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.003sec
net check time: 0m 0.000sec
init dd package: 0m 3.424sec
RS generation: 0m 1.704sec
-> reachability set: #nodes 20060 (2.0e+04) #states 18,876,919,019 (10)
starting MCC model checker
--------------------------
checking: EF [AG [[p55<=0 & 0<=p55]]]
normalized: E [true U ~ [E [true U ~ [[p55<=0 & 0<=p55]]]]]
abstracting: (0<=p55)
states: 18,876,919,019 (10)
abstracting: (p55<=0)
states: 18,109,588,651 (10)
-> the formula is TRUE
FORMULA SmartHome-PT-09-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.849sec
checking: EX [AG [[EF [AG [~ [[p75<=0 & 0<=p75]]]] & [p0<=0 & 0<=p0]]]]
normalized: EX [~ [E [true U ~ [[[p0<=0 & 0<=p0] & E [true U ~ [E [true U [p75<=0 & 0<=p75]]]]]]]]]
abstracting: (0<=p75)
states: 18,876,919,019 (10)
abstracting: (p75<=0)
states: 17,978,511,159 (10)
abstracting: (0<=p0)
states: 18,876,919,019 (10)
abstracting: (p0<=0)
states: 18,876,919,018 (10)
.-> the formula is FALSE
FORMULA SmartHome-PT-09-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.157sec
checking: EF [EX [[[p121<=1 & 1<=p121] & [[p39<=0 & 0<=p39] & [p139<=1 & 1<=p139]]]]]
normalized: E [true U EX [[[[p139<=1 & 1<=p139] & [p39<=0 & 0<=p39]] & [p121<=1 & 1<=p121]]]]
abstracting: (1<=p121)
states: 582,835,871 (8)
abstracting: (p121<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p39)
states: 18,876,919,019 (10)
abstracting: (p39<=0)
states: 17,660,714,603 (10)
abstracting: (1<=p139)
states: 930,712,850 (8)
abstracting: (p139<=1)
states: 18,876,919,019 (10)
.-> the formula is TRUE
FORMULA SmartHome-PT-09-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.240sec
checking: AX [[E [~ [AG [[p54<=0 & 0<=p54]]] U AG [[p0<=1 & 1<=p0]]] & [[p154<=1 & 1<=p154] | [p133<=0 & 0<=p133]]]]
normalized: ~ [EX [~ [[[[p133<=0 & 0<=p133] | [p154<=1 & 1<=p154]] & E [E [true U ~ [[p54<=0 & 0<=p54]]] U ~ [E [true U ~ [[p0<=1 & 1<=p0]]]]]]]]]
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p54)
states: 18,876,919,019 (10)
abstracting: (p54<=0)
states: 18,109,588,651 (10)
abstracting: (1<=p154)
states: 1,158,826,022 (9)
abstracting: (p154<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p133)
states: 18,876,919,019 (10)
abstracting: (p133<=0)
states: 17,946,206,169 (10)
.-> the formula is FALSE
FORMULA SmartHome-PT-09-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.102sec
checking: E [~ [A [EX [[p121<=1 & 1<=p121]] U A [[[p160<=0 & 0<=p160] | [p96<=1 & 1<=p96]] U [p11<=1 & 1<=p11]]]] U ~ [A [AX [AX [[p58<=1 & 1<=p58]]] U [[p171<=0 & 0<=p171] | [p58<=1 & 1<=p58]]]]]
normalized: E [~ [[~ [EG [~ [[~ [EG [~ [[p11<=1 & 1<=p11]]]] & ~ [E [~ [[p11<=1 & 1<=p11]] U [~ [[[p96<=1 & 1<=p96] | [p160<=0 & 0<=p160]]] & ~ [[p11<=1 & 1<=p11]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[p11<=1 & 1<=p11]]]] & ~ [E [~ [[p11<=1 & 1<=p11]] U [~ [[[p96<=1 & 1<=p96] | [p160<=0 & 0<=p160]]] & ~ [[p11<=1 & 1<=p11]]]]]]] U [~ [EX [[p121<=1 & 1<=p121]]] & ~ [[~ [EG [~ [[p11<=1 & 1<=p11]]]] & ~ [E [~ [[p11<=1 & 1<=p11]] U [~ [[[p96<=1 & 1<=p96] | [p160<=0 & 0<=p160]]] & ~ [[p11<=1 & 1<=p11]]]]]]]]]]]] U ~ [[~ [EG [~ [[[p58<=1 & 1<=p58] | [p171<=0 & 0<=p171]]]]] & ~ [E [~ [[[p58<=1 & 1<=p58] | [p171<=0 & 0<=p171]]] U [EX [EX [~ [[p58<=1 & 1<=p58]]]] & ~ [[[p58<=1 & 1<=p58] | [p171<=0 & 0<=p171]]]]]]]]]
abstracting: (0<=p171)
states: 18,876,919,019 (10)
abstracting: (p171<=0)
states: 17,233,194,219 (10)
abstracting: (1<=p58)
states: 767,330,368 (8)
abstracting: (p58<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p58)
states: 767,330,368 (8)
abstracting: (p58<=1)
states: 18,876,919,019 (10)
..abstracting: (0<=p171)
states: 18,876,919,019 (10)
abstracting: (p171<=0)
states: 17,233,194,219 (10)
abstracting: (1<=p58)
states: 767,330,368 (8)
abstracting: (p58<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p171)
states: 18,876,919,019 (10)
abstracting: (p171<=0)
states: 17,233,194,219 (10)
abstracting: (1<=p58)
states: 767,330,368 (8)
abstracting: (p58<=1)
states: 18,876,919,019 (10)
..........
EG iterations: 10
abstracting: (1<=p11)
states: 869,271,552 (8)
abstracting: (p11<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p160)
states: 18,876,919,019 (10)
abstracting: (p160<=0)
states: 18,254,716,139 (10)
abstracting: (1<=p96)
states: 582,835,871 (8)
abstracting: (p96<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p11)
states: 869,271,552 (8)
abstracting: (p11<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p11)
states: 869,271,552 (8)
abstracting: (p11<=1)
states: 18,876,919,019 (10)
.......
EG iterations: 7
abstracting: (1<=p121)
states: 582,835,871 (8)
abstracting: (p121<=1)
states: 18,876,919,019 (10)
.abstracting: (1<=p11)
states: 869,271,552 (8)
abstracting: (p11<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p160)
states: 18,876,919,019 (10)
abstracting: (p160<=0)
states: 18,254,716,139 (10)
abstracting: (1<=p96)
states: 582,835,871 (8)
abstracting: (p96<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p11)
states: 869,271,552 (8)
abstracting: (p11<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p11)
states: 869,271,552 (8)
abstracting: (p11<=1)
states: 18,876,919,019 (10)
.......
EG iterations: 7
abstracting: (1<=p11)
states: 869,271,552 (8)
abstracting: (p11<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p160)
states: 18,876,919,019 (10)
abstracting: (p160<=0)
states: 18,254,716,139 (10)
abstracting: (1<=p96)
states: 582,835,871 (8)
abstracting: (p96<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p11)
states: 869,271,552 (8)
abstracting: (p11<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p11)
states: 869,271,552 (8)
abstracting: (p11<=1)
states: 18,876,919,019 (10)
.......
EG iterations: 7
.
EG iterations: 1
-> the formula is TRUE
FORMULA SmartHome-PT-09-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.173sec
checking: [E [EX [EG [AG [[[0<=p138 & p138<=0] | [p139<=1 & 1<=p139]]]]] U [[EX [~ [[1<=p164 & p164<=1]]] | AF [[p38<=1 & 1<=p38]]] & AX [[p125<=1 & 1<=p125]]]] | AG [[AG [[[[p6<=0 & 0<=p6] & [p106<=1 & 1<=p106]] & [[p160<=0 & 0<=p160] & [p134<=1 & 1<=p134]]]] | AF [[[p25<=0 & 0<=p25] | [[p106<=1 & 1<=p106] | [p118<=0 & 0<=p118]]]]]]]
normalized: [E [EX [EG [~ [E [true U ~ [[[p139<=1 & 1<=p139] | [0<=p138 & p138<=0]]]]]]] U [~ [EX [~ [[p125<=1 & 1<=p125]]]] & [~ [EG [~ [[p38<=1 & 1<=p38]]]] | EX [~ [[1<=p164 & p164<=1]]]]]] | ~ [E [true U ~ [[~ [EG [~ [[[[p118<=0 & 0<=p118] | [p106<=1 & 1<=p106]] | [p25<=0 & 0<=p25]]]]] | ~ [E [true U ~ [[[[p134<=1 & 1<=p134] & [p160<=0 & 0<=p160]] & [[p106<=1 & 1<=p106] & [p6<=0 & 0<=p6]]]]]]]]]]]
abstracting: (0<=p6)
states: 18,876,919,019 (10)
abstracting: (p6<=0)
states: 18,876,919,017 (10)
abstracting: (1<=p106)
states: 582,835,871 (8)
abstracting: (p106<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p160)
states: 18,876,919,019 (10)
abstracting: (p160<=0)
states: 18,254,716,139 (10)
abstracting: (1<=p134)
states: 930,712,850 (8)
abstracting: (p134<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p25)
states: 18,876,919,019 (10)
abstracting: (p25<=0)
states: 17,931,906,283 (10)
abstracting: (1<=p106)
states: 582,835,871 (8)
abstracting: (p106<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p118)
states: 18,876,919,019 (10)
abstracting: (p118<=0)
states: 18,294,083,148 (10)
.......
EG iterations: 7
abstracting: (p164<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p164)
states: 821,862,400 (8)
.abstracting: (1<=p38)
states: 1,216,204,416 (9)
abstracting: (p38<=1)
states: 18,876,919,019 (10)
.
EG iterations: 1
abstracting: (1<=p125)
states: 56,542,734 (7)
abstracting: (p125<=1)
states: 18,876,919,019 (10)
.abstracting: (p138<=0)
states: 17,946,206,169 (10)
abstracting: (0<=p138)
states: 18,876,919,019 (10)
abstracting: (1<=p139)
states: 930,712,850 (8)
abstracting: (p139<=1)
states: 18,876,919,019 (10)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA SmartHome-PT-09-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.259sec
checking: [EF [EG [[[p79<=0 & 0<=p79] | [p14<=1 & 1<=p14]]]] | [AX [~ [A [EF [[p54<=1 & 1<=p54]] U EG [[p50<=0 & 0<=p50]]]]] & AG [[[[p34<=1 & 1<=p34] | ~ [A [[[p84<=0 & 0<=p84] | [p24<=1 & 1<=p24]] U [p92<=1 & 1<=p92]]]] | [[p51<=1 & 1<=p51] | [[p21<=1 & 1<=p21] & [[p44<=0 & 0<=p44] | [p67<=1 & 1<=p67]]]]]]]]
normalized: [[~ [E [true U ~ [[[[[[p67<=1 & 1<=p67] | [p44<=0 & 0<=p44]] & [p21<=1 & 1<=p21]] | [p51<=1 & 1<=p51]] | [~ [[~ [EG [~ [[p92<=1 & 1<=p92]]]] & ~ [E [~ [[p92<=1 & 1<=p92]] U [~ [[[p24<=1 & 1<=p24] | [p84<=0 & 0<=p84]]] & ~ [[p92<=1 & 1<=p92]]]]]]] | [p34<=1 & 1<=p34]]]]]] & ~ [EX [[~ [EG [~ [EG [[p50<=0 & 0<=p50]]]]] & ~ [E [~ [EG [[p50<=0 & 0<=p50]]] U [~ [E [true U [p54<=1 & 1<=p54]]] & ~ [EG [[p50<=0 & 0<=p50]]]]]]]]]] | E [true U EG [[[p14<=1 & 1<=p14] | [p79<=0 & 0<=p79]]]]]
abstracting: (0<=p79)
states: 18,876,919,019 (10)
abstracting: (p79<=0)
states: 17,978,511,159 (10)
abstracting: (1<=p14)
states: 945,012,736 (8)
abstracting: (p14<=1)
states: 18,876,919,019 (10)
.
EG iterations: 1
abstracting: (0<=p50)
states: 18,876,919,019 (10)
abstracting: (p50<=0)
states: 18,109,588,651 (10)
........
EG iterations: 8
abstracting: (1<=p54)
states: 767,330,368 (8)
abstracting: (p54<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p50)
states: 18,876,919,019 (10)
abstracting: (p50<=0)
states: 18,109,588,651 (10)
........
EG iterations: 8
abstracting: (0<=p50)
states: 18,876,919,019 (10)
abstracting: (p50<=0)
states: 18,109,588,651 (10)
........
EG iterations: 8
.........
EG iterations: 9
.abstracting: (1<=p34)
states: 1,216,204,416 (9)
abstracting: (p34<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p92)
states: 56,542,734 (7)
abstracting: (p92<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p84)
states: 18,876,919,019 (10)
abstracting: (p84<=0)
states: 17,978,511,159 (10)
abstracting: (1<=p24)
states: 945,012,736 (8)
abstracting: (p24<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p92)
states: 56,542,734 (7)
abstracting: (p92<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p92)
states: 56,542,734 (7)
abstracting: (p92<=1)
states: 18,876,919,019 (10)
....
EG iterations: 4
abstracting: (1<=p51)
states: 767,330,368 (8)
abstracting: (p51<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p21)
states: 945,012,736 (8)
abstracting: (p21<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p44)
states: 18,876,919,019 (10)
abstracting: (p44<=0)
states: 17,819,403,883 (10)
abstracting: (1<=p67)
states: 745,122,304 (8)
abstracting: (p67<=1)
states: 18,876,919,019 (10)
-> the formula is TRUE
FORMULA SmartHome-PT-09-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.336sec
checking: EG [[A [~ [[[E [[[p164<=0 & 0<=p164] | [p66<=1 & 1<=p66]] U [[p166<=0 & 0<=p166] | [p33<=1 & 1<=p33]]] | [p9<=0 & 0<=p9]] | [[p148<=0 & 0<=p148] | [p127<=1 & 1<=p127]]]] U [[p72<=1 & 1<=p72] | EF [[[p13<=1 & 1<=p13] & [p100<=0 & 0<=p100]]]]] | [AX [EG [[[p138<=0 & 0<=p138] | [p83<=1 & 1<=p83]]]] | EX [[EG [[p95<=1 & 1<=p95]] & [p4<=1 & 1<=p4]]]]]]
normalized: EG [[[EX [[[p4<=1 & 1<=p4] & EG [[p95<=1 & 1<=p95]]]] | ~ [EX [~ [EG [[[p83<=1 & 1<=p83] | [p138<=0 & 0<=p138]]]]]]] | [~ [EG [~ [[E [true U [[p100<=0 & 0<=p100] & [p13<=1 & 1<=p13]]] | [p72<=1 & 1<=p72]]]]] & ~ [E [~ [[E [true U [[p100<=0 & 0<=p100] & [p13<=1 & 1<=p13]]] | [p72<=1 & 1<=p72]]] U [[[[p127<=1 & 1<=p127] | [p148<=0 & 0<=p148]] | [[p9<=0 & 0<=p9] | E [[[p66<=1 & 1<=p66] | [p164<=0 & 0<=p164]] U [[p33<=1 & 1<=p33] | [p166<=0 & 0<=p166]]]]] & ~ [[E [true U [[p100<=0 & 0<=p100] & [p13<=1 & 1<=p13]]] | [p72<=1 & 1<=p72]]]]]]]]]
abstracting: (1<=p72)
states: 898,407,860 (8)
abstracting: (p72<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p13)
states: 945,012,736 (8)
abstracting: (p13<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p100)
states: 18,876,919,019 (10)
abstracting: (p100<=0)
states: 18,294,083,148 (10)
abstracting: (0<=p166)
states: 18,876,919,019 (10)
abstracting: (p166<=0)
states: 17,993,413,099 (10)
abstracting: (1<=p33)
states: 1,216,204,416 (9)
abstracting: (p33<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p164)
states: 18,876,919,019 (10)
abstracting: (p164<=0)
states: 18,055,056,619 (10)
abstracting: (1<=p66)
states: 767,330,368 (8)
abstracting: (p66<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p9)
states: 18,876,919,019 (10)
abstracting: (p9<=0)
states: 18,874,995,499 (10)
abstracting: (0<=p148)
states: 18,876,919,019 (10)
abstracting: (p148<=0)
states: 18,805,459,329 (10)
abstracting: (1<=p127)
states: 56,542,734 (7)
abstracting: (p127<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p72)
states: 898,407,860 (8)
abstracting: (p72<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p13)
states: 945,012,736 (8)
abstracting: (p13<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p100)
states: 18,876,919,019 (10)
abstracting: (p100<=0)
states: 18,294,083,148 (10)
abstracting: (1<=p72)
states: 898,407,860 (8)
abstracting: (p72<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p13)
states: 945,012,736 (8)
abstracting: (p13<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p100)
states: 18,876,919,019 (10)
abstracting: (p100<=0)
states: 18,294,083,148 (10)
.
EG iterations: 1
abstracting: (0<=p138)
states: 18,876,919,019 (10)
abstracting: (p138<=0)
states: 17,946,206,169 (10)
abstracting: (1<=p83)
states: 898,407,860 (8)
abstracting: (p83<=1)
states: 18,876,919,019 (10)
............
EG iterations: 12
.abstracting: (1<=p95)
states: 582,835,871 (8)
abstracting: (p95<=1)
states: 18,876,919,019 (10)
.......
EG iterations: 7
abstracting: (1<=p4)
states: 4,737,239,584 (9)
abstracting: (p4<=1)
states: 18,876,919,019 (10)
.
EG iterations: 0
-> the formula is TRUE
FORMULA SmartHome-PT-09-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.587sec
checking: A [[AF [EG [[[p29<=1 & 1<=p29] & [[p160<=1 & 1<=p160] & EF [[p97<=0 & 0<=p97]]]]]] | [p97<=1 & 1<=p97]] U AG [[[AG [[p146<=1 & 1<=p146]] | ~ [AX [[p41<=1 & 1<=p41]]]] | [EX [[p136<=0 & 0<=p136]] | [AF [[[[p80<=0 & 0<=p80] | [p52<=1 & 1<=p52]] | [[p142<=0 & 0<=p142] | [p15<=1 & 1<=p15]]]] | E [E [[[p30<=0 & 0<=p30] | [p57<=1 & 1<=p57]] U [p107<=1 & 1<=p107]] U [[p92<=1 & 1<=p92] & [p5<=0 & 0<=p5]]]]]]]]
normalized: [~ [EG [E [true U ~ [[[~ [E [true U ~ [[p146<=1 & 1<=p146]]]] | EX [~ [[p41<=1 & 1<=p41]]]] | [[E [E [[[p57<=1 & 1<=p57] | [p30<=0 & 0<=p30]] U [p107<=1 & 1<=p107]] U [[p5<=0 & 0<=p5] & [p92<=1 & 1<=p92]]] | ~ [EG [~ [[[[p15<=1 & 1<=p15] | [p142<=0 & 0<=p142]] | [[p52<=1 & 1<=p52] | [p80<=0 & 0<=p80]]]]]]] | EX [[p136<=0 & 0<=p136]]]]]]]] & ~ [E [E [true U ~ [[[~ [E [true U ~ [[p146<=1 & 1<=p146]]]] | EX [~ [[p41<=1 & 1<=p41]]]] | [[E [E [[[p57<=1 & 1<=p57] | [p30<=0 & 0<=p30]] U [p107<=1 & 1<=p107]] U [[p5<=0 & 0<=p5] & [p92<=1 & 1<=p92]]] | ~ [EG [~ [[[[p15<=1 & 1<=p15] | [p142<=0 & 0<=p142]] | [[p52<=1 & 1<=p52] | [p80<=0 & 0<=p80]]]]]]] | EX [[p136<=0 & 0<=p136]]]]]] U [E [true U ~ [[[~ [E [true U ~ [[p146<=1 & 1<=p146]]]] | EX [~ [[p41<=1 & 1<=p41]]]] | [[E [E [[[p57<=1 & 1<=p57] | [p30<=0 & 0<=p30]] U [p107<=1 & 1<=p107]] U [[p5<=0 & 0<=p5] & [p92<=1 & 1<=p92]]] | ~ [EG [~ [[[[p15<=1 & 1<=p15] | [p142<=0 & 0<=p142]] | [[p52<=1 & 1<=p52] | [p80<=0 & 0<=p80]]]]]]] | EX [[p136<=0 & 0<=p136]]]]]] & ~ [[[p97<=1 & 1<=p97] | ~ [EG [~ [EG [[[E [true U [p97<=0 & 0<=p97]] & [p160<=1 & 1<=p160]] & [p29<=1 & 1<=p29]]]]]]]]]]]]
abstracting: (1<=p29)
states: 945,012,736 (8)
abstracting: (p29<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p160)
states: 622,202,880 (8)
abstracting: (p160<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p97)
states: 18,876,919,019 (10)
abstracting: (p97<=0)
states: 18,294,083,148 (10)
....
EG iterations: 4
.
EG iterations: 1
abstracting: (1<=p97)
states: 582,835,871 (8)
abstracting: (p97<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p136)
states: 18,876,919,019 (10)
abstracting: (p136<=0)
states: 17,946,206,169 (10)
.abstracting: (0<=p80)
states: 18,876,919,019 (10)
abstracting: (p80<=0)
states: 17,978,511,159 (10)
abstracting: (1<=p52)
states: 767,330,368 (8)
abstracting: (p52<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p142)
states: 18,876,919,019 (10)
abstracting: (p142<=0)
states: 17,946,206,169 (10)
abstracting: (1<=p15)
states: 945,012,736 (8)
abstracting: (p15<=1)
states: 18,876,919,019 (10)
.......
EG iterations: 7
abstracting: (1<=p92)
states: 56,542,734 (7)
abstracting: (p92<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p5)
states: 18,876,919,019 (10)
abstracting: (p5<=0)
states: 14,367,209,659 (10)
abstracting: (1<=p107)
states: 582,835,871 (8)
abstracting: (p107<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p30)
states: 18,876,919,019 (10)
abstracting: (p30<=0)
states: 17,931,906,283 (10)
abstracting: (1<=p57)
states: 767,330,368 (8)
abstracting: (p57<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p41)
states: 1,216,204,416 (9)
abstracting: (p41<=1)
states: 18,876,919,019 (10)
.abstracting: (1<=p146)
states: 907,536,104 (8)
abstracting: (p146<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p136)
states: 18,876,919,019 (10)
abstracting: (p136<=0)
states: 17,946,206,169 (10)
.abstracting: (0<=p80)
states: 18,876,919,019 (10)
abstracting: (p80<=0)
states: 17,978,511,159 (10)
abstracting: (1<=p52)
states: 767,330,368 (8)
abstracting: (p52<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p142)
states: 18,876,919,019 (10)
abstracting: (p142<=0)
states: 17,946,206,169 (10)
abstracting: (1<=p15)
states: 945,012,736 (8)
abstracting: (p15<=1)
states: 18,876,919,019 (10)
.......
EG iterations: 7
abstracting: (1<=p92)
states: 56,542,734 (7)
abstracting: (p92<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p5)
states: 18,876,919,019 (10)
abstracting: (p5<=0)
states: 14,367,209,659 (10)
abstracting: (1<=p107)
states: 582,835,871 (8)
abstracting: (p107<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p30)
states: 18,876,919,019 (10)
abstracting: (p30<=0)
states: 17,931,906,283 (10)
abstracting: (1<=p57)
states: 767,330,368 (8)
abstracting: (p57<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p41)
states: 1,216,204,416 (9)
abstracting: (p41<=1)
states: 18,876,919,019 (10)
.abstracting: (1<=p146)
states: 907,536,104 (8)
abstracting: (p146<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p136)
states: 18,876,919,019 (10)
abstracting: (p136<=0)
states: 17,946,206,169 (10)
.abstracting: (0<=p80)
states: 18,876,919,019 (10)
abstracting: (p80<=0)
states: 17,978,511,159 (10)
abstracting: (1<=p52)
states: 767,330,368 (8)
abstracting: (p52<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p142)
states: 18,876,919,019 (10)
abstracting: (p142<=0)
states: 17,946,206,169 (10)
abstracting: (1<=p15)
states: 945,012,736 (8)
abstracting: (p15<=1)
states: 18,876,919,019 (10)
.......
EG iterations: 7
abstracting: (1<=p92)
states: 56,542,734 (7)
abstracting: (p92<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p5)
states: 18,876,919,019 (10)
abstracting: (p5<=0)
states: 14,367,209,659 (10)
abstracting: (1<=p107)
states: 582,835,871 (8)
abstracting: (p107<=1)
states: 18,876,919,019 (10)
abstracting: (0<=p30)
states: 18,876,919,019 (10)
abstracting: (p30<=0)
states: 17,931,906,283 (10)
abstracting: (1<=p57)
states: 767,330,368 (8)
abstracting: (p57<=1)
states: 18,876,919,019 (10)
abstracting: (1<=p41)
states: 1,216,204,416 (9)
abstracting: (p41<=1)
states: 18,876,919,019 (10)
.abstracting: (1<=p146)
states: 907,536,104 (8)
abstracting: (p146<=1)
states: 18,876,919,019 (10)
.
EG iterations: 1
-> the formula is TRUE
FORMULA SmartHome-PT-09-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.297sec
totally nodes used: 7634761 (7.6e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 18767959 43131632 61899591
used/not used/entry size/cache size: 35259616 31849248 16 1024MB
basic ops cache: hits/miss/sum: 2492730 5621481 8114211
used/not used/entry size/cache size: 7101371 9675845 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 132702 300464 433166
used/not used/entry size/cache size: 295304 8093304 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 60414792
1 5888374
2 688126
3 102120
4 13703
5 1549
6 183
7 16
8 1
9 0
>= 10 0
Total processing time: 0m27.747sec
BK_STOP 1679311634065
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:10753 (50), effective:934 (4)
initing FirstDep: 0m 0.000sec
iterations count:866 (4), effective:32 (0)
iterations count:726 (3), effective:30 (0)
iterations count:215 (1), effective:1 (0)
iterations count:213 (1), effective:0 (0)
iterations count:1117 (5), effective:87 (0)
iterations count:214 (1), effective:1 (0)
iterations count:862 (4), effective:32 (0)
iterations count:218 (1), effective:2 (0)
iterations count:3949 (18), effective:298 (1)
iterations count:3949 (18), effective:298 (1)
iterations count:357 (1), effective:30 (0)
iterations count:3949 (18), effective:298 (1)
iterations count:1381 (6), effective:102 (0)
iterations count:215 (1), effective:1 (0)
iterations count:623 (2), effective:59 (0)
iterations count:643 (3), effective:25 (0)
iterations count:1398 (6), effective:90 (0)
iterations count:215 (1), effective:1 (0)
iterations count:862 (4), effective:32 (0)
iterations count:447 (2), effective:22 (0)
iterations count:269 (1), effective:10 (0)
iterations count:382 (1), effective:27 (0)
iterations count:216 (1), effective:1 (0)
iterations count:382 (1), effective:27 (0)
iterations count:382 (1), effective:27 (0)
iterations count:215 (1), effective:1 (0)
iterations count:507 (2), effective:38 (0)
iterations count:257 (1), effective:5 (0)
iterations count:218 (1), effective:1 (0)
iterations count:507 (2), effective:38 (0)
iterations count:257 (1), effective:5 (0)
iterations count:218 (1), effective:1 (0)
iterations count:507 (2), effective:38 (0)
iterations count:257 (1), effective:5 (0)
iterations count:218 (1), effective:1 (0)
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="SmartHome-PT-09"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is SmartHome-PT-09, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r458-smll-167912650000217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-09.tgz
mv SmartHome-PT-09 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;