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.r074-smll-167814400200378.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 CloudDeployment-PT-3a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814400200378
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.7K Feb 25 14:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 14:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 14:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 14:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 25 14:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 14:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 14:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:44 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 97K 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 CloudDeployment-PT-3a-CTLFireability-00
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-01
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-02
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-03
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-04
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-05
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-06
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-07
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-08
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-09
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-10
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-11
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-12
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-13
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-14
FORMULA_NAME CloudDeployment-PT-3a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678479075593

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=CloudDeployment-PT-3a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 20:11:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 20:11:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 20:11:19] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2023-03-10 20:11:19] [INFO ] Transformed 104 places.
[2023-03-10 20:11:19] [INFO ] Transformed 308 transitions.
[2023-03-10 20:11:19] [INFO ] Found NUPN structural information;
[2023-03-10 20:11:19] [INFO ] Parsed PT model containing 104 places and 308 transitions and 1611 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 30 transitions
Reduce redundant transitions removed 30 transitions.
Support contains 54 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 278/278 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 98 transition count 278
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 30 place count 98 transition count 254
Applied a total of 30 rules in 33 ms. Remains 98 /104 variables (removed 6) and now considering 254/278 (removed 24) transitions.
[2023-03-10 20:11:19] [INFO ] Flow matrix only has 159 transitions (discarded 95 similar events)
// Phase 1: matrix 159 rows 98 cols
[2023-03-10 20:11:19] [INFO ] Computed 12 place invariants in 26 ms
[2023-03-10 20:11:19] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-10 20:11:19] [INFO ] Flow matrix only has 159 transitions (discarded 95 similar events)
[2023-03-10 20:11:19] [INFO ] Invariant cache hit.
[2023-03-10 20:11:20] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-10 20:11:20] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2023-03-10 20:11:20] [INFO ] Flow matrix only has 159 transitions (discarded 95 similar events)
[2023-03-10 20:11:20] [INFO ] Invariant cache hit.
[2023-03-10 20:11:20] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 254/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1143 ms. Remains : 98/104 places, 254/278 transitions.
Support contains 54 out of 98 places after structural reductions.
[2023-03-10 20:11:21] [INFO ] Flatten gal took : 115 ms
[2023-03-10 20:11:21] [INFO ] Flatten gal took : 77 ms
[2023-03-10 20:11:21] [INFO ] Input system was already deterministic with 254 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 806 ms. (steps per millisecond=12 ) properties (out of 66) seen :48
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-10 20:11:22] [INFO ] Flow matrix only has 159 transitions (discarded 95 similar events)
[2023-03-10 20:11:22] [INFO ] Invariant cache hit.
[2023-03-10 20:11:22] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-10 20:11:22] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:4
[2023-03-10 20:11:22] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 7 ms returned sat
[2023-03-10 20:11:23] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2023-03-10 20:11:23] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-10 20:11:23] [INFO ] After 124ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :3 sat :4
[2023-03-10 20:11:23] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-10 20:11:23] [INFO ] After 751ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 12 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 254/254 transitions.
Graph (trivial) has 103 edges and 98 vertex of which 21 / 98 are part of one of the 6 SCC in 12 ms
Free SCC test removed 15 places
Drop transitions removed 55 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 65 transitions.
Graph (complete) has 378 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 80 transition count 184
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 80 transition count 184
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 77 transition count 181
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 28 place count 69 transition count 195
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 0 with 35 rules applied. Total rules applied 63 place count 69 transition count 160
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 69 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 68 transition count 159
Applied a total of 65 rules in 111 ms. Remains 68 /98 variables (removed 30) and now considering 159/254 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 68/98 places, 159/254 transitions.
Incomplete random walk after 10000 steps, including 279 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-10 20:11:24] [INFO ] Flow matrix only has 89 transitions (discarded 70 similar events)
// Phase 1: matrix 89 rows 68 cols
[2023-03-10 20:11:24] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-10 20:11:24] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 20:11:24] [INFO ] [Real]Absence check using 3 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-10 20:11:24] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 20:11:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 20:11:24] [INFO ] [Nat]Absence check using 3 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-10 20:11:24] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 20:11:24] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-10 20:11:24] [INFO ] After 21ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 20:11:24] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-10 20:11:24] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 159/159 transitions.
Graph (trivial) has 38 edges and 68 vertex of which 4 / 68 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 333 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 64 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 64 transition count 149
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 1 with 2 rules applied. Total rules applied 7 place count 63 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 62 transition count 147
Applied a total of 8 rules in 42 ms. Remains 62 /68 variables (removed 6) and now considering 147/159 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 62/68 places, 147/159 transitions.
Finished random walk after 2143 steps, including 54 resets, run visited all 1 properties in 7 ms. (steps per millisecond=306 )
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-10 20:11:24] [INFO ] Flatten gal took : 36 ms
[2023-03-10 20:11:24] [INFO ] Flatten gal took : 38 ms
[2023-03-10 20:11:25] [INFO ] Input system was already deterministic with 254 transitions.
Support contains 51 out of 98 places (down from 53) after GAL structural reductions.
Computed a total of 47 stabilizing places and 152 stable transitions
Graph (complete) has 739 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 254/254 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 97 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 253
Applied a total of 2 rules in 10 ms. Remains 97 /98 variables (removed 1) and now considering 253/254 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 97/98 places, 253/254 transitions.
[2023-03-10 20:11:25] [INFO ] Flatten gal took : 33 ms
[2023-03-10 20:11:25] [INFO ] Flatten gal took : 35 ms
[2023-03-10 20:11:25] [INFO ] Input system was already deterministic with 253 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 98/98 places, 254/254 transitions.
[2023-03-10 20:11:25] [INFO ] Flatten gal took : 30 ms
[2023-03-10 20:11:25] [INFO ] Flatten gal took : 34 ms
[2023-03-10 20:11:25] [INFO ] Input system was already deterministic with 254 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 254/254 transitions.
Graph (trivial) has 113 edges and 98 vertex of which 30 / 98 are part of one of the 9 SCC in 0 ms
Free SCC test removed 21 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 73 transition count 187
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 73 transition count 187
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 21 place count 73 transition count 175
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 24 place count 73 transition count 172
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 70 transition count 172
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 2 with 6 rules applied. Total rules applied 33 place count 67 transition count 169
Applied a total of 33 rules in 62 ms. Remains 67 /98 variables (removed 31) and now considering 169/254 (removed 85) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63 ms. Remains : 67/98 places, 169/254 transitions.
[2023-03-10 20:11:25] [INFO ] Flatten gal took : 19 ms
[2023-03-10 20:11:25] [INFO ] Flatten gal took : 19 ms
[2023-03-10 20:11:25] [INFO ] Input system was already deterministic with 169 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 254/254 transitions.
Graph (trivial) has 85 edges and 98 vertex of which 20 / 98 are part of one of the 6 SCC in 1 ms
Free SCC test removed 14 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 82 transition count 211
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 82 transition count 211
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 16 place count 82 transition count 200
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 82 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 81 transition count 199
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 77 transition count 195
Applied a total of 26 rules in 43 ms. Remains 77 /98 variables (removed 21) and now considering 195/254 (removed 59) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 77/98 places, 195/254 transitions.
[2023-03-10 20:11:25] [INFO ] Flatten gal took : 12 ms
[2023-03-10 20:11:25] [INFO ] Flatten gal took : 12 ms
[2023-03-10 20:11:25] [INFO ] Input system was already deterministic with 195 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 254/254 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 97 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 253
Applied a total of 2 rules in 6 ms. Remains 97 /98 variables (removed 1) and now considering 253/254 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 97/98 places, 253/254 transitions.
[2023-03-10 20:11:25] [INFO ] Flatten gal took : 12 ms
[2023-03-10 20:11:25] [INFO ] Flatten gal took : 14 ms
[2023-03-10 20:11:25] [INFO ] Input system was already deterministic with 253 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 254/254 transitions.
Graph (trivial) has 117 edges and 98 vertex of which 29 / 98 are part of one of the 9 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 75 transition count 197
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 75 transition count 197
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 19 place count 75 transition count 185
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 22 place count 75 transition count 182
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 72 transition count 182
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 2 with 6 rules applied. Total rules applied 31 place count 69 transition count 179
Applied a total of 31 rules in 32 ms. Remains 69 /98 variables (removed 29) and now considering 179/254 (removed 75) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 69/98 places, 179/254 transitions.
[2023-03-10 20:11:25] [INFO ] Flatten gal took : 9 ms
[2023-03-10 20:11:25] [INFO ] Flatten gal took : 10 ms
[2023-03-10 20:11:25] [INFO ] Input system was already deterministic with 179 transitions.
Incomplete random walk after 10000 steps, including 269 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Finished Best-First random walk after 133 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=133 )
FORMULA CloudDeployment-PT-3a-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 254/254 transitions.
Graph (trivial) has 118 edges and 98 vertex of which 30 / 98 are part of one of the 9 SCC in 1 ms
Free SCC test removed 21 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 73 transition count 187
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 73 transition count 187
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 21 place count 73 transition count 175
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 24 place count 73 transition count 172
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 70 transition count 172
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 2 with 6 rules applied. Total rules applied 33 place count 67 transition count 169
Applied a total of 33 rules in 30 ms. Remains 67 /98 variables (removed 31) and now considering 169/254 (removed 85) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 67/98 places, 169/254 transitions.
[2023-03-10 20:11:25] [INFO ] Flatten gal took : 9 ms
[2023-03-10 20:11:25] [INFO ] Flatten gal took : 10 ms
[2023-03-10 20:11:25] [INFO ] Input system was already deterministic with 169 transitions.
Finished random walk after 1071 steps, including 26 resets, run visited all 1 properties in 5 ms. (steps per millisecond=214 )
FORMULA CloudDeployment-PT-3a-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 254/254 transitions.
Graph (trivial) has 117 edges and 98 vertex of which 30 / 98 are part of one of the 9 SCC in 0 ms
Free SCC test removed 21 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 73 transition count 187
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 73 transition count 187
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 21 place count 73 transition count 175
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 24 place count 73 transition count 172
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 70 transition count 172
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 33 place count 67 transition count 169
Applied a total of 33 rules in 28 ms. Remains 67 /98 variables (removed 31) and now considering 169/254 (removed 85) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 67/98 places, 169/254 transitions.
[2023-03-10 20:11:25] [INFO ] Flatten gal took : 9 ms
[2023-03-10 20:11:25] [INFO ] Flatten gal took : 10 ms
[2023-03-10 20:11:25] [INFO ] Input system was already deterministic with 169 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 254/254 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 98/98 places, 254/254 transitions.
[2023-03-10 20:11:25] [INFO ] Flatten gal took : 13 ms
[2023-03-10 20:11:25] [INFO ] Flatten gal took : 21 ms
[2023-03-10 20:11:26] [INFO ] Input system was already deterministic with 254 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 254/254 transitions.
Graph (trivial) has 111 edges and 98 vertex of which 28 / 98 are part of one of the 8 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 75 transition count 193
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 75 transition count 193
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 19 place count 75 transition count 181
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 22 place count 75 transition count 178
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 72 transition count 178
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 2 with 6 rules applied. Total rules applied 31 place count 69 transition count 175
Applied a total of 31 rules in 38 ms. Remains 69 /98 variables (removed 29) and now considering 175/254 (removed 79) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 69/98 places, 175/254 transitions.
[2023-03-10 20:11:26] [INFO ] Flatten gal took : 13 ms
[2023-03-10 20:11:26] [INFO ] Flatten gal took : 16 ms
[2023-03-10 20:11:26] [INFO ] Input system was already deterministic with 175 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 254/254 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 97 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 253
Applied a total of 2 rules in 5 ms. Remains 97 /98 variables (removed 1) and now considering 253/254 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 97/98 places, 253/254 transitions.
[2023-03-10 20:11:26] [INFO ] Flatten gal took : 19 ms
[2023-03-10 20:11:26] [INFO ] Flatten gal took : 22 ms
[2023-03-10 20:11:26] [INFO ] Input system was already deterministic with 253 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 254/254 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 97 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 253
Applied a total of 2 rules in 4 ms. Remains 97 /98 variables (removed 1) and now considering 253/254 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 97/98 places, 253/254 transitions.
[2023-03-10 20:11:26] [INFO ] Flatten gal took : 19 ms
[2023-03-10 20:11:26] [INFO ] Flatten gal took : 21 ms
[2023-03-10 20:11:26] [INFO ] Input system was already deterministic with 253 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 254/254 transitions.
Graph (trivial) has 109 edges and 98 vertex of which 26 / 98 are part of one of the 8 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 77 transition count 198
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 77 transition count 198
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 18 place count 77 transition count 187
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 77 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 75 transition count 185
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 73 transition count 183
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 73 transition count 183
Applied a total of 27 rules in 47 ms. Remains 73 /98 variables (removed 25) and now considering 183/254 (removed 71) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 73/98 places, 183/254 transitions.
[2023-03-10 20:11:26] [INFO ] Flatten gal took : 13 ms
[2023-03-10 20:11:26] [INFO ] Flatten gal took : 15 ms
[2023-03-10 20:11:26] [INFO ] Input system was already deterministic with 183 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 254/254 transitions.
Graph (trivial) has 110 edges and 98 vertex of which 29 / 98 are part of one of the 9 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 75 transition count 197
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 75 transition count 197
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 19 place count 75 transition count 185
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 22 place count 75 transition count 182
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 72 transition count 182
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 2 with 6 rules applied. Total rules applied 31 place count 69 transition count 179
Applied a total of 31 rules in 35 ms. Remains 69 /98 variables (removed 29) and now considering 179/254 (removed 75) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 69/98 places, 179/254 transitions.
[2023-03-10 20:11:26] [INFO ] Flatten gal took : 19 ms
[2023-03-10 20:11:26] [INFO ] Flatten gal took : 10 ms
[2023-03-10 20:11:26] [INFO ] Input system was already deterministic with 179 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 254/254 transitions.
Graph (trivial) has 115 edges and 98 vertex of which 29 / 98 are part of one of the 9 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 75 transition count 197
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 75 transition count 197
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 19 place count 75 transition count 185
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 22 place count 75 transition count 182
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 72 transition count 182
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 31 place count 69 transition count 179
Applied a total of 31 rules in 25 ms. Remains 69 /98 variables (removed 29) and now considering 179/254 (removed 75) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 69/98 places, 179/254 transitions.
[2023-03-10 20:11:26] [INFO ] Flatten gal took : 8 ms
[2023-03-10 20:11:26] [INFO ] Flatten gal took : 10 ms
[2023-03-10 20:11:26] [INFO ] Input system was already deterministic with 179 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 254/254 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 97 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 253
Applied a total of 2 rules in 4 ms. Remains 97 /98 variables (removed 1) and now considering 253/254 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 97/98 places, 253/254 transitions.
[2023-03-10 20:11:26] [INFO ] Flatten gal took : 11 ms
[2023-03-10 20:11:26] [INFO ] Flatten gal took : 13 ms
[2023-03-10 20:11:26] [INFO ] Input system was already deterministic with 253 transitions.
[2023-03-10 20:11:26] [INFO ] Flatten gal took : 13 ms
[2023-03-10 20:11:26] [INFO ] Flatten gal took : 21 ms
[2023-03-10 20:11:26] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-10 20:11:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 98 places, 254 transitions and 1407 arcs took 2 ms.
Total runtime 7617 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: 98 NrTr: 254 NrArc: 1407)

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

net check time: 0m 0.000sec

init dd package: 0m 3.454sec


RS generation: 0m 0.379sec


-> reachability set: #nodes 762 (7.6e+02) #states 190,102 (5)



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

checking: AG [EF [[[[p27<=1 & 1<=p27] & [p28<=1 & 1<=p28]] & [[p40<=1 & 1<=p40] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]]]]
normalized: ~ [E [true U ~ [E [true U [[[p27<=1 & 1<=p27] & [p28<=1 & 1<=p28]] & [[p40<=1 & 1<=p40] & [[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]]]]]]]]

abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
abstracting: (1<=p40)
states: 7,785 (3)
abstracting: (p40<=1)
states: 190,102 (5)
abstracting: (1<=p28)
states: 190,073 (5)
abstracting: (p28<=1)
states: 190,102 (5)
abstracting: (1<=p27)
states: 190,073 (5)
abstracting: (p27<=1)
states: 190,102 (5)
-> the formula is FALSE

FORMULA CloudDeployment-PT-3a-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.217sec

checking: AG [EF [[[[p53<=1 & 1<=p53] & [p54<=1 & 1<=p54]] & [[p58<=1 & 1<=p58] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]]]]
normalized: ~ [E [true U ~ [E [true U [[[p54<=1 & 1<=p54] & [p53<=1 & 1<=p53]] & [[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p58<=1 & 1<=p58]]]]]]]

abstracting: (1<=p58)
states: 7,776 (3)
abstracting: (p58<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
abstracting: (1<=p53)
states: 190,073 (5)
abstracting: (p53<=1)
states: 190,102 (5)
abstracting: (1<=p54)
states: 190,073 (5)
abstracting: (p54<=1)
states: 190,102 (5)
-> the formula is FALSE

FORMULA CloudDeployment-PT-3a-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.158sec

checking: AX [[AG [[p56<=0 & 0<=p56]] | AG [[[[p53<=0 & 0<=p53] | [p54<=0 & 0<=p54]] | [[p58<=0 & 0<=p58] | [[p89<=0 & 0<=p89] | [p96<=0 & 0<=p96]]]]]]]
normalized: ~ [EX [~ [[~ [E [true U ~ [[[[[p89<=0 & 0<=p89] | [p96<=0 & 0<=p96]] | [p58<=0 & 0<=p58]] | [[p54<=0 & 0<=p54] | [p53<=0 & 0<=p53]]]]]] | ~ [E [true U ~ [[p56<=0 & 0<=p56]]]]]]]]

abstracting: (0<=p56)
states: 190,102 (5)
abstracting: (p56<=0)
states: 182,326 (5)
abstracting: (0<=p53)
states: 190,102 (5)
abstracting: (p53<=0)
states: 29
abstracting: (0<=p54)
states: 190,102 (5)
abstracting: (p54<=0)
states: 29
abstracting: (0<=p58)
states: 190,102 (5)
abstracting: (p58<=0)
states: 182,326 (5)
abstracting: (0<=p96)
states: 190,102 (5)
abstracting: (p96<=0)
states: 157,272 (5)
abstracting: (0<=p89)
states: 190,102 (5)
abstracting: (p89<=0)
states: 162,454 (5)
.-> the formula is FALSE

FORMULA CloudDeployment-PT-3a-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.120sec

checking: E [~ [[p67<=1 & 1<=p67]] U [[[p53<=1 & 1<=p53] & [p54<=1 & 1<=p54]] & [[p58<=1 & 1<=p58] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]]]
normalized: E [~ [[p67<=1 & 1<=p67]] U [[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p58<=1 & 1<=p58]] & [[p54<=1 & 1<=p54] & [p53<=1 & 1<=p53]]]]

abstracting: (1<=p53)
states: 190,073 (5)
abstracting: (p53<=1)
states: 190,102 (5)
abstracting: (1<=p54)
states: 190,073 (5)
abstracting: (p54<=1)
states: 190,102 (5)
abstracting: (1<=p58)
states: 7,776 (3)
abstracting: (p58<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
abstracting: (1<=p67)
states: 7,776 (3)
abstracting: (p67<=1)
states: 190,102 (5)
-> the formula is TRUE

FORMULA CloudDeployment-PT-3a-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: AF [[EF [[p19<=1 & 1<=p19]] & [AG [[[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p4<=1 & 1<=p4] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]] | [[p2<=1 & 1<=p2] & [p53<=1 & 1<=p53]]]] & [~ [[p2<=1 & 1<=p2]] | ~ [[p6<=1 & 1<=p6]]]]]]
normalized: ~ [EG [~ [[[[~ [[p6<=1 & 1<=p6]] | ~ [[p2<=1 & 1<=p2]]] & ~ [E [true U ~ [[[[p53<=1 & 1<=p53] & [p2<=1 & 1<=p2]] | [[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p4<=1 & 1<=p4]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]]] & E [true U [p19<=1 & 1<=p19]]]]]]

abstracting: (1<=p19)
states: 7,776 (3)
abstracting: (p19<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p4)
states: 7,776 (3)
abstracting: (p4<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p53)
states: 190,073 (5)
abstracting: (p53<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p6)
states: 7,776 (3)
abstracting: (p6<=1)
states: 190,102 (5)
.
EG iterations: 1
-> the formula is FALSE

FORMULA CloudDeployment-PT-3a-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.441sec

checking: EF [[~ [A [EX [[[[p27<=1 & 1<=p27] & [p28<=1 & 1<=p28]] & [[p32<=1 & 1<=p32] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]]] U [~ [[p30<=1 & 1<=p30]] & A [[p45<=1 & 1<=p45] U [p45<=1 & 1<=p45]]]]] & [[p68<=0 & 0<=p68] & [p6<=1 & 1<=p6]]]]
normalized: E [true U [[[p6<=1 & 1<=p6] & [p68<=0 & 0<=p68]] & ~ [[~ [EG [~ [[[~ [EG [~ [[p45<=1 & 1<=p45]]]] & ~ [E [~ [[p45<=1 & 1<=p45]] U [~ [[p45<=1 & 1<=p45]] & ~ [[p45<=1 & 1<=p45]]]]]] & ~ [[p30<=1 & 1<=p30]]]]]] & ~ [E [~ [[[~ [EG [~ [[p45<=1 & 1<=p45]]]] & ~ [E [~ [[p45<=1 & 1<=p45]] U [~ [[p45<=1 & 1<=p45]] & ~ [[p45<=1 & 1<=p45]]]]]] & ~ [[p30<=1 & 1<=p30]]]] U [~ [EX [[[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p32<=1 & 1<=p32]] & [[p28<=1 & 1<=p28] & [p27<=1 & 1<=p27]]]]] & ~ [[[~ [EG [~ [[p45<=1 & 1<=p45]]]] & ~ [E [~ [[p45<=1 & 1<=p45]] U [~ [[p45<=1 & 1<=p45]] & ~ [[p45<=1 & 1<=p45]]]]]] & ~ [[p30<=1 & 1<=p30]]]]]]]]]]]

abstracting: (1<=p30)
states: 7,776 (3)
abstracting: (p30<=1)
states: 190,102 (5)
abstracting: (1<=p45)
states: 7,776 (3)
abstracting: (p45<=1)
states: 190,102 (5)
abstracting: (1<=p45)
states: 7,776 (3)
abstracting: (p45<=1)
states: 190,102 (5)
abstracting: (1<=p45)
states: 7,776 (3)
abstracting: (p45<=1)
states: 190,102 (5)
abstracting: (1<=p45)
states: 7,776 (3)
abstracting: (p45<=1)
states: 190,102 (5)
.
EG iterations: 1
abstracting: (1<=p27)
states: 190,073 (5)
abstracting: (p27<=1)
states: 190,102 (5)
abstracting: (1<=p28)
states: 190,073 (5)
abstracting: (p28<=1)
states: 190,102 (5)
abstracting: (1<=p32)
states: 7,776 (3)
abstracting: (p32<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
.abstracting: (1<=p30)
states: 7,776 (3)
abstracting: (p30<=1)
states: 190,102 (5)
abstracting: (1<=p45)
states: 7,776 (3)
abstracting: (p45<=1)
states: 190,102 (5)
abstracting: (1<=p45)
states: 7,776 (3)
abstracting: (p45<=1)
states: 190,102 (5)
abstracting: (1<=p45)
states: 7,776 (3)
abstracting: (p45<=1)
states: 190,102 (5)
abstracting: (1<=p45)
states: 7,776 (3)
abstracting: (p45<=1)
states: 190,102 (5)
.
EG iterations: 1
abstracting: (1<=p30)
states: 7,776 (3)
abstracting: (p30<=1)
states: 190,102 (5)
abstracting: (1<=p45)
states: 7,776 (3)
abstracting: (p45<=1)
states: 190,102 (5)
abstracting: (1<=p45)
states: 7,776 (3)
abstracting: (p45<=1)
states: 190,102 (5)
abstracting: (1<=p45)
states: 7,776 (3)
abstracting: (p45<=1)
states: 190,102 (5)
abstracting: (1<=p45)
states: 7,776 (3)
abstracting: (p45<=1)
states: 190,102 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p68)
states: 190,102 (5)
abstracting: (p68<=0)
states: 182,326 (5)
abstracting: (1<=p6)
states: 7,776 (3)
abstracting: (p6<=1)
states: 190,102 (5)
-> the formula is TRUE

FORMULA CloudDeployment-PT-3a-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.199sec

checking: E [~ [EF [~ [EF [[[[p27<=1 & 1<=p27] & [p28<=1 & 1<=p28]] & [[p41<=1 & 1<=p41] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]]]]]] U [[[p53<=1 & 1<=p53] & [p54<=1 & 1<=p54]] & [[p66<=1 & 1<=p66] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]]]
normalized: E [~ [E [true U ~ [E [true U [[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p41<=1 & 1<=p41]] & [[p28<=1 & 1<=p28] & [p27<=1 & 1<=p27]]]]]]] U [[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p66<=1 & 1<=p66]] & [[p54<=1 & 1<=p54] & [p53<=1 & 1<=p53]]]]

abstracting: (1<=p53)
states: 190,073 (5)
abstracting: (p53<=1)
states: 190,102 (5)
abstracting: (1<=p54)
states: 190,073 (5)
abstracting: (p54<=1)
states: 190,102 (5)
abstracting: (1<=p66)
states: 7,785 (3)
abstracting: (p66<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
abstracting: (1<=p27)
states: 190,073 (5)
abstracting: (p27<=1)
states: 190,102 (5)
abstracting: (1<=p28)
states: 190,073 (5)
abstracting: (p28<=1)
states: 190,102 (5)
abstracting: (1<=p41)
states: 7,776 (3)
abstracting: (p41<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
-> the formula is FALSE

FORMULA CloudDeployment-PT-3a-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.126sec

checking: AG [[[[EG [[[p62<=1 & 1<=p62] | [[p27<=1 & 1<=p27] & [p50<=1 & 1<=p50]]]] | [p27<=0 & 0<=p27]] | [[p28<=0 & 0<=p28] | [p30<=0 & 0<=p30]]] | [[[p89<=0 & 0<=p89] | [p96<=0 & 0<=p96]] | [[p1<=0 & 0<=p1] | [[p2<=0 & 0<=p2] | [p20<=0 & 0<=p20]]]]]]
normalized: ~ [E [true U ~ [[[[[[p20<=0 & 0<=p20] | [p2<=0 & 0<=p2]] | [p1<=0 & 0<=p1]] | [[p96<=0 & 0<=p96] | [p89<=0 & 0<=p89]]] | [[[p30<=0 & 0<=p30] | [p28<=0 & 0<=p28]] | [[p27<=0 & 0<=p27] | EG [[[[p50<=1 & 1<=p50] & [p27<=1 & 1<=p27]] | [p62<=1 & 1<=p62]]]]]]]]]

abstracting: (1<=p62)
states: 7,776 (3)
abstracting: (p62<=1)
states: 190,102 (5)
abstracting: (1<=p27)
states: 190,073 (5)
abstracting: (p27<=1)
states: 190,102 (5)
abstracting: (1<=p50)
states: 7,776 (3)
abstracting: (p50<=1)
states: 190,102 (5)
.
EG iterations: 1
abstracting: (0<=p27)
states: 190,102 (5)
abstracting: (p27<=0)
states: 29
abstracting: (0<=p28)
states: 190,102 (5)
abstracting: (p28<=0)
states: 29
abstracting: (0<=p30)
states: 190,102 (5)
abstracting: (p30<=0)
states: 182,326 (5)
abstracting: (0<=p89)
states: 190,102 (5)
abstracting: (p89<=0)
states: 162,454 (5)
abstracting: (0<=p96)
states: 190,102 (5)
abstracting: (p96<=0)
states: 157,272 (5)
abstracting: (0<=p1)
states: 190,102 (5)
abstracting: (p1<=0)
states: 29
abstracting: (0<=p2)
states: 190,102 (5)
abstracting: (p2<=0)
states: 29
abstracting: (0<=p20)
states: 190,102 (5)
abstracting: (p20<=0)
states: 182,326 (5)
-> the formula is FALSE

FORMULA CloudDeployment-PT-3a-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.077sec

checking: A [~ [AX [E [[p63<=1 & 1<=p63] U AF [[[[p27<=1 & 1<=p27] & [p28<=1 & 1<=p28]] & [[p35<=1 & 1<=p35] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]]]]]] U EF [AG [~ [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p24<=1 & 1<=p24] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]]]]]]
normalized: [~ [EG [~ [E [true U ~ [E [true U [[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p24<=1 & 1<=p24]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]]]] & ~ [E [~ [E [true U ~ [E [true U [[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p24<=1 & 1<=p24]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]] U [~ [EX [~ [E [[p63<=1 & 1<=p63] U ~ [EG [~ [[[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p35<=1 & 1<=p35]] & [[p28<=1 & 1<=p28] & [p27<=1 & 1<=p27]]]]]]]]]] & ~ [E [true U ~ [E [true U [[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p24<=1 & 1<=p24]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]]]]]]

abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p24)
states: 7,776 (3)
abstracting: (p24<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
abstracting: (1<=p27)
states: 190,073 (5)
abstracting: (p27<=1)
states: 190,102 (5)
abstracting: (1<=p28)
states: 190,073 (5)
abstracting: (p28<=1)
states: 190,102 (5)
abstracting: (1<=p35)
states: 7,776 (3)
abstracting: (p35<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
.
EG iterations: 1
abstracting: (1<=p63)
states: 7,776 (3)
abstracting: (p63<=1)
states: 190,102 (5)
.abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p24)
states: 7,776 (3)
abstracting: (p24<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p24)
states: 7,776 (3)
abstracting: (p24<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA CloudDeployment-PT-3a-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.149sec

checking: [E [[A [[p22<=1 & 1<=p22] U [EF [[[p1<=1 & 1<=p1] & [p86<=1 & 1<=p86]]] | [[p2<=1 & 1<=p2] & [p54<=1 & 1<=p54]]]] & [~ [EF [[[[p53<=1 & 1<=p53] & [p54<=1 & 1<=p54]] & [[p56<=1 & 1<=p56] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]]]] | AF [[p19<=1 & 1<=p19]]]] U [p12<=1 & 1<=p12]] | [EG [AX [[[p67<=0 & 0<=p67] & [[p1<=0 & 0<=p1] | [p28<=0 & 0<=p28]]]]] & AX [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p6<=1 & 1<=p6] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]]]]]
normalized: [[~ [EX [~ [[[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p6<=1 & 1<=p6]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]] & EG [~ [EX [~ [[[[p28<=0 & 0<=p28] | [p1<=0 & 0<=p1]] & [p67<=0 & 0<=p67]]]]]]] | E [[[~ [EG [~ [[p19<=1 & 1<=p19]]]] | ~ [E [true U [[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p56<=1 & 1<=p56]] & [[p54<=1 & 1<=p54] & [p53<=1 & 1<=p53]]]]]] & [~ [EG [~ [[[[p54<=1 & 1<=p54] & [p2<=1 & 1<=p2]] | E [true U [[p86<=1 & 1<=p86] & [p1<=1 & 1<=p1]]]]]]] & ~ [E [~ [[[[p54<=1 & 1<=p54] & [p2<=1 & 1<=p2]] | E [true U [[p86<=1 & 1<=p86] & [p1<=1 & 1<=p1]]]]] U [~ [[p22<=1 & 1<=p22]] & ~ [[[[p54<=1 & 1<=p54] & [p2<=1 & 1<=p2]] | E [true U [[p86<=1 & 1<=p86] & [p1<=1 & 1<=p1]]]]]]]]]] U [p12<=1 & 1<=p12]]]

abstracting: (1<=p12)
states: 7,776 (3)
abstracting: (p12<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p86)
states: 13,824 (4)
abstracting: (p86<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p54)
states: 190,073 (5)
abstracting: (p54<=1)
states: 190,102 (5)
abstracting: (1<=p22)
states: 7,776 (3)
abstracting: (p22<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p86)
states: 13,824 (4)
abstracting: (p86<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p54)
states: 190,073 (5)
abstracting: (p54<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p86)
states: 13,824 (4)
abstracting: (p86<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p54)
states: 190,073 (5)
abstracting: (p54<=1)
states: 190,102 (5)
.
EG iterations: 1
abstracting: (1<=p53)
states: 190,073 (5)
abstracting: (p53<=1)
states: 190,102 (5)
abstracting: (1<=p54)
states: 190,073 (5)
abstracting: (p54<=1)
states: 190,102 (5)
abstracting: (1<=p56)
states: 7,776 (3)
abstracting: (p56<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
abstracting: (1<=p19)
states: 7,776 (3)
abstracting: (p19<=1)
states: 190,102 (5)
.
EG iterations: 1
abstracting: (0<=p67)
states: 190,102 (5)
abstracting: (p67<=0)
states: 182,326 (5)
abstracting: (0<=p1)
states: 190,102 (5)
abstracting: (p1<=0)
states: 29
abstracting: (0<=p28)
states: 190,102 (5)
abstracting: (p28<=0)
states: 29
..
EG iterations: 1
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p6)
states: 7,776 (3)
abstracting: (p6<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
.-> the formula is FALSE

FORMULA CloudDeployment-PT-3a-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.453sec

checking: [EF [AX [AG [[[p50<=0 & 0<=p50] | E [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p9<=1 & 1<=p9] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]] U [[[p27<=1 & 1<=p27] & [p28<=1 & 1<=p28]] & [[p48<=1 & 1<=p48] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]]]]]]] & EG [[[[[[p2<=0 & 0<=p2] | [p27<=0 & 0<=p27]] & AF [[[[p27<=1 & 1<=p27] & [p28<=1 & 1<=p28]] & [[p40<=1 & 1<=p40] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]]]] | [p74<=0 & 0<=p74]] & A [[p50<=1 & 1<=p50] U ~ [[p39<=1 & 1<=p39]]]]]]
normalized: [EG [[[~ [EG [[p39<=1 & 1<=p39]]] & ~ [E [[p39<=1 & 1<=p39] U [~ [[p50<=1 & 1<=p50]] & [p39<=1 & 1<=p39]]]]] & [[p74<=0 & 0<=p74] | [~ [EG [~ [[[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p40<=1 & 1<=p40]] & [[p28<=1 & 1<=p28] & [p27<=1 & 1<=p27]]]]]] & [[p27<=0 & 0<=p27] | [p2<=0 & 0<=p2]]]]]] & E [true U ~ [EX [E [true U ~ [[E [[[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p9<=1 & 1<=p9]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]] U [[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p48<=1 & 1<=p48]] & [[p28<=1 & 1<=p28] & [p27<=1 & 1<=p27]]]] | [p50<=0 & 0<=p50]]]]]]]]

abstracting: (0<=p50)
states: 190,102 (5)
abstracting: (p50<=0)
states: 182,326 (5)
abstracting: (1<=p27)
states: 190,073 (5)
abstracting: (p27<=1)
states: 190,102 (5)
abstracting: (1<=p28)
states: 190,073 (5)
abstracting: (p28<=1)
states: 190,102 (5)
abstracting: (1<=p48)
states: 7,776 (3)
abstracting: (p48<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p9)
states: 7,776 (3)
abstracting: (p9<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
.abstracting: (0<=p2)
states: 190,102 (5)
abstracting: (p2<=0)
states: 29
abstracting: (0<=p27)
states: 190,102 (5)
abstracting: (p27<=0)
states: 29
abstracting: (1<=p27)
states: 190,073 (5)
abstracting: (p27<=1)
states: 190,102 (5)
abstracting: (1<=p28)
states: 190,073 (5)
abstracting: (p28<=1)
states: 190,102 (5)
abstracting: (1<=p40)
states: 7,785 (3)
abstracting: (p40<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
.
EG iterations: 1
abstracting: (0<=p74)
states: 190,102 (5)
abstracting: (p74<=0)
states: 182,326 (5)
abstracting: (1<=p39)
states: 7,776 (3)
abstracting: (p39<=1)
states: 190,102 (5)
abstracting: (1<=p50)
states: 7,776 (3)
abstracting: (p50<=1)
states: 190,102 (5)
abstracting: (1<=p39)
states: 7,776 (3)
abstracting: (p39<=1)
states: 190,102 (5)
abstracting: (1<=p39)
states: 7,776 (3)
abstracting: (p39<=1)
states: 190,102 (5)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA CloudDeployment-PT-3a-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.418sec

checking: [A [[[p2<=1 & 1<=p2] & [p27<=1 & 1<=p27]] U [[p28<=1 & 1<=p28] & [[A [[[p2<=1 & 1<=p2] & [p20<=1 & 1<=p20]] U [[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p26<=1 & 1<=p26] & [p88<=1 & 1<=p88]]]] & AF [[[p27<=1 & 1<=p27] & [p80<=1 & 1<=p80]]]] | E [[[p1<=1 & 1<=p1] & [[p86<=1 & 1<=p86] & [p42<=1 & 1<=p42]]] U ~ [[[[p53<=1 & 1<=p53] & [p54<=1 & 1<=p54]] & [[p76<=1 & 1<=p76] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]]]]]]] | [EF [EG [[p5<=1 & 1<=p5]]] | AG [AF [EX [[[[p27<=0 & 0<=p27] | [p28<=0 & 0<=p28]] | [[p30<=0 & 0<=p30] | [[p89<=0 & 0<=p89] | [p96<=0 & 0<=p96]]]]]]]]]
normalized: [[~ [E [true U EG [~ [EX [[[[[p96<=0 & 0<=p96] | [p89<=0 & 0<=p89]] | [p30<=0 & 0<=p30]] | [[p28<=0 & 0<=p28] | [p27<=0 & 0<=p27]]]]]]]] | E [true U EG [[p5<=1 & 1<=p5]]]] | [~ [EG [~ [[[E [[[[p42<=1 & 1<=p42] & [p86<=1 & 1<=p86]] & [p1<=1 & 1<=p1]] U ~ [[[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p76<=1 & 1<=p76]] & [[p54<=1 & 1<=p54] & [p53<=1 & 1<=p53]]]]] | [~ [EG [~ [[[p80<=1 & 1<=p80] & [p27<=1 & 1<=p27]]]]] & [~ [EG [~ [[[[p88<=1 & 1<=p88] & [p26<=1 & 1<=p26]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[p88<=1 & 1<=p88] & [p26<=1 & 1<=p26]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] U [~ [[[p20<=1 & 1<=p20] & [p2<=1 & 1<=p2]]] & ~ [[[[p88<=1 & 1<=p88] & [p26<=1 & 1<=p26]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]]]]] & [p28<=1 & 1<=p28]]]]] & ~ [E [~ [[[E [[[[p42<=1 & 1<=p42] & [p86<=1 & 1<=p86]] & [p1<=1 & 1<=p1]] U ~ [[[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p76<=1 & 1<=p76]] & [[p54<=1 & 1<=p54] & [p53<=1 & 1<=p53]]]]] | [~ [EG [~ [[[p80<=1 & 1<=p80] & [p27<=1 & 1<=p27]]]]] & [~ [EG [~ [[[[p88<=1 & 1<=p88] & [p26<=1 & 1<=p26]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[p88<=1 & 1<=p88] & [p26<=1 & 1<=p26]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] U [~ [[[p20<=1 & 1<=p20] & [p2<=1 & 1<=p2]]] & ~ [[[[p88<=1 & 1<=p88] & [p26<=1 & 1<=p26]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]]]]] & [p28<=1 & 1<=p28]]] U [~ [[[p27<=1 & 1<=p27] & [p2<=1 & 1<=p2]]] & ~ [[[E [[[[p42<=1 & 1<=p42] & [p86<=1 & 1<=p86]] & [p1<=1 & 1<=p1]] U ~ [[[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p76<=1 & 1<=p76]] & [[p54<=1 & 1<=p54] & [p53<=1 & 1<=p53]]]]] | [~ [EG [~ [[[p80<=1 & 1<=p80] & [p27<=1 & 1<=p27]]]]] & [~ [EG [~ [[[[p88<=1 & 1<=p88] & [p26<=1 & 1<=p26]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[p88<=1 & 1<=p88] & [p26<=1 & 1<=p26]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] U [~ [[[p20<=1 & 1<=p20] & [p2<=1 & 1<=p2]]] & ~ [[[[p88<=1 & 1<=p88] & [p26<=1 & 1<=p26]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]]]]] & [p28<=1 & 1<=p28]]]]]]]]

abstracting: (1<=p28)
states: 190,073 (5)
abstracting: (p28<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p26)
states: 11,237 (4)
abstracting: (p26<=1)
states: 190,102 (5)
abstracting: (1<=p88)
states: 13,823 (4)
abstracting: (p88<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p20)
states: 7,776 (3)
abstracting: (p20<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p26)
states: 11,237 (4)
abstracting: (p26<=1)
states: 190,102 (5)
abstracting: (1<=p88)
states: 13,823 (4)
abstracting: (p88<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p26)
states: 11,237 (4)
abstracting: (p26<=1)
states: 190,102 (5)
abstracting: (1<=p88)
states: 13,823 (4)
abstracting: (p88<=1)
states: 190,102 (5)
.
EG iterations: 1
abstracting: (1<=p27)
states: 190,073 (5)
abstracting: (p27<=1)
states: 190,102 (5)
abstracting: (1<=p80)
states: 13,824 (4)
abstracting: (p80<=1)
states: 190,102 (5)
.
EG iterations: 1
abstracting: (1<=p53)
states: 190,073 (5)
abstracting: (p53<=1)
states: 190,102 (5)
abstracting: (1<=p54)
states: 190,073 (5)
abstracting: (p54<=1)
states: 190,102 (5)
abstracting: (1<=p76)
states: 7,776 (3)
abstracting: (p76<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p86)
states: 13,824 (4)
abstracting: (p86<=1)
states: 190,102 (5)
abstracting: (1<=p42)
states: 7,776 (3)
abstracting: (p42<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p27)
states: 190,073 (5)
abstracting: (p27<=1)
states: 190,102 (5)
abstracting: (1<=p28)
states: 190,073 (5)
abstracting: (p28<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p26)
states: 11,237 (4)
abstracting: (p26<=1)
states: 190,102 (5)
abstracting: (1<=p88)
states: 13,823 (4)
abstracting: (p88<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p20)
states: 7,776 (3)
abstracting: (p20<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p26)
states: 11,237 (4)
abstracting: (p26<=1)
states: 190,102 (5)
abstracting: (1<=p88)
states: 13,823 (4)
abstracting: (p88<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p26)
states: 11,237 (4)
abstracting: (p26<=1)
states: 190,102 (5)
abstracting: (1<=p88)
states: 13,823 (4)
abstracting: (p88<=1)
states: 190,102 (5)
.
EG iterations: 1
abstracting: (1<=p27)
states: 190,073 (5)
abstracting: (p27<=1)
states: 190,102 (5)
abstracting: (1<=p80)
states: 13,824 (4)
abstracting: (p80<=1)
states: 190,102 (5)
.
EG iterations: 1
abstracting: (1<=p53)
states: 190,073 (5)
abstracting: (p53<=1)
states: 190,102 (5)
abstracting: (1<=p54)
states: 190,073 (5)
abstracting: (p54<=1)
states: 190,102 (5)
abstracting: (1<=p76)
states: 7,776 (3)
abstracting: (p76<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p86)
states: 13,824 (4)
abstracting: (p86<=1)
states: 190,102 (5)
abstracting: (1<=p42)
states: 7,776 (3)
abstracting: (p42<=1)
states: 190,102 (5)
abstracting: (1<=p28)
states: 190,073 (5)
abstracting: (p28<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p26)
states: 11,237 (4)
abstracting: (p26<=1)
states: 190,102 (5)
abstracting: (1<=p88)
states: 13,823 (4)
abstracting: (p88<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p20)
states: 7,776 (3)
abstracting: (p20<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p26)
states: 11,237 (4)
abstracting: (p26<=1)
states: 190,102 (5)
abstracting: (1<=p88)
states: 13,823 (4)
abstracting: (p88<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p26)
states: 11,237 (4)
abstracting: (p26<=1)
states: 190,102 (5)
abstracting: (1<=p88)
states: 13,823 (4)
abstracting: (p88<=1)
states: 190,102 (5)
.
EG iterations: 1
abstracting: (1<=p27)
states: 190,073 (5)
abstracting: (p27<=1)
states: 190,102 (5)
abstracting: (1<=p80)
states: 13,824 (4)
abstracting: (p80<=1)
states: 190,102 (5)
.
EG iterations: 1
abstracting: (1<=p53)
states: 190,073 (5)
abstracting: (p53<=1)
states: 190,102 (5)
abstracting: (1<=p54)
states: 190,073 (5)
abstracting: (p54<=1)
states: 190,102 (5)
abstracting: (1<=p76)
states: 7,776 (3)
abstracting: (p76<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p86)
states: 13,824 (4)
abstracting: (p86<=1)
states: 190,102 (5)
abstracting: (1<=p42)
states: 7,776 (3)
abstracting: (p42<=1)
states: 190,102 (5)
..
EG iterations: 2
abstracting: (1<=p5)
states: 7,776 (3)
abstracting: (p5<=1)
states: 190,102 (5)
.
EG iterations: 1
abstracting: (0<=p27)
states: 190,102 (5)
abstracting: (p27<=0)
states: 29
abstracting: (0<=p28)
states: 190,102 (5)
abstracting: (p28<=0)
states: 29
abstracting: (0<=p30)
states: 190,102 (5)
abstracting: (p30<=0)
states: 182,326 (5)
abstracting: (0<=p89)
states: 190,102 (5)
abstracting: (p89<=0)
states: 162,454 (5)
abstracting: (0<=p96)
states: 190,102 (5)
abstracting: (p96<=0)
states: 157,272 (5)
..
EG iterations: 1
-> the formula is TRUE

FORMULA CloudDeployment-PT-3a-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.233sec

checking: E [~ [[[EG [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p4<=1 & 1<=p4] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]]] | [EF [[p76<=1 & 1<=p76]] | [[[p53<=1 & 1<=p53] & [p54<=1 & 1<=p54]] & [[p74<=1 & 1<=p74] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]]]] & [AF [~ [AF [[p32<=1 & 1<=p32]]]] & AG [AF [[[p53<=1 & 1<=p53] & [p84<=1 & 1<=p84]]]]]]] U [~ [E [[p0<=1 & 1<=p0] U A [[p47<=1 & 1<=p47] U [[p65<=1 & 1<=p65] | [p49<=1 & 1<=p49]]]]] & [E [E [AG [[p62<=1 & 1<=p62]] U EF [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p26<=1 & 1<=p26] & [p94<=1 & 1<=p94]]]]] U AG [[[p56<=1 & 1<=p56] & [p37<=1 & 1<=p37]]]] | [p58<=1 & 1<=p58]]]]
normalized: E [~ [[[~ [E [true U EG [~ [[[p84<=1 & 1<=p84] & [p53<=1 & 1<=p53]]]]]] & ~ [EG [~ [EG [~ [[p32<=1 & 1<=p32]]]]]]] & [[[[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p74<=1 & 1<=p74]] & [[p54<=1 & 1<=p54] & [p53<=1 & 1<=p53]]] | E [true U [p76<=1 & 1<=p76]]] | EG [[[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p4<=1 & 1<=p4]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]] U [[[p58<=1 & 1<=p58] | E [E [~ [E [true U ~ [[p62<=1 & 1<=p62]]]] U E [true U [[[p94<=1 & 1<=p94] & [p26<=1 & 1<=p26]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]] U ~ [E [true U ~ [[[p37<=1 & 1<=p37] & [p56<=1 & 1<=p56]]]]]]] & ~ [E [[p0<=1 & 1<=p0] U [~ [EG [~ [[[p49<=1 & 1<=p49] | [p65<=1 & 1<=p65]]]]] & ~ [E [~ [[[p49<=1 & 1<=p49] | [p65<=1 & 1<=p65]]] U [~ [[p47<=1 & 1<=p47]] & ~ [[[p49<=1 & 1<=p49] | [p65<=1 & 1<=p65]]]]]]]]]]]

abstracting: (1<=p65)
states: 7,776 (3)
abstracting: (p65<=1)
states: 190,102 (5)
abstracting: (1<=p49)
states: 7,776 (3)
abstracting: (p49<=1)
states: 190,102 (5)
abstracting: (1<=p47)
states: 7,776 (3)
abstracting: (p47<=1)
states: 190,102 (5)
abstracting: (1<=p65)
states: 7,776 (3)
abstracting: (p65<=1)
states: 190,102 (5)
abstracting: (1<=p49)
states: 7,776 (3)
abstracting: (p49<=1)
states: 190,102 (5)
abstracting: (1<=p65)
states: 7,776 (3)
abstracting: (p65<=1)
states: 190,102 (5)
abstracting: (1<=p49)
states: 7,776 (3)
abstracting: (p49<=1)
states: 190,102 (5)
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 190,102 (5)
abstracting: (1<=p56)
states: 7,776 (3)
abstracting: (p56<=1)
states: 190,102 (5)
abstracting: (1<=p37)
states: 7,776 (3)
abstracting: (p37<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p26)
states: 11,237 (4)
abstracting: (p26<=1)
states: 190,102 (5)
abstracting: (1<=p94)
states: 3,596 (3)
abstracting: (p94<=1)
states: 190,102 (5)
abstracting: (1<=p62)
states: 7,776 (3)
abstracting: (p62<=1)
states: 190,102 (5)
abstracting: (1<=p58)
states: 7,776 (3)
abstracting: (p58<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p4)
states: 7,776 (3)
abstracting: (p4<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
.
EG iterations: 1
abstracting: (1<=p76)
states: 7,776 (3)
abstracting: (p76<=1)
states: 190,102 (5)
abstracting: (1<=p53)
states: 190,073 (5)
abstracting: (p53<=1)
states: 190,102 (5)
abstracting: (1<=p54)
states: 190,073 (5)
abstracting: (p54<=1)
states: 190,102 (5)
abstracting: (1<=p74)
states: 7,776 (3)
abstracting: (p74<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
abstracting: (1<=p32)
states: 7,776 (3)
abstracting: (p32<=1)
states: 190,102 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p53)
states: 190,073 (5)
abstracting: (p53<=1)
states: 190,102 (5)
abstracting: (1<=p84)
states: 13,824 (4)
abstracting: (p84<=1)
states: 190,102 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA CloudDeployment-PT-3a-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.206sec

checking: E [A [[[[[p27<=1 & 1<=p27] & [p28<=1 & 1<=p28]] & [[p46<=1 & 1<=p46] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]] | [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p14<=1 & 1<=p14] & [[p27<=1 & 1<=p27] & [p28<=1 & 1<=p28]]]] & [[[p40<=1 & 1<=p40] & [[p53<=1 & 1<=p53] & [p54<=1 & 1<=p54]]] & [[p66<=1 & 1<=p66] & [[p89<=1 & 1<=p89] & [p97<=1 & 1<=p97]]]]]] U AX [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p13<=1 & 1<=p13] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]]]] U EF [[[[p27<=1 & 1<=p27] & [p28<=1 & 1<=p28]] & [[p41<=1 & 1<=p41] & [[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]]]]]]
normalized: E [[~ [EG [EX [~ [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]] & [p13<=1 & 1<=p13]]]]]]] & ~ [E [EX [~ [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]] & [p13<=1 & 1<=p13]]]]] U [EX [~ [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[[p89<=1 & 1<=p89] & [p96<=1 & 1<=p96]] & [p13<=1 & 1<=p13]]]]] & ~ [[[[[[[p97<=1 & 1<=p97] & [p89<=1 & 1<=p89]] & [p66<=1 & 1<=p66]] & [[[p54<=1 & 1<=p54] & [p53<=1 & 1<=p53]] & [p40<=1 & 1<=p40]]] & [[[[p28<=1 & 1<=p28] & [p27<=1 & 1<=p27]] & [p14<=1 & 1<=p14]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] | [[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p46<=1 & 1<=p46]] & [[p28<=1 & 1<=p28] & [p27<=1 & 1<=p27]]]]]]]]] U E [true U [[[[p96<=1 & 1<=p96] & [p89<=1 & 1<=p89]] & [p41<=1 & 1<=p41]] & [[p28<=1 & 1<=p28] & [p27<=1 & 1<=p27]]]]]

abstracting: (1<=p27)
states: 190,073 (5)
abstracting: (p27<=1)
states: 190,102 (5)
abstracting: (1<=p28)
states: 190,073 (5)
abstracting: (p28<=1)
states: 190,102 (5)
abstracting: (1<=p41)
states: 7,776 (3)
abstracting: (p41<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
abstracting: (1<=p27)
states: 190,073 (5)
abstracting: (p27<=1)
states: 190,102 (5)
abstracting: (1<=p28)
states: 190,073 (5)
abstracting: (p28<=1)
states: 190,102 (5)
abstracting: (1<=p46)
states: 7,776 (3)
abstracting: (p46<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p14)
states: 7,785 (3)
abstracting: (p14<=1)
states: 190,102 (5)
abstracting: (1<=p27)
states: 190,073 (5)
abstracting: (p27<=1)
states: 190,102 (5)
abstracting: (1<=p28)
states: 190,073 (5)
abstracting: (p28<=1)
states: 190,102 (5)
abstracting: (1<=p40)
states: 7,785 (3)
abstracting: (p40<=1)
states: 190,102 (5)
abstracting: (1<=p53)
states: 190,073 (5)
abstracting: (p53<=1)
states: 190,102 (5)
abstracting: (1<=p54)
states: 190,073 (5)
abstracting: (p54<=1)
states: 190,102 (5)
abstracting: (1<=p66)
states: 7,785 (3)
abstracting: (p66<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p97)
states: 157,243 (5)
abstracting: (p97<=1)
states: 190,102 (5)
abstracting: (1<=p13)
states: 7,776 (3)
abstracting: (p13<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
.abstracting: (1<=p13)
states: 7,776 (3)
abstracting: (p13<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
.abstracting: (1<=p13)
states: 7,776 (3)
abstracting: (p13<=1)
states: 190,102 (5)
abstracting: (1<=p96)
states: 32,830 (4)
abstracting: (p96<=1)
states: 190,102 (5)
abstracting: (1<=p89)
states: 27,648 (4)
abstracting: (p89<=1)
states: 190,102 (5)
abstracting: (1<=p2)
states: 190,073 (5)
abstracting: (p2<=1)
states: 190,102 (5)
abstracting: (1<=p1)
states: 190,073 (5)
abstracting: (p1<=1)
states: 190,102 (5)
.....
EG iterations: 4
-> the formula is TRUE

FORMULA CloudDeployment-PT-3a-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.072sec

totally nodes used: 735364 (7.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3392789 7934268 11327057
used/not used/entry size/cache size: 8117067 58991797 16 1024MB
basic ops cache: hits/miss/sum: 383758 656553 1040311
used/not used/entry size/cache size: 1148073 15629143 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: 4477 10442 14919
used/not used/entry size/cache size: 10434 8378174 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 66415904
1 654455
2 34882
3 3359
4 253
5 10
6 1
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 8.530sec


BK_STOP 1678479096407

--------------------
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:17625 (69), effective:832 (3)

initing FirstDep: 0m 0.000sec


iterations count:1881 (7), effective:99 (0)

iterations count:1973 (7), effective:169 (0)

iterations count:2034 (8), effective:99 (0)

iterations count:1973 (7), effective:169 (0)

iterations count:3294 (12), effective:85 (0)

iterations count:2034 (8), effective:99 (0)

iterations count:2022 (7), effective:98 (0)

iterations count:4891 (19), effective:191 (0)

iterations count:5577 (21), effective:285 (1)

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

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

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

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

iterations count:4166 (16), effective:100 (0)

iterations count:1888 (7), effective:99 (0)

iterations count:1973 (7), effective:169 (0)

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

iterations count:2019 (7), effective:105 (0)

iterations count:1046 (4), effective:75 (0)

iterations count:1045 (4), effective:75 (0)

iterations count:1189 (4), effective:29 (0)

iterations count:1046 (4), effective:75 (0)

iterations count:1045 (4), effective:75 (0)

iterations count:1046 (4), effective:75 (0)

iterations count:1045 (4), effective:75 (0)

iterations count:4696 (18), effective:185 (0)

iterations count:4696 (18), effective:185 (0)

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

iterations count:4696 (18), effective:185 (0)

iterations count:2050 (8), effective:99 (0)

iterations count:2016 (7), effective:67 (0)

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

iterations count:4402 (17), effective:162 (0)

iterations count:2941 (11), effective:265 (1)

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

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

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

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

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

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

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

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

iterations count:4156 (16), effective:100 (0)

iterations count:6195 (24), effective:295 (1)

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

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

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

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

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

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

iterations count:4177 (16), effective:161 (0)

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

iterations count:3288 (12), effective:86 (0)

iterations count:1888 (7), effective:99 (0)

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

iterations count:254 (1), effective:0 (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="CloudDeployment-PT-3a"
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 CloudDeployment-PT-3a, 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 r074-smll-167814400200378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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