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-167912649900194.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-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912649900194
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.1K Feb 26 05:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 05:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 05:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 05:44 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.6K Feb 25 17:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 05:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Feb 26 05:46 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 56K 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-06-CTLFireability-00
FORMULA_NAME SmartHome-PT-06-CTLFireability-01
FORMULA_NAME SmartHome-PT-06-CTLFireability-02
FORMULA_NAME SmartHome-PT-06-CTLFireability-03
FORMULA_NAME SmartHome-PT-06-CTLFireability-04
FORMULA_NAME SmartHome-PT-06-CTLFireability-05
FORMULA_NAME SmartHome-PT-06-CTLFireability-06
FORMULA_NAME SmartHome-PT-06-CTLFireability-07
FORMULA_NAME SmartHome-PT-06-CTLFireability-08
FORMULA_NAME SmartHome-PT-06-CTLFireability-09
FORMULA_NAME SmartHome-PT-06-CTLFireability-10
FORMULA_NAME SmartHome-PT-06-CTLFireability-11
FORMULA_NAME SmartHome-PT-06-CTLFireability-12
FORMULA_NAME SmartHome-PT-06-CTLFireability-13
FORMULA_NAME SmartHome-PT-06-CTLFireability-14
FORMULA_NAME SmartHome-PT-06-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679310019888

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-06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 11:00:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 11:00:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:00:23] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2023-03-20 11:00:23] [INFO ] Transformed 219 places.
[2023-03-20 11:00:23] [INFO ] Transformed 254 transitions.
[2023-03-20 11:00:23] [INFO ] Found NUPN structural information;
[2023-03-20 11:00:23] [INFO ] Parsed PT model containing 219 places and 254 transitions and 581 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 18 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-06-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 82 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 167 transition count 201
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 167 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 73 place count 167 transition count 198
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 78 place count 162 transition count 193
Iterating global reduction 1 with 5 rules applied. Total rules applied 83 place count 162 transition count 193
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 159 transition count 190
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 159 transition count 190
Applied a total of 89 rules in 66 ms. Remains 159 /202 variables (removed 43) and now considering 190/236 (removed 46) transitions.
// Phase 1: matrix 190 rows 159 cols
[2023-03-20 11:00:23] [INFO ] Computed 9 place invariants in 20 ms
[2023-03-20 11:00:23] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-20 11:00:23] [INFO ] Invariant cache hit.
[2023-03-20 11:00:23] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2023-03-20 11:00:23] [INFO ] Invariant cache hit.
[2023-03-20 11:00:23] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 159/202 places, 190/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 768 ms. Remains : 159/202 places, 190/236 transitions.
Support contains 82 out of 159 places after structural reductions.
[2023-03-20 11:00:24] [INFO ] Flatten gal took : 53 ms
[2023-03-20 11:00:24] [INFO ] Flatten gal took : 26 ms
[2023-03-20 11:00:24] [INFO ] Input system was already deterministic with 190 transitions.
Support contains 81 out of 159 places (down from 82) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 702 ms. (steps per millisecond=14 ) properties (out of 66) seen :55
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-20 11:00:25] [INFO ] Invariant cache hit.
[2023-03-20 11:00:26] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-20 11:00:26] [INFO ] After 170ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
[2023-03-20 11:00:26] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 8 ms to minimize.
[2023-03-20 11:00:26] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2023-03-20 11:00:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2023-03-20 11:00:26] [INFO ] After 326ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 11:00:26] [INFO ] After 511ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 11:00:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-20 11:00:26] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-20 11:00:26] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-20 11:00:27] [INFO ] After 599ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 5 properties in 29 ms.
Support contains 9 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 190/190 transitions.
Graph (trivial) has 148 edges and 159 vertex of which 68 / 159 are part of one of the 5 SCC in 4 ms
Free SCC test removed 63 places
Drop transitions removed 85 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 86 transitions.
Graph (complete) has 178 edges and 96 vertex of which 91 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 91 transition count 63
Reduce places removed 32 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 39 rules applied. Total rules applied 78 place count 59 transition count 56
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 56 transition count 56
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 81 place count 56 transition count 51
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 91 place count 51 transition count 51
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 99 place count 43 transition count 43
Iterating global reduction 3 with 8 rules applied. Total rules applied 107 place count 43 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 109 place count 43 transition count 41
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 135 place count 30 transition count 28
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 82 edges and 30 vertex of which 29 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 4 with 5 rules applied. Total rules applied 140 place count 29 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 28 transition count 23
Applied a total of 141 rules in 31 ms. Remains 28 /159 variables (removed 131) and now considering 23/190 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 28/159 places, 23/190 transitions.
Incomplete random walk after 10000 steps, including 1463 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 359 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 362 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 363 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 432 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Finished probabilistic random walk after 91 steps, run visited all 4 properties in 10 ms. (steps per millisecond=9 )
Probabilistic random walk after 91 steps, saw 78 distinct states, run finished after 10 ms. (steps per millisecond=9 ) properties seen :4
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-03-20 11:00:27] [INFO ] Flatten gal took : 14 ms
[2023-03-20 11:00:27] [INFO ] Flatten gal took : 20 ms
[2023-03-20 11:00:27] [INFO ] Input system was already deterministic with 190 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 159/159 places, 190/190 transitions.
Graph (trivial) has 148 edges and 159 vertex of which 60 / 159 are part of one of the 5 SCC in 1 ms
Free SCC test removed 55 places
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 103 transition count 91
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 33 rules applied. Total rules applied 62 place count 75 transition count 86
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 66 place count 73 transition count 84
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 71 transition count 84
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 68 place count 71 transition count 77
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 82 place count 64 transition count 77
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 92 place count 54 transition count 67
Iterating global reduction 4 with 10 rules applied. Total rules applied 102 place count 54 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 104 place count 54 transition count 65
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 134 place count 39 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 135 place count 39 transition count 48
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 6 with 2 rules applied. Total rules applied 137 place count 38 transition count 47
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 144 place count 38 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 145 place count 37 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 147 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 148 place count 34 transition count 38
Applied a total of 148 rules in 43 ms. Remains 34 /159 variables (removed 125) and now considering 38/190 (removed 152) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 34/159 places, 38/190 transitions.
[2023-03-20 11:00:27] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:00:27] [INFO ] Flatten gal took : 3 ms
[2023-03-20 11:00:27] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 159/159 places, 190/190 transitions.
Graph (trivial) has 140 edges and 159 vertex of which 36 / 159 are part of one of the 4 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 126 transition count 107
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 46 rules applied. Total rules applied 87 place count 86 transition count 101
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 94 place count 83 transition count 97
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 100 place count 79 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 78 transition count 95
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 101 place count 78 transition count 87
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 117 place count 70 transition count 87
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 130 place count 57 transition count 74
Iterating global reduction 5 with 13 rules applied. Total rules applied 143 place count 57 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 145 place count 57 transition count 72
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 177 place count 41 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 181 place count 41 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 182 place count 40 transition count 51
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 184 place count 39 transition count 50
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 192 place count 39 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 193 place count 38 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 195 place count 36 transition count 40
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 14 edges and 35 vertex of which 2 / 35 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 2 rules applied. Total rules applied 197 place count 34 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 199 place count 34 transition count 38
Applied a total of 199 rules in 35 ms. Remains 34 /159 variables (removed 125) and now considering 38/190 (removed 152) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 34/159 places, 38/190 transitions.
[2023-03-20 11:00:27] [INFO ] Flatten gal took : 3 ms
[2023-03-20 11:00:27] [INFO ] Flatten gal took : 3 ms
[2023-03-20 11:00:27] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 190/190 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 135 transition count 166
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 135 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 135 transition count 164
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 59 place count 126 transition count 155
Iterating global reduction 1 with 9 rules applied. Total rules applied 68 place count 126 transition count 155
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 76 place count 118 transition count 147
Iterating global reduction 1 with 8 rules applied. Total rules applied 84 place count 118 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 118 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 117 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 117 transition count 145
Applied a total of 87 rules in 27 ms. Remains 117 /159 variables (removed 42) and now considering 145/190 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 117/159 places, 145/190 transitions.
[2023-03-20 11:00:27] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:00:27] [INFO ] Flatten gal took : 14 ms
[2023-03-20 11:00:27] [INFO ] Input system was already deterministic with 145 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 190/190 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 141 transition count 172
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 141 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 141 transition count 170
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 136 transition count 165
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 136 transition count 165
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 132 transition count 161
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 132 transition count 161
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 131 transition count 160
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 131 transition count 160
Applied a total of 58 rules in 12 ms. Remains 131 /159 variables (removed 28) and now considering 160/190 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 131/159 places, 160/190 transitions.
[2023-03-20 11:00:27] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:00:27] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:00:27] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 190/190 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 136 transition count 167
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 136 transition count 167
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 136 transition count 165
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 57 place count 127 transition count 156
Iterating global reduction 1 with 9 rules applied. Total rules applied 66 place count 127 transition count 156
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 74 place count 119 transition count 148
Iterating global reduction 1 with 8 rules applied. Total rules applied 82 place count 119 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 119 transition count 147
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 117 transition count 145
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 117 transition count 145
Applied a total of 87 rules in 11 ms. Remains 117 /159 variables (removed 42) and now considering 145/190 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 117/159 places, 145/190 transitions.
[2023-03-20 11:00:27] [INFO ] Flatten gal took : 7 ms
[2023-03-20 11:00:27] [INFO ] Flatten gal took : 8 ms
[2023-03-20 11:00:27] [INFO ] Input system was already deterministic with 145 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 190/190 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 139 transition count 170
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 139 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 139 transition count 169
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 133 transition count 163
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 133 transition count 163
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 59 place count 127 transition count 157
Iterating global reduction 1 with 6 rules applied. Total rules applied 65 place count 127 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 127 transition count 156
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 125 transition count 154
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 125 transition count 154
Applied a total of 70 rules in 10 ms. Remains 125 /159 variables (removed 34) and now considering 154/190 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 125/159 places, 154/190 transitions.
[2023-03-20 11:00:27] [INFO ] Flatten gal took : 8 ms
[2023-03-20 11:00:27] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:00:27] [INFO ] Input system was already deterministic with 154 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 190/190 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 141 transition count 172
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 141 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 141 transition count 170
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 135 transition count 164
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 135 transition count 164
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 132 transition count 161
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 132 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 132 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 131 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 131 transition count 159
Applied a total of 59 rules in 13 ms. Remains 131 /159 variables (removed 28) and now considering 159/190 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 131/159 places, 159/190 transitions.
[2023-03-20 11:00:27] [INFO ] Flatten gal took : 7 ms
[2023-03-20 11:00:27] [INFO ] Flatten gal took : 8 ms
[2023-03-20 11:00:27] [INFO ] Input system was already deterministic with 159 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 159/159 places, 190/190 transitions.
Graph (trivial) has 142 edges and 159 vertex of which 47 / 159 are part of one of the 4 SCC in 0 ms
Free SCC test removed 43 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 115 transition count 97
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 40 rules applied. Total rules applied 77 place count 79 transition count 93
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 81 place count 78 transition count 90
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 86 place count 75 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 87 place count 74 transition count 88
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 87 place count 74 transition count 80
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 103 place count 66 transition count 80
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 116 place count 53 transition count 67
Iterating global reduction 5 with 13 rules applied. Total rules applied 129 place count 53 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 131 place count 53 transition count 65
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 159 place count 39 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 160 place count 39 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 162 place count 38 transition count 49
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 172 place count 38 transition count 39
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 174 place count 37 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 175 place count 36 transition count 38
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 176 place count 36 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 178 place count 34 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 179 place count 33 transition count 36
Applied a total of 179 rules in 25 ms. Remains 33 /159 variables (removed 126) and now considering 36/190 (removed 154) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 33/159 places, 36/190 transitions.
[2023-03-20 11:00:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 11:00:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 11:00:27] [INFO ] Input system was already deterministic with 36 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 190/190 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 139 transition count 170
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 139 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 139 transition count 168
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 49 place count 132 transition count 161
Iterating global reduction 1 with 7 rules applied. Total rules applied 56 place count 132 transition count 161
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 126 transition count 155
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 126 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 126 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 124 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 124 transition count 152
Applied a total of 73 rules in 11 ms. Remains 124 /159 variables (removed 35) and now considering 152/190 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 124/159 places, 152/190 transitions.
[2023-03-20 11:00:27] [INFO ] Flatten gal took : 8 ms
[2023-03-20 11:00:28] [INFO ] Flatten gal took : 8 ms
[2023-03-20 11:00:28] [INFO ] Input system was already deterministic with 152 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 159/159 places, 190/190 transitions.
Graph (trivial) has 138 edges and 159 vertex of which 56 / 159 are part of one of the 4 SCC in 0 ms
Free SCC test removed 52 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 106 transition count 92
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 33 rules applied. Total rules applied 64 place count 76 transition count 89
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 75 transition count 87
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 70 place count 73 transition count 86
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 70 place count 73 transition count 79
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 84 place count 66 transition count 79
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 96 place count 54 transition count 67
Iterating global reduction 4 with 12 rules applied. Total rules applied 108 place count 54 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 109 place count 54 transition count 66
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 135 place count 41 transition count 53
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 138 place count 41 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 139 place count 40 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 141 place count 39 transition count 49
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 146 place count 39 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 147 place count 38 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 148 place count 37 transition count 43
Applied a total of 148 rules in 17 ms. Remains 37 /159 variables (removed 122) and now considering 43/190 (removed 147) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 37/159 places, 43/190 transitions.
[2023-03-20 11:00:28] [INFO ] Flatten gal took : 2 ms
[2023-03-20 11:00:28] [INFO ] Flatten gal took : 3 ms
[2023-03-20 11:00:28] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 159/159 places, 190/190 transitions.
Graph (trivial) has 149 edges and 159 vertex of which 57 / 159 are part of one of the 4 SCC in 1 ms
Free SCC test removed 53 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 105 transition count 86
Reduce places removed 36 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 43 rules applied. Total rules applied 80 place count 69 transition count 79
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 83 place count 66 transition count 79
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 83 place count 66 transition count 73
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 95 place count 60 transition count 73
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 107 place count 48 transition count 61
Iterating global reduction 3 with 12 rules applied. Total rules applied 119 place count 48 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 121 place count 48 transition count 59
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 149 place count 34 transition count 44
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 4 with 3 rules applied. Total rules applied 152 place count 34 transition count 41
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 154 place count 33 transition count 40
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 6 with 2 rules applied. Total rules applied 156 place count 32 transition count 39
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 161 place count 32 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 162 place count 31 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 163 place count 30 transition count 33
Applied a total of 163 rules in 13 ms. Remains 30 /159 variables (removed 129) and now considering 33/190 (removed 157) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 30/159 places, 33/190 transitions.
[2023-03-20 11:00:28] [INFO ] Flatten gal took : 1 ms
[2023-03-20 11:00:28] [INFO ] Flatten gal took : 2 ms
[2023-03-20 11:00:28] [INFO ] Input system was already deterministic with 33 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
FORMULA SmartHome-PT-06-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 159/159 places, 190/190 transitions.
Graph (trivial) has 141 edges and 159 vertex of which 43 / 159 are part of one of the 4 SCC in 0 ms
Free SCC test removed 39 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 119 transition count 100
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 43 rules applied. Total rules applied 82 place count 81 transition count 95
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 5 rules applied. Total rules applied 87 place count 78 transition count 93
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 91 place count 77 transition count 90
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 94 place count 74 transition count 90
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 94 place count 74 transition count 86
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 102 place count 70 transition count 86
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 116 place count 56 transition count 72
Iterating global reduction 5 with 14 rules applied. Total rules applied 130 place count 56 transition count 72
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 134 place count 56 transition count 68
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 135 place count 55 transition count 67
Iterating global reduction 6 with 1 rules applied. Total rules applied 136 place count 55 transition count 67
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 166 place count 40 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 168 place count 40 transition count 49
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 170 place count 39 transition count 48
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 178 place count 39 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 179 place count 38 transition count 40
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 181 place count 38 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 183 place count 36 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 184 place count 35 transition count 38
Applied a total of 184 rules in 14 ms. Remains 35 /159 variables (removed 124) and now considering 38/190 (removed 152) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 35/159 places, 38/190 transitions.
[2023-03-20 11:00:28] [INFO ] Flatten gal took : 2 ms
[2023-03-20 11:00:28] [INFO ] Flatten gal took : 2 ms
[2023-03-20 11:00:28] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 190/190 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 137 transition count 168
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 137 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 137 transition count 167
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 128 transition count 158
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 128 transition count 158
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 71 place count 120 transition count 150
Iterating global reduction 1 with 8 rules applied. Total rules applied 79 place count 120 transition count 150
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 120 transition count 149
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 118 transition count 147
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 118 transition count 147
Applied a total of 84 rules in 10 ms. Remains 118 /159 variables (removed 41) and now considering 147/190 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 118/159 places, 147/190 transitions.
[2023-03-20 11:00:28] [INFO ] Flatten gal took : 7 ms
[2023-03-20 11:00:28] [INFO ] Flatten gal took : 7 ms
[2023-03-20 11:00:28] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 159/159 places, 190/190 transitions.
Graph (trivial) has 150 edges and 159 vertex of which 68 / 159 are part of one of the 5 SCC in 0 ms
Free SCC test removed 63 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 95 transition count 76
Reduce places removed 32 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 39 rules applied. Total rules applied 72 place count 63 transition count 69
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 75 place count 60 transition count 69
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 75 place count 60 transition count 65
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 83 place count 56 transition count 65
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 95 place count 44 transition count 53
Iterating global reduction 3 with 12 rules applied. Total rules applied 107 place count 44 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 109 place count 44 transition count 51
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 135 place count 31 transition count 38
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 144 place count 31 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 146 place count 29 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 148 place count 27 transition count 27
Applied a total of 148 rules in 8 ms. Remains 27 /159 variables (removed 132) and now considering 27/190 (removed 163) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 27/159 places, 27/190 transitions.
[2023-03-20 11:00:28] [INFO ] Flatten gal took : 1 ms
[2023-03-20 11:00:28] [INFO ] Flatten gal took : 2 ms
[2023-03-20 11:00:28] [INFO ] Input system was already deterministic with 27 transitions.
Incomplete random walk after 10000 steps, including 1463 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 433 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 111 steps, run visited all 1 properties in 4 ms. (steps per millisecond=27 )
Probabilistic random walk after 111 steps, saw 83 distinct states, run finished after 5 ms. (steps per millisecond=22 ) properties seen :1
FORMULA SmartHome-PT-06-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2023-03-20 11:00:28] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:00:28] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:00:28] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-20 11:00:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 159 places, 190 transitions and 447 arcs took 1 ms.
Total runtime 5551 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: 159 NrTr: 190 NrArc: 447)

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

net check time: 0m 0.000sec

init dd package: 0m 3.718sec


RS generation: 0m 1.219sec


-> reachability set: #nodes 7597 (7.6e+03) #states 1,721,712,427 (9)



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

checking: E [AF [~ [A [[p76<=1 & 1<=p76] U [p27<=1 & 1<=p27]]]] U AX [1<=0]]
normalized: E [~ [EG [[~ [E [~ [[p27<=1 & 1<=p27]] U [~ [[p27<=1 & 1<=p27]] & ~ [[p76<=1 & 1<=p76]]]]] & ~ [EG [~ [[p27<=1 & 1<=p27]]]]]]] U ~ [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
.abstracting: (1<=p27)
states: 111,296,916 (8)
abstracting: (p27<=1)
states: 1,721,712,427 (9)
...............
EG iterations: 15
abstracting: (1<=p76)
states: 4,596,480 (6)
abstracting: (p76<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p27)
states: 111,296,916 (8)
abstracting: (p27<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p27)
states: 111,296,916 (8)
abstracting: (p27<=1)
states: 1,721,712,427 (9)
.......
EG iterations: 7
-> the formula is TRUE

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

MC time: 0m 0.913sec

checking: EF [[[p125<=1 & 1<=p125] & EG [[EG [[p38<=1 & 1<=p38]] & [EG [[p81<=1 & 1<=p81]] & AF [[p85<=1 & 1<=p85]]]]]]]
normalized: E [true U [EG [[[~ [EG [~ [[p85<=1 & 1<=p85]]]] & EG [[p81<=1 & 1<=p81]]] & EG [[p38<=1 & 1<=p38]]]] & [p125<=1 & 1<=p125]]]

abstracting: (1<=p125)
states: 106,902,583 (8)
abstracting: (p125<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p38)
states: 86,578,200 (7)
abstracting: (p38<=1)
states: 1,721,712,427 (9)
.......
EG iterations: 7
abstracting: (1<=p81)
states: 51,663,764 (7)
abstracting: (p81<=1)
states: 1,721,712,427 (9)
.......
EG iterations: 7
abstracting: (1<=p85)
states: 51,663,764 (7)
abstracting: (p85<=1)
states: 1,721,712,427 (9)
........
EG iterations: 8
.
EG iterations: 1
-> the formula is FALSE

FORMULA SmartHome-PT-06-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.407sec

checking: EF [AG [A [[AG [[p48<=1 & 1<=p48]] | [[p20<=1 & 1<=p20] | [p85<=1 & 1<=p85]]] U [p41<=1 & 1<=p41]]]]
normalized: E [true U ~ [E [true U ~ [[~ [EG [~ [[p41<=1 & 1<=p41]]]] & ~ [E [~ [[p41<=1 & 1<=p41]] U [~ [[[[p85<=1 & 1<=p85] | [p20<=1 & 1<=p20]] | ~ [E [true U ~ [[p48<=1 & 1<=p48]]]]]] & ~ [[p41<=1 & 1<=p41]]]]]]]]]]

abstracting: (1<=p41)
states: 86,578,200 (7)
abstracting: (p41<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p48)
states: 86,578,200 (7)
abstracting: (p48<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p20)
states: 111,296,916 (8)
abstracting: (p20<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p85)
states: 51,663,764 (7)
abstracting: (p85<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p41)
states: 86,578,200 (7)
abstracting: (p41<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p41)
states: 86,578,200 (7)
abstracting: (p41<=1)
states: 1,721,712,427 (9)
.
EG iterations: 1
-> the formula is FALSE

FORMULA SmartHome-PT-06-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.149sec

checking: EF [AX [[~ [E [[p5<=1 & 1<=p5] U [p132<=1 & 1<=p132]]] | [[p48<=1 & 1<=p48] & [p140<=1 & 1<=p140]]]]]
normalized: E [true U ~ [EX [~ [[[[p140<=1 & 1<=p140] & [p48<=1 & 1<=p48]] | ~ [E [[p5<=1 & 1<=p5] U [p132<=1 & 1<=p132]]]]]]]]

abstracting: (1<=p132)
states: 317,513,952 (8)
abstracting: (p132<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p5)
states: 412,798,446 (8)
abstracting: (p5<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p48)
states: 86,578,200 (7)
abstracting: (p48<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p140)
states: 74,034,576 (7)
abstracting: (p140<=1)
states: 1,721,712,427 (9)
.-> the formula is TRUE

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

MC time: 0m 0.764sec

checking: [EG [EF [[[p55<=1 & 1<=p55] & EF [[p107<=1 & 1<=p107]]]]] | EG [[[p44<=1 & 1<=p44] | AG [[EG [[p48<=1 & 1<=p48]] & [p87<=1 & 1<=p87]]]]]]
normalized: [EG [E [true U [E [true U [p107<=1 & 1<=p107]] & [p55<=1 & 1<=p55]]]] | EG [[~ [E [true U ~ [[EG [[p48<=1 & 1<=p48]] & [p87<=1 & 1<=p87]]]]] | [p44<=1 & 1<=p44]]]]

abstracting: (1<=p44)
states: 86,578,200 (7)
abstracting: (p44<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p87)
states: 51,663,764 (7)
abstracting: (p87<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p48)
states: 86,578,200 (7)
abstracting: (p48<=1)
states: 1,721,712,427 (9)
.......
EG iterations: 7
.......
EG iterations: 7
abstracting: (1<=p55)
states: 84,171,582 (7)
abstracting: (p55<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p107)
states: 51,663,764 (7)
abstracting: (p107<=1)
states: 1,721,712,427 (9)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.775sec

checking: AG [A [E [A [~ [[[p2<=1 & 1<=p2] & [1<=p48 & p48<=1]]] U A [[p47<=1 & 1<=p47] U [p45<=1 & 1<=p45]]] U [p58<=1 & 1<=p58]] U ~ [[[p61<=1 & 1<=p61] | ~ [A [[p3<=1 & 1<=p3] U [p58<=1 & 1<=p58]]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [[~ [[~ [EG [~ [[p58<=1 & 1<=p58]]]] & ~ [E [~ [[p58<=1 & 1<=p58]] U [~ [[p3<=1 & 1<=p3]] & ~ [[p58<=1 & 1<=p58]]]]]]] | [p61<=1 & 1<=p61]]]] & ~ [E [[~ [[~ [EG [~ [[p58<=1 & 1<=p58]]]] & ~ [E [~ [[p58<=1 & 1<=p58]] U [~ [[p3<=1 & 1<=p3]] & ~ [[p58<=1 & 1<=p58]]]]]]] | [p61<=1 & 1<=p61]] U [~ [E [[~ [EG [~ [[~ [EG [~ [[p45<=1 & 1<=p45]]]] & ~ [E [~ [[p45<=1 & 1<=p45]] U [~ [[p47<=1 & 1<=p47]] & ~ [[p45<=1 & 1<=p45]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[p45<=1 & 1<=p45]]]] & ~ [E [~ [[p45<=1 & 1<=p45]] U [~ [[p47<=1 & 1<=p47]] & ~ [[p45<=1 & 1<=p45]]]]]]] U [[[1<=p48 & p48<=1] & [p2<=1 & 1<=p2]] & ~ [[~ [EG [~ [[p45<=1 & 1<=p45]]]] & ~ [E [~ [[p45<=1 & 1<=p45]] U [~ [[p47<=1 & 1<=p47]] & ~ [[p45<=1 & 1<=p45]]]]]]]]]]] U [p58<=1 & 1<=p58]]] & [~ [[~ [EG [~ [[p58<=1 & 1<=p58]]]] & ~ [E [~ [[p58<=1 & 1<=p58]] U [~ [[p3<=1 & 1<=p3]] & ~ [[p58<=1 & 1<=p58]]]]]]] | [p61<=1 & 1<=p61]]]]]]]]]

abstracting: (1<=p61)
states: 84,171,582 (7)
abstracting: (p61<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p58)
states: 84,171,582 (7)
abstracting: (p58<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p3)
states: 399,180,960 (8)
abstracting: (p3<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p58)
states: 84,171,582 (7)
abstracting: (p58<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p58)
states: 84,171,582 (7)
abstracting: (p58<=1)
states: 1,721,712,427 (9)
.........
EG iterations: 9
abstracting: (1<=p58)
states: 84,171,582 (7)
abstracting: (p58<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p45)
states: 86,578,200 (7)
abstracting: (p45<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p47)
states: 86,578,200 (7)
abstracting: (p47<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p45)
states: 86,578,200 (7)
abstracting: (p45<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p45)
states: 86,578,200 (7)
abstracting: (p45<=1)
states: 1,721,712,427 (9)
.......
EG iterations: 7
abstracting: (1<=p2)
states: 454,868,156 (8)
abstracting: (p2<=1)
states: 1,721,712,427 (9)
abstracting: (p48<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p48)
states: 86,578,200 (7)
abstracting: (1<=p45)
states: 86,578,200 (7)
abstracting: (p45<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p47)
states: 86,578,200 (7)
abstracting: (p47<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p45)
states: 86,578,200 (7)
abstracting: (p45<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p45)
states: 86,578,200 (7)
abstracting: (p45<=1)
states: 1,721,712,427 (9)
.......
EG iterations: 7
abstracting: (1<=p45)
states: 86,578,200 (7)
abstracting: (p45<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p47)
states: 86,578,200 (7)
abstracting: (p47<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p45)
states: 86,578,200 (7)
abstracting: (p45<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p45)
states: 86,578,200 (7)
abstracting: (p45<=1)
states: 1,721,712,427 (9)
.......
EG iterations: 7
.......
EG iterations: 7
abstracting: (1<=p61)
states: 84,171,582 (7)
abstracting: (p61<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p58)
states: 84,171,582 (7)
abstracting: (p58<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p3)
states: 399,180,960 (8)
abstracting: (p3<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p58)
states: 84,171,582 (7)
abstracting: (p58<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p58)
states: 84,171,582 (7)
abstracting: (p58<=1)
states: 1,721,712,427 (9)
.........
EG iterations: 9
abstracting: (1<=p61)
states: 84,171,582 (7)
abstracting: (p61<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p58)
states: 84,171,582 (7)
abstracting: (p58<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p3)
states: 399,180,960 (8)
abstracting: (p3<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p58)
states: 84,171,582 (7)
abstracting: (p58<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p58)
states: 84,171,582 (7)
abstracting: (p58<=1)
states: 1,721,712,427 (9)
.........
EG iterations: 9
.........
EG iterations: 9
-> the formula is FALSE

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

MC time: 0m 0.305sec

checking: AG [[EG [[AF [[p149<=0 & 0<=p149]] | [[EG [[p43<=1 & 1<=p43]] & [p38<=1 & 1<=p38]] & [[p33<=0 & 0<=p33] & [[p155<=0 & 0<=p155] | [p158<=0 & 0<=p158]]]]]] & [[p108<=0 & 0<=p108] | [p148<=0 & 0<=p148]]]]
normalized: ~ [E [true U ~ [[[[p148<=0 & 0<=p148] | [p108<=0 & 0<=p108]] & EG [[[[[[p158<=0 & 0<=p158] | [p155<=0 & 0<=p155]] & [p33<=0 & 0<=p33]] & [[p38<=1 & 1<=p38] & EG [[p43<=1 & 1<=p43]]]] | ~ [EG [~ [[p149<=0 & 0<=p149]]]]]]]]]]

abstracting: (0<=p149)
states: 1,721,712,427 (9)
abstracting: (p149<=0)
states: 1,647,677,851 (9)
....
EG iterations: 4
abstracting: (1<=p43)
states: 86,578,200 (7)
abstracting: (p43<=1)
states: 1,721,712,427 (9)
.......
EG iterations: 7
abstracting: (1<=p38)
states: 86,578,200 (7)
abstracting: (p38<=1)
states: 1,721,712,427 (9)
abstracting: (0<=p33)
states: 1,721,712,427 (9)
abstracting: (p33<=0)
states: 1,635,134,227 (9)
abstracting: (0<=p155)
states: 1,721,712,427 (9)
abstracting: (p155<=0)
states: 1,588,387,147 (9)
abstracting: (0<=p158)
states: 1,721,712,427 (9)
abstracting: (p158<=0)
states: 1,514,352,571 (9)
.
EG iterations: 1
abstracting: (0<=p108)
states: 1,721,712,427 (9)
abstracting: (p108<=0)
states: 1,670,048,663 (9)
abstracting: (0<=p148)
states: 1,721,712,427 (9)
abstracting: (p148<=0)
states: 1,655,049,787 (9)
-> the formula is FALSE

FORMULA SmartHome-PT-06-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.744sec

checking: EX [[AG [[[p116<=0 & 0<=p116] | [[p108<=0 & 0<=p108] | [p130<=0 & 0<=p130]]]] | [EF [[[p42<=1 & 1<=p42] & [AG [[p119<=1 & 1<=p119]] & EG [[p143<=1 & 1<=p143]]]]] & [[p150<=1 & 1<=p150] & AF [[[p96<=0 & 0<=p96] & [p87<=0 & 0<=p87]]]]]]]
normalized: EX [[[E [true U [[~ [E [true U ~ [[p119<=1 & 1<=p119]]]] & EG [[p143<=1 & 1<=p143]]] & [p42<=1 & 1<=p42]]] & [~ [EG [~ [[[p87<=0 & 0<=p87] & [p96<=0 & 0<=p96]]]]] & [p150<=1 & 1<=p150]]] | ~ [E [true U ~ [[[[p130<=0 & 0<=p130] | [p108<=0 & 0<=p108]] | [p116<=0 & 0<=p116]]]]]]]

abstracting: (0<=p116)
states: 1,721,712,427 (9)
abstracting: (p116<=0)
states: 1,614,809,844 (9)
abstracting: (0<=p108)
states: 1,721,712,427 (9)
abstracting: (p108<=0)
states: 1,670,048,663 (9)
abstracting: (0<=p130)
states: 1,721,712,427 (9)
abstracting: (p130<=0)
states: 1,362,132,455 (9)
abstracting: (1<=p150)
states: 74,034,576 (7)
abstracting: (p150<=1)
states: 1,721,712,427 (9)
abstracting: (0<=p96)
states: 1,721,712,427 (9)
abstracting: (p96<=0)
states: 1,670,048,663 (9)
abstracting: (0<=p87)
states: 1,721,712,427 (9)
abstracting: (p87<=0)
states: 1,670,048,663 (9)
.......
EG iterations: 7
abstracting: (1<=p42)
states: 86,578,200 (7)
abstracting: (p42<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p143)
states: 58,769,568 (7)
abstracting: (p143<=1)
states: 1,721,712,427 (9)
....
EG iterations: 4
abstracting: (1<=p119)
states: 106,902,583 (8)
abstracting: (p119<=1)
states: 1,721,712,427 (9)
.-> the formula is FALSE

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

MC time: 0m 0.588sec

checking: [AG [AX [AF [[p40<=0 & 0<=p40]]]] | [E [[p24<=1 & 1<=p24] U [A [AF [[p62<=1 & 1<=p62]] U AG [[p134<=1 & 1<=p134]]] | [p46<=1 & 1<=p46]]] & E [[[[p2<=1 & 1<=p2] & [p48<=1 & 1<=p48]] & [~ [[[p1<=1 & 1<=p1] | [p0<=1 & 1<=p0]]] & ~ [[p37<=1 & 1<=p37]]]] U [p93<=1 & 1<=p93]]]]
normalized: [[E [[[~ [[p37<=1 & 1<=p37]] & ~ [[[p0<=1 & 1<=p0] | [p1<=1 & 1<=p1]]]] & [[p48<=1 & 1<=p48] & [p2<=1 & 1<=p2]]] U [p93<=1 & 1<=p93]] & E [[p24<=1 & 1<=p24] U [[p46<=1 & 1<=p46] | [~ [EG [E [true U ~ [[p134<=1 & 1<=p134]]]]] & ~ [E [E [true U ~ [[p134<=1 & 1<=p134]]] U [EG [~ [[p62<=1 & 1<=p62]]] & E [true U ~ [[p134<=1 & 1<=p134]]]]]]]]]] | ~ [E [true U EX [EG [~ [[p40<=0 & 0<=p40]]]]]]]

abstracting: (0<=p40)
states: 1,721,712,427 (9)
abstracting: (p40<=0)
states: 1,635,134,227 (9)
.......
EG iterations: 7
.abstracting: (1<=p134)
states: 356,666,226 (8)
abstracting: (p134<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p62)
states: 84,171,582 (7)
abstracting: (p62<=1)
states: 1,721,712,427 (9)
.
EG iterations: 1
abstracting: (1<=p134)
states: 356,666,226 (8)
abstracting: (p134<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p134)
states: 356,666,226 (8)
abstracting: (p134<=1)
states: 1,721,712,427 (9)

EG iterations: 0
abstracting: (1<=p46)
states: 86,578,200 (7)
abstracting: (p46<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p24)
states: 4,039,200 (6)
abstracting: (p24<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p93)
states: 51,663,764 (7)
abstracting: (p93<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p2)
states: 454,868,156 (8)
abstracting: (p2<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p48)
states: 86,578,200 (7)
abstracting: (p48<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p1)
states: 2
abstracting: (p1<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p37)
states: 86,578,200 (7)
abstracting: (p37<=1)
states: 1,721,712,427 (9)
-> the formula is FALSE

FORMULA SmartHome-PT-06-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.502sec

checking: [AG [[AF [[[E [[p1<=1 & 1<=p1] U [p121<=1 & 1<=p121]] | EF [[p5<=1 & 1<=p5]]] | [[p86<=1 & 1<=p86] | [p108<=1 & 1<=p108]]]] | [A [~ [[[p2<=1 & 1<=p2] & [p108<=1 & 1<=p108]]] U [p109<=1 & 1<=p109]] | AF [E [[p55<=1 & 1<=p55] U [p131<=1 & 1<=p131]]]]]] | EX [[[p71<=1 & 1<=p71] & [p154<=1 & 1<=p154]]]]
normalized: [EX [[[p154<=1 & 1<=p154] & [p71<=1 & 1<=p71]]] | ~ [E [true U ~ [[[~ [EG [~ [E [[p55<=1 & 1<=p55] U [p131<=1 & 1<=p131]]]]] | [~ [EG [~ [[p109<=1 & 1<=p109]]]] & ~ [E [~ [[p109<=1 & 1<=p109]] U [[[p108<=1 & 1<=p108] & [p2<=1 & 1<=p2]] & ~ [[p109<=1 & 1<=p109]]]]]]] | ~ [EG [~ [[[[p108<=1 & 1<=p108] | [p86<=1 & 1<=p86]] | [E [true U [p5<=1 & 1<=p5]] | E [[p1<=1 & 1<=p1] U [p121<=1 & 1<=p121]]]]]]]]]]]]

abstracting: (1<=p121)
states: 106,902,583 (8)
abstracting: (p121<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p1)
states: 2
abstracting: (p1<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p5)
states: 412,798,446 (8)
abstracting: (p5<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p86)
states: 51,663,764 (7)
abstracting: (p86<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p108)
states: 51,663,764 (7)
abstracting: (p108<=1)
states: 1,721,712,427 (9)
.........................
EG iterations: 25
abstracting: (1<=p109)
states: 4,070,522 (6)
abstracting: (p109<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p2)
states: 454,868,156 (8)
abstracting: (p2<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p108)
states: 51,663,764 (7)
abstracting: (p108<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p109)
states: 4,070,522 (6)
abstracting: (p109<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p109)
states: 4,070,522 (6)
abstracting: (p109<=1)
states: 1,721,712,427 (9)
.....
EG iterations: 5
abstracting: (1<=p131)
states: 310,069,224 (8)
abstracting: (p131<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p55)
states: 84,171,582 (7)
abstracting: (p55<=1)
states: 1,721,712,427 (9)
.
EG iterations: 1
abstracting: (1<=p71)
states: 84,171,582 (7)
abstracting: (p71<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p154)
states: 148,069,152 (8)
abstracting: (p154<=1)
states: 1,721,712,427 (9)
.-> the formula is FALSE

FORMULA SmartHome-PT-06-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.598sec

checking: [AX [[[E [[p74<=1 & 1<=p74] U [p26<=1 & 1<=p26]] | [EX [[p56<=0 & 0<=p56]] | E [EG [[p12<=1 & 1<=p12]] U EX [[p72<=1 & 1<=p72]]]]] | [[[p49<=0 & 0<=p49] & [p6<=0 & 0<=p6]] | [[p33<=1 & 1<=p33] | [[[[p55<=0 & 0<=p55] | [p127<=0 & 0<=p127]] | [[p135<=0 & 0<=p135] | [p73<=1 & 1<=p73]]] & [p62<=0 & 0<=p62]]]]]] & [EF [[p123<=0 & 0<=p123]] & EX [0<=0]]]
normalized: [[EX [0<=0] & E [true U [p123<=0 & 0<=p123]]] & ~ [EX [~ [[[[[[p62<=0 & 0<=p62] & [[[p73<=1 & 1<=p73] | [p135<=0 & 0<=p135]] | [[p127<=0 & 0<=p127] | [p55<=0 & 0<=p55]]]] | [p33<=1 & 1<=p33]] | [[p6<=0 & 0<=p6] & [p49<=0 & 0<=p49]]] | [[E [EG [[p12<=1 & 1<=p12]] U EX [[p72<=1 & 1<=p72]]] | EX [[p56<=0 & 0<=p56]]] | E [[p74<=1 & 1<=p74] U [p26<=1 & 1<=p26]]]]]]]]

abstracting: (1<=p26)
states: 4,039,200 (6)
abstracting: (p26<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p74)
states: 4,070,522 (6)
abstracting: (p74<=1)
states: 1,721,712,427 (9)
abstracting: (0<=p56)
states: 1,721,712,427 (9)
abstracting: (p56<=0)
states: 1,637,540,845 (9)
.abstracting: (1<=p72)
states: 40,807,248 (7)
abstracting: (p72<=1)
states: 1,721,712,427 (9)
.abstracting: (1<=p12)
states: 68,947,200 (7)
abstracting: (p12<=1)
states: 1,721,712,427 (9)
.......
EG iterations: 7
abstracting: (0<=p49)
states: 1,721,712,427 (9)
abstracting: (p49<=0)
states: 1,681,315,405 (9)
abstracting: (0<=p6)
states: 1,721,712,427 (9)
abstracting: (p6<=0)
states: 1,721,712,425 (9)
abstracting: (1<=p33)
states: 86,578,200 (7)
abstracting: (p33<=1)
states: 1,721,712,427 (9)
abstracting: (0<=p55)
states: 1,721,712,427 (9)
abstracting: (p55<=0)
states: 1,637,540,845 (9)
abstracting: (0<=p127)
states: 1,721,712,427 (9)
abstracting: (p127<=0)
states: 1,614,809,844 (9)
abstracting: (0<=p135)
states: 1,721,712,427 (9)
abstracting: (p135<=0)
states: 1,631,900,501 (9)
abstracting: (1<=p73)
states: 40,807,248 (7)
abstracting: (p73<=1)
states: 1,721,712,427 (9)
abstracting: (0<=p62)
states: 1,721,712,427 (9)
abstracting: (p62<=0)
states: 1,637,540,845 (9)
.abstracting: (0<=p123)
states: 1,721,712,427 (9)
abstracting: (p123<=0)
states: 1,614,809,844 (9)
abstracting: (0<=0)
states: 1,721,712,427 (9)
.-> the formula is TRUE

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

MC time: 0m 0.343sec

checking: [AG [[[EG [[p14<=0 & 0<=p14]] | [E [[[p78<=1 & 1<=p78] | [[p128<=1 & 1<=p128] | [p17<=1 & 1<=p17]]] U EG [[p43<=1 & 1<=p43]]] | EX [AF [[[p71<=0 & 0<=p71] | [p154<=0 & 0<=p154]]]]]] | [EF [[[[p93<=1 & 1<=p93] & [p65<=1 & 1<=p65]] | AX [[p22<=1 & 1<=p22]]]] | [[p105<=1 & 1<=p105] | [p37<=1 & 1<=p37]]]]] & AX [[[EX [AG [[p58<=1 & 1<=p58]]] & AF [AG [[[p2<=0 & 0<=p2] | [p108<=0 & 0<=p108]]]]] | [[p84<=1 & 1<=p84] | [EF [[p131<=1 & 1<=p131]] & [[[p15<=0 & 0<=p15] & [p101<=0 & 0<=p101]] | AF [[p108<=0 & 0<=p108]]]]]]]]
normalized: [~ [EX [~ [[[[[~ [EG [~ [[p108<=0 & 0<=p108]]]] | [[p101<=0 & 0<=p101] & [p15<=0 & 0<=p15]]] & E [true U [p131<=1 & 1<=p131]]] | [p84<=1 & 1<=p84]] | [~ [EG [E [true U ~ [[[p108<=0 & 0<=p108] | [p2<=0 & 0<=p2]]]]]] & EX [~ [E [true U ~ [[p58<=1 & 1<=p58]]]]]]]]]] & ~ [E [true U ~ [[[[[p37<=1 & 1<=p37] | [p105<=1 & 1<=p105]] | E [true U [~ [EX [~ [[p22<=1 & 1<=p22]]]] | [[p65<=1 & 1<=p65] & [p93<=1 & 1<=p93]]]]] | [[EX [~ [EG [~ [[[p154<=0 & 0<=p154] | [p71<=0 & 0<=p71]]]]]] | E [[[[p17<=1 & 1<=p17] | [p128<=1 & 1<=p128]] | [p78<=1 & 1<=p78]] U EG [[p43<=1 & 1<=p43]]]] | EG [[p14<=0 & 0<=p14]]]]]]]]

abstracting: (0<=p14)
states: 1,721,712,427 (9)
abstracting: (p14<=0)
states: 1,610,415,511 (9)
.
EG iterations: 1
abstracting: (1<=p43)
states: 86,578,200 (7)
abstracting: (p43<=1)
states: 1,721,712,427 (9)
.......
EG iterations: 7
abstracting: (1<=p78)
states: 51,663,764 (7)
abstracting: (p78<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p128)
states: 5,635,547 (6)
abstracting: (p128<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p17)
states: 111,296,916 (8)
abstracting: (p17<=1)
states: 1,721,712,427 (9)
abstracting: (0<=p71)
states: 1,721,712,427 (9)
abstracting: (p71<=0)
states: 1,637,540,845 (9)
abstracting: (0<=p154)
states: 1,721,712,427 (9)
abstracting: (p154<=0)
states: 1,573,643,275 (9)
....
EG iterations: 4
.abstracting: (1<=p93)
states: 51,663,764 (7)
abstracting: (p93<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p65)
states: 84,171,582 (7)
abstracting: (p65<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p22)
states: 111,296,916 (8)
abstracting: (p22<=1)
states: 1,721,712,427 (9)
.abstracting: (1<=p105)
states: 51,663,764 (7)
abstracting: (p105<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p37)
states: 86,578,200 (7)
abstracting: (p37<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p58)
states: 84,171,582 (7)
abstracting: (p58<=1)
states: 1,721,712,427 (9)
.abstracting: (0<=p2)
states: 1,721,712,427 (9)
abstracting: (p2<=0)
states: 1,266,844,271 (9)
abstracting: (0<=p108)
states: 1,721,712,427 (9)
abstracting: (p108<=0)
states: 1,670,048,663 (9)
.
EG iterations: 1
abstracting: (1<=p84)
states: 51,663,764 (7)
abstracting: (p84<=1)
states: 1,721,712,427 (9)
abstracting: (1<=p131)
states: 310,069,224 (8)
abstracting: (p131<=1)
states: 1,721,712,427 (9)
abstracting: (0<=p15)
states: 1,721,712,427 (9)
abstracting: (p15<=0)
states: 1,610,415,511 (9)
abstracting: (0<=p101)
states: 1,721,712,427 (9)
abstracting: (p101<=0)
states: 1,670,048,663 (9)
abstracting: (0<=p108)
states: 1,721,712,427 (9)
abstracting: (p108<=0)
states: 1,670,048,663 (9)
.......
EG iterations: 7
.-> the formula is TRUE

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

MC time: 0m 0.890sec

totally nodes used: 4370622 (4.4e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 8553507 19436078 27989585
used/not used/entry size/cache size: 19988119 47120745 16 1024MB
basic ops cache: hits/miss/sum: 951770 2339064 3290834
used/not used/entry size/cache size: 3423573 13353643 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: 31522 88106 119628
used/not used/entry size/cache size: 87692 8300916 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 63221584
1 3472311
2 354834
3 52711
4 6683
5 671
6 67
7 3
8 0
9 0
>= 10 0

Total processing time: 0m16.204sec


BK_STOP 1679310046160

--------------------
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.003sec


iterations count:16066 (84), effective:1993 (10)

initing FirstDep: 0m 0.000sec


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

iterations count:2878 (15), effective:308 (1)

iterations count:316 (1), effective:6 (0)

iterations count:198 (1), effective:2 (0)

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

iterations count:3103 (16), effective:368 (1)

iterations count:2129 (11), effective:269 (1)

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

iterations count:1315 (6), effective:110 (0)

iterations count:3293 (17), effective:377 (1)

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

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

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

iterations count:3387 (17), effective:375 (1)

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

iterations count:481 (2), effective:23 (0)

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

iterations count:392 (2), effective:12 (0)

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

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

iterations count:3357 (17), effective:376 (1)

iterations count:4126 (21), effective:498 (2)

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

iterations count:3517 (18), effective:386 (2)

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

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

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

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

iterations count:384 (2), effective:16 (0)

iterations count:385 (2), effective:35 (0)

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

iterations count:3306 (17), effective:377 (1)

iterations count:1175 (6), effective:106 (0)

iterations count:432 (2), effective:24 (0)

iterations count:2095 (11), effective:224 (1)

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

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

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

iterations count:493 (2), effective:23 (0)

iterations count:2463 (12), effective:239 (1)

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

iterations count:1315 (6), effective:113 (0)

iterations count:1836 (9), effective:184 (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-06"
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-06, 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-167912649900194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-06.tgz
mv SmartHome-PT-06 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 ;