fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r458-smll-167912650000266
Last Updated
May 14, 2023

About the Execution of Marcie+red for SmartHome-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7165.140 78093.00 89850.00 2912.40 TTFFTTTFTFFTTTFT 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-167912650000266.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-15, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650000266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.9K Feb 26 05:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 05:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 05:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 05:40 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.5K Feb 25 17:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 05:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 05:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 05:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 05:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:10 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 102K 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-15-CTLFireability-00
FORMULA_NAME SmartHome-PT-15-CTLFireability-01
FORMULA_NAME SmartHome-PT-15-CTLFireability-02
FORMULA_NAME SmartHome-PT-15-CTLFireability-03
FORMULA_NAME SmartHome-PT-15-CTLFireability-04
FORMULA_NAME SmartHome-PT-15-CTLFireability-05
FORMULA_NAME SmartHome-PT-15-CTLFireability-06
FORMULA_NAME SmartHome-PT-15-CTLFireability-07
FORMULA_NAME SmartHome-PT-15-CTLFireability-08
FORMULA_NAME SmartHome-PT-15-CTLFireability-09
FORMULA_NAME SmartHome-PT-15-CTLFireability-10
FORMULA_NAME SmartHome-PT-15-CTLFireability-11
FORMULA_NAME SmartHome-PT-15-CTLFireability-12
FORMULA_NAME SmartHome-PT-15-CTLFireability-13
FORMULA_NAME SmartHome-PT-15-CTLFireability-14
FORMULA_NAME SmartHome-PT-15-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679316239718

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-15
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 12:44:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 12:44:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:44:03] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2023-03-20 12:44:03] [INFO ] Transformed 427 places.
[2023-03-20 12:44:03] [INFO ] Transformed 451 transitions.
[2023-03-20 12:44:03] [INFO ] Found NUPN structural information;
[2023-03-20 12:44:03] [INFO ] Parsed PT model containing 427 places and 451 transitions and 1038 arcs in 284 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Deduced a syphon composed of 134 places in 5 ms
Reduce places removed 134 places and 107 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-15-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 344/344 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 282 transition count 344
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 74 place count 219 transition count 281
Iterating global reduction 1 with 63 rules applied. Total rules applied 137 place count 219 transition count 281
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 142 place count 219 transition count 276
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 152 place count 209 transition count 266
Iterating global reduction 2 with 10 rules applied. Total rules applied 162 place count 209 transition count 266
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 168 place count 203 transition count 260
Iterating global reduction 2 with 6 rules applied. Total rules applied 174 place count 203 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 175 place count 203 transition count 259
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 201 transition count 257
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 201 transition count 257
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 180 place count 200 transition count 256
Iterating global reduction 3 with 1 rules applied. Total rules applied 181 place count 200 transition count 256
Applied a total of 181 rules in 103 ms. Remains 200 /293 variables (removed 93) and now considering 256/344 (removed 88) transitions.
// Phase 1: matrix 256 rows 200 cols
[2023-03-20 12:44:03] [INFO ] Computed 3 place invariants in 22 ms
[2023-03-20 12:44:03] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-20 12:44:03] [INFO ] Invariant cache hit.
[2023-03-20 12:44:04] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
[2023-03-20 12:44:04] [INFO ] Invariant cache hit.
[2023-03-20 12:44:04] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 200/293 places, 256/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1231 ms. Remains : 200/293 places, 256/344 transitions.
Support contains 66 out of 200 places after structural reductions.
[2023-03-20 12:44:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 12:44:04] [INFO ] Flatten gal took : 101 ms
[2023-03-20 12:44:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-15-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 12:44:04] [INFO ] Flatten gal took : 34 ms
[2023-03-20 12:44:05] [INFO ] Input system was already deterministic with 256 transitions.
Support contains 47 out of 200 places (down from 66) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 51 resets, run finished after 816 ms. (steps per millisecond=12 ) properties (out of 37) seen :31
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 12:44:06] [INFO ] Invariant cache hit.
[2023-03-20 12:44:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:44:06] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:44:06] [INFO ] After 185ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:3
[2023-03-20 12:44:06] [INFO ] After 221ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-20 12:44:06] [INFO ] After 408ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-20 12:44:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:44:06] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 13 ms returned sat
[2023-03-20 12:44:06] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-20 12:44:07] [INFO ] After 251ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-20 12:44:07] [INFO ] After 547ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 35 ms.
Support contains 6 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 256/256 transitions.
Graph (trivial) has 196 edges and 200 vertex of which 88 / 200 are part of one of the 6 SCC in 9 ms
Free SCC test removed 82 places
Drop transitions removed 116 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 118 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 118 transition count 97
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 52 rules applied. Total rules applied 94 place count 77 transition count 86
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 100 place count 71 transition count 86
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 100 place count 71 transition count 82
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 108 place count 67 transition count 82
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 118 place count 57 transition count 72
Iterating global reduction 3 with 10 rules applied. Total rules applied 128 place count 57 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 130 place count 57 transition count 70
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 130 place count 57 transition count 68
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 134 place count 55 transition count 68
Performed 24 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 182 place count 31 transition count 40
Drop transitions removed 11 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 52 edges and 31 vertex of which 25 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 14 rules applied. Total rules applied 196 place count 25 transition count 27
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 199 place count 25 transition count 24
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 201 place count 25 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 203 place count 23 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 204 place count 22 transition count 21
Reduce places removed 4 places and 0 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 7 with 6 rules applied. Total rules applied 210 place count 18 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 212 place count 16 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 212 place count 16 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 216 place count 14 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 217 place count 13 transition count 16
Applied a total of 217 rules in 52 ms. Remains 13 /200 variables (removed 187) and now considering 16/256 (removed 240) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 13/200 places, 16/256 transitions.
Finished random walk after 37 steps, including 2 resets, run visited all 3 properties in 1 ms. (steps per millisecond=37 )
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 17 ms
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 19 ms
[2023-03-20 12:44:07] [INFO ] Input system was already deterministic with 256 transitions.
Computed a total of 49 stabilizing places and 48 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 256/256 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 178 transition count 234
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 178 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 178 transition count 231
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 168 transition count 221
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 168 transition count 221
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 73 place count 162 transition count 215
Iterating global reduction 1 with 6 rules applied. Total rules applied 79 place count 162 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 162 transition count 214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 161 transition count 213
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 161 transition count 213
Applied a total of 82 rules in 32 ms. Remains 161 /200 variables (removed 39) and now considering 213/256 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 161/200 places, 213/256 transitions.
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 13 ms
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 14 ms
[2023-03-20 12:44:07] [INFO ] Input system was already deterministic with 213 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 256/256 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 178 transition count 234
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 178 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 178 transition count 231
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 56 place count 169 transition count 222
Iterating global reduction 1 with 9 rules applied. Total rules applied 65 place count 169 transition count 222
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 70 place count 164 transition count 217
Iterating global reduction 1 with 5 rules applied. Total rules applied 75 place count 164 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 164 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 163 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 163 transition count 215
Applied a total of 78 rules in 19 ms. Remains 163 /200 variables (removed 37) and now considering 215/256 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 163/200 places, 215/256 transitions.
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 18 ms
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 12 ms
[2023-03-20 12:44:07] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 256/256 transitions.
Graph (trivial) has 199 edges and 200 vertex of which 83 / 200 are part of one of the 7 SCC in 1 ms
Free SCC test removed 76 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 123 transition count 109
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 61 rules applied. Total rules applied 109 place count 76 transition count 95
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 118 place count 68 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 67 transition count 94
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 119 place count 67 transition count 91
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 125 place count 64 transition count 91
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 136 place count 53 transition count 80
Iterating global reduction 4 with 11 rules applied. Total rules applied 147 place count 53 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 149 place count 53 transition count 78
Performed 21 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 191 place count 32 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 194 place count 32 transition count 52
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 196 place count 31 transition count 51
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 197 place count 30 transition count 50
Iterating global reduction 7 with 1 rules applied. Total rules applied 198 place count 30 transition count 50
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 7 with 2 rules applied. Total rules applied 200 place count 29 transition count 49
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 213 place count 29 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 215 place count 27 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 215 place count 27 transition count 35
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 217 place count 26 transition count 35
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 218 place count 25 transition count 33
Iterating global reduction 8 with 1 rules applied. Total rules applied 219 place count 25 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 220 place count 24 transition count 32
Applied a total of 220 rules in 30 ms. Remains 24 /200 variables (removed 176) and now considering 32/256 (removed 224) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 24/200 places, 32/256 transitions.
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 2 ms
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 3 ms
[2023-03-20 12:44:07] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 256/256 transitions.
Graph (trivial) has 203 edges and 200 vertex of which 100 / 200 are part of one of the 8 SCC in 1 ms
Free SCC test removed 92 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 107 transition count 94
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 52 rules applied. Total rules applied 94 place count 66 transition count 83
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 101 place count 60 transition count 82
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 103 place count 59 transition count 81
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 103 place count 59 transition count 79
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 107 place count 57 transition count 79
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 118 place count 46 transition count 68
Iterating global reduction 4 with 11 rules applied. Total rules applied 129 place count 46 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 131 place count 46 transition count 66
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 171 place count 26 transition count 45
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 172 place count 25 transition count 44
Iterating global reduction 5 with 1 rules applied. Total rules applied 173 place count 25 transition count 44
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 186 place count 25 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 188 place count 23 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 188 place count 23 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 190 place count 22 transition count 30
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 191 place count 21 transition count 28
Iterating global reduction 6 with 1 rules applied. Total rules applied 192 place count 21 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 193 place count 20 transition count 27
Applied a total of 193 rules in 23 ms. Remains 20 /200 variables (removed 180) and now considering 27/256 (removed 229) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 20/200 places, 27/256 transitions.
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 1 ms
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 2 ms
[2023-03-20 12:44:07] [INFO ] Input system was already deterministic with 27 transitions.
Finished random walk after 27 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
FORMULA SmartHome-PT-15-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 256/256 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 179 transition count 235
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 179 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 179 transition count 233
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 169 transition count 223
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 169 transition count 223
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 164 transition count 218
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 164 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 164 transition count 217
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 77 place count 162 transition count 215
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 162 transition count 215
Applied a total of 79 rules in 18 ms. Remains 162 /200 variables (removed 38) and now considering 215/256 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 162/200 places, 215/256 transitions.
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 12 ms
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 11 ms
[2023-03-20 12:44:07] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 256/256 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 176 transition count 232
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 176 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 176 transition count 229
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 62 place count 165 transition count 218
Iterating global reduction 1 with 11 rules applied. Total rules applied 73 place count 165 transition count 218
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 79 place count 159 transition count 212
Iterating global reduction 1 with 6 rules applied. Total rules applied 85 place count 159 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 159 transition count 211
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 157 transition count 209
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 157 transition count 209
Applied a total of 90 rules in 27 ms. Remains 157 /200 variables (removed 43) and now considering 209/256 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 157/200 places, 209/256 transitions.
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 9 ms
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 10 ms
[2023-03-20 12:44:07] [INFO ] Input system was already deterministic with 209 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 256/256 transitions.
Graph (trivial) has 202 edges and 200 vertex of which 105 / 200 are part of one of the 8 SCC in 1 ms
Free SCC test removed 97 places
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 102 transition count 92
Reduce places removed 37 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 45 rules applied. Total rules applied 83 place count 65 transition count 84
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 87 place count 61 transition count 84
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 87 place count 61 transition count 82
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 91 place count 59 transition count 82
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 102 place count 48 transition count 71
Iterating global reduction 3 with 11 rules applied. Total rules applied 113 place count 48 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 48 transition count 69
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 155 place count 28 transition count 48
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 156 place count 27 transition count 47
Iterating global reduction 4 with 1 rules applied. Total rules applied 157 place count 27 transition count 47
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 170 place count 27 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 172 place count 25 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 172 place count 25 transition count 33
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 174 place count 24 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 175 place count 23 transition count 32
Applied a total of 175 rules in 21 ms. Remains 23 /200 variables (removed 177) and now considering 32/256 (removed 224) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 23/200 places, 32/256 transitions.
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 2 ms
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 2 ms
[2023-03-20 12:44:07] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 256/256 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 177 transition count 233
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 177 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 177 transition count 230
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 168 transition count 221
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 168 transition count 221
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 72 place count 163 transition count 216
Iterating global reduction 1 with 5 rules applied. Total rules applied 77 place count 163 transition count 216
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 161 transition count 214
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 161 transition count 214
Applied a total of 81 rules in 20 ms. Remains 161 /200 variables (removed 39) and now considering 214/256 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 161/200 places, 214/256 transitions.
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 10 ms
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 11 ms
[2023-03-20 12:44:07] [INFO ] Input system was already deterministic with 214 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 256/256 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 179 transition count 235
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 179 transition count 235
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 179 transition count 232
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 170 transition count 223
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 170 transition count 223
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 69 place count 164 transition count 217
Iterating global reduction 1 with 6 rules applied. Total rules applied 75 place count 164 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 164 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 162 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 162 transition count 214
Applied a total of 80 rules in 17 ms. Remains 162 /200 variables (removed 38) and now considering 214/256 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 162/200 places, 214/256 transitions.
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 10 ms
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 10 ms
[2023-03-20 12:44:07] [INFO ] Input system was already deterministic with 214 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 256/256 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 176 transition count 232
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 176 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 176 transition count 229
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 61 place count 166 transition count 219
Iterating global reduction 1 with 10 rules applied. Total rules applied 71 place count 166 transition count 219
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 77 place count 160 transition count 213
Iterating global reduction 1 with 6 rules applied. Total rules applied 83 place count 160 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 160 transition count 212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 158 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 158 transition count 210
Applied a total of 88 rules in 17 ms. Remains 158 /200 variables (removed 42) and now considering 210/256 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 158/200 places, 210/256 transitions.
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 9 ms
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 11 ms
[2023-03-20 12:44:07] [INFO ] Input system was already deterministic with 210 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 256/256 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 178 transition count 234
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 178 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 178 transition count 232
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 56 place count 168 transition count 222
Iterating global reduction 1 with 10 rules applied. Total rules applied 66 place count 168 transition count 222
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 163 transition count 217
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 163 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 163 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 161 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 161 transition count 214
Applied a total of 81 rules in 16 ms. Remains 161 /200 variables (removed 39) and now considering 214/256 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 161/200 places, 214/256 transitions.
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 10 ms
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 10 ms
[2023-03-20 12:44:07] [INFO ] Input system was already deterministic with 214 transitions.
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 12 ms
[2023-03-20 12:44:07] [INFO ] Flatten gal took : 10 ms
[2023-03-20 12:44:08] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-20 12:44:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 200 places, 256 transitions and 571 arcs took 2 ms.
Total runtime 5213 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 200 NrTr: 256 NrArc: 571)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.004sec

net check time: 0m 0.000sec

init dd package: 0m 3.587sec


RS generation: 0m 1.430sec


-> reachability set: #nodes 27493 (2.7e+04) #states 23,115,125,806,922 (13)



starting MCC model checker
--------------------------

checking: A [~ [EF [AG [[p15<=1 & 1<=p15]]]] U AG [EF [AG [[p148<=1 & 1<=p148]]]]]
normalized: [~ [EG [E [true U ~ [E [true U ~ [E [true U ~ [[p148<=1 & 1<=p148]]]]]]]]] & ~ [E [E [true U ~ [E [true U ~ [E [true U ~ [[p148<=1 & 1<=p148]]]]]]] U [E [true U ~ [E [true U ~ [[p15<=1 & 1<=p15]]]]] & E [true U ~ [E [true U ~ [E [true U ~ [[p148<=1 & 1<=p148]]]]]]]]]]]

abstracting: (1<=p148)
states: 822,614,237,142 (11)
abstracting: (p148<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p15)
states: 1,538,638,572,195 (12)
abstracting: (p15<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p148)
states: 822,614,237,142 (11)
abstracting: (p148<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p148)
states: 822,614,237,142 (11)
abstracting: (p148<=1)
states: 23,115,125,806,922 (13)

EG iterations: 0
-> the formula is FALSE

FORMULA SmartHome-PT-15-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.577sec

checking: [AG [~ [[p151<=1 & 1<=p151]]] | EX [EF [EX [AX [[p37<=1 & 1<=p37]]]]]]
normalized: [EX [E [true U EX [~ [EX [~ [[p37<=1 & 1<=p37]]]]]]] | ~ [E [true U [p151<=1 & 1<=p151]]]]

abstracting: (1<=p151)
states: 822,614,237,142 (11)
abstracting: (p151<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p37)
states: 1,225,918,380,825 (12)
abstracting: (p37<=1)
states: 23,115,125,806,922 (13)
...-> the formula is TRUE

FORMULA SmartHome-PT-15-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.821sec

checking: EG [A [[p140<=1 & 1<=p140] U [[[1<=p127 & p127<=1] & ~ [EX [[p82<=1 & 1<=p82]]]] | AX [EF [[p154<=1 & 1<=p154]]]]]]
normalized: EG [[~ [EG [~ [[~ [EX [~ [E [true U [p154<=1 & 1<=p154]]]]] | [~ [EX [[p82<=1 & 1<=p82]]] & [1<=p127 & p127<=1]]]]]] & ~ [E [~ [[~ [EX [~ [E [true U [p154<=1 & 1<=p154]]]]] | [~ [EX [[p82<=1 & 1<=p82]]] & [1<=p127 & p127<=1]]]] U [~ [[p140<=1 & 1<=p140]] & ~ [[~ [EX [~ [E [true U [p154<=1 & 1<=p154]]]]] | [~ [EX [[p82<=1 & 1<=p82]]] & [1<=p127 & p127<=1]]]]]]]]]

abstracting: (p127<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p127)
states: 716,753,665,038 (11)
abstracting: (1<=p82)
states: 406,122,344,685 (11)
abstracting: (p82<=1)
states: 23,115,125,806,922 (13)
.abstracting: (1<=p154)
states: 822,614,237,142 (11)
abstracting: (p154<=1)
states: 23,115,125,806,922 (13)
.abstracting: (1<=p140)
states: 822,614,237,142 (11)
abstracting: (p140<=1)
states: 23,115,125,806,922 (13)
abstracting: (p127<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p127)
states: 716,753,665,038 (11)
abstracting: (1<=p82)
states: 406,122,344,685 (11)
abstracting: (p82<=1)
states: 23,115,125,806,922 (13)
.abstracting: (1<=p154)
states: 822,614,237,142 (11)
abstracting: (p154<=1)
states: 23,115,125,806,922 (13)
.abstracting: (p127<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p127)
states: 716,753,665,038 (11)
abstracting: (1<=p82)
states: 406,122,344,685 (11)
abstracting: (p82<=1)
states: 23,115,125,806,922 (13)
.abstracting: (1<=p154)
states: 822,614,237,142 (11)
abstracting: (p154<=1)
states: 23,115,125,806,922 (13)
............................
EG iterations: 27
..........................
EG iterations: 26
-> the formula is TRUE

FORMULA SmartHome-PT-15-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.370sec

checking: A [EG [[[p49<=1 & 1<=p49] & [[p97<=1 & 1<=p97] & [p195<=1 & 1<=p195]]]] U EF [[p78<=1 & 1<=p78]]]
normalized: [~ [EG [~ [E [true U [p78<=1 & 1<=p78]]]]] & ~ [E [~ [E [true U [p78<=1 & 1<=p78]]] U [~ [EG [[[[p195<=1 & 1<=p195] & [p97<=1 & 1<=p97]] & [p49<=1 & 1<=p49]]]] & ~ [E [true U [p78<=1 & 1<=p78]]]]]]]

abstracting: (1<=p78)
states: 1,152,699,861,375 (12)
abstracting: (p78<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p49)
states: 1,585,733,284,440 (12)
abstracting: (p49<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p97)
states: 1,541,008,278,180 (12)
abstracting: (p97<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p195)
states: 4,378,877,357,232 (12)
abstracting: (p195<=1)
states: 23,115,125,806,922 (13)
.....
EG iterations: 5
abstracting: (1<=p78)
states: 1,152,699,861,375 (12)
abstracting: (p78<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p78)
states: 1,152,699,861,375 (12)
abstracting: (p78<=1)
states: 23,115,125,806,922 (13)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmartHome-PT-15-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.680sec

checking: [EF [[p19<=1 & 1<=p19]] | A [~ [AX [EF [[[p2<=1 & 1<=p2] & [p44<=1 & 1<=p44]]]]] U [p91<=1 & 1<=p91]]]
normalized: [[~ [EG [~ [[p91<=1 & 1<=p91]]]] & ~ [E [~ [[p91<=1 & 1<=p91]] U [~ [EX [~ [E [true U [[p44<=1 & 1<=p44] & [p2<=1 & 1<=p2]]]]]] & ~ [[p91<=1 & 1<=p91]]]]]] | E [true U [p19<=1 & 1<=p19]]]

abstracting: (1<=p19)
states: 1,538,638,572,195 (12)
abstracting: (p19<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p91)
states: 1,541,008,278,180 (12)
abstracting: (p91<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p2)
states: 5,915,196,956,475 (12)
abstracting: (p2<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p44)
states: 1,225,918,380,825 (12)
abstracting: (p44<=1)
states: 23,115,125,806,922 (13)
.abstracting: (1<=p91)
states: 1,541,008,278,180 (12)
abstracting: (p91<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p91)
states: 1,541,008,278,180 (12)
abstracting: (p91<=1)
states: 23,115,125,806,922 (13)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmartHome-PT-15-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.775sec

checking: A [[EG [AX [[[p57<=1 & 1<=p57] | [p163<=1 & 1<=p163]]]] & [p57<=1 & 1<=p57]] U EF [[AG [~ [[[p127<=1 & 1<=p127] & [p4<=1 & 1<=p4]]]] | AF [[p155<=1 & 1<=p155]]]]]
normalized: [~ [EG [~ [E [true U [~ [EG [~ [[p155<=1 & 1<=p155]]]] | ~ [E [true U [[p4<=1 & 1<=p4] & [p127<=1 & 1<=p127]]]]]]]]] & ~ [E [~ [E [true U [~ [EG [~ [[p155<=1 & 1<=p155]]]] | ~ [E [true U [[p4<=1 & 1<=p4] & [p127<=1 & 1<=p127]]]]]]] U [~ [[[p57<=1 & 1<=p57] & EG [~ [EX [~ [[[p163<=1 & 1<=p163] | [p57<=1 & 1<=p57]]]]]]]] & ~ [E [true U [~ [EG [~ [[p155<=1 & 1<=p155]]]] | ~ [E [true U [[p4<=1 & 1<=p4] & [p127<=1 & 1<=p127]]]]]]]]]]]

abstracting: (1<=p127)
states: 716,753,665,038 (11)
abstracting: (p127<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p4)
states: 5,377,451,767,230 (12)
abstracting: (p4<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p155)
states: 85,499,659,596 (10)
abstracting: (p155<=1)
states: 23,115,125,806,922 (13)
.
EG iterations: 1
abstracting: (1<=p57)
states: 664,880,245,470 (11)
abstracting: (p57<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p163)
states: 1,215,373,422,615 (12)
abstracting: (p163<=1)
states: 23,115,125,806,922 (13)
.......
EG iterations: 6
abstracting: (1<=p57)
states: 664,880,245,470 (11)
abstracting: (p57<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p127)
states: 716,753,665,038 (11)
abstracting: (p127<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p4)
states: 5,377,451,767,230 (12)
abstracting: (p4<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p155)
states: 85,499,659,596 (10)
abstracting: (p155<=1)
states: 23,115,125,806,922 (13)
.
EG iterations: 1
abstracting: (1<=p127)
states: 716,753,665,038 (11)
abstracting: (p127<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p4)
states: 5,377,451,767,230 (12)
abstracting: (p4<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p155)
states: 85,499,659,596 (10)
abstracting: (p155<=1)
states: 23,115,125,806,922 (13)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmartHome-PT-15-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.716sec

checking: [~ [E [AG [[p101<=1 & 1<=p101]] U [p81<=1 & 1<=p81]]] & [AG [[AX [AG [[~ [[p157<=1 & 1<=p157]] | ~ [[p193<=1 & 1<=p193]]]]] | EX [~ [[p37<=1 & 1<=p37]]]]] & EF [AG [[p117<=0 & 0<=p117]]]]]
normalized: [[E [true U ~ [E [true U ~ [[p117<=0 & 0<=p117]]]]] & ~ [E [true U ~ [[EX [~ [[p37<=1 & 1<=p37]]] | ~ [EX [E [true U ~ [[~ [[p193<=1 & 1<=p193]] | ~ [[p157<=1 & 1<=p157]]]]]]]]]]]] & ~ [E [~ [E [true U ~ [[p101<=1 & 1<=p101]]]] U [p81<=1 & 1<=p81]]]]

abstracting: (1<=p81)
states: 1,152,699,861,375 (12)
abstracting: (p81<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p101)
states: 716,753,665,038 (11)
abstracting: (p101<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p157)
states: 822,614,237,142 (11)
abstracting: (p157<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p193)
states: 2,267,632,626,210 (12)
abstracting: (p193<=1)
states: 23,115,125,806,922 (13)
.abstracting: (1<=p37)
states: 1,225,918,380,825 (12)
abstracting: (p37<=1)
states: 23,115,125,806,922 (13)
.abstracting: (0<=p117)
states: 23,115,125,806,922 (13)
abstracting: (p117<=0)
states: 22,398,372,141,884 (13)
-> the formula is TRUE

FORMULA SmartHome-PT-15-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.103sec

checking: AX [[E [[~ [[[p114<=1 & 1<=p114] | [p61<=1 & 1<=p61]]] & [[[p167<=1 & 1<=p167] & ~ [[p177<=1 & 1<=p177]]] | ~ [[p41<=1 & 1<=p41]]]] U ~ [[[p60<=1 & 1<=p60] & [p190<=1 & 1<=p190]]]] & AF [AG [[p40<=0 & 0<=p40]]]]]
normalized: ~ [EX [~ [[~ [EG [E [true U ~ [[p40<=0 & 0<=p40]]]]] & E [[[~ [[p41<=1 & 1<=p41]] | [~ [[p177<=1 & 1<=p177]] & [p167<=1 & 1<=p167]]] & ~ [[[p61<=1 & 1<=p61] | [p114<=1 & 1<=p114]]]] U ~ [[[p190<=1 & 1<=p190] & [p60<=1 & 1<=p60]]]]]]]]

abstracting: (1<=p60)
states: 1,585,733,284,440 (12)
abstracting: (p60<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p190)
states: 4,952,354,692,050 (12)
abstracting: (p190<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p114)
states: 716,753,665,038 (11)
abstracting: (p114<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p61)
states: 696,691,760,400 (11)
abstracting: (p61<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p167)
states: 1,215,373,422,615 (12)
abstracting: (p167<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p177)
states: 11,515,388,616 (10)
abstracting: (p177<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p41)
states: 1,225,918,380,825 (12)
abstracting: (p41<=1)
states: 23,115,125,806,922 (13)
abstracting: (0<=p40)
states: 23,115,125,806,922 (13)
abstracting: (p40<=0)
states: 21,889,207,426,097 (13)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA SmartHome-PT-15-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.833sec

checking: AF [E [[EX [[p126<=1 & 1<=p126]] | [p106<=1 & 1<=p106]] U A [[AG [[p161<=1 & 1<=p161]] | [~ [[p80<=1 & 1<=p80]] & ~ [[p29<=1 & 1<=p29]]]] U EF [[[p97<=1 & 1<=p97] & [[p179<=1 & 1<=p179] & [p121<=1 & 1<=p121]]]]]]]
normalized: ~ [EG [~ [E [[[p106<=1 & 1<=p106] | EX [[p126<=1 & 1<=p126]]] U [~ [EG [~ [E [true U [[[p121<=1 & 1<=p121] & [p179<=1 & 1<=p179]] & [p97<=1 & 1<=p97]]]]]] & ~ [E [~ [E [true U [[[p121<=1 & 1<=p121] & [p179<=1 & 1<=p179]] & [p97<=1 & 1<=p97]]]] U [~ [[[~ [[p80<=1 & 1<=p80]] & ~ [[p29<=1 & 1<=p29]]] | ~ [E [true U ~ [[p161<=1 & 1<=p161]]]]]] & ~ [E [true U [[[p121<=1 & 1<=p121] & [p179<=1 & 1<=p179]] & [p97<=1 & 1<=p97]]]]]]]]]]]]

abstracting: (1<=p97)
states: 1,541,008,278,180 (12)
abstracting: (p97<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p179)
states: 11,509,334,248,688 (13)
abstracting: (p179<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p121)
states: 716,753,665,038 (11)
abstracting: (p121<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p161)
states: 1,215,373,422,615 (12)
abstracting: (p161<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p29)
states: 1,225,918,380,825 (12)
abstracting: (p29<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p80)
states: 1,148,106,710,610 (12)
abstracting: (p80<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p97)
states: 1,541,008,278,180 (12)
abstracting: (p97<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p179)
states: 11,509,334,248,688 (13)
abstracting: (p179<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p121)
states: 716,753,665,038 (11)
abstracting: (p121<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p97)
states: 1,541,008,278,180 (12)
abstracting: (p97<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p179)
states: 11,509,334,248,688 (13)
abstracting: (p179<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p121)
states: 716,753,665,038 (11)
abstracting: (p121<=1)
states: 23,115,125,806,922 (13)
.
EG iterations: 1
abstracting: (1<=p126)
states: 716,753,665,038 (11)
abstracting: (p126<=1)
states: 23,115,125,806,922 (13)
.abstracting: (1<=p106)
states: 716,753,665,038 (11)
abstracting: (p106<=1)
states: 23,115,125,806,922 (13)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmartHome-PT-15-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.768sec

checking: EG [E [EF [[AG [[p128<=1 & 1<=p128]] | [p136<=1 & 1<=p136]]] U [AX [AX [[p164<=1 & 1<=p164]]] & [~ [[[p96<=1 & 1<=p96] & [p19<=1 & 1<=p19]]] & A [~ [[[p2<=1 & 1<=p2] & [p127<=1 & 1<=p127]]] U AF [[p156<=1 & 1<=p156]]]]]]]
normalized: EG [E [E [true U [[p136<=1 & 1<=p136] | ~ [E [true U ~ [[p128<=1 & 1<=p128]]]]]] U [[[~ [EG [EG [~ [[p156<=1 & 1<=p156]]]]] & ~ [E [EG [~ [[p156<=1 & 1<=p156]]] U [[[p127<=1 & 1<=p127] & [p2<=1 & 1<=p2]] & EG [~ [[p156<=1 & 1<=p156]]]]]]] & ~ [[[p19<=1 & 1<=p19] & [p96<=1 & 1<=p96]]]] & ~ [EX [EX [~ [[p164<=1 & 1<=p164]]]]]]]]

abstracting: (1<=p164)
states: 1,215,373,422,615 (12)
abstracting: (p164<=1)
states: 23,115,125,806,922 (13)
..abstracting: (1<=p96)
states: 1,541,008,278,180 (12)
abstracting: (p96<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p19)
states: 1,538,638,572,195 (12)
abstracting: (p19<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p156)
states: 819,041,744,198 (11)
abstracting: (p156<=1)
states: 23,115,125,806,922 (13)
.
EG iterations: 1
abstracting: (1<=p2)
states: 5,915,196,956,475 (12)
abstracting: (p2<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p127)
states: 716,753,665,038 (11)
abstracting: (p127<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p156)
states: 819,041,744,198 (11)
abstracting: (p156<=1)
states: 23,115,125,806,922 (13)
.
EG iterations: 1
abstracting: (1<=p156)
states: 819,041,744,198 (11)
abstracting: (p156<=1)
states: 23,115,125,806,922 (13)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p128)
states: 537,505,272,797 (11)
abstracting: (p128<=1)
states: 23,115,125,806,922 (13)
abstracting: (1<=p136)
states: 822,614,237,142 (11)
abstracting: (p136<=1)
states: 23,115,125,806,922 (13)
.
EG iterations: 1
-> the formula is FALSE

FORMULA SmartHome-PT-15-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.730sec

totally nodes used: 23604418 (2.4e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 44284078 100477486 144761564
used/not used/entry size/cache size: 55651171 11457693 16 1024MB
basic ops cache: hits/miss/sum: 10509219 26007689 36516908
used/not used/entry size/cache size: 15289176 1488040 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: 113683 285861 399544
used/not used/entry size/cache size: 281194 8107414 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 48370498
1 14775982
2 3208951
3 625540
4 108529
5 16750
6 2294
7 281
8 35
9 3
>= 10 1

Total processing time: 1m 8.423sec


BK_STOP 1679316317811

--------------------
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 CTLFireability -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:7416 (28), effective:556 (2)

initing FirstDep: 0m 0.000sec


iterations count:259 (1), effective:1 (0)

iterations count:256 (1), effective:0 (0)

iterations count:261 (1), effective:1 (0)

iterations count:259 (1), effective:1 (0)

iterations count:256 (1), effective:0 (0)

iterations count:259 (1), effective:1 (0)

iterations count:256 (1), effective:0 (0)

iterations count:741 (2), effective:31 (0)

iterations count:2754 (10), effective:195 (0)

iterations count:736 (2), effective:31 (0)

iterations count:736 (2), effective:31 (0)

iterations count:256 (1), effective:0 (0)

iterations count:736 (2), effective:31 (0)

iterations count:571 (2), effective:27 (0)

iterations count:571 (2), effective:27 (0)

iterations count:275 (1), effective:1 (0)

iterations count:571 (2), effective:27 (0)

iterations count:650 (2), effective:22 (0)

iterations count:845 (3), effective:30 (0)

iterations count:2621 (10), effective:212 (0)

iterations count:763 (2), effective:48 (0)

iterations count:1723 (6), effective:132 (0)

iterations count:763 (2), effective:48 (0)

iterations count:1723 (6), effective:132 (0)

iterations count:763 (2), effective:48 (0)

iterations count:1723 (6), effective:132 (0)

iterations count:262 (1), effective:1 (0)

iterations count:256 (1), effective:0 (0)

iterations count:1892 (7), effective:144 (0)

iterations count:692 (2), effective:36 (0)

iterations count:675 (2), effective:37 (0)

iterations count:844 (3), effective:22 (0)

iterations count:947 (3), effective:27 (0)

iterations count:882 (3), effective:52 (0)

iterations count:260 (1), effective:1 (0)

iterations count:882 (3), effective:52 (0)

iterations count:1530 (5), effective:99 (0)

iterations count:882 (3), effective:52 (0)

iterations count:256 (1), effective:0 (0)

iterations count:690 (2), effective:39 (0)

iterations count:394 (1), effective:1 (0)

iterations count:759 (2), effective:34 (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-15"
export BK_EXAMINATION="CTLFireability"
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-15, 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 r458-smll-167912650000266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-15.tgz
mv SmartHome-PT-15 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;