About the Execution of Marcie+red for SmartHome-PT-07
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5946.363 | 32188.00 | 42087.00 | 1061.40 | FTFFTFFFTFFTTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r458-smll-167912650000202.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-07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650000202
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.8K Feb 26 05:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 05:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 26 05:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 05:45 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.4K Feb 25 17:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Feb 25 17:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 05:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 05:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 05:47 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 63K 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-07-CTLFireability-00
FORMULA_NAME SmartHome-PT-07-CTLFireability-01
FORMULA_NAME SmartHome-PT-07-CTLFireability-02
FORMULA_NAME SmartHome-PT-07-CTLFireability-03
FORMULA_NAME SmartHome-PT-07-CTLFireability-04
FORMULA_NAME SmartHome-PT-07-CTLFireability-05
FORMULA_NAME SmartHome-PT-07-CTLFireability-06
FORMULA_NAME SmartHome-PT-07-CTLFireability-07
FORMULA_NAME SmartHome-PT-07-CTLFireability-08
FORMULA_NAME SmartHome-PT-07-CTLFireability-09
FORMULA_NAME SmartHome-PT-07-CTLFireability-10
FORMULA_NAME SmartHome-PT-07-CTLFireability-11
FORMULA_NAME SmartHome-PT-07-CTLFireability-12
FORMULA_NAME SmartHome-PT-07-CTLFireability-13
FORMULA_NAME SmartHome-PT-07-CTLFireability-14
FORMULA_NAME SmartHome-PT-07-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679310514472
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-07
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 11:08:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 11:08:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:08:37] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-20 11:08:37] [INFO ] Transformed 251 places.
[2023-03-20 11:08:37] [INFO ] Transformed 290 transitions.
[2023-03-20 11:08:37] [INFO ] Found NUPN structural information;
[2023-03-20 11:08:37] [INFO ] Parsed PT model containing 251 places and 290 transitions and 658 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 30 transitions.
FORMULA SmartHome-PT-07-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 260/260 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 215 transition count 260
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 51 place count 171 transition count 216
Iterating global reduction 1 with 44 rules applied. Total rules applied 95 place count 171 transition count 216
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 100 place count 171 transition count 211
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 107 place count 164 transition count 204
Iterating global reduction 2 with 7 rules applied. Total rules applied 114 place count 164 transition count 204
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 162 transition count 202
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 162 transition count 202
Applied a total of 118 rules in 69 ms. Remains 162 /222 variables (removed 60) and now considering 202/260 (removed 58) transitions.
// Phase 1: matrix 202 rows 162 cols
[2023-03-20 11:08:38] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-20 11:08:38] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-20 11:08:38] [INFO ] Invariant cache hit.
[2023-03-20 11:08:38] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2023-03-20 11:08:38] [INFO ] Invariant cache hit.
[2023-03-20 11:08:38] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 162/222 places, 202/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 992 ms. Remains : 162/222 places, 202/260 transitions.
Support contains 56 out of 162 places after structural reductions.
[2023-03-20 11:08:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 11:08:39] [INFO ] Flatten gal took : 83 ms
FORMULA SmartHome-PT-07-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 11:08:39] [INFO ] Flatten gal took : 24 ms
[2023-03-20 11:08:39] [INFO ] Input system was already deterministic with 202 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 654 ms. (steps per millisecond=15 ) properties (out of 46) seen :42
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-20 11:08:40] [INFO ] Invariant cache hit.
[2023-03-20 11:08:40] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-20 11:08:40] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:08:40] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:08:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-20 11:08:40] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 11:08:40] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 11:08:40] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 717 ms.
[2023-03-20 11:08:41] [INFO ] After 934ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 202/202 transitions.
Graph (trivial) has 159 edges and 162 vertex of which 67 / 162 are part of one of the 5 SCC in 3 ms
Free SCC test removed 62 places
Drop transitions removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 100 transition count 78
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 65 transition count 71
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 62 transition count 71
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 81 place count 62 transition count 63
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 97 place count 54 transition count 63
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 103 place count 48 transition count 57
Iterating global reduction 3 with 6 rules applied. Total rules applied 109 place count 48 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 110 place count 48 transition count 56
Performed 25 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 160 place count 23 transition count 27
Drop transitions removed 10 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 39 edges and 23 vertex of which 21 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 12 rules applied. Total rules applied 172 place count 21 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 173 place count 20 transition count 15
Reduce places removed 5 places and 0 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 5 with 8 rules applied. Total rules applied 181 place count 15 transition count 12
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 184 place count 12 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 184 place count 12 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 193 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 193 place count 7 transition count 7
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 195 place count 6 transition count 7
Applied a total of 195 rules in 33 ms. Remains 6 /162 variables (removed 156) and now considering 7/202 (removed 195) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 6/162 places, 7/202 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 15 ms
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 14 ms
[2023-03-20 11:08:41] [INFO ] Input system was already deterministic with 202 transitions.
Computed a total of 44 stabilizing places and 43 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 162/162 places, 202/202 transitions.
Graph (trivial) has 157 edges and 162 vertex of which 70 / 162 are part of one of the 6 SCC in 1 ms
Free SCC test removed 64 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 97 transition count 89
Reduce places removed 31 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 38 rules applied. Total rules applied 70 place count 66 transition count 82
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 74 place count 63 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 62 transition count 81
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 75 place count 62 transition count 73
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 91 place count 54 transition count 73
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 95 place count 50 transition count 69
Iterating global reduction 4 with 4 rules applied. Total rules applied 99 place count 50 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 100 place count 50 transition count 68
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 138 place count 31 transition count 49
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 141 place count 31 transition count 46
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 147 place count 28 transition count 43
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 157 place count 28 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 159 place count 26 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 159 place count 26 transition count 32
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 161 place count 25 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 162 place count 24 transition count 31
Applied a total of 162 rules in 27 ms. Remains 24 /162 variables (removed 138) and now considering 31/202 (removed 171) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 24/162 places, 31/202 transitions.
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 2 ms
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 3 ms
[2023-03-20 11:08:41] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 162/162 places, 202/202 transitions.
Graph (trivial) has 139 edges and 162 vertex of which 28 / 162 are part of one of the 4 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 137 transition count 122
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 61 rules applied. Total rules applied 110 place count 89 transition count 109
Reduce places removed 8 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 10 rules applied. Total rules applied 120 place count 81 transition count 107
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 3 with 5 rules applied. Total rules applied 125 place count 80 transition count 103
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 129 place count 76 transition count 103
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 129 place count 76 transition count 94
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 147 place count 67 transition count 94
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 158 place count 56 transition count 83
Iterating global reduction 5 with 11 rules applied. Total rules applied 169 place count 56 transition count 83
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 174 place count 56 transition count 78
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 176 place count 55 transition count 77
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 214 place count 36 transition count 58
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 218 place count 36 transition count 54
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 226 place count 32 transition count 50
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 236 place count 32 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 238 place count 30 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 238 place count 30 transition count 39
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 240 place count 29 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 241 place count 28 transition count 38
Applied a total of 241 rules in 28 ms. Remains 28 /162 variables (removed 134) and now considering 38/202 (removed 164) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 28/162 places, 38/202 transitions.
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 3 ms
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 3 ms
[2023-03-20 11:08:41] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 202/202 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 143 transition count 183
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 143 transition count 183
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 135 transition count 175
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 135 transition count 175
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 129 transition count 169
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 129 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 129 transition count 168
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 127 transition count 166
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 127 transition count 166
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 126 transition count 165
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 126 transition count 165
Applied a total of 73 rules in 15 ms. Remains 126 /162 variables (removed 36) and now considering 165/202 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 126/162 places, 165/202 transitions.
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:08:41] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 202/202 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 144 transition count 184
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 144 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 144 transition count 183
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 139 transition count 178
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 139 transition count 178
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 135 transition count 174
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 135 transition count 174
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 133 transition count 172
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 133 transition count 172
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 132 transition count 171
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 132 transition count 171
Applied a total of 61 rules in 22 ms. Remains 132 /162 variables (removed 30) and now considering 171/202 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 132/162 places, 171/202 transitions.
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:08:41] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 202/202 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 142 transition count 182
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 142 transition count 182
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 142 transition count 181
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 134 transition count 173
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 134 transition count 173
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 129 transition count 168
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 129 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 129 transition count 167
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 127 transition count 165
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 127 transition count 165
Applied a total of 72 rules in 11 ms. Remains 127 /162 variables (removed 35) and now considering 165/202 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 127/162 places, 165/202 transitions.
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:08:41] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 202/202 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 140 transition count 180
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 140 transition count 180
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 140 transition count 179
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 131 transition count 170
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 131 transition count 170
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 69 place count 125 transition count 164
Iterating global reduction 1 with 6 rules applied. Total rules applied 75 place count 125 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 125 transition count 163
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 122 transition count 160
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 122 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 121 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 121 transition count 159
Applied a total of 84 rules in 12 ms. Remains 121 /162 variables (removed 41) and now considering 159/202 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 121/162 places, 159/202 transitions.
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:08:41] [INFO ] Input system was already deterministic with 159 transitions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 202/202 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 140 transition count 180
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 140 transition count 180
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 140 transition count 179
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 132 transition count 171
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 132 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 127 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 127 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 127 transition count 165
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 125 transition count 163
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 125 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 124 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 124 transition count 162
Applied a total of 78 rules in 20 ms. Remains 124 /162 variables (removed 38) and now considering 162/202 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 124/162 places, 162/202 transitions.
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 8 ms
[2023-03-20 11:08:41] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 202/202 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 143 transition count 183
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 143 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 143 transition count 182
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 134 transition count 173
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 134 transition count 173
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 129 transition count 168
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 129 transition count 168
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 126 transition count 165
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 126 transition count 165
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 125 transition count 164
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 125 transition count 164
Applied a total of 75 rules in 13 ms. Remains 125 /162 variables (removed 37) and now considering 164/202 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 125/162 places, 164/202 transitions.
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:08:41] [INFO ] Input system was already deterministic with 164 transitions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 202/202 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 140 transition count 180
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 140 transition count 180
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 140 transition count 179
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 131 transition count 170
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 131 transition count 170
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 69 place count 125 transition count 164
Iterating global reduction 1 with 6 rules applied. Total rules applied 75 place count 125 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 125 transition count 163
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 122 transition count 160
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 122 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 121 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 121 transition count 159
Applied a total of 84 rules in 14 ms. Remains 121 /162 variables (removed 41) and now considering 159/202 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 121/162 places, 159/202 transitions.
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:08:41] [INFO ] Input system was already deterministic with 159 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 162/162 places, 202/202 transitions.
Graph (trivial) has 162 edges and 162 vertex of which 79 / 162 are part of one of the 6 SCC in 1 ms
Free SCC test removed 73 places
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 88 transition count 79
Reduce places removed 29 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 34 rules applied. Total rules applied 64 place count 59 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 57 transition count 74
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 66 place count 57 transition count 67
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 80 place count 50 transition count 67
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 84 place count 46 transition count 63
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 46 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 46 transition count 62
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 127 place count 27 transition count 43
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 130 place count 27 transition count 40
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 136 place count 24 transition count 37
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 145 place count 24 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 146 place count 23 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 148 place count 21 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 149 place count 20 transition count 26
Applied a total of 149 rules in 17 ms. Remains 20 /162 variables (removed 142) and now considering 26/202 (removed 176) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 20/162 places, 26/202 transitions.
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 2 ms
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 2 ms
[2023-03-20 11:08:41] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 202/202 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 143 transition count 183
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 143 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 143 transition count 182
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 136 transition count 175
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 136 transition count 175
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 131 transition count 170
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 131 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 131 transition count 169
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 129 transition count 167
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 129 transition count 167
Applied a total of 68 rules in 13 ms. Remains 129 /162 variables (removed 33) and now considering 167/202 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 129/162 places, 167/202 transitions.
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:08:41] [INFO ] Input system was already deterministic with 167 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 162/162 places, 202/202 transitions.
Graph (trivial) has 145 edges and 162 vertex of which 46 / 162 are part of one of the 5 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 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 120 transition count 111
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 48 rules applied. Total rules applied 89 place count 80 transition count 103
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 96 place count 76 transition count 100
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 101 place count 73 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 72 transition count 98
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 102 place count 72 transition count 90
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 118 place count 64 transition count 90
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 122 place count 60 transition count 86
Iterating global reduction 5 with 4 rules applied. Total rules applied 126 place count 60 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 127 place count 60 transition count 85
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 167 place count 40 transition count 65
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 171 place count 40 transition count 61
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 179 place count 36 transition count 57
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 190 place count 36 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 192 place count 34 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 192 place count 34 transition count 45
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 194 place count 33 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 195 place count 32 transition count 44
Applied a total of 195 rules in 20 ms. Remains 32 /162 variables (removed 130) and now considering 44/202 (removed 158) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 32/162 places, 44/202 transitions.
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 2 ms
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 3 ms
[2023-03-20 11:08:41] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 162/162 places, 202/202 transitions.
Graph (trivial) has 159 edges and 162 vertex of which 69 / 162 are part of one of the 5 SCC in 0 ms
Free SCC test removed 64 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 97 transition count 87
Reduce places removed 33 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 39 rules applied. Total rules applied 73 place count 64 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 61 transition count 81
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 76 place count 61 transition count 73
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 92 place count 53 transition count 73
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 97 place count 48 transition count 67
Iterating global reduction 3 with 5 rules applied. Total rules applied 102 place count 48 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 48 transition count 66
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 141 place count 29 transition count 47
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 145 place count 29 transition count 43
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 153 place count 25 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 154 place count 25 transition count 38
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 159 place count 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 160 place count 24 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 161 place count 23 transition count 32
Applied a total of 161 rules in 11 ms. Remains 23 /162 variables (removed 139) and now considering 32/202 (removed 170) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 23/162 places, 32/202 transitions.
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 2 ms
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 2 ms
[2023-03-20 11:08:41] [INFO ] Input system was already deterministic with 32 transitions.
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 11 ms
[2023-03-20 11:08:41] [INFO ] Flatten gal took : 11 ms
[2023-03-20 11:08:41] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-20 11:08:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 162 places, 202 transitions and 453 arcs took 2 ms.
Total runtime 4537 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: 162 NrTr: 202 NrArc: 453)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.003sec
net check time: 0m 0.000sec
init dd package: 0m 3.338sec
RS generation: 0m 1.195sec
-> reachability set: #nodes 14598 (1.5e+04) #states 8,300,645,353 (9)
starting MCC model checker
--------------------------
checking: EG [EF [[p81<=1 & 1<=p81]]]
normalized: EG [E [true U [p81<=1 & 1<=p81]]]
abstracting: (1<=p81)
states: 429,841,480 (8)
abstracting: (p81<=1)
states: 8,300,645,353 (9)
.
EG iterations: 1
-> the formula is TRUE
FORMULA SmartHome-PT-07-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.721sec
checking: EG [[[p138<=0 & 0<=p138] | [p141<=0 & 0<=p141]]]
normalized: EG [[[p138<=0 & 0<=p138] | [p141<=0 & 0<=p141]]]
abstracting: (0<=p141)
states: 8,300,645,353 (9)
abstracting: (p141<=0)
states: 4,274,293,811 (9)
abstracting: (0<=p138)
states: 8,300,645,353 (9)
abstracting: (p138<=0)
states: 7,787,201,563 (9)
.............
EG iterations: 13
-> the formula is TRUE
FORMULA SmartHome-PT-07-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.548sec
checking: AF [[AG [[[p19<=0 & 0<=p19] & EF [[p62<=1 & 1<=p62]]]] | [p114<=1 & 1<=p114]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [[E [true U [p62<=1 & 1<=p62]] & [p19<=0 & 0<=p19]]]]] | [p114<=1 & 1<=p114]]]]]
abstracting: (1<=p114)
states: 239,091,816 (8)
abstracting: (p114<=1)
states: 8,300,645,353 (9)
abstracting: (0<=p19)
states: 8,300,645,353 (9)
abstracting: (p19<=0)
states: 7,905,079,981 (9)
abstracting: (1<=p62)
states: 209,882,640 (8)
abstracting: (p62<=1)
states: 8,300,645,353 (9)
......
EG iterations: 6
-> the formula is FALSE
FORMULA SmartHome-PT-07-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.780sec
checking: AG [AX [AG [[[[1<=p43 & p43<=1] & [p2<=1 & 1<=p2]] & [[p29<=1 & 1<=p29] & EF [[p63<=1 & 1<=p63]]]]]]]
normalized: ~ [E [true U EX [E [true U ~ [[[E [true U [p63<=1 & 1<=p63]] & [p29<=1 & 1<=p29]] & [[p2<=1 & 1<=p2] & [1<=p43 & p43<=1]]]]]]]]
abstracting: (p43<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p43)
states: 563,520,660 (8)
abstracting: (1<=p2)
states: 2,906,917,952 (9)
abstracting: (p2<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p29)
states: 395,565,372 (8)
abstracting: (p29<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p63)
states: 209,882,640 (8)
abstracting: (p63<=1)
states: 8,300,645,353 (9)
.-> the formula is FALSE
FORMULA SmartHome-PT-07-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.394sec
checking: [AX [[p24<=1 & 1<=p24]] | EF [[AF [AX [AX [[p83<=1 & 1<=p83]]]] & [[p88<=0 & 0<=p88] & EF [[p126<=0 & 0<=p126]]]]]]
normalized: [E [true U [[E [true U [p126<=0 & 0<=p126]] & [p88<=0 & 0<=p88]] & ~ [EG [EX [EX [~ [[p83<=1 & 1<=p83]]]]]]]] | ~ [EX [~ [[p24<=1 & 1<=p24]]]]]
abstracting: (1<=p24)
states: 395,565,372 (8)
abstracting: (p24<=1)
states: 8,300,645,353 (9)
.abstracting: (1<=p83)
states: 170,818,932 (8)
abstracting: (p83<=1)
states: 8,300,645,353 (9)
......
EG iterations: 4
abstracting: (0<=p88)
states: 8,300,645,353 (9)
abstracting: (p88<=0)
states: 8,061,553,537 (9)
abstracting: (0<=p126)
states: 8,300,645,353 (9)
abstracting: (p126<=0)
states: 7,787,201,563 (9)
-> the formula is TRUE
FORMULA SmartHome-PT-07-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.958sec
checking: [EG [AX [E [[p104<=1 & 1<=p104] U [p108<=1 & 1<=p108]]]] | EG [AG [[~ [[p120<=1 & 1<=p120]] | ~ [[p155<=1 & 1<=p155]]]]]]
normalized: [EG [~ [E [true U ~ [[~ [[p155<=1 & 1<=p155]] | ~ [[p120<=1 & 1<=p120]]]]]]] | EG [~ [EX [~ [E [[p104<=1 & 1<=p104] U [p108<=1 & 1<=p108]]]]]]]
abstracting: (1<=p108)
states: 239,091,816 (8)
abstracting: (p108<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p104)
states: 239,091,816 (8)
abstracting: (p104<=1)
states: 8,300,645,353 (9)
...
EG iterations: 2
abstracting: (1<=p120)
states: 239,091,816 (8)
abstracting: (p120<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p155)
states: 463,988,288 (8)
abstracting: (p155<=1)
states: 8,300,645,353 (9)
.
EG iterations: 1
-> the formula is FALSE
FORMULA SmartHome-PT-07-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.601sec
checking: AX [E [~ [[[[p99<=1 & 1<=p99] & ~ [[p101<=1 & 1<=p101]]] | [EG [[p137<=1 & 1<=p137]] | EF [EG [[p79<=1 & 1<=p79]]]]]] U [p78<=1 & 1<=p78]]]
normalized: ~ [EX [~ [E [~ [[[[p99<=1 & 1<=p99] & ~ [[p101<=1 & 1<=p101]]] | [E [true U EG [[p79<=1 & 1<=p79]]] | EG [[p137<=1 & 1<=p137]]]]] U [p78<=1 & 1<=p78]]]]]
abstracting: (1<=p78)
states: 442,891,084 (8)
abstracting: (p78<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p137)
states: 513,443,790 (8)
abstracting: (p137<=1)
states: 8,300,645,353 (9)
......
EG iterations: 6
abstracting: (1<=p79)
states: 442,891,084 (8)
abstracting: (p79<=1)
states: 8,300,645,353 (9)
......
EG iterations: 6
abstracting: (1<=p101)
states: 239,091,816 (8)
abstracting: (p101<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p99)
states: 239,091,816 (8)
abstracting: (p99<=1)
states: 8,300,645,353 (9)
.-> the formula is FALSE
FORMULA SmartHome-PT-07-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.599sec
checking: AX [EG [[EX [AG [[p99<=0 & 0<=p99]]] | [[p35<=0 & 0<=p35] & [[[p138<=0 & 0<=p138] | [p33<=0 & 0<=p33]] & [[p109<=0 & 0<=p109] | [p92<=0 & 0<=p92]]]]]]]
normalized: ~ [EX [~ [EG [[[[[[p92<=0 & 0<=p92] | [p109<=0 & 0<=p109]] & [[p33<=0 & 0<=p33] | [p138<=0 & 0<=p138]]] & [p35<=0 & 0<=p35]] | EX [~ [E [true U ~ [[p99<=0 & 0<=p99]]]]]]]]]]
abstracting: (0<=p99)
states: 8,300,645,353 (9)
abstracting: (p99<=0)
states: 8,061,553,537 (9)
.abstracting: (0<=p35)
states: 8,300,645,353 (9)
abstracting: (p35<=0)
states: 7,737,124,693 (9)
abstracting: (0<=p138)
states: 8,300,645,353 (9)
abstracting: (p138<=0)
states: 7,787,201,563 (9)
abstracting: (0<=p33)
states: 8,300,645,353 (9)
abstracting: (p33<=0)
states: 7,737,124,693 (9)
abstracting: (0<=p109)
states: 8,300,645,353 (9)
abstracting: (p109<=0)
states: 8,061,553,537 (9)
abstracting: (0<=p92)
states: 8,300,645,353 (9)
abstracting: (p92<=0)
states: 8,061,553,537 (9)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA SmartHome-PT-07-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.621sec
checking: EF [[[[p134<=0 & 0<=p134] & [p29<=0 & 0<=p29]] & [[p120<=1 & 1<=p120] & [[p133<=1 & 1<=p133] & [A [[p80<=1 & 1<=p80] U [p28<=1 & 1<=p28]] | AF [[p74<=0 & 0<=p74]]]]]]]
normalized: E [true U [[[[[~ [EG [~ [[p28<=1 & 1<=p28]]]] & ~ [E [~ [[p28<=1 & 1<=p28]] U [~ [[p28<=1 & 1<=p28]] & ~ [[p80<=1 & 1<=p80]]]]]] | ~ [EG [~ [[p74<=0 & 0<=p74]]]]] & [p133<=1 & 1<=p133]] & [p120<=1 & 1<=p120]] & [[p29<=0 & 0<=p29] & [p134<=0 & 0<=p134]]]]
abstracting: (0<=p134)
states: 8,300,645,353 (9)
abstracting: (p134<=0)
states: 7,787,201,563 (9)
abstracting: (0<=p29)
states: 8,300,645,353 (9)
abstracting: (p29<=0)
states: 7,905,079,981 (9)
abstracting: (1<=p120)
states: 239,091,816 (8)
abstracting: (p120<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p133)
states: 513,443,790 (8)
abstracting: (p133<=1)
states: 8,300,645,353 (9)
abstracting: (0<=p74)
states: 8,300,645,353 (9)
abstracting: (p74<=0)
states: 7,857,754,269 (9)
......
EG iterations: 6
abstracting: (1<=p80)
states: 442,891,084 (8)
abstracting: (p80<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p28)
states: 395,565,372 (8)
abstracting: (p28<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p28)
states: 395,565,372 (8)
abstracting: (p28<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p28)
states: 395,565,372 (8)
abstracting: (p28<=1)
states: 8,300,645,353 (9)
.
EG iterations: 1
-> the formula is TRUE
FORMULA SmartHome-PT-07-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.732sec
checking: A [AX [[[AX [[[p104<=1 & 1<=p104] | ~ [[p60<=1 & 1<=p60]]]] | ~ [[p69<=1 & 1<=p69]]] | [AX [[p43<=1 & 1<=p43]] | AF [~ [[p120<=1 & 1<=p120]]]]]] U EF [~ [EF [~ [[[p120<=1 & 1<=p120] & [p141<=1 & 1<=p141]]]]]]]
normalized: [~ [EG [~ [E [true U ~ [E [true U ~ [[[p141<=1 & 1<=p141] & [p120<=1 & 1<=p120]]]]]]]]] & ~ [E [~ [E [true U ~ [E [true U ~ [[[p141<=1 & 1<=p141] & [p120<=1 & 1<=p120]]]]]]] U [EX [~ [[[~ [EG [[p120<=1 & 1<=p120]]] | ~ [EX [~ [[p43<=1 & 1<=p43]]]]] | [~ [[p69<=1 & 1<=p69]] | ~ [EX [~ [[~ [[p60<=1 & 1<=p60]] | [p104<=1 & 1<=p104]]]]]]]]] & ~ [E [true U ~ [E [true U ~ [[[p141<=1 & 1<=p141] & [p120<=1 & 1<=p120]]]]]]]]]]]
abstracting: (1<=p120)
states: 239,091,816 (8)
abstracting: (p120<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p141)
states: 4,026,351,542 (9)
abstracting: (p141<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p104)
states: 239,091,816 (8)
abstracting: (p104<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p60)
states: 414,468,504 (8)
abstracting: (p60<=1)
states: 8,300,645,353 (9)
.abstracting: (1<=p69)
states: 442,891,084 (8)
abstracting: (p69<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p43)
states: 563,520,660 (8)
abstracting: (p43<=1)
states: 8,300,645,353 (9)
.abstracting: (1<=p120)
states: 239,091,816 (8)
abstracting: (p120<=1)
states: 8,300,645,353 (9)
......
EG iterations: 6
.abstracting: (1<=p120)
states: 239,091,816 (8)
abstracting: (p120<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p141)
states: 4,026,351,542 (9)
abstracting: (p141<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p120)
states: 239,091,816 (8)
abstracting: (p120<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p141)
states: 4,026,351,542 (9)
abstracting: (p141<=1)
states: 8,300,645,353 (9)
EG iterations: 0
-> the formula is FALSE
FORMULA SmartHome-PT-07-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.820sec
checking: E [[AF [~ [[[p82<=1 & 1<=p82] & [p157<=1 & 1<=p157]]]] | [EX [EX [[p89<=1 & 1<=p89]]] & EF [[p54<=1 & 1<=p54]]]] U EX [[AF [~ [EF [[p117<=1 & 1<=p117]]]] | [[p136<=1 & 1<=p136] & EF [[[p113<=1 & 1<=p113] & [p139<=1 & 1<=p139]]]]]]]
normalized: E [[[E [true U [p54<=1 & 1<=p54]] & EX [EX [[p89<=1 & 1<=p89]]]] | ~ [EG [[[p157<=1 & 1<=p157] & [p82<=1 & 1<=p82]]]]] U EX [[[E [true U [[p139<=1 & 1<=p139] & [p113<=1 & 1<=p113]]] & [p136<=1 & 1<=p136]] | ~ [EG [E [true U [p117<=1 & 1<=p117]]]]]]]
abstracting: (1<=p117)
states: 23,826,368 (7)
abstracting: (p117<=1)
states: 8,300,645,353 (9)
......
EG iterations: 6
abstracting: (1<=p136)
states: 513,443,790 (8)
abstracting: (p136<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p113)
states: 239,091,816 (8)
abstracting: (p113<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p139)
states: 42,772,354 (7)
abstracting: (p139<=1)
states: 8,300,645,353 (9)
.abstracting: (1<=p82)
states: 442,891,084 (8)
abstracting: (p82<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p157)
states: 852,735,232 (8)
abstracting: (p157<=1)
states: 8,300,645,353 (9)
....
EG iterations: 4
abstracting: (1<=p89)
states: 239,091,816 (8)
abstracting: (p89<=1)
states: 8,300,645,353 (9)
..abstracting: (1<=p54)
states: 414,468,504 (8)
abstracting: (p54<=1)
states: 8,300,645,353 (9)
-> the formula is TRUE
FORMULA SmartHome-PT-07-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.787sec
checking: EG [[[p31<=0 & 0<=p31] | [[AG [[p52<=1 & 1<=p52]] & [p105<=0 & 0<=p105]] & [AG [[p134<=1 & 1<=p134]] & [[p85<=0 & 0<=p85] & [[p138<=1 & 1<=p138] | [[p36<=1 & 1<=p36] & [p21<=1 & 1<=p21]]]]]]]]
normalized: EG [[[[[[[[p21<=1 & 1<=p21] & [p36<=1 & 1<=p36]] | [p138<=1 & 1<=p138]] & [p85<=0 & 0<=p85]] & ~ [E [true U ~ [[p134<=1 & 1<=p134]]]]] & [[p105<=0 & 0<=p105] & ~ [E [true U ~ [[p52<=1 & 1<=p52]]]]]] | [p31<=0 & 0<=p31]]]
abstracting: (0<=p31)
states: 8,300,645,353 (9)
abstracting: (p31<=0)
states: 7,737,124,693 (9)
abstracting: (1<=p52)
states: 414,468,504 (8)
abstracting: (p52<=1)
states: 8,300,645,353 (9)
abstracting: (0<=p105)
states: 8,300,645,353 (9)
abstracting: (p105<=0)
states: 8,061,553,537 (9)
abstracting: (1<=p134)
states: 513,443,790 (8)
abstracting: (p134<=1)
states: 8,300,645,353 (9)
abstracting: (0<=p85)
states: 8,300,645,353 (9)
abstracting: (p85<=0)
states: 8,061,553,537 (9)
abstracting: (1<=p138)
states: 513,443,790 (8)
abstracting: (p138<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p36)
states: 563,520,660 (8)
abstracting: (p36<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p21)
states: 395,565,372 (8)
abstracting: (p21<=1)
states: 8,300,645,353 (9)
.
EG iterations: 1
-> the formula is TRUE
FORMULA SmartHome-PT-07-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.275sec
checking: [A [~ [[[p43<=1 & 1<=p43] & [p148<=1 & 1<=p148]]] U [E [[[p28<=1 & 1<=p28] | A [[p132<=1 & 1<=p132] U [p11<=1 & 1<=p11]]] U [p4<=1 & 1<=p4]] | EX [AF [[[p44<=1 & 1<=p44] & [p110<=1 & 1<=p110]]]]]] & E [[p41<=1 & 1<=p41] U ~ [[p71<=1 & 1<=p71]]]]
normalized: [E [[p41<=1 & 1<=p41] U ~ [[p71<=1 & 1<=p71]]] & [~ [EG [~ [[EX [~ [EG [~ [[[p110<=1 & 1<=p110] & [p44<=1 & 1<=p44]]]]]] | E [[[~ [EG [~ [[p11<=1 & 1<=p11]]]] & ~ [E [~ [[p11<=1 & 1<=p11]] U [~ [[p132<=1 & 1<=p132]] & ~ [[p11<=1 & 1<=p11]]]]]] | [p28<=1 & 1<=p28]] U [p4<=1 & 1<=p4]]]]]] & ~ [E [~ [[EX [~ [EG [~ [[[p110<=1 & 1<=p110] & [p44<=1 & 1<=p44]]]]]] | E [[[~ [EG [~ [[p11<=1 & 1<=p11]]]] & ~ [E [~ [[p11<=1 & 1<=p11]] U [~ [[p132<=1 & 1<=p132]] & ~ [[p11<=1 & 1<=p11]]]]]] | [p28<=1 & 1<=p28]] U [p4<=1 & 1<=p4]]]] U [[[p148<=1 & 1<=p148] & [p43<=1 & 1<=p43]] & ~ [[EX [~ [EG [~ [[[p110<=1 & 1<=p110] & [p44<=1 & 1<=p44]]]]]] | E [[[~ [EG [~ [[p11<=1 & 1<=p11]]]] & ~ [E [~ [[p11<=1 & 1<=p11]] U [~ [[p132<=1 & 1<=p132]] & ~ [[p11<=1 & 1<=p11]]]]]] | [p28<=1 & 1<=p28]] U [p4<=1 & 1<=p4]]]]]]]]]
abstracting: (1<=p4)
states: 2,486,811,024 (9)
abstracting: (p4<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p28)
states: 395,565,372 (8)
abstracting: (p28<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p11)
states: 395,565,372 (8)
abstracting: (p11<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p132)
states: 513,443,790 (8)
abstracting: (p132<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p11)
states: 395,565,372 (8)
abstracting: (p11<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p11)
states: 395,565,372 (8)
abstracting: (p11<=1)
states: 8,300,645,353 (9)
.
EG iterations: 1
abstracting: (1<=p44)
states: 209,882,640 (8)
abstracting: (p44<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p110)
states: 239,091,816 (8)
abstracting: (p110<=1)
states: 8,300,645,353 (9)
.
EG iterations: 1
.abstracting: (1<=p43)
states: 563,520,660 (8)
abstracting: (p43<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p148)
states: 334,181,376 (8)
abstracting: (p148<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p4)
states: 2,486,811,024 (9)
abstracting: (p4<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p28)
states: 395,565,372 (8)
abstracting: (p28<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p11)
states: 395,565,372 (8)
abstracting: (p11<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p132)
states: 513,443,790 (8)
abstracting: (p132<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p11)
states: 395,565,372 (8)
abstracting: (p11<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p11)
states: 395,565,372 (8)
abstracting: (p11<=1)
states: 8,300,645,353 (9)
.
EG iterations: 1
abstracting: (1<=p44)
states: 209,882,640 (8)
abstracting: (p44<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p110)
states: 239,091,816 (8)
abstracting: (p110<=1)
states: 8,300,645,353 (9)
.
EG iterations: 1
.abstracting: (1<=p4)
states: 2,486,811,024 (9)
abstracting: (p4<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p28)
states: 395,565,372 (8)
abstracting: (p28<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p11)
states: 395,565,372 (8)
abstracting: (p11<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p132)
states: 513,443,790 (8)
abstracting: (p132<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p11)
states: 395,565,372 (8)
abstracting: (p11<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p11)
states: 395,565,372 (8)
abstracting: (p11<=1)
states: 8,300,645,353 (9)
.
EG iterations: 1
abstracting: (1<=p44)
states: 209,882,640 (8)
abstracting: (p44<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p110)
states: 239,091,816 (8)
abstracting: (p110<=1)
states: 8,300,645,353 (9)
.
EG iterations: 1
.......
EG iterations: 6
abstracting: (1<=p71)
states: 442,891,084 (8)
abstracting: (p71<=1)
states: 8,300,645,353 (9)
abstracting: (1<=p41)
states: 563,520,660 (8)
abstracting: (p41<=1)
states: 8,300,645,353 (9)
-> the formula is FALSE
FORMULA SmartHome-PT-07-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.413sec
totally nodes used: 6746872 (6.7e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 12640277 27590662 40230939
used/not used/entry size/cache size: 26302718 40806146 16 1024MB
basic ops cache: hits/miss/sum: 2699758 5836514 8536272
used/not used/entry size/cache size: 7454043 9323173 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: 56623 132744 189367
used/not used/entry size/cache size: 131647 8256961 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 61096912
1 5374939
2 551331
3 74815
4 9658
5 1080
6 111
7 16
8 2
9 0
>= 10 0
Total processing time: 0m23.313sec
BK_STOP 1679310546660
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:6400 (31), effective:599 (2)
initing FirstDep: 0m 0.000sec
iterations count:551 (2), effective:25 (0)
iterations count:246 (1), effective:9 (0)
iterations count:264 (1), effective:10 (0)
iterations count:244 (1), effective:8 (0)
iterations count:208 (1), effective:3 (0)
iterations count:202 (1), effective:0 (0)
iterations count:212 (1), effective:1 (0)
iterations count:1545 (7), effective:137 (0)
iterations count:202 (1), effective:0 (0)
iterations count:1070 (5), effective:66 (0)
iterations count:430 (2), effective:23 (0)
iterations count:395 (1), effective:18 (0)
iterations count:749 (3), effective:42 (0)
iterations count:208 (1), effective:1 (0)
iterations count:1175 (5), effective:83 (0)
iterations count:1120 (5), effective:83 (0)
iterations count:1120 (5), effective:83 (0)
iterations count:1099 (5), effective:83 (0)
iterations count:1120 (5), effective:83 (0)
iterations count:1441 (7), effective:104 (0)
iterations count:757 (3), effective:40 (0)
iterations count:355 (1), effective:26 (0)
iterations count:1709 (8), effective:144 (0)
iterations count:207 (1), effective:1 (0)
iterations count:206 (1), effective:1 (0)
iterations count:204 (1), effective:1 (0)
iterations count:325 (1), effective:22 (0)
iterations count:204 (1), effective:1 (0)
iterations count:325 (1), effective:22 (0)
iterations count:1898 (9), effective:151 (0)
iterations count:204 (1), effective:1 (0)
iterations count:325 (1), effective:22 (0)
iterations count:204 (1), effective:1 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmartHome-PT-07"
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-07, 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-167912650000202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-07.tgz
mv SmartHome-PT-07 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;