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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.3K Feb 26 05:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 05:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 05:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 05:41 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.3K 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.1K Feb 25 17:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 05:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 05:43 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 71K 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-11-CTLFireability-00
FORMULA_NAME SmartHome-PT-11-CTLFireability-01
FORMULA_NAME SmartHome-PT-11-CTLFireability-02
FORMULA_NAME SmartHome-PT-11-CTLFireability-03
FORMULA_NAME SmartHome-PT-11-CTLFireability-04
FORMULA_NAME SmartHome-PT-11-CTLFireability-05
FORMULA_NAME SmartHome-PT-11-CTLFireability-06
FORMULA_NAME SmartHome-PT-11-CTLFireability-07
FORMULA_NAME SmartHome-PT-11-CTLFireability-08
FORMULA_NAME SmartHome-PT-11-CTLFireability-09
FORMULA_NAME SmartHome-PT-11-CTLFireability-10
FORMULA_NAME SmartHome-PT-11-CTLFireability-11
FORMULA_NAME SmartHome-PT-11-CTLFireability-12
FORMULA_NAME SmartHome-PT-11-CTLFireability-13
FORMULA_NAME SmartHome-PT-11-CTLFireability-14
FORMULA_NAME SmartHome-PT-11-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679312376242

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

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

net check time: 0m 0.000sec

init dd package: 0m 3.755sec


RS generation: 0m 2.506sec


-> reachability set: #nodes 22970 (2.3e+04) #states 120,235,679,619 (11)



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

checking: EF [EG [[p50<=1 & 1<=p50]]]
normalized: E [true U EG [[p50<=1 & 1<=p50]]]

abstracting: (1<=p50)
states: 5,822,494,417 (9)
abstracting: (p50<=1)
states: 120,235,679,619 (11)
........
EG iterations: 8
-> the formula is TRUE

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

MC time: 0m 3.041sec

checking: EF [AX [A [[p24<=1 & 1<=p24] U [p20<=1 & 1<=p20]]]]
normalized: E [true U ~ [EX [~ [[~ [EG [~ [[p20<=1 & 1<=p20]]]] & ~ [E [~ [[p20<=1 & 1<=p20]] U [~ [[p24<=1 & 1<=p24]] & ~ [[p20<=1 & 1<=p20]]]]]]]]]]

abstracting: (1<=p20)
states: 6,226,596,600 (9)
abstracting: (p20<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p24)
states: 6,226,596,600 (9)
abstracting: (p24<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p20)
states: 6,226,596,600 (9)
abstracting: (p20<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p20)
states: 6,226,596,600 (9)
abstracting: (p20<=1)
states: 120,235,679,619 (11)
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m 3.048sec

checking: EX [AG [E [~ [[p91<=1 & 1<=p91]] U [p145<=1 & 1<=p145]]]]
normalized: EX [~ [E [true U ~ [E [~ [[p91<=1 & 1<=p91]] U [p145<=1 & 1<=p145]]]]]]

abstracting: (1<=p145)
states: 52,509,140 (7)
abstracting: (p145<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p91)
states: 3,715,648,503 (9)
abstracting: (p91<=1)
states: 120,235,679,619 (11)
.-> the formula is FALSE

FORMULA SmartHome-PT-11-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.431sec

checking: EG [AG [AF [[[p55<=0 & 0<=p55] & [p0<=0 & 0<=p0]]]]]
normalized: EG [~ [E [true U EG [~ [[[p0<=0 & 0<=p0] & [p55<=0 & 0<=p55]]]]]]]

abstracting: (0<=p55)
states: 120,235,679,619 (11)
abstracting: (p55<=0)
states: 114,413,185,202 (11)
abstracting: (0<=p0)
states: 120,235,679,619 (11)
abstracting: (p0<=0)
states: 120,235,679,618 (11)
........
EG iterations: 8
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.271sec

checking: EF [AG [[~ [[p144<=1 & 1<=p144]] & [p79<=1 & 1<=p79]]]]
normalized: E [true U ~ [E [true U ~ [[[p79<=1 & 1<=p79] & ~ [[p144<=1 & 1<=p144]]]]]]]

abstracting: (1<=p144)
states: 6,322,666,386 (9)
abstracting: (p144<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p79)
states: 5,308,448,824 (9)
abstracting: (p79<=1)
states: 120,235,679,619 (11)
-> the formula is FALSE

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

MC time: 0m 0.639sec

checking: EX [AF [[EG [[[p26<=0 & 0<=p26] & [p94<=0 & 0<=p94]]] & AF [~ [E [[1<=p0 & p0<=1] U [p47<=1 & 1<=p47]]]]]]]
normalized: EX [~ [EG [~ [[~ [EG [E [[1<=p0 & p0<=1] U [p47<=1 & 1<=p47]]]] & EG [[[p94<=0 & 0<=p94] & [p26<=0 & 0<=p26]]]]]]]]

abstracting: (0<=p26)
states: 120,235,679,619 (11)
abstracting: (p26<=0)
states: 114,009,083,019 (11)
abstracting: (0<=p94)
states: 120,235,679,619 (11)
abstracting: (p94<=0)
states: 116,520,031,116 (11)
........
EG iterations: 8
abstracting: (1<=p47)
states: 5,822,494,417 (9)
abstracting: (p47<=1)
states: 120,235,679,619 (11)
abstracting: (p0<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p0)
states: 1
........
EG iterations: 8
.........
EG iterations: 9
.-> the formula is TRUE

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

MC time: 0m 1.848sec

checking: [EX [[[EG [AX [[p114<=0 & 0<=p114]]] | [[p112<=0 & 0<=p112] & EX [[p15<=0 & 0<=p15]]]] | [[p95<=0 & 0<=p95] | [p11<=0 & 0<=p11]]]] & EG [AX [[p91<=0 & 0<=p91]]]]
normalized: [EG [~ [EX [~ [[p91<=0 & 0<=p91]]]]] & EX [[[[p11<=0 & 0<=p11] | [p95<=0 & 0<=p95]] | [[EX [[p15<=0 & 0<=p15]] & [p112<=0 & 0<=p112]] | EG [~ [EX [~ [[p114<=0 & 0<=p114]]]]]]]]]

abstracting: (0<=p114)
states: 120,235,679,619 (11)
abstracting: (p114<=0)
states: 116,520,031,116 (11)
..
EG iterations: 1
abstracting: (0<=p112)
states: 120,235,679,619 (11)
abstracting: (p112<=0)
states: 116,520,031,116 (11)
abstracting: (0<=p15)
states: 120,235,679,619 (11)
abstracting: (p15<=0)
states: 114,009,083,019 (11)
.abstracting: (0<=p95)
states: 120,235,679,619 (11)
abstracting: (p95<=0)
states: 116,520,031,116 (11)
abstracting: (0<=p11)
states: 120,235,679,619 (11)
abstracting: (p11<=0)
states: 118,404,039,879 (11)
.abstracting: (0<=p91)
states: 120,235,679,619 (11)
abstracting: (p91<=0)
states: 116,520,031,116 (11)
..
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.902sec

checking: A [[AX [[AG [EX [[p73<=1 & 1<=p73]]] & EG [[[p108<=1 & 1<=p108] & [p11<=1 & 1<=p11]]]]] & [[p47<=1 & 1<=p47] & EG [[AX [1<=0] & [[p76<=1 & 1<=p76] & [p102<=1 & 1<=p102]]]]]] U [AG [~ [EG [[[p91<=1 & 1<=p91] | [p116<=1 & 1<=p116]]]]] & ~ [E [EG [[p65<=1 & 1<=p65]] U [p86<=1 & 1<=p86]]]]]
normalized: [~ [EG [~ [[~ [E [EG [[p65<=1 & 1<=p65]] U [p86<=1 & 1<=p86]]] & ~ [E [true U EG [[[p116<=1 & 1<=p116] | [p91<=1 & 1<=p91]]]]]]]]] & ~ [E [~ [[~ [E [EG [[p65<=1 & 1<=p65]] U [p86<=1 & 1<=p86]]] & ~ [E [true U EG [[[p116<=1 & 1<=p116] | [p91<=1 & 1<=p91]]]]]]] U [~ [[[EG [[[[p102<=1 & 1<=p102] & [p76<=1 & 1<=p76]] & ~ [EX [~ [1<=0]]]]] & [p47<=1 & 1<=p47]] & ~ [EX [~ [[EG [[[p11<=1 & 1<=p11] & [p108<=1 & 1<=p108]]] & ~ [E [true U ~ [EX [[p73<=1 & 1<=p73]]]]]]]]]]] & ~ [[~ [E [EG [[p65<=1 & 1<=p65]] U [p86<=1 & 1<=p86]]] & ~ [E [true U EG [[[p116<=1 & 1<=p116] | [p91<=1 & 1<=p91]]]]]]]]]]]

abstracting: (1<=p91)
states: 3,715,648,503 (9)
abstracting: (p91<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p116)
states: 3,715,648,503 (9)
abstracting: (p116<=1)
states: 120,235,679,619 (11)
........
EG iterations: 8
abstracting: (1<=p86)
states: 5,292,758,044 (9)
abstracting: (p86<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p65)
states: 1,261,188,445 (9)
abstracting: (p65<=1)
states: 120,235,679,619 (11)
........
EG iterations: 8
abstracting: (1<=p73)
states: 5,308,448,824 (9)
abstracting: (p73<=1)
states: 120,235,679,619 (11)
.abstracting: (1<=p108)
states: 3,715,648,503 (9)
abstracting: (p108<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p11)
states: 1,831,639,740 (9)
abstracting: (p11<=1)
states: 120,235,679,619 (11)
........
EG iterations: 8
.abstracting: (1<=p47)
states: 5,822,494,417 (9)
abstracting: (p47<=1)
states: 120,235,679,619 (11)
abstracting: (1<=0)
states: 0
.abstracting: (1<=p76)
states: 5,308,448,824 (9)
abstracting: (p76<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p102)
states: 3,715,648,503 (9)
abstracting: (p102<=1)
states: 120,235,679,619 (11)
.
EG iterations: 1
abstracting: (1<=p91)
states: 3,715,648,503 (9)
abstracting: (p91<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p116)
states: 3,715,648,503 (9)
abstracting: (p116<=1)
states: 120,235,679,619 (11)
........
EG iterations: 8
abstracting: (1<=p86)
states: 5,292,758,044 (9)
abstracting: (p86<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p65)
states: 1,261,188,445 (9)
abstracting: (p65<=1)
states: 120,235,679,619 (11)
........
EG iterations: 8
abstracting: (1<=p91)
states: 3,715,648,503 (9)
abstracting: (p91<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p116)
states: 3,715,648,503 (9)
abstracting: (p116<=1)
states: 120,235,679,619 (11)
........
EG iterations: 8
abstracting: (1<=p86)
states: 5,292,758,044 (9)
abstracting: (p86<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p65)
states: 1,261,188,445 (9)
abstracting: (p65<=1)
states: 120,235,679,619 (11)
........
EG iterations: 8
........
EG iterations: 8
-> the formula is FALSE

FORMULA SmartHome-PT-11-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.509sec

checking: [EG [A [~ [EG [~ [[p54<=1 & 1<=p54]]]] U [EF [[[p87<=1 & 1<=p87] & [p164<=1 & 1<=p164]]] | AF [EG [[p59<=1 & 1<=p59]]]]]] & E [[~ [[EG [[p40<=1 & 1<=p40]] | [EF [[p52<=1 & 1<=p52]] | ~ [[p105<=1 & 1<=p105]]]]] | [~ [[p12<=1 & 1<=p12]] | ~ [EF [[EF [[[p123<=1 & 1<=p123] & [p147<=1 & 1<=p147]]] & [p14<=1 & 1<=p14]]]]]] U [p145<=1 & 1<=p145]]]
normalized: [E [[~ [[[~ [[p105<=1 & 1<=p105]] | E [true U [p52<=1 & 1<=p52]]] | EG [[p40<=1 & 1<=p40]]]] | [~ [E [true U [E [true U [[p147<=1 & 1<=p147] & [p123<=1 & 1<=p123]]] & [p14<=1 & 1<=p14]]]] | ~ [[p12<=1 & 1<=p12]]]] U [p145<=1 & 1<=p145]] & EG [[~ [EG [~ [[~ [EG [~ [EG [[p59<=1 & 1<=p59]]]]] | E [true U [[p164<=1 & 1<=p164] & [p87<=1 & 1<=p87]]]]]]] & ~ [E [~ [[~ [EG [~ [EG [[p59<=1 & 1<=p59]]]]] | E [true U [[p164<=1 & 1<=p164] & [p87<=1 & 1<=p87]]]]] U [EG [~ [[p54<=1 & 1<=p54]]] & ~ [[~ [EG [~ [EG [[p59<=1 & 1<=p59]]]]] | E [true U [[p164<=1 & 1<=p164] & [p87<=1 & 1<=p87]]]]]]]]]]]

abstracting: (1<=p87)
states: 5,308,448,824 (9)
abstracting: (p87<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p164)
states: 24,195,184,896 (10)
abstracting: (p164<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p59)
states: 5,822,494,417 (9)
abstracting: (p59<=1)
states: 120,235,679,619 (11)
........
EG iterations: 8
.
EG iterations: 1
abstracting: (1<=p54)
states: 5,822,494,417 (9)
abstracting: (p54<=1)
states: 120,235,679,619 (11)
.
EG iterations: 1
abstracting: (1<=p87)
states: 5,308,448,824 (9)
abstracting: (p87<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p164)
states: 24,195,184,896 (10)
abstracting: (p164<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p59)
states: 5,822,494,417 (9)
abstracting: (p59<=1)
states: 120,235,679,619 (11)
........
EG iterations: 8
.
EG iterations: 1
abstracting: (1<=p87)
states: 5,308,448,824 (9)
abstracting: (p87<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p164)
states: 24,195,184,896 (10)
abstracting: (p164<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p59)
states: 5,822,494,417 (9)
abstracting: (p59<=1)
states: 120,235,679,619 (11)
........
EG iterations: 8
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p145)
states: 52,509,140 (7)
abstracting: (p145<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p12)
states: 6,226,596,600 (9)
abstracting: (p12<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p14)
states: 6,226,596,600 (9)
abstracting: (p14<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p123)
states: 3,715,648,503 (9)
abstracting: (p123<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p147)
states: 40,581,378,069 (10)
abstracting: (p147<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p40)
states: 3,881,981,352 (9)
abstracting: (p40<=1)
states: 120,235,679,619 (11)
......
EG iterations: 6
abstracting: (1<=p52)
states: 5,822,494,417 (9)
abstracting: (p52<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p105)
states: 3,715,648,503 (9)
abstracting: (p105<=1)
states: 120,235,679,619 (11)
-> the formula is TRUE

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

MC time: 0m 6.341sec

checking: AG [[A [EF [[[p130<=1 & 1<=p130] | [p19<=1 & 1<=p19]]] U ~ [[[p32<=1 & 1<=p32] & [p107<=1 & 1<=p107]]]] | E [[[[p43<=1 & 1<=p43] & [p157<=1 & 1<=p157]] | [[p87<=1 & 1<=p87] | [p9<=1 & 1<=p9]]] U [[EG [[[p165<=1 & 1<=p165] & [p168<=1 & 1<=p168]]] | [~ [[p123<=1 & 1<=p123]] | ~ [AG [[p61<=1 & 1<=p61]]]]] & EX [[[p115<=1 & 1<=p115] | [p116<=1 & 1<=p116]]]]]]]
normalized: ~ [E [true U ~ [[E [[[[p9<=1 & 1<=p9] | [p87<=1 & 1<=p87]] | [[p157<=1 & 1<=p157] & [p43<=1 & 1<=p43]]] U [EX [[[p116<=1 & 1<=p116] | [p115<=1 & 1<=p115]]] & [[E [true U ~ [[p61<=1 & 1<=p61]]] | ~ [[p123<=1 & 1<=p123]]] | EG [[[p168<=1 & 1<=p168] & [p165<=1 & 1<=p165]]]]]] | [~ [EG [[[p107<=1 & 1<=p107] & [p32<=1 & 1<=p32]]]] & ~ [E [[[p107<=1 & 1<=p107] & [p32<=1 & 1<=p32]] U [~ [E [true U [[p19<=1 & 1<=p19] | [p130<=1 & 1<=p130]]]] & [[p107<=1 & 1<=p107] & [p32<=1 & 1<=p32]]]]]]]]]]

abstracting: (1<=p32)
states: 9,040,919,257 (9)
abstracting: (p32<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p107)
states: 3,715,648,503 (9)
abstracting: (p107<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p130)
states: 6,322,666,386 (9)
abstracting: (p130<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p19)
states: 6,226,596,600 (9)
abstracting: (p19<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p32)
states: 9,040,919,257 (9)
abstracting: (p32<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p107)
states: 3,715,648,503 (9)
abstracting: (p107<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p32)
states: 9,040,919,257 (9)
abstracting: (p32<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p107)
states: 3,715,648,503 (9)
abstracting: (p107<=1)
states: 120,235,679,619 (11)
........
EG iterations: 8
abstracting: (1<=p165)
states: 22,178,906,112 (10)
abstracting: (p165<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p168)
states: 34,276,498,560 (10)
abstracting: (p168<=1)
states: 120,235,679,619 (11)
.....
EG iterations: 5
abstracting: (1<=p123)
states: 3,715,648,503 (9)
abstracting: (p123<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p61)
states: 5,822,494,417 (9)
abstracting: (p61<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p115)
states: 3,715,648,503 (9)
abstracting: (p115<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p116)
states: 3,715,648,503 (9)
abstracting: (p116<=1)
states: 120,235,679,619 (11)
.abstracting: (1<=p43)
states: 9,040,919,257 (9)
abstracting: (p43<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p157)
states: 33,005,993,184 (10)
abstracting: (p157<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p87)
states: 5,308,448,824 (9)
abstracting: (p87<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p9)
states: 2,182,105 (6)
abstracting: (p9<=1)
states: 120,235,679,619 (11)
-> the formula is FALSE

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

MC time: 0m 5.512sec

checking: ~ [E [~ [[[~ [AG [[p120<=1 & 1<=p120]]] | [[p70<=1 & 1<=p70] & ~ [[p5<=1 & 1<=p5]]]] & ~ [AX [[p15<=1 & 1<=p15]]]]] U [~ [[AG [~ [[p68<=1 & 1<=p68]]] | A [E [[[p2<=1 & 1<=p2] & [p144<=1 & 1<=p144]] U [p120<=1 & 1<=p120]] U [[p46<=1 & 1<=p46] & [p144<=1 & 1<=p144]]]]] & EF [[E [[p130<=1 & 1<=p130] U [p133<=1 & 1<=p133]] & [[p77<=1 & 1<=p77] | [[p135<=1 & 1<=p135] | [p7<=1 & 1<=p7]]]]]]]]
normalized: ~ [E [~ [[EX [~ [[p15<=1 & 1<=p15]]] & [[~ [[p5<=1 & 1<=p5]] & [p70<=1 & 1<=p70]] | E [true U ~ [[p120<=1 & 1<=p120]]]]]] U [E [true U [[[[p7<=1 & 1<=p7] | [p135<=1 & 1<=p135]] | [p77<=1 & 1<=p77]] & E [[p130<=1 & 1<=p130] U [p133<=1 & 1<=p133]]]] & ~ [[[~ [EG [~ [[[p144<=1 & 1<=p144] & [p46<=1 & 1<=p46]]]]] & ~ [E [~ [[[p144<=1 & 1<=p144] & [p46<=1 & 1<=p46]]] U [~ [E [[[p144<=1 & 1<=p144] & [p2<=1 & 1<=p2]] U [p120<=1 & 1<=p120]]] & ~ [[[p144<=1 & 1<=p144] & [p46<=1 & 1<=p46]]]]]]] | ~ [E [true U [p68<=1 & 1<=p68]]]]]]]]

abstracting: (1<=p68)
states: 5,308,448,824 (9)
abstracting: (p68<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p46)
states: 5,822,494,417 (9)
abstracting: (p46<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p144)
states: 6,322,666,386 (9)
abstracting: (p144<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p120)
states: 375,169,554 (8)
abstracting: (p120<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p2)
states: 30,228,854,588 (10)
abstracting: (p2<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p144)
states: 6,322,666,386 (9)
abstracting: (p144<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p46)
states: 5,822,494,417 (9)
abstracting: (p46<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p144)
states: 6,322,666,386 (9)
abstracting: (p144<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p46)
states: 5,822,494,417 (9)
abstracting: (p46<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p144)
states: 6,322,666,386 (9)
abstracting: (p144<=1)
states: 120,235,679,619 (11)
.
EG iterations: 1
abstracting: (1<=p133)
states: 6,322,666,386 (9)
abstracting: (p133<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p130)
states: 6,322,666,386 (9)
abstracting: (p130<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p77)
states: 5,308,448,824 (9)
abstracting: (p77<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p135)
states: 6,322,666,386 (9)
abstracting: (p135<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p7)
states: 289
abstracting: (p7<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p120)
states: 375,169,554 (8)
abstracting: (p120<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p70)
states: 5,308,448,824 (9)
abstracting: (p70<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p5)
states: 30,193,206,698 (10)
abstracting: (p5<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p15)
states: 6,226,596,600 (9)
abstracting: (p15<=1)
states: 120,235,679,619 (11)
.-> the formula is FALSE

FORMULA SmartHome-PT-11-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.565sec

checking: E [[EG [~ [EX [[[p77<=1 & 1<=p77] & [p119<=1 & 1<=p119]]]]] & [EX [E [[p53<=1 & 1<=p53] U [p145<=1 & 1<=p145]]] | [A [[AG [[p47<=1 & 1<=p47]] | E [[p137<=1 & 1<=p137] U [p4<=1 & 1<=p4]]] U ~ [[p46<=1 & 1<=p46]]] | [EG [A [[p134<=1 & 1<=p134] U [p69<=1 & 1<=p69]]] & ~ [[~ [[[p43<=1 & 1<=p43] & [p157<=1 & 1<=p157]]] | [[p24<=1 & 1<=p24] & [p69<=1 & 1<=p69]]]]]]]] U EX [A [EG [[p57<=1 & 1<=p57]] U [[EX [[p93<=1 & 1<=p93]] & [p32<=1 & 1<=p32]] & [[p2<=1 & 1<=p2] & [p63<=1 & 1<=p63]]]]]]
normalized: E [[[[[~ [[~ [[[p157<=1 & 1<=p157] & [p43<=1 & 1<=p43]]] | [[p69<=1 & 1<=p69] & [p24<=1 & 1<=p24]]]] & EG [[~ [EG [~ [[p69<=1 & 1<=p69]]]] & ~ [E [~ [[p69<=1 & 1<=p69]] U [~ [[p134<=1 & 1<=p134]] & ~ [[p69<=1 & 1<=p69]]]]]]]] | [~ [EG [[p46<=1 & 1<=p46]]] & ~ [E [[p46<=1 & 1<=p46] U [~ [[E [[p137<=1 & 1<=p137] U [p4<=1 & 1<=p4]] | ~ [E [true U ~ [[p47<=1 & 1<=p47]]]]]] & [p46<=1 & 1<=p46]]]]]] | EX [E [[p53<=1 & 1<=p53] U [p145<=1 & 1<=p145]]]] & EG [~ [EX [[[p119<=1 & 1<=p119] & [p77<=1 & 1<=p77]]]]]] U EX [[~ [EG [~ [[[[p63<=1 & 1<=p63] & [p2<=1 & 1<=p2]] & [[p32<=1 & 1<=p32] & EX [[p93<=1 & 1<=p93]]]]]]] & ~ [E [~ [[[[p63<=1 & 1<=p63] & [p2<=1 & 1<=p2]] & [[p32<=1 & 1<=p32] & EX [[p93<=1 & 1<=p93]]]]] U [~ [EG [[p57<=1 & 1<=p57]]] & ~ [[[[p63<=1 & 1<=p63] & [p2<=1 & 1<=p2]] & [[p32<=1 & 1<=p32] & EX [[p93<=1 & 1<=p93]]]]]]]]]]]

abstracting: (1<=p93)
states: 3,715,648,503 (9)
abstracting: (p93<=1)
states: 120,235,679,619 (11)
.abstracting: (1<=p32)
states: 9,040,919,257 (9)
abstracting: (p32<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p2)
states: 30,228,854,588 (10)
abstracting: (p2<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p63)
states: 5,822,494,417 (9)
abstracting: (p63<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p57)
states: 5,822,494,417 (9)
abstracting: (p57<=1)
states: 120,235,679,619 (11)
........
EG iterations: 8
abstracting: (1<=p93)
states: 3,715,648,503 (9)
abstracting: (p93<=1)
states: 120,235,679,619 (11)
.abstracting: (1<=p32)
states: 9,040,919,257 (9)
abstracting: (p32<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p2)
states: 30,228,854,588 (10)
abstracting: (p2<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p63)
states: 5,822,494,417 (9)
abstracting: (p63<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p93)
states: 3,715,648,503 (9)
abstracting: (p93<=1)
states: 120,235,679,619 (11)
.abstracting: (1<=p32)
states: 9,040,919,257 (9)
abstracting: (p32<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p2)
states: 30,228,854,588 (10)
abstracting: (p2<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p63)
states: 5,822,494,417 (9)
abstracting: (p63<=1)
states: 120,235,679,619 (11)
.
EG iterations: 1
.abstracting: (1<=p77)
states: 5,308,448,824 (9)
abstracting: (p77<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p119)
states: 3,715,648,503 (9)
abstracting: (p119<=1)
states: 120,235,679,619 (11)
..
EG iterations: 1
abstracting: (1<=p145)
states: 52,509,140 (7)
abstracting: (p145<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p53)
states: 5,822,494,417 (9)
abstracting: (p53<=1)
states: 120,235,679,619 (11)
.abstracting: (1<=p46)
states: 5,822,494,417 (9)
abstracting: (p46<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p47)
states: 5,822,494,417 (9)
abstracting: (p47<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p4)
states: 29,584,764,720 (10)
abstracting: (p4<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p137)
states: 6,322,666,386 (9)
abstracting: (p137<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p46)
states: 5,822,494,417 (9)
abstracting: (p46<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p46)
states: 5,822,494,417 (9)
abstracting: (p46<=1)
states: 120,235,679,619 (11)
........
EG iterations: 8
abstracting: (1<=p69)
states: 5,308,448,824 (9)
abstracting: (p69<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p134)
states: 6,322,666,386 (9)
abstracting: (p134<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p69)
states: 5,308,448,824 (9)
abstracting: (p69<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p69)
states: 5,308,448,824 (9)
abstracting: (p69<=1)
states: 120,235,679,619 (11)
.........
EG iterations: 9
........
EG iterations: 8
abstracting: (1<=p24)
states: 6,226,596,600 (9)
abstracting: (p24<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p69)
states: 5,308,448,824 (9)
abstracting: (p69<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p43)
states: 9,040,919,257 (9)
abstracting: (p43<=1)
states: 120,235,679,619 (11)
abstracting: (1<=p157)
states: 33,005,993,184 (10)
abstracting: (p157<=1)
states: 120,235,679,619 (11)
-> the formula is TRUE

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

MC time: 0m 5.336sec

totally nodes used: 15654360 (1.6e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 31729142 71751751 103480893
used/not used/entry size/cache size: 48095636 19013228 16 1024MB
basic ops cache: hits/miss/sum: 6201106 13709595 19910701
used/not used/entry size/cache size: 12365424 4411792 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: 136077 320517 456594
used/not used/entry size/cache size: 314844 8073764 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 54025757
1 10920446
2 1812275
3 299526
4 44320
5 5810
6 661
7 62
8 7
9 0
>= 10 0

Total processing time: 0m46.672sec


BK_STOP 1679312433460

--------------------
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:9386 (44), effective:940 (4)

initing FirstDep: 0m 0.001sec


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

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

iterations count:2103 (10), effective:154 (0)

iterations count:242 (1), effective:4 (0)

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

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

iterations count:308 (1), effective:20 (0)

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

iterations count:707 (3), effective:42 (0)

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

iterations count:775 (3), effective:69 (0)

iterations count:707 (3), effective:42 (0)

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

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

iterations count:707 (3), effective:42 (0)

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

iterations count:1238 (5), effective:92 (0)

iterations count:1238 (5), effective:92 (0)

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

iterations count:1238 (5), effective:92 (0)

iterations count:731 (3), effective:43 (0)

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

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

iterations count:242 (1), effective:4 (0)

iterations count:543 (2), effective:50 (0)

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

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

iterations count:669 (3), effective:34 (0)

iterations count:1253 (5), effective:60 (0)

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

iterations count:1296 (6), effective:95 (0)

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

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

iterations count:663 (3), effective:48 (0)

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

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

iterations count:1142 (5), effective:100 (0)

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

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

iterations count:405 (1), effective:25 (0)

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

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

iterations count:1675 (7), effective:94 (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-11"
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-11, 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-167912650000234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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