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.r106-tall-167814483200794.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 DLCshifumi-PT-2a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483200794
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 6.1K Feb 26 08:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 08:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 07:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 07:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 08:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Feb 26 08:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 08:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 08:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 213K Mar 5 18:22 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 DLCshifumi-PT-2a-CTLFireability-00
FORMULA_NAME DLCshifumi-PT-2a-CTLFireability-01
FORMULA_NAME DLCshifumi-PT-2a-CTLFireability-02
FORMULA_NAME DLCshifumi-PT-2a-CTLFireability-03
FORMULA_NAME DLCshifumi-PT-2a-CTLFireability-04
FORMULA_NAME DLCshifumi-PT-2a-CTLFireability-05
FORMULA_NAME DLCshifumi-PT-2a-CTLFireability-06
FORMULA_NAME DLCshifumi-PT-2a-CTLFireability-07
FORMULA_NAME DLCshifumi-PT-2a-CTLFireability-08
FORMULA_NAME DLCshifumi-PT-2a-CTLFireability-09
FORMULA_NAME DLCshifumi-PT-2a-CTLFireability-10
FORMULA_NAME DLCshifumi-PT-2a-CTLFireability-11
FORMULA_NAME DLCshifumi-PT-2a-CTLFireability-12
FORMULA_NAME DLCshifumi-PT-2a-CTLFireability-13
FORMULA_NAME DLCshifumi-PT-2a-CTLFireability-14
FORMULA_NAME DLCshifumi-PT-2a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678479016001

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=DLCshifumi-PT-2a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 20:10:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 20:10:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 20:10:17] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-10 20:10:17] [INFO ] Transformed 188 places.
[2023-03-10 20:10:17] [INFO ] Transformed 888 transitions.
[2023-03-10 20:10:17] [INFO ] Found NUPN structural information;
[2023-03-10 20:10:17] [INFO ] Parsed PT model containing 188 places and 888 transitions and 3166 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
FORMULA DLCshifumi-PT-2a-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 104 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 760/760 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 171 transition count 709
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 171 transition count 709
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 41 place count 171 transition count 702
Drop transitions removed 220 transitions
Redundant transition composition rules discarded 220 transitions
Iterating global reduction 1 with 220 rules applied. Total rules applied 261 place count 171 transition count 482
Applied a total of 261 rules in 41 ms. Remains 171 /188 variables (removed 17) and now considering 482/760 (removed 278) transitions.
[2023-03-10 20:10:17] [INFO ] Flow matrix only has 160 transitions (discarded 322 similar events)
// Phase 1: matrix 160 rows 171 cols
[2023-03-10 20:10:17] [INFO ] Computed 79 place invariants in 12 ms
[2023-03-10 20:10:18] [INFO ] Implicit Places using invariants in 598 ms returned [111, 117, 120, 124, 125, 131, 135, 136, 137, 142, 145, 147, 150, 151, 153, 161, 167]
Discarding 17 places :
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Implicit Place search using SMT only with invariants took 623 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 154/188 places, 442/760 transitions.
Drop transitions removed 193 transitions
Redundant transition composition rules discarded 193 transitions
Iterating global reduction 0 with 193 rules applied. Total rules applied 193 place count 154 transition count 249
Applied a total of 193 rules in 4 ms. Remains 154 /154 variables (removed 0) and now considering 249/442 (removed 193) transitions.
[2023-03-10 20:10:18] [INFO ] Flow matrix only has 160 transitions (discarded 89 similar events)
// Phase 1: matrix 160 rows 154 cols
[2023-03-10 20:10:18] [INFO ] Computed 62 place invariants in 1 ms
[2023-03-10 20:10:18] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-10 20:10:18] [INFO ] Flow matrix only has 160 transitions (discarded 89 similar events)
[2023-03-10 20:10:18] [INFO ] Invariant cache hit.
[2023-03-10 20:10:18] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-10 20:10:18] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 154/188 places, 249/760 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 853 ms. Remains : 154/188 places, 249/760 transitions.
Support contains 104 out of 154 places after structural reductions.
[2023-03-10 20:10:18] [INFO ] Flatten gal took : 35 ms
[2023-03-10 20:10:18] [INFO ] Flatten gal took : 14 ms
[2023-03-10 20:10:18] [INFO ] Input system was already deterministic with 249 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 88) seen :86
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 20:10:19] [INFO ] Flow matrix only has 160 transitions (discarded 89 similar events)
[2023-03-10 20:10:19] [INFO ] Invariant cache hit.
[2023-03-10 20:10:19] [INFO ] [Real]Absence check using 62 positive place invariants in 11 ms returned sat
[2023-03-10 20:10:19] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 11 ms
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 11 ms
[2023-03-10 20:10:19] [INFO ] Input system was already deterministic with 249 transitions.
Computed a total of 46 stabilizing places and 1 stable transitions
Graph (complete) has 427 edges and 154 vertex of which 143 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 249/249 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 144 transition count 249
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 37 place count 117 transition count 192
Iterating global reduction 1 with 27 rules applied. Total rules applied 64 place count 117 transition count 192
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 70 place count 117 transition count 186
Applied a total of 70 rules in 7 ms. Remains 117 /154 variables (removed 37) and now considering 186/249 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 117/154 places, 186/249 transitions.
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 6 ms
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 6 ms
[2023-03-10 20:10:19] [INFO ] Input system was already deterministic with 186 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 249/249 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 146 transition count 249
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 41 place count 113 transition count 182
Iterating global reduction 1 with 33 rules applied. Total rules applied 74 place count 113 transition count 182
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 81 place count 113 transition count 175
Applied a total of 81 rules in 7 ms. Remains 113 /154 variables (removed 41) and now considering 175/249 (removed 74) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 113/154 places, 175/249 transitions.
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 5 ms
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 6 ms
[2023-03-10 20:10:19] [INFO ] Input system was already deterministic with 175 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 249/249 transitions.
Graph (trivial) has 153 edges and 154 vertex of which 46 / 154 are part of one of the 16 SCC in 2 ms
Free SCC test removed 30 places
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Graph (complete) has 344 edges and 124 vertex of which 114 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 114 transition count 166
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 102 transition count 163
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 99 transition count 163
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 57 place count 74 transition count 120
Iterating global reduction 3 with 25 rules applied. Total rules applied 82 place count 74 transition count 120
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 91 place count 74 transition count 111
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 119 place count 60 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 59 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 59 transition count 96
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 145 place count 59 transition count 72
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 151 place count 53 transition count 72
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 157 place count 47 transition count 66
Iterating global reduction 5 with 6 rules applied. Total rules applied 163 place count 47 transition count 66
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 169 place count 44 transition count 63
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 170 place count 44 transition count 63
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 171 place count 43 transition count 62
Iterating global reduction 5 with 1 rules applied. Total rules applied 172 place count 43 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 173 place count 43 transition count 61
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 174 place count 43 transition count 60
Applied a total of 174 rules in 37 ms. Remains 43 /154 variables (removed 111) and now considering 60/249 (removed 189) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 43/154 places, 60/249 transitions.
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 2 ms
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 2 ms
[2023-03-10 20:10:19] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 249/249 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 143 transition count 249
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 38 place count 116 transition count 192
Iterating global reduction 1 with 27 rules applied. Total rules applied 65 place count 116 transition count 192
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 73 place count 116 transition count 184
Applied a total of 73 rules in 5 ms. Remains 116 /154 variables (removed 38) and now considering 184/249 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 116/154 places, 184/249 transitions.
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 5 ms
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 11 ms
[2023-03-10 20:10:19] [INFO ] Input system was already deterministic with 184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 249/249 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 144 transition count 249
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 40 place count 114 transition count 188
Iterating global reduction 1 with 30 rules applied. Total rules applied 70 place count 114 transition count 188
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 77 place count 114 transition count 181
Applied a total of 77 rules in 7 ms. Remains 114 /154 variables (removed 40) and now considering 181/249 (removed 68) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 114/154 places, 181/249 transitions.
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 5 ms
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 5 ms
[2023-03-10 20:10:19] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 249/249 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 144 transition count 249
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 40 place count 114 transition count 188
Iterating global reduction 1 with 30 rules applied. Total rules applied 70 place count 114 transition count 188
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 78 place count 114 transition count 180
Applied a total of 78 rules in 4 ms. Remains 114 /154 variables (removed 40) and now considering 180/249 (removed 69) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 114/154 places, 180/249 transitions.
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 6 ms
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 6 ms
[2023-03-10 20:10:19] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 249/249 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 143 transition count 249
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 44 place count 110 transition count 182
Iterating global reduction 1 with 33 rules applied. Total rules applied 77 place count 110 transition count 182
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 85 place count 110 transition count 174
Applied a total of 85 rules in 5 ms. Remains 110 /154 variables (removed 44) and now considering 174/249 (removed 75) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 110/154 places, 174/249 transitions.
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 6 ms
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 7 ms
[2023-03-10 20:10:19] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 249/249 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 143 transition count 249
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 43 place count 111 transition count 184
Iterating global reduction 1 with 32 rules applied. Total rules applied 75 place count 111 transition count 184
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 82 place count 111 transition count 177
Applied a total of 82 rules in 4 ms. Remains 111 /154 variables (removed 43) and now considering 177/249 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 111/154 places, 177/249 transitions.
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 5 ms
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 5 ms
[2023-03-10 20:10:19] [INFO ] Input system was already deterministic with 177 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 249/249 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 144 transition count 249
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 39 place count 115 transition count 189
Iterating global reduction 1 with 29 rules applied. Total rules applied 68 place count 115 transition count 189
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 76 place count 115 transition count 181
Applied a total of 76 rules in 4 ms. Remains 115 /154 variables (removed 39) and now considering 181/249 (removed 68) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 115/154 places, 181/249 transitions.
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 5 ms
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 5 ms
[2023-03-10 20:10:19] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 249/249 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 143 transition count 249
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 37 place count 117 transition count 195
Iterating global reduction 1 with 26 rules applied. Total rules applied 63 place count 117 transition count 195
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 69 place count 117 transition count 189
Applied a total of 69 rules in 3 ms. Remains 117 /154 variables (removed 37) and now considering 189/249 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 117/154 places, 189/249 transitions.
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 6 ms
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 6 ms
[2023-03-10 20:10:19] [INFO ] Input system was already deterministic with 189 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 249/249 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 144 transition count 249
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 34 place count 120 transition count 200
Iterating global reduction 1 with 24 rules applied. Total rules applied 58 place count 120 transition count 200
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 120 transition count 193
Applied a total of 65 rules in 3 ms. Remains 120 /154 variables (removed 34) and now considering 193/249 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 120/154 places, 193/249 transitions.
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 6 ms
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 6 ms
[2023-03-10 20:10:19] [INFO ] Input system was already deterministic with 193 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 249/249 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 144 transition count 249
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 39 place count 115 transition count 190
Iterating global reduction 1 with 29 rules applied. Total rules applied 68 place count 115 transition count 190
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 75 place count 115 transition count 183
Applied a total of 75 rules in 3 ms. Remains 115 /154 variables (removed 39) and now considering 183/249 (removed 66) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 115/154 places, 183/249 transitions.
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 5 ms
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 5 ms
[2023-03-10 20:10:19] [INFO ] Input system was already deterministic with 183 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 249/249 transitions.
Graph (trivial) has 126 edges and 154 vertex of which 37 / 154 are part of one of the 12 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Graph (complete) has 359 edges and 129 vertex of which 121 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.6 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 11 place count 121 transition count 181
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 112 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 111 transition count 180
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 22 place count 111 transition count 178
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 109 transition count 178
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 47 place count 88 transition count 141
Iterating global reduction 3 with 21 rules applied. Total rules applied 68 place count 88 transition count 141
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 79 place count 88 transition count 130
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 105 place count 75 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 106 place count 74 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 74 transition count 116
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 4 with 21 rules applied. Total rules applied 128 place count 74 transition count 95
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 134 place count 68 transition count 95
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 140 place count 62 transition count 89
Iterating global reduction 5 with 6 rules applied. Total rules applied 146 place count 62 transition count 89
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 149 place count 62 transition count 89
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 151 place count 60 transition count 87
Iterating global reduction 5 with 2 rules applied. Total rules applied 153 place count 60 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 155 place count 60 transition count 85
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 156 place count 60 transition count 84
Applied a total of 156 rules in 29 ms. Remains 60 /154 variables (removed 94) and now considering 84/249 (removed 165) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 60/154 places, 84/249 transitions.
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 2 ms
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 2 ms
[2023-03-10 20:10:19] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 249/249 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 146 transition count 249
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 33 place count 121 transition count 198
Iterating global reduction 1 with 25 rules applied. Total rules applied 58 place count 121 transition count 198
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 64 place count 121 transition count 192
Applied a total of 64 rules in 3 ms. Remains 121 /154 variables (removed 33) and now considering 192/249 (removed 57) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 121/154 places, 192/249 transitions.
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 4 ms
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 5 ms
[2023-03-10 20:10:19] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 249/249 transitions.
Graph (trivial) has 168 edges and 154 vertex of which 59 / 154 are part of one of the 17 SCC in 0 ms
Free SCC test removed 42 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Graph (complete) has 316 edges and 112 vertex of which 102 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 102 transition count 138
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 90 transition count 138
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 53 place count 63 transition count 93
Iterating global reduction 2 with 27 rules applied. Total rules applied 80 place count 63 transition count 93
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 88 place count 63 transition count 85
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 116 place count 49 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 48 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 48 transition count 70
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 139 place count 48 transition count 49
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 145 place count 42 transition count 49
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 150 place count 37 transition count 44
Iterating global reduction 4 with 5 rules applied. Total rules applied 155 place count 37 transition count 44
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 4 with 6 rules applied. Total rules applied 161 place count 34 transition count 41
Applied a total of 161 rules in 12 ms. Remains 34 /154 variables (removed 120) and now considering 41/249 (removed 208) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 34/154 places, 41/249 transitions.
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 1 ms
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 1 ms
[2023-03-10 20:10:19] [INFO ] Input system was already deterministic with 41 transitions.
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 7 ms
[2023-03-10 20:10:19] [INFO ] Flatten gal took : 7 ms
[2023-03-10 20:10:19] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-10 20:10:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 154 places, 249 transitions and 699 arcs took 1 ms.
Total runtime 2396 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: 154 NrTr: 249 NrArc: 699)

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

net check time: 0m 0.000sec

init dd package: 0m 2.734sec


RS generation: 0m 0.015sec


-> reachability set: #nodes 415 (4.2e+02) #states 30,005,640,000,001 (13)



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

checking: EX [AG [[[p105<=0 & 0<=p105] | [p143<=0 & 0<=p143]]]]
normalized: EX [~ [E [true U ~ [[[p143<=0 & 0<=p143] | [p105<=0 & 0<=p105]]]]]]

abstracting: (0<=p105)
states: 30,005,640,000,001 (13)
abstracting: (p105<=0)
states: 27,005,076,000,001 (13)
abstracting: (0<=p143)
states: 30,005,640,000,001 (13)
abstracting: (p143<=0)
states: 1
.-> the formula is FALSE

FORMULA DLCshifumi-PT-2a-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: EF [AG [~ [A [AX [[p7<=1 & 1<=p7]] U AG [[p101<=1 & 1<=p101]]]]]]
normalized: E [true U ~ [E [true U [~ [EG [E [true U ~ [[p101<=1 & 1<=p101]]]]] & ~ [E [E [true U ~ [[p101<=1 & 1<=p101]]] U [E [true U ~ [[p101<=1 & 1<=p101]]] & EX [~ [[p7<=1 & 1<=p7]]]]]]]]]]

abstracting: (1<=p7)
states: 5,000,940,000,000 (12)
abstracting: (p7<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p101)
states: 3,000,564,000,000 (12)
abstracting: (p101<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p101)
states: 3,000,564,000,000 (12)
abstracting: (p101<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p101)
states: 3,000,564,000,000 (12)
abstracting: (p101<=1)
states: 30,005,640,000,001 (13)

EG iterations: 0
-> the formula is TRUE

FORMULA DLCshifumi-PT-2a-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: ~ [E [[[p99<=1 & 1<=p99] & [p136<=1 & 1<=p136]] U AF [AG [[AG [[p32<=1 & 1<=p32]] | [[p103<=1 & 1<=p103] & [p153<=1 & 1<=p153]]]]]]]
normalized: ~ [E [[[p136<=1 & 1<=p136] & [p99<=1 & 1<=p99]] U ~ [EG [E [true U ~ [[[[p153<=1 & 1<=p153] & [p103<=1 & 1<=p103]] | ~ [E [true U ~ [[p32<=1 & 1<=p32]]]]]]]]]]]

abstracting: (1<=p32)
states: 4,286,520,000,000 (12)
abstracting: (p32<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p103)
states: 3,000,564,000,000 (12)
abstracting: (p103<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p153)
states: 30,005,640,000,000 (13)
abstracting: (p153<=1)
states: 30,005,640,000,001 (13)

EG iterations: 0
abstracting: (1<=p99)
states: 3,000,564,000,000 (12)
abstracting: (p99<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p136)
states: 30,005,640,000,000 (13)
abstracting: (p136<=1)
states: 30,005,640,000,001 (13)
-> the formula is TRUE

FORMULA DLCshifumi-PT-2a-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AF [AG [E [[[p107<=1 & 1<=p107] & [p142<=1 & 1<=p142]] U [~ [[[p47<=1 & 1<=p47] & [p139<=1 & 1<=p139]]] & [[[p93<=1 & 1<=p93] & [p129<=1 & 1<=p129]] | [[p96<=1 & 1<=p96] & [p113<=1 & 1<=p113]]]]]]]
normalized: ~ [EG [E [true U ~ [E [[[p142<=1 & 1<=p142] & [p107<=1 & 1<=p107]] U [[[[p113<=1 & 1<=p113] & [p96<=1 & 1<=p96]] | [[p129<=1 & 1<=p129] & [p93<=1 & 1<=p93]]] & ~ [[[p139<=1 & 1<=p139] & [p47<=1 & 1<=p47]]]]]]]]]

abstracting: (1<=p47)
states: 5,000,940,000,000 (12)
abstracting: (p47<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p139)
states: 30,005,640,000,000 (13)
abstracting: (p139<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p93)
states: 3,000,564,000,000 (12)
abstracting: (p93<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p129)
states: 30,005,640,000,000 (13)
abstracting: (p129<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p96)
states: 3,000,564,000,000 (12)
abstracting: (p96<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p113)
states: 30,005,640,000,000 (13)
abstracting: (p113<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p107)
states: 3,000,564,000,000 (12)
abstracting: (p107<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p142)
states: 30,005,640,000,000 (13)
abstracting: (p142<=1)
states: 30,005,640,000,001 (13)

EG iterations: 0
-> the formula is FALSE

FORMULA DLCshifumi-PT-2a-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: AX [[~ [E [E [EX [[[p71<=1 & 1<=p71] & [p126<=1 & 1<=p126]]] U EG [[p104<=1 & 1<=p104]]] U A [~ [[[p49<=1 & 1<=p49] & [p140<=1 & 1<=p140]]] U EG [[p33<=1 & 1<=p33]]]]] | [[p98<=0 & 0<=p98] | [p113<=0 & 0<=p113]]]]
normalized: ~ [EX [~ [[[[p113<=0 & 0<=p113] | [p98<=0 & 0<=p98]] | ~ [E [E [EX [[[p126<=1 & 1<=p126] & [p71<=1 & 1<=p71]]] U EG [[p104<=1 & 1<=p104]]] U [~ [EG [~ [EG [[p33<=1 & 1<=p33]]]]] & ~ [E [~ [EG [[p33<=1 & 1<=p33]]] U [[[p140<=1 & 1<=p140] & [p49<=1 & 1<=p49]] & ~ [EG [[p33<=1 & 1<=p33]]]]]]]]]]]]]

abstracting: (1<=p33)
states: 4,286,520,000,000 (12)
abstracting: (p33<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 1
abstracting: (1<=p49)
states: 5,000,940,000,000 (12)
abstracting: (p49<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p140)
states: 30,005,640,000,000 (13)
abstracting: (p140<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p33)
states: 4,286,520,000,000 (12)
abstracting: (p33<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 1
abstracting: (1<=p33)
states: 4,286,520,000,000 (12)
abstracting: (p33<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p104)
states: 3,000,564,000,000 (12)
abstracting: (p104<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 1
abstracting: (1<=p71)
states: 6,001,128,000,000 (12)
abstracting: (p71<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p126)
states: 30,005,640,000,000 (13)
abstracting: (p126<=1)
states: 30,005,640,000,001 (13)
.abstracting: (0<=p98)
states: 30,005,640,000,001 (13)
abstracting: (p98<=0)
states: 27,005,076,000,001 (13)
abstracting: (0<=p113)
states: 30,005,640,000,001 (13)
abstracting: (p113<=0)
states: 1
.-> the formula is FALSE

FORMULA DLCshifumi-PT-2a-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: EF [AX [[E [[AX [[[p63<=1 & 1<=p63] & [p144<=1 & 1<=p144]]] | [[p97<=1 & 1<=p97] & [p118<=1 & 1<=p118]]] U EF [[[p107<=1 & 1<=p107] & [p144<=1 & 1<=p144]]]] & [[p102<=1 & 1<=p102] & [p145<=1 & 1<=p145]]]]]
normalized: E [true U ~ [EX [~ [[[[p145<=1 & 1<=p145] & [p102<=1 & 1<=p102]] & E [[[[p118<=1 & 1<=p118] & [p97<=1 & 1<=p97]] | ~ [EX [~ [[[p144<=1 & 1<=p144] & [p63<=1 & 1<=p63]]]]]] U E [true U [[p144<=1 & 1<=p144] & [p107<=1 & 1<=p107]]]]]]]]]

abstracting: (1<=p107)
states: 3,000,564,000,000 (12)
abstracting: (p107<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p144)
states: 30,005,640,000,000 (13)
abstracting: (p144<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p63)
states: 5,000,940,000,000 (12)
abstracting: (p63<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p144)
states: 30,005,640,000,000 (13)
abstracting: (p144<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p97)
states: 3,000,564,000,000 (12)
abstracting: (p97<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p118)
states: 30,005,640,000,000 (13)
abstracting: (p118<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p102)
states: 3,000,564,000,000 (12)
abstracting: (p102<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p145)
states: 30,005,640,000,000 (13)
abstracting: (p145<=1)
states: 30,005,640,000,001 (13)
.-> the formula is FALSE

FORMULA DLCshifumi-PT-2a-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: EG [EF [[EF [[AG [[[p7<=1 & 1<=p7] & [p132<=1 & 1<=p132]]] | AX [[p77<=1 & 1<=p77]]]] | AX [[[[p5<=1 & 1<=p5] | [[p108<=1 & 1<=p108] & [p153<=1 & 1<=p153]]] & [[[p97<=1 & 1<=p97] & [p120<=1 & 1<=p120]] | [p93<=1 & 1<=p93]]]]]]]
normalized: EG [E [true U [~ [EX [~ [[[[p93<=1 & 1<=p93] | [[p120<=1 & 1<=p120] & [p97<=1 & 1<=p97]]] & [[[p153<=1 & 1<=p153] & [p108<=1 & 1<=p108]] | [p5<=1 & 1<=p5]]]]]] | E [true U [~ [EX [~ [[p77<=1 & 1<=p77]]]] | ~ [E [true U ~ [[[p132<=1 & 1<=p132] & [p7<=1 & 1<=p7]]]]]]]]]]

abstracting: (1<=p7)
states: 5,000,940,000,000 (12)
abstracting: (p7<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p132)
states: 30,005,640,000,000 (13)
abstracting: (p132<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p77)
states: 5,000,940,000,000 (12)
abstracting: (p77<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p5)
states: 6,001,128,000,000 (12)
abstracting: (p5<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p108)
states: 3,000,564,000,000 (12)
abstracting: (p108<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p153)
states: 30,005,640,000,000 (13)
abstracting: (p153<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p97)
states: 3,000,564,000,000 (12)
abstracting: (p97<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p120)
states: 30,005,640,000,000 (13)
abstracting: (p120<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p93)
states: 3,000,564,000,000 (12)
abstracting: (p93<=1)
states: 30,005,640,000,001 (13)
...
EG iterations: 2
-> the formula is FALSE

FORMULA DLCshifumi-PT-2a-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: AG [[EF [[EG [[[p97<=0 & 0<=p97] | [p112<=0 & 0<=p112]]] & AF [AX [[p46<=1 & 1<=p46]]]]] | EX [[EX [[[p38<=0 & 0<=p38] | [p118<=0 & 0<=p118]]] & [[[[p99<=0 & 0<=p99] | [p135<=0 & 0<=p135]] | [[p106<=0 & 0<=p106] | [p143<=0 & 0<=p143]]] & [p75<=0 & 0<=p75]]]]]]
normalized: ~ [E [true U ~ [[EX [[[[p75<=0 & 0<=p75] & [[[p143<=0 & 0<=p143] | [p106<=0 & 0<=p106]] | [[p135<=0 & 0<=p135] | [p99<=0 & 0<=p99]]]] & EX [[[p118<=0 & 0<=p118] | [p38<=0 & 0<=p38]]]]] | E [true U [~ [EG [EX [~ [[p46<=1 & 1<=p46]]]]] & EG [[[p112<=0 & 0<=p112] | [p97<=0 & 0<=p97]]]]]]]]]

abstracting: (0<=p97)
states: 30,005,640,000,001 (13)
abstracting: (p97<=0)
states: 27,005,076,000,001 (13)
abstracting: (0<=p112)
states: 30,005,640,000,001 (13)
abstracting: (p112<=0)
states: 1
.
EG iterations: 1
abstracting: (1<=p46)
states: 5,000,940,000,000 (12)
abstracting: (p46<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 0
abstracting: (0<=p38)
states: 30,005,640,000,001 (13)
abstracting: (p38<=0)
states: 25,719,120,000,001 (13)
abstracting: (0<=p118)
states: 30,005,640,000,001 (13)
abstracting: (p118<=0)
states: 1
.abstracting: (0<=p99)
states: 30,005,640,000,001 (13)
abstracting: (p99<=0)
states: 27,005,076,000,001 (13)
abstracting: (0<=p135)
states: 30,005,640,000,001 (13)
abstracting: (p135<=0)
states: 1
abstracting: (0<=p106)
states: 30,005,640,000,001 (13)
abstracting: (p106<=0)
states: 27,005,076,000,001 (13)
abstracting: (0<=p143)
states: 30,005,640,000,001 (13)
abstracting: (p143<=0)
states: 1
abstracting: (0<=p75)
states: 30,005,640,000,001 (13)
abstracting: (p75<=0)
states: 25,004,700,000,001 (13)
.-> the formula is TRUE

FORMULA DLCshifumi-PT-2a-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: E [~ [A [[[AX [[[p66<=1 & 1<=p66] & [p125<=1 & 1<=p125]]] | [[[p94<=1 & 1<=p94] & [p119<=1 & 1<=p119]] | [[p7<=1 & 1<=p7] & [p132<=1 & 1<=p132]]]] & AX [[p47<=1 & 1<=p47]]] U E [[[[p97<=1 & 1<=p97] & [p124<=1 & 1<=p124]] | [p12<=1 & 1<=p12]] U ~ [[p60<=1 & 1<=p60]]]]] U EF [AG [[[p107<=1 & 1<=p107] & [p130<=1 & 1<=p130]]]]]
normalized: E [~ [[~ [EG [~ [E [[[p12<=1 & 1<=p12] | [[p124<=1 & 1<=p124] & [p97<=1 & 1<=p97]]] U ~ [[p60<=1 & 1<=p60]]]]]] & ~ [E [~ [E [[[p12<=1 & 1<=p12] | [[p124<=1 & 1<=p124] & [p97<=1 & 1<=p97]]] U ~ [[p60<=1 & 1<=p60]]]] U [~ [[~ [EX [~ [[p47<=1 & 1<=p47]]]] & [[[[p132<=1 & 1<=p132] & [p7<=1 & 1<=p7]] | [[p119<=1 & 1<=p119] & [p94<=1 & 1<=p94]]] | ~ [EX [~ [[[p125<=1 & 1<=p125] & [p66<=1 & 1<=p66]]]]]]]] & ~ [E [[[p12<=1 & 1<=p12] | [[p124<=1 & 1<=p124] & [p97<=1 & 1<=p97]]] U ~ [[p60<=1 & 1<=p60]]]]]]]]] U E [true U ~ [E [true U ~ [[[p130<=1 & 1<=p130] & [p107<=1 & 1<=p107]]]]]]]

abstracting: (1<=p107)
states: 3,000,564,000,000 (12)
abstracting: (p107<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p130)
states: 30,005,640,000,000 (13)
abstracting: (p130<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p60)
states: 4,286,520,000,000 (12)
abstracting: (p60<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p97)
states: 3,000,564,000,000 (12)
abstracting: (p97<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p124)
states: 30,005,640,000,000 (13)
abstracting: (p124<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p12)
states: 5,000,940,000,000 (12)
abstracting: (p12<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p66)
states: 5,000,940,000,000 (12)
abstracting: (p66<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p125)
states: 30,005,640,000,000 (13)
abstracting: (p125<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p94)
states: 3,000,564,000,000 (12)
abstracting: (p94<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p119)
states: 30,005,640,000,000 (13)
abstracting: (p119<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p7)
states: 5,000,940,000,000 (12)
abstracting: (p7<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p132)
states: 30,005,640,000,000 (13)
abstracting: (p132<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p47)
states: 5,000,940,000,000 (12)
abstracting: (p47<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p60)
states: 4,286,520,000,000 (12)
abstracting: (p60<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p97)
states: 3,000,564,000,000 (12)
abstracting: (p97<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p124)
states: 30,005,640,000,000 (13)
abstracting: (p124<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p12)
states: 5,000,940,000,000 (12)
abstracting: (p12<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p60)
states: 4,286,520,000,000 (12)
abstracting: (p60<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p97)
states: 3,000,564,000,000 (12)
abstracting: (p97<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p124)
states: 30,005,640,000,000 (13)
abstracting: (p124<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p12)
states: 5,000,940,000,000 (12)
abstracting: (p12<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DLCshifumi-PT-2a-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: A [A [[p3<=1 & 1<=p3] U EX [[[p17<=1 & 1<=p17] & [p134<=1 & 1<=p134]]]] U EG [[AG [A [[p102<=1 & 1<=p102] U [[p88<=1 & 1<=p88] & [p129<=1 & 1<=p129]]]] | E [[AF [[[p22<=1 & 1<=p22] & [p135<=1 & 1<=p135]]] | [[p97<=1 & 1<=p97] & [p121<=1 & 1<=p121]]] U [AX [[[p97<=1 & 1<=p97] & [p109<=1 & 1<=p109]]] | [[p7<=1 & 1<=p7] & [p73<=1 & 1<=p73]]]]]]]
normalized: [~ [EG [~ [EG [[E [[[[p121<=1 & 1<=p121] & [p97<=1 & 1<=p97]] | ~ [EG [~ [[[p135<=1 & 1<=p135] & [p22<=1 & 1<=p22]]]]]] U [[[p73<=1 & 1<=p73] & [p7<=1 & 1<=p7]] | ~ [EX [~ [[[p109<=1 & 1<=p109] & [p97<=1 & 1<=p97]]]]]]] | ~ [E [true U ~ [[~ [EG [~ [[[p129<=1 & 1<=p129] & [p88<=1 & 1<=p88]]]]] & ~ [E [~ [[[p129<=1 & 1<=p129] & [p88<=1 & 1<=p88]]] U [~ [[p102<=1 & 1<=p102]] & ~ [[[p129<=1 & 1<=p129] & [p88<=1 & 1<=p88]]]]]]]]]]]]]]] & ~ [E [~ [EG [[E [[[[p121<=1 & 1<=p121] & [p97<=1 & 1<=p97]] | ~ [EG [~ [[[p135<=1 & 1<=p135] & [p22<=1 & 1<=p22]]]]]] U [[[p73<=1 & 1<=p73] & [p7<=1 & 1<=p7]] | ~ [EX [~ [[[p109<=1 & 1<=p109] & [p97<=1 & 1<=p97]]]]]]] | ~ [E [true U ~ [[~ [EG [~ [[[p129<=1 & 1<=p129] & [p88<=1 & 1<=p88]]]]] & ~ [E [~ [[[p129<=1 & 1<=p129] & [p88<=1 & 1<=p88]]] U [~ [[p102<=1 & 1<=p102]] & ~ [[[p129<=1 & 1<=p129] & [p88<=1 & 1<=p88]]]]]]]]]]]]] U [~ [[~ [EG [~ [EX [[[p134<=1 & 1<=p134] & [p17<=1 & 1<=p17]]]]]] & ~ [E [~ [EX [[[p134<=1 & 1<=p134] & [p17<=1 & 1<=p17]]]] U [~ [[p3<=1 & 1<=p3]] & ~ [EX [[[p134<=1 & 1<=p134] & [p17<=1 & 1<=p17]]]]]]]]] & ~ [EG [[E [[[[p121<=1 & 1<=p121] & [p97<=1 & 1<=p97]] | ~ [EG [~ [[[p135<=1 & 1<=p135] & [p22<=1 & 1<=p22]]]]]] U [[[p73<=1 & 1<=p73] & [p7<=1 & 1<=p7]] | ~ [EX [~ [[[p109<=1 & 1<=p109] & [p97<=1 & 1<=p97]]]]]]] | ~ [E [true U ~ [[~ [EG [~ [[[p129<=1 & 1<=p129] & [p88<=1 & 1<=p88]]]]] & ~ [E [~ [[[p129<=1 & 1<=p129] & [p88<=1 & 1<=p88]]] U [~ [[p102<=1 & 1<=p102]] & ~ [[[p129<=1 & 1<=p129] & [p88<=1 & 1<=p88]]]]]]]]]]]]]]]]]

abstracting: (1<=p88)
states: 6,001,128,000,000 (12)
abstracting: (p88<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p129)
states: 30,005,640,000,000 (13)
abstracting: (p129<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p102)
states: 3,000,564,000,000 (12)
abstracting: (p102<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p88)
states: 6,001,128,000,000 (12)
abstracting: (p88<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p129)
states: 30,005,640,000,000 (13)
abstracting: (p129<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p88)
states: 6,001,128,000,000 (12)
abstracting: (p88<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p129)
states: 30,005,640,000,000 (13)
abstracting: (p129<=1)
states: 30,005,640,000,001 (13)
..
EG iterations: 2
abstracting: (1<=p97)
states: 3,000,564,000,000 (12)
abstracting: (p97<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p109)
states: 30,005,640,000,000 (13)
abstracting: (p109<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p7)
states: 5,000,940,000,000 (12)
abstracting: (p7<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p73)
states: 5,000,940,000,000 (12)
abstracting: (p73<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p22)
states: 6,001,128,000,000 (12)
abstracting: (p22<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p135)
states: 30,005,640,000,000 (13)
abstracting: (p135<=1)
states: 30,005,640,000,001 (13)
..
EG iterations: 2
abstracting: (1<=p97)
states: 3,000,564,000,000 (12)
abstracting: (p97<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p121)
states: 30,005,640,000,000 (13)
abstracting: (p121<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 1
abstracting: (1<=p17)
states: 5,000,940,000,000 (12)
abstracting: (p17<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p134)
states: 30,005,640,000,000 (13)
abstracting: (p134<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p3)
states: 6,001,128,000,000 (12)
abstracting: (p3<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p17)
states: 5,000,940,000,000 (12)
abstracting: (p17<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p134)
states: 30,005,640,000,000 (13)
abstracting: (p134<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p17)
states: 5,000,940,000,000 (12)
abstracting: (p17<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p134)
states: 30,005,640,000,000 (13)
abstracting: (p134<=1)
states: 30,005,640,000,001 (13)
..
EG iterations: 1
abstracting: (1<=p88)
states: 6,001,128,000,000 (12)
abstracting: (p88<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p129)
states: 30,005,640,000,000 (13)
abstracting: (p129<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p102)
states: 3,000,564,000,000 (12)
abstracting: (p102<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p88)
states: 6,001,128,000,000 (12)
abstracting: (p88<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p129)
states: 30,005,640,000,000 (13)
abstracting: (p129<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p88)
states: 6,001,128,000,000 (12)
abstracting: (p88<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p129)
states: 30,005,640,000,000 (13)
abstracting: (p129<=1)
states: 30,005,640,000,001 (13)
..
EG iterations: 2
abstracting: (1<=p97)
states: 3,000,564,000,000 (12)
abstracting: (p97<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p109)
states: 30,005,640,000,000 (13)
abstracting: (p109<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p7)
states: 5,000,940,000,000 (12)
abstracting: (p7<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p73)
states: 5,000,940,000,000 (12)
abstracting: (p73<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p22)
states: 6,001,128,000,000 (12)
abstracting: (p22<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p135)
states: 30,005,640,000,000 (13)
abstracting: (p135<=1)
states: 30,005,640,000,001 (13)
..
EG iterations: 2
abstracting: (1<=p97)
states: 3,000,564,000,000 (12)
abstracting: (p97<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p121)
states: 30,005,640,000,000 (13)
abstracting: (p121<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 1
abstracting: (1<=p88)
states: 6,001,128,000,000 (12)
abstracting: (p88<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p129)
states: 30,005,640,000,000 (13)
abstracting: (p129<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p102)
states: 3,000,564,000,000 (12)
abstracting: (p102<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p88)
states: 6,001,128,000,000 (12)
abstracting: (p88<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p129)
states: 30,005,640,000,000 (13)
abstracting: (p129<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p88)
states: 6,001,128,000,000 (12)
abstracting: (p88<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p129)
states: 30,005,640,000,000 (13)
abstracting: (p129<=1)
states: 30,005,640,000,001 (13)
..
EG iterations: 2
abstracting: (1<=p97)
states: 3,000,564,000,000 (12)
abstracting: (p97<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p109)
states: 30,005,640,000,000 (13)
abstracting: (p109<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p7)
states: 5,000,940,000,000 (12)
abstracting: (p7<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p73)
states: 5,000,940,000,000 (12)
abstracting: (p73<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p22)
states: 6,001,128,000,000 (12)
abstracting: (p22<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p135)
states: 30,005,640,000,000 (13)
abstracting: (p135<=1)
states: 30,005,640,000,001 (13)
..
EG iterations: 2
abstracting: (1<=p97)
states: 3,000,564,000,000 (12)
abstracting: (p97<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p121)
states: 30,005,640,000,000 (13)
abstracting: (p121<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA DLCshifumi-PT-2a-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.095sec

checking: [~ [A [[~ [[EG [[[p22<=1 & 1<=p22] & [p115<=1 & 1<=p115]]] | ~ [[p108<=1 & 1<=p108]]]] & AG [EF [[[p97<=1 & 1<=p97] & [p114<=1 & 1<=p114]]]]] U ~ [AG [~ [AX [[p0<=1 & 1<=p0]]]]]]] | [E [EX [[[p12<=1 & 1<=p12] & [p133<=1 & 1<=p133]]] U E [EF [[[p96<=1 & 1<=p96] & [p110<=1 & 1<=p110]]] U [p100<=1 & 1<=p100]]] & [AG [[[[p53<=0 & 0<=p53] | [p121<=0 & 0<=p121]] & [p8<=1 & 1<=p8]]] | EG [[[p53<=1 & 1<=p53] & [p141<=1 & 1<=p141]]]]]]
normalized: [[[EG [[[p141<=1 & 1<=p141] & [p53<=1 & 1<=p53]]] | ~ [E [true U ~ [[[p8<=1 & 1<=p8] & [[p121<=0 & 0<=p121] | [p53<=0 & 0<=p53]]]]]]] & E [EX [[[p133<=1 & 1<=p133] & [p12<=1 & 1<=p12]]] U E [E [true U [[p110<=1 & 1<=p110] & [p96<=1 & 1<=p96]]] U [p100<=1 & 1<=p100]]]] | ~ [[~ [EG [~ [E [true U ~ [EX [~ [[p0<=1 & 1<=p0]]]]]]]] & ~ [E [~ [E [true U ~ [EX [~ [[p0<=1 & 1<=p0]]]]]] U [~ [[~ [E [true U ~ [E [true U [[p114<=1 & 1<=p114] & [p97<=1 & 1<=p97]]]]]] & ~ [[~ [[p108<=1 & 1<=p108]] | EG [[[p115<=1 & 1<=p115] & [p22<=1 & 1<=p22]]]]]]] & ~ [E [true U ~ [EX [~ [[p0<=1 & 1<=p0]]]]]]]]]]]]

abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p22)
states: 6,001,128,000,000 (12)
abstracting: (p22<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p115)
states: 30,005,640,000,000 (13)
abstracting: (p115<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 1
abstracting: (1<=p108)
states: 3,000,564,000,000 (12)
abstracting: (p108<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p97)
states: 3,000,564,000,000 (12)
abstracting: (p97<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p114)
states: 30,005,640,000,000 (13)
abstracting: (p114<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 0
abstracting: (1<=p100)
states: 3,000,564,000,000 (12)
abstracting: (p100<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p96)
states: 3,000,564,000,000 (12)
abstracting: (p96<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p110)
states: 30,005,640,000,000 (13)
abstracting: (p110<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p12)
states: 5,000,940,000,000 (12)
abstracting: (p12<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p133)
states: 30,005,640,000,000 (13)
abstracting: (p133<=1)
states: 30,005,640,000,001 (13)
.abstracting: (0<=p53)
states: 30,005,640,000,001 (13)
abstracting: (p53<=0)
states: 25,004,700,000,001 (13)
abstracting: (0<=p121)
states: 30,005,640,000,001 (13)
abstracting: (p121<=0)
states: 1
abstracting: (1<=p8)
states: 5,000,940,000,000 (12)
abstracting: (p8<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p53)
states: 5,000,940,000,000 (12)
abstracting: (p53<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p141)
states: 30,005,640,000,000 (13)
abstracting: (p141<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DLCshifumi-PT-2a-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: [EF [AX [AG [[p57<=1 & 1<=p57]]]] & [[AF [~ [E [[[p107<=1 & 1<=p107] & [p130<=1 & 1<=p130]] U [[p108<=1 & 1<=p108] & [p135<=1 & 1<=p135]]]]] | EX [[AG [[[p107<=1 & 1<=p107] & [p137<=1 & 1<=p137]]] | [[[p102<=1 & 1<=p102] & [p135<=1 & 1<=p135]] | EX [[p45<=0 & 0<=p45]]]]]] | [~ [E [AX [[[p97<=1 & 1<=p97] & [p112<=1 & 1<=p112]]] U [~ [[[p108<=1 & 1<=p108] & [p135<=1 & 1<=p135]]] | AX [[p107<=1 & 1<=p107]]]]] | EX [AG [[[p31<=1 & 1<=p31] | [p103<=1 & 1<=p103]]]]]]]
normalized: [[[EX [~ [E [true U ~ [[[p103<=1 & 1<=p103] | [p31<=1 & 1<=p31]]]]]] | ~ [E [~ [EX [~ [[[p112<=1 & 1<=p112] & [p97<=1 & 1<=p97]]]]] U [~ [EX [~ [[p107<=1 & 1<=p107]]]] | ~ [[[p135<=1 & 1<=p135] & [p108<=1 & 1<=p108]]]]]]] | [EX [[[EX [[p45<=0 & 0<=p45]] | [[p135<=1 & 1<=p135] & [p102<=1 & 1<=p102]]] | ~ [E [true U ~ [[[p137<=1 & 1<=p137] & [p107<=1 & 1<=p107]]]]]]] | ~ [EG [E [[[p130<=1 & 1<=p130] & [p107<=1 & 1<=p107]] U [[p135<=1 & 1<=p135] & [p108<=1 & 1<=p108]]]]]]] & E [true U ~ [EX [E [true U ~ [[p57<=1 & 1<=p57]]]]]]]

abstracting: (1<=p57)
states: 4,286,520,000,000 (12)
abstracting: (p57<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p108)
states: 3,000,564,000,000 (12)
abstracting: (p108<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p135)
states: 30,005,640,000,000 (13)
abstracting: (p135<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p107)
states: 3,000,564,000,000 (12)
abstracting: (p107<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p130)
states: 30,005,640,000,000 (13)
abstracting: (p130<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 1
abstracting: (1<=p107)
states: 3,000,564,000,000 (12)
abstracting: (p107<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p137)
states: 30,005,640,000,000 (13)
abstracting: (p137<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p102)
states: 3,000,564,000,000 (12)
abstracting: (p102<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p135)
states: 30,005,640,000,000 (13)
abstracting: (p135<=1)
states: 30,005,640,000,001 (13)
abstracting: (0<=p45)
states: 30,005,640,000,001 (13)
abstracting: (p45<=0)
states: 25,004,700,000,001 (13)
..abstracting: (1<=p108)
states: 3,000,564,000,000 (12)
abstracting: (p108<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p135)
states: 30,005,640,000,000 (13)
abstracting: (p135<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p107)
states: 3,000,564,000,000 (12)
abstracting: (p107<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p97)
states: 3,000,564,000,000 (12)
abstracting: (p97<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p112)
states: 30,005,640,000,000 (13)
abstracting: (p112<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p31)
states: 4,286,520,000,000 (12)
abstracting: (p31<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p103)
states: 3,000,564,000,000 (12)
abstracting: (p103<=1)
states: 30,005,640,000,001 (13)
.-> the formula is FALSE

FORMULA DLCshifumi-PT-2a-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: AG [[[A [[[p77<=1 & 1<=p77] & [p128<=1 & 1<=p128]] U [EX [[[p89<=1 & 1<=p89] & [p121<=1 & 1<=p121]]] | [[p63<=1 & 1<=p63] & [[p124<=1 & 1<=p124] & [p11<=1 & 1<=p11]]]]] | [p86<=1 & 1<=p86]] | [[p16<=1 & 1<=p16] | [[EF [[[p44<=0 & 0<=p44] | [p120<=0 & 0<=p120]]] & [[[p103<=0 & 0<=p103] | [p138<=0 & 0<=p138]] | [[p27<=0 & 0<=p27] | [p136<=0 & 0<=p136]]]] | [[p54<=1 & 1<=p54] & [p122<=1 & 1<=p122]]]]]]
normalized: ~ [E [true U ~ [[[[[[p122<=1 & 1<=p122] & [p54<=1 & 1<=p54]] | [[[[p136<=0 & 0<=p136] | [p27<=0 & 0<=p27]] | [[p138<=0 & 0<=p138] | [p103<=0 & 0<=p103]]] & E [true U [[p120<=0 & 0<=p120] | [p44<=0 & 0<=p44]]]]] | [p16<=1 & 1<=p16]] | [[p86<=1 & 1<=p86] | [~ [EG [~ [[[[[p11<=1 & 1<=p11] & [p124<=1 & 1<=p124]] & [p63<=1 & 1<=p63]] | EX [[[p121<=1 & 1<=p121] & [p89<=1 & 1<=p89]]]]]]] & ~ [E [~ [[[[[p11<=1 & 1<=p11] & [p124<=1 & 1<=p124]] & [p63<=1 & 1<=p63]] | EX [[[p121<=1 & 1<=p121] & [p89<=1 & 1<=p89]]]]] U [~ [[[p128<=1 & 1<=p128] & [p77<=1 & 1<=p77]]] & ~ [[[[[p11<=1 & 1<=p11] & [p124<=1 & 1<=p124]] & [p63<=1 & 1<=p63]] | EX [[[p121<=1 & 1<=p121] & [p89<=1 & 1<=p89]]]]]]]]]]]]]]

abstracting: (1<=p89)
states: 3,000,564,000,000 (12)
abstracting: (p89<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p121)
states: 30,005,640,000,000 (13)
abstracting: (p121<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p63)
states: 5,000,940,000,000 (12)
abstracting: (p63<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p124)
states: 30,005,640,000,000 (13)
abstracting: (p124<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p11)
states: 5,000,940,000,000 (12)
abstracting: (p11<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p77)
states: 5,000,940,000,000 (12)
abstracting: (p77<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p128)
states: 30,005,640,000,000 (13)
abstracting: (p128<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p89)
states: 3,000,564,000,000 (12)
abstracting: (p89<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p121)
states: 30,005,640,000,000 (13)
abstracting: (p121<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p63)
states: 5,000,940,000,000 (12)
abstracting: (p63<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p124)
states: 30,005,640,000,000 (13)
abstracting: (p124<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p11)
states: 5,000,940,000,000 (12)
abstracting: (p11<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p89)
states: 3,000,564,000,000 (12)
abstracting: (p89<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p121)
states: 30,005,640,000,000 (13)
abstracting: (p121<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p63)
states: 5,000,940,000,000 (12)
abstracting: (p63<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p124)
states: 30,005,640,000,000 (13)
abstracting: (p124<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p11)
states: 5,000,940,000,000 (12)
abstracting: (p11<=1)
states: 30,005,640,000,001 (13)
..
EG iterations: 2
abstracting: (1<=p86)
states: 6,001,128,000,000 (12)
abstracting: (p86<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p16)
states: 5,000,940,000,000 (12)
abstracting: (p16<=1)
states: 30,005,640,000,001 (13)
abstracting: (0<=p44)
states: 30,005,640,000,001 (13)
abstracting: (p44<=0)
states: 25,004,700,000,001 (13)
abstracting: (0<=p120)
states: 30,005,640,000,001 (13)
abstracting: (p120<=0)
states: 1
abstracting: (0<=p103)
states: 30,005,640,000,001 (13)
abstracting: (p103<=0)
states: 27,005,076,000,001 (13)
abstracting: (0<=p138)
states: 30,005,640,000,001 (13)
abstracting: (p138<=0)
states: 1
abstracting: (0<=p27)
states: 30,005,640,000,001 (13)
abstracting: (p27<=0)
states: 24,004,512,000,001 (13)
abstracting: (0<=p136)
states: 30,005,640,000,001 (13)
abstracting: (p136<=0)
states: 1
abstracting: (1<=p54)
states: 4,286,520,000,000 (12)
abstracting: (p54<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p122)
states: 30,005,640,000,000 (13)
abstracting: (p122<=1)
states: 30,005,640,000,001 (13)
-> the formula is FALSE

FORMULA DLCshifumi-PT-2a-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.056sec

checking: [E [AF [AG [[[p35<=1 & 1<=p35] & [p118<=1 & 1<=p118]]]] U [[[[p71<=1 & 1<=p71] & [p146<=1 & 1<=p146]] | [A [~ [[[p98<=1 & 1<=p98] & [p116<=1 & 1<=p116]]] U [[[p105<=1 & 1<=p105] & [p151<=1 & 1<=p151]] | [p64<=1 & 1<=p64]]] | A [[EX [[p66<=1 & 1<=p66]] & EF [[p86<=1 & 1<=p86]]] U EX [[p75<=1 & 1<=p75]]]]] & [[[p29<=1 & 1<=p29] & [p117<=1 & 1<=p117]] | [A [~ [[[p107<=1 & 1<=p107] & [p149<=1 & 1<=p149]]] U ~ [[[p106<=1 & 1<=p106] & [p148<=1 & 1<=p148]]]] & A [AF [[p14<=1 & 1<=p14]] U [[[p101<=1 & 1<=p101] & [p151<=1 & 1<=p151]] | [[p102<=1 & 1<=p102] & [p153<=1 & 1<=p153]]]]]]]] | EF [[p14<=1 & 1<=p14]]]
normalized: [E [true U [p14<=1 & 1<=p14]] | E [~ [EG [E [true U ~ [[[p118<=1 & 1<=p118] & [p35<=1 & 1<=p35]]]]]] U [[[[~ [EG [~ [[[[p153<=1 & 1<=p153] & [p102<=1 & 1<=p102]] | [[p151<=1 & 1<=p151] & [p101<=1 & 1<=p101]]]]]] & ~ [E [~ [[[[p153<=1 & 1<=p153] & [p102<=1 & 1<=p102]] | [[p151<=1 & 1<=p151] & [p101<=1 & 1<=p101]]]] U [EG [~ [[p14<=1 & 1<=p14]]] & ~ [[[[p153<=1 & 1<=p153] & [p102<=1 & 1<=p102]] | [[p151<=1 & 1<=p151] & [p101<=1 & 1<=p101]]]]]]]] & [~ [EG [[[p148<=1 & 1<=p148] & [p106<=1 & 1<=p106]]]] & ~ [E [[[p148<=1 & 1<=p148] & [p106<=1 & 1<=p106]] U [[[p149<=1 & 1<=p149] & [p107<=1 & 1<=p107]] & [[p148<=1 & 1<=p148] & [p106<=1 & 1<=p106]]]]]]] | [[p117<=1 & 1<=p117] & [p29<=1 & 1<=p29]]] & [[[~ [EG [~ [EX [[p75<=1 & 1<=p75]]]]] & ~ [E [~ [EX [[p75<=1 & 1<=p75]]] U [~ [[E [true U [p86<=1 & 1<=p86]] & EX [[p66<=1 & 1<=p66]]]] & ~ [EX [[p75<=1 & 1<=p75]]]]]]] | [~ [EG [~ [[[p64<=1 & 1<=p64] | [[p151<=1 & 1<=p151] & [p105<=1 & 1<=p105]]]]]] & ~ [E [~ [[[p64<=1 & 1<=p64] | [[p151<=1 & 1<=p151] & [p105<=1 & 1<=p105]]]] U [[[p116<=1 & 1<=p116] & [p98<=1 & 1<=p98]] & ~ [[[p64<=1 & 1<=p64] | [[p151<=1 & 1<=p151] & [p105<=1 & 1<=p105]]]]]]]]] | [[p146<=1 & 1<=p146] & [p71<=1 & 1<=p71]]]]]]

abstracting: (1<=p71)
states: 6,001,128,000,000 (12)
abstracting: (p71<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p146)
states: 30,005,640,000,000 (13)
abstracting: (p146<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p105)
states: 3,000,564,000,000 (12)
abstracting: (p105<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p151)
states: 30,005,640,000,000 (13)
abstracting: (p151<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p64)
states: 5,000,940,000,000 (12)
abstracting: (p64<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p98)
states: 3,000,564,000,000 (12)
abstracting: (p98<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p116)
states: 30,005,640,000,000 (13)
abstracting: (p116<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p105)
states: 3,000,564,000,000 (12)
abstracting: (p105<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p151)
states: 30,005,640,000,000 (13)
abstracting: (p151<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p64)
states: 5,000,940,000,000 (12)
abstracting: (p64<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p105)
states: 3,000,564,000,000 (12)
abstracting: (p105<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p151)
states: 30,005,640,000,000 (13)
abstracting: (p151<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p64)
states: 5,000,940,000,000 (12)
abstracting: (p64<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 1
abstracting: (1<=p75)
states: 5,000,940,000,000 (12)
abstracting: (p75<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p66)
states: 5,000,940,000,000 (12)
abstracting: (p66<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p86)
states: 6,001,128,000,000 (12)
abstracting: (p86<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p75)
states: 5,000,940,000,000 (12)
abstracting: (p75<=1)
states: 30,005,640,000,001 (13)
.abstracting: (1<=p75)
states: 5,000,940,000,000 (12)
abstracting: (p75<=1)
states: 30,005,640,000,001 (13)
..
EG iterations: 1
abstracting: (1<=p29)
states: 4,286,520,000,000 (12)
abstracting: (p29<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p117)
states: 30,005,640,000,000 (13)
abstracting: (p117<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p106)
states: 3,000,564,000,000 (12)
abstracting: (p106<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p148)
states: 30,005,640,000,000 (13)
abstracting: (p148<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p107)
states: 3,000,564,000,000 (12)
abstracting: (p107<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p149)
states: 30,005,640,000,000 (13)
abstracting: (p149<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p106)
states: 3,000,564,000,000 (12)
abstracting: (p106<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p148)
states: 30,005,640,000,000 (13)
abstracting: (p148<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p106)
states: 3,000,564,000,000 (12)
abstracting: (p106<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p148)
states: 30,005,640,000,000 (13)
abstracting: (p148<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 1
abstracting: (1<=p101)
states: 3,000,564,000,000 (12)
abstracting: (p101<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p151)
states: 30,005,640,000,000 (13)
abstracting: (p151<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p102)
states: 3,000,564,000,000 (12)
abstracting: (p102<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p153)
states: 30,005,640,000,000 (13)
abstracting: (p153<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p14)
states: 5,000,940,000,000 (12)
abstracting: (p14<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 1
abstracting: (1<=p101)
states: 3,000,564,000,000 (12)
abstracting: (p101<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p151)
states: 30,005,640,000,000 (13)
abstracting: (p151<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p102)
states: 3,000,564,000,000 (12)
abstracting: (p102<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p153)
states: 30,005,640,000,000 (13)
abstracting: (p153<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p101)
states: 3,000,564,000,000 (12)
abstracting: (p101<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p151)
states: 30,005,640,000,000 (13)
abstracting: (p151<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p102)
states: 3,000,564,000,000 (12)
abstracting: (p102<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p153)
states: 30,005,640,000,000 (13)
abstracting: (p153<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 1
abstracting: (1<=p35)
states: 4,286,520,000,000 (12)
abstracting: (p35<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p118)
states: 30,005,640,000,000 (13)
abstracting: (p118<=1)
states: 30,005,640,000,001 (13)

EG iterations: 0
abstracting: (1<=p14)
states: 5,000,940,000,000 (12)
abstracting: (p14<=1)
states: 30,005,640,000,001 (13)
-> the formula is TRUE

FORMULA DLCshifumi-PT-2a-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.092sec

checking: AG [[AG [E [~ [[[p17<=1 & 1<=p17] & [p113<=1 & 1<=p113]]] U [[[p107<=1 & 1<=p107] & [p147<=1 & 1<=p147]] | [[p107<=1 & 1<=p107] & [p140<=1 & 1<=p140]]]]] | [AF [[E [[[p92<=1 & 1<=p92] & [p129<=1 & 1<=p129]] U [p78<=1 & 1<=p78]] | [[p104<=0 & 0<=p104] | [p51<=0 & 0<=p51]]]] | [A [[~ [EG [[p50<=1 & 1<=p50]]] & ~ [[[[p97<=1 & 1<=p97] & [p114<=1 & 1<=p114]] | [[p57<=1 & 1<=p57] & [p122<=1 & 1<=p122]]]]] U EG [E [[[p77<=1 & 1<=p77] & [p127<=1 & 1<=p127]] U [[p83<=1 & 1<=p83] & [p150<=1 & 1<=p150]]]]] & [EG [[[p91<=0 & 0<=p91] | [p123<=0 & 0<=p123]]] | [[[p107<=1 & 1<=p107] & [p137<=1 & 1<=p137]] | [[p97<=1 & 1<=p97] & [p116<=1 & 1<=p116]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[p116<=1 & 1<=p116] & [p97<=1 & 1<=p97]] | [[p137<=1 & 1<=p137] & [p107<=1 & 1<=p107]]] | EG [[[p123<=0 & 0<=p123] | [p91<=0 & 0<=p91]]]] & [~ [EG [~ [EG [E [[[p127<=1 & 1<=p127] & [p77<=1 & 1<=p77]] U [[p150<=1 & 1<=p150] & [p83<=1 & 1<=p83]]]]]]] & ~ [E [~ [EG [E [[[p127<=1 & 1<=p127] & [p77<=1 & 1<=p77]] U [[p150<=1 & 1<=p150] & [p83<=1 & 1<=p83]]]]] U [~ [[~ [[[[p122<=1 & 1<=p122] & [p57<=1 & 1<=p57]] | [[p114<=1 & 1<=p114] & [p97<=1 & 1<=p97]]]] & ~ [EG [[p50<=1 & 1<=p50]]]]] & ~ [EG [E [[[p127<=1 & 1<=p127] & [p77<=1 & 1<=p77]] U [[p150<=1 & 1<=p150] & [p83<=1 & 1<=p83]]]]]]]]]] | ~ [EG [~ [[[[p51<=0 & 0<=p51] | [p104<=0 & 0<=p104]] | E [[[p129<=1 & 1<=p129] & [p92<=1 & 1<=p92]] U [p78<=1 & 1<=p78]]]]]]] | ~ [E [true U ~ [E [~ [[[p113<=1 & 1<=p113] & [p17<=1 & 1<=p17]]] U [[[p140<=1 & 1<=p140] & [p107<=1 & 1<=p107]] | [[p147<=1 & 1<=p147] & [p107<=1 & 1<=p107]]]]]]]]]]]

abstracting: (1<=p107)
states: 3,000,564,000,000 (12)
abstracting: (p107<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p147)
states: 30,005,640,000,000 (13)
abstracting: (p147<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p107)
states: 3,000,564,000,000 (12)
abstracting: (p107<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p140)
states: 30,005,640,000,000 (13)
abstracting: (p140<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p17)
states: 5,000,940,000,000 (12)
abstracting: (p17<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p113)
states: 30,005,640,000,000 (13)
abstracting: (p113<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p78)
states: 5,000,940,000,000 (12)
abstracting: (p78<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p92)
states: 3,000,564,000,000 (12)
abstracting: (p92<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p129)
states: 30,005,640,000,000 (13)
abstracting: (p129<=1)
states: 30,005,640,000,001 (13)
abstracting: (0<=p104)
states: 30,005,640,000,001 (13)
abstracting: (p104<=0)
states: 27,005,076,000,001 (13)
abstracting: (0<=p51)
states: 30,005,640,000,001 (13)
abstracting: (p51<=0)
states: 25,004,700,000,001 (13)
.
EG iterations: 1
abstracting: (1<=p83)
states: 5,000,940,000,000 (12)
abstracting: (p83<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p150)
states: 30,005,640,000,000 (13)
abstracting: (p150<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p77)
states: 5,000,940,000,000 (12)
abstracting: (p77<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p127)
states: 30,005,640,000,000 (13)
abstracting: (p127<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 1
abstracting: (1<=p50)
states: 5,000,940,000,000 (12)
abstracting: (p50<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 1
abstracting: (1<=p97)
states: 3,000,564,000,000 (12)
abstracting: (p97<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p114)
states: 30,005,640,000,000 (13)
abstracting: (p114<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p57)
states: 4,286,520,000,000 (12)
abstracting: (p57<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p122)
states: 30,005,640,000,000 (13)
abstracting: (p122<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p83)
states: 5,000,940,000,000 (12)
abstracting: (p83<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p150)
states: 30,005,640,000,000 (13)
abstracting: (p150<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p77)
states: 5,000,940,000,000 (12)
abstracting: (p77<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p127)
states: 30,005,640,000,000 (13)
abstracting: (p127<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 1
abstracting: (1<=p83)
states: 5,000,940,000,000 (12)
abstracting: (p83<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p150)
states: 30,005,640,000,000 (13)
abstracting: (p150<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p77)
states: 5,000,940,000,000 (12)
abstracting: (p77<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p127)
states: 30,005,640,000,000 (13)
abstracting: (p127<=1)
states: 30,005,640,000,001 (13)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (0<=p91)
states: 30,005,640,000,001 (13)
abstracting: (p91<=0)
states: 27,005,076,000,001 (13)
abstracting: (0<=p123)
states: 30,005,640,000,001 (13)
abstracting: (p123<=0)
states: 1
.
EG iterations: 1
abstracting: (1<=p107)
states: 3,000,564,000,000 (12)
abstracting: (p107<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p137)
states: 30,005,640,000,000 (13)
abstracting: (p137<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p97)
states: 3,000,564,000,000 (12)
abstracting: (p97<=1)
states: 30,005,640,000,001 (13)
abstracting: (1<=p116)
states: 30,005,640,000,000 (13)
abstracting: (p116<=1)
states: 30,005,640,000,001 (13)
-> the formula is FALSE

FORMULA DLCshifumi-PT-2a-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.081sec

totally nodes used: 118489 (1.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 704763 2193282 2898045
used/not used/entry size/cache size: 2237644 64871220 16 1024MB
basic ops cache: hits/miss/sum: 56129 146163 202292
used/not used/entry size/cache size: 253458 16523758 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: 3918 10131 14049
used/not used/entry size/cache size: 10131 8378477 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 66991865
1 115532
2 1444
3 23
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.979sec


BK_STOP 1678479025812

--------------------
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:1029 (4), effective:92 (0)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

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

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

iterations count:263 (1), effective:3 (0)

iterations count:523 (2), effective:6 (0)

iterations count:541 (2), effective:10 (0)

iterations count:530 (2), effective:7 (0)

iterations count:542 (2), effective:10 (0)

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

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

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

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

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

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

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

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

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

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

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

iterations count:544 (2), effective:11 (0)

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

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

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

iterations count:544 (2), effective:11 (0)

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

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

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

iterations count:544 (2), effective:11 (0)

iterations count:542 (2), effective:10 (0)

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

iterations count:544 (2), effective:10 (0)

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

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

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

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

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

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

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

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

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

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

iterations count:614 (2), effective:20 (0)

iterations count:542 (2), effective:10 (0)

iterations count:511 (2), effective:5 (0)

iterations count:514 (2), effective:5 (0)

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

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

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

iterations count:521 (2), effective:6 (0)

iterations count:299 (1), effective:9 (0)

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

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

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

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

iterations count:299 (1), effective:9 (0)

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

iterations count:634 (2), effective:26 (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="DLCshifumi-PT-2a"
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 DLCshifumi-PT-2a, 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 r106-tall-167814483200794"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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