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.r138-smll-167819420300330.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 DiscoveryGPU-PT-09a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819420300330
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.6K Feb 25 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 13:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 13:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 199K Feb 25 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 25 13:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 32K 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 DiscoveryGPU-PT-09a-CTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678752105970

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=DiscoveryGPU-PT-09a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 00:01:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 00:01:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 00:01:49] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-14 00:01:49] [INFO ] Transformed 93 places.
[2023-03-14 00:01:49] [INFO ] Transformed 127 transitions.
[2023-03-14 00:01:49] [INFO ] Found NUPN structural information;
[2023-03-14 00:01:49] [INFO ] Parsed PT model containing 93 places and 127 transitions and 408 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Support contains 66 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 127/127 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 89 transition count 123
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 89 transition count 123
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 87 transition count 121
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 87 transition count 121
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 21 place count 87 transition count 112
Applied a total of 21 rules in 44 ms. Remains 87 /93 variables (removed 6) and now considering 112/127 (removed 15) transitions.
// Phase 1: matrix 112 rows 87 cols
[2023-03-14 00:01:49] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-14 00:01:50] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-14 00:01:50] [INFO ] Invariant cache hit.
[2023-03-14 00:01:50] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-14 00:01:50] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2023-03-14 00:01:50] [INFO ] Invariant cache hit.
[2023-03-14 00:01:50] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/93 places, 112/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 893 ms. Remains : 87/93 places, 112/127 transitions.
Support contains 66 out of 87 places after structural reductions.
[2023-03-14 00:01:51] [INFO ] Flatten gal took : 59 ms
[2023-03-14 00:01:51] [INFO ] Flatten gal took : 27 ms
[2023-03-14 00:01:51] [INFO ] Input system was already deterministic with 112 transitions.
Incomplete random walk after 10000 steps, including 102 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 81) seen :80
Finished Best-First random walk after 2601 steps, including 2 resets, run visited all 1 properties in 10 ms. (steps per millisecond=260 )
[2023-03-14 00:01:51] [INFO ] Flatten gal took : 13 ms
[2023-03-14 00:01:51] [INFO ] Flatten gal took : 17 ms
[2023-03-14 00:01:51] [INFO ] Input system was already deterministic with 112 transitions.
Computed a total of 12 stabilizing places and 10 stable transitions
Graph (complete) has 248 edges and 87 vertex of which 82 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 79 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 79 transition count 104
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 73 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 73 transition count 98
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 69 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 69 transition count 94
Applied a total of 36 rules in 19 ms. Remains 69 /87 variables (removed 18) and now considering 94/112 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 69/87 places, 94/112 transitions.
[2023-03-14 00:01:51] [INFO ] Flatten gal took : 9 ms
[2023-03-14 00:01:51] [INFO ] Flatten gal took : 11 ms
[2023-03-14 00:01:51] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 82 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 82 transition count 107
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 77 transition count 102
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 77 transition count 102
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 74 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 74 transition count 99
Applied a total of 26 rules in 12 ms. Remains 74 /87 variables (removed 13) and now considering 99/112 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 74/87 places, 99/112 transitions.
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 7 ms
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 8 ms
[2023-03-14 00:01:52] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 80 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 80 transition count 105
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 77 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 77 transition count 102
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 75 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 75 transition count 100
Applied a total of 24 rules in 9 ms. Remains 75 /87 variables (removed 12) and now considering 100/112 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 75/87 places, 100/112 transitions.
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 6 ms
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 8 ms
[2023-03-14 00:01:52] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Graph (complete) has 248 edges and 87 vertex of which 82 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 82 transition count 100
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 75 transition count 100
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 23 place count 67 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 31 place count 67 transition count 92
Applied a total of 31 rules in 22 ms. Remains 67 /87 variables (removed 20) and now considering 92/112 (removed 20) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 67/87 places, 92/112 transitions.
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 5 ms
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 6 ms
[2023-03-14 00:01:52] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 80 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 80 transition count 105
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 75 transition count 100
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 75 transition count 100
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 72 transition count 97
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 72 transition count 97
Applied a total of 30 rules in 11 ms. Remains 72 /87 variables (removed 15) and now considering 97/112 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 72/87 places, 97/112 transitions.
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 5 ms
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 6 ms
[2023-03-14 00:01:52] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 81 transition count 106
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 81 transition count 106
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 75 transition count 100
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 75 transition count 100
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 71 transition count 96
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 71 transition count 96
Applied a total of 32 rules in 7 ms. Remains 71 /87 variables (removed 16) and now considering 96/112 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 71/87 places, 96/112 transitions.
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 5 ms
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 6 ms
[2023-03-14 00:01:52] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 80 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 80 transition count 105
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 75 transition count 100
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 75 transition count 100
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 71 transition count 96
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 71 transition count 96
Applied a total of 32 rules in 9 ms. Remains 71 /87 variables (removed 16) and now considering 96/112 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 71/87 places, 96/112 transitions.
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 5 ms
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 13 ms
[2023-03-14 00:01:52] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 83 transition count 108
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 83 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 80 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 80 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 79 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 79 transition count 104
Applied a total of 16 rules in 7 ms. Remains 79 /87 variables (removed 8) and now considering 104/112 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 79/87 places, 104/112 transitions.
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 6 ms
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 7 ms
[2023-03-14 00:01:52] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 80 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 80 transition count 105
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 74 transition count 99
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 74 transition count 99
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 70 transition count 95
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 70 transition count 95
Applied a total of 34 rules in 8 ms. Remains 70 /87 variables (removed 17) and now considering 95/112 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 70/87 places, 95/112 transitions.
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 6 ms
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 7 ms
[2023-03-14 00:01:52] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 79 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 79 transition count 104
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 73 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 73 transition count 98
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 69 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 69 transition count 94
Applied a total of 36 rules in 5 ms. Remains 69 /87 variables (removed 18) and now considering 94/112 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 69/87 places, 94/112 transitions.
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 5 ms
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 6 ms
[2023-03-14 00:01:52] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 82 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 82 transition count 107
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 78 transition count 103
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 78 transition count 103
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 75 transition count 100
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 75 transition count 100
Applied a total of 24 rules in 4 ms. Remains 75 /87 variables (removed 12) and now considering 100/112 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 75/87 places, 100/112 transitions.
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 6 ms
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 7 ms
[2023-03-14 00:01:52] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Graph (complete) has 248 edges and 87 vertex of which 83 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 91 edges and 80 vertex of which 66 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Graph (trivial) has 70 edges and 66 vertex of which 34 / 66 are part of one of the 17 SCC in 3 ms
Free SCC test removed 17 places
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 13 rules applied. Total rules applied 14 place count 49 transition count 84
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 40 place count 40 transition count 67
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 46 place count 34 transition count 55
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 34 transition count 55
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 29 transition count 45
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 29 transition count 45
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 67 place count 24 transition count 35
Iterating global reduction 2 with 5 rules applied. Total rules applied 72 place count 24 transition count 35
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 77 place count 19 transition count 30
Iterating global reduction 2 with 5 rules applied. Total rules applied 82 place count 19 transition count 30
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 19 transition count 28
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 19 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 18 transition count 27
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 90 place count 14 transition count 23
Applied a total of 90 rules in 18 ms. Remains 14 /87 variables (removed 73) and now considering 23/112 (removed 89) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 14/87 places, 23/112 transitions.
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 2 ms
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 1 ms
[2023-03-14 00:01:52] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Graph (complete) has 248 edges and 87 vertex of which 82 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 82 transition count 100
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 75 transition count 100
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 23 place count 67 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 31 place count 67 transition count 92
Applied a total of 31 rules in 11 ms. Remains 67 /87 variables (removed 20) and now considering 92/112 (removed 20) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 67/87 places, 92/112 transitions.
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 5 ms
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 8 ms
[2023-03-14 00:01:52] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 81 transition count 106
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 81 transition count 106
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 76 transition count 101
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 76 transition count 101
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 74 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 74 transition count 99
Applied a total of 26 rules in 4 ms. Remains 74 /87 variables (removed 13) and now considering 99/112 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 74/87 places, 99/112 transitions.
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 6 ms
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 6 ms
[2023-03-14 00:01:52] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 79 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 79 transition count 104
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 73 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 73 transition count 98
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 69 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 69 transition count 94
Applied a total of 36 rules in 4 ms. Remains 69 /87 variables (removed 18) and now considering 94/112 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 69/87 places, 94/112 transitions.
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 4 ms
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 5 ms
[2023-03-14 00:01:52] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 79 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 79 transition count 104
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 73 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 73 transition count 98
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 69 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 69 transition count 94
Applied a total of 36 rules in 3 ms. Remains 69 /87 variables (removed 18) and now considering 94/112 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 69/87 places, 94/112 transitions.
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 5 ms
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 4 ms
[2023-03-14 00:01:52] [INFO ] Input system was already deterministic with 94 transitions.
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 7 ms
[2023-03-14 00:01:52] [INFO ] Flatten gal took : 16 ms
[2023-03-14 00:01:52] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-14 00:01:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 87 places, 112 transitions and 360 arcs took 1 ms.
Total runtime 3253 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: 87 NrTr: 112 NrArc: 360)

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

net check time: 0m 0.000sec

init dd package: 0m 3.724sec


RS generation: 0m 2.142sec


-> reachability set: #nodes 35411 (3.5e+04) #states 2,103,033,241 (9)



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

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

abstracting: (0<=p16)
states: 2,103,033,241 (9)
abstracting: (p16<=0)
states: 1,901,280,261 (9)
..........................
EG iterations: 26
.-> the formula is FALSE

FORMULA DiscoveryGPU-PT-09a-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.670sec

checking: AX [EF [[p53<=1 & 1<=p53]]]
normalized: ~ [EX [~ [E [true U [p53<=1 & 1<=p53]]]]]

abstracting: (1<=p53)
states: 201,752,980 (8)
abstracting: (p53<=1)
states: 2,103,033,241 (9)
.-> the formula is TRUE

FORMULA DiscoveryGPU-PT-09a-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.218sec

checking: EG [AG [[[p69<=0 & 0<=p69] | [p86<=0 & 0<=p86]]]]
normalized: EG [~ [E [true U ~ [[[p86<=0 & 0<=p86] | [p69<=0 & 0<=p69]]]]]]

abstracting: (0<=p69)
states: 2,103,033,241 (9)
abstracting: (p69<=0)
states: 1,911,848,401 (9)
abstracting: (0<=p86)
states: 2,103,033,241 (9)
abstracting: (p86<=0)
states: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA DiscoveryGPU-PT-09a-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.575sec

checking: AF [[EF [AG [A [[p41<=1 & 1<=p41] U [p71<=1 & 1<=p71]]]] | [p56<=1 & 1<=p56]]]
normalized: ~ [EG [~ [[E [true U ~ [E [true U ~ [[~ [EG [~ [[p71<=1 & 1<=p71]]]] & ~ [E [~ [[p71<=1 & 1<=p71]] U [~ [[p41<=1 & 1<=p41]] & ~ [[p71<=1 & 1<=p71]]]]]]]]]] | [p56<=1 & 1<=p56]]]]]

abstracting: (1<=p56)
states: 191,184,840 (8)
abstracting: (p56<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p71)
states: 191,184,840 (8)
abstracting: (p71<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p41)
states: 201,752,980 (8)
abstracting: (p41<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p71)
states: 191,184,840 (8)
abstracting: (p71<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p71)
states: 191,184,840 (8)
abstracting: (p71<=1)
states: 2,103,033,241 (9)
..........................
EG iterations: 26
...........................
EG iterations: 27
-> the formula is FALSE

FORMULA DiscoveryGPU-PT-09a-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.119sec

checking: EF [EG [AG [[AG [[p4<=1 & 1<=p4]] | EG [[[p60<=1 & 1<=p60] & [p85<=1 & 1<=p85]]]]]]]
normalized: E [true U EG [~ [E [true U ~ [[EG [[[p85<=1 & 1<=p85] & [p60<=1 & 1<=p60]]] | ~ [E [true U ~ [[p4<=1 & 1<=p4]]]]]]]]]]

abstracting: (1<=p4)
states: 191,184,840 (8)
abstracting: (p4<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p60)
states: 191,184,840 (8)
abstracting: (p60<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
..........................
EG iterations: 26
.
EG iterations: 1
-> the formula is FALSE

FORMULA DiscoveryGPU-PT-09a-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.326sec

checking: EF [AG [EX [[AF [[p35<=1 & 1<=p35]] & [[[p41<=1 & 1<=p41] & [p86<=1 & 1<=p86]] | [[[p48<=1 & 1<=p48] & [p86<=1 & 1<=p86]] & [[p47<=1 & 1<=p47] & [p85<=1 & 1<=p85]]]]]]]]
normalized: E [true U ~ [E [true U ~ [EX [[[[[[p47<=1 & 1<=p47] & [p85<=1 & 1<=p85]] & [[p86<=1 & 1<=p86] & [p48<=1 & 1<=p48]]] | [[p86<=1 & 1<=p86] & [p41<=1 & 1<=p41]]] & ~ [EG [~ [[p35<=1 & 1<=p35]]]]]]]]]]

abstracting: (1<=p35)
states: 196,072,272 (8)
abstracting: (p35<=1)
states: 2,103,033,241 (9)
..........................
EG iterations: 26
abstracting: (1<=p41)
states: 201,752,980 (8)
abstracting: (p41<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p48)
states: 201,752,980 (8)
abstracting: (p48<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p47)
states: 201,752,980 (8)
abstracting: (p47<=1)
states: 2,103,033,241 (9)
.-> the formula is FALSE

FORMULA DiscoveryGPU-PT-09a-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.238sec

checking: AX [EF [[AG [[[p24<=0 & 0<=p24] & [[p14<=0 & 0<=p14] | [p86<=0 & 0<=p86]]]] & [EF [[[p5<=0 & 0<=p5] | [p85<=0 & 0<=p85]]] | [[p30<=1 & 1<=p30] & [[p85<=1 & 1<=p85] & [p15<=1 & 1<=p15]]]]]]]
normalized: ~ [EX [~ [E [true U [[[[[p15<=1 & 1<=p15] & [p85<=1 & 1<=p85]] & [p30<=1 & 1<=p30]] | E [true U [[p85<=0 & 0<=p85] | [p5<=0 & 0<=p5]]]] & ~ [E [true U ~ [[[[p86<=0 & 0<=p86] | [p14<=0 & 0<=p14]] & [p24<=0 & 0<=p24]]]]]]]]]]

abstracting: (0<=p24)
states: 2,103,033,241 (9)
abstracting: (p24<=0)
states: 1,911,848,401 (9)
abstracting: (0<=p14)
states: 2,103,033,241 (9)
abstracting: (p14<=0)
states: 1,901,280,261 (9)
abstracting: (0<=p86)
states: 2,103,033,241 (9)
abstracting: (p86<=0)
states: 1
abstracting: (0<=p5)
states: 2,103,033,241 (9)
abstracting: (p5<=0)
states: 1,911,848,401 (9)
abstracting: (0<=p85)
states: 2,103,033,241 (9)
abstracting: (p85<=0)
states: 1
abstracting: (1<=p30)
states: 191,184,840 (8)
abstracting: (p30<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p15)
states: 201,752,980 (8)
abstracting: (p15<=1)
states: 2,103,033,241 (9)
.-> the formula is TRUE

FORMULA DiscoveryGPU-PT-09a-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.158sec

checking: AX [A [[~ [[p13<=1 & 1<=p13]] & [[p40<=1 & 1<=p40] | E [[[[p6<=1 & 1<=p6] & [p85<=1 & 1<=p85]] | [p59<=1 & 1<=p59]] U ~ [[[p47<=1 & 1<=p47] & [p85<=1 & 1<=p85]]]]]] U EF [AG [~ [[[p33<=1 & 1<=p33] & [p86<=1 & 1<=p86]]]]]]]
normalized: ~ [EX [~ [[~ [EG [~ [E [true U ~ [E [true U [[p86<=1 & 1<=p86] & [p33<=1 & 1<=p33]]]]]]]] & ~ [E [~ [E [true U ~ [E [true U [[p86<=1 & 1<=p86] & [p33<=1 & 1<=p33]]]]]] U [~ [[[[p40<=1 & 1<=p40] | E [[[p59<=1 & 1<=p59] | [[p85<=1 & 1<=p85] & [p6<=1 & 1<=p6]]] U ~ [[[p85<=1 & 1<=p85] & [p47<=1 & 1<=p47]]]]] & ~ [[p13<=1 & 1<=p13]]]] & ~ [E [true U ~ [E [true U [[p86<=1 & 1<=p86] & [p33<=1 & 1<=p33]]]]]]]]]]]]]

abstracting: (1<=p33)
states: 196,072,272 (8)
abstracting: (p33<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p13)
states: 201,752,980 (8)
abstracting: (p13<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p47)
states: 201,752,980 (8)
abstracting: (p47<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p6)
states: 191,184,840 (8)
abstracting: (p6<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p59)
states: 191,184,840 (8)
abstracting: (p59<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p40)
states: 201,752,980 (8)
abstracting: (p40<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p33)
states: 196,072,272 (8)
abstracting: (p33<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p33)
states: 196,072,272 (8)
abstracting: (p33<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA DiscoveryGPU-PT-09a-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.098sec

checking: AF [[EF [[EG [[p18<=0 & 0<=p18]] | A [[[p80<=1 & 1<=p80] & [p1<=1 & 1<=p1]] U AX [[[p17<=1 & 1<=p17] & [p85<=1 & 1<=p85]]]]]] & [EF [AG [[[p54<=0 & 0<=p54] | [p85<=0 & 0<=p85]]]] | AG [[AF [[[p38<=0 & 0<=p38] | [p85<=0 & 0<=p85]]] | [[p71<=1 & 1<=p71] & [p85<=1 & 1<=p85]]]]]]]
normalized: ~ [EG [~ [[[~ [E [true U ~ [[[[p85<=1 & 1<=p85] & [p71<=1 & 1<=p71]] | ~ [EG [~ [[[p85<=0 & 0<=p85] | [p38<=0 & 0<=p38]]]]]]]]] | E [true U ~ [E [true U ~ [[[p85<=0 & 0<=p85] | [p54<=0 & 0<=p54]]]]]]] & E [true U [[~ [EG [EX [~ [[[p85<=1 & 1<=p85] & [p17<=1 & 1<=p17]]]]]] & ~ [E [EX [~ [[[p85<=1 & 1<=p85] & [p17<=1 & 1<=p17]]]] U [~ [[[p1<=1 & 1<=p1] & [p80<=1 & 1<=p80]]] & EX [~ [[[p85<=1 & 1<=p85] & [p17<=1 & 1<=p17]]]]]]]] | EG [[p18<=0 & 0<=p18]]]]]]]]

abstracting: (0<=p18)
states: 2,103,033,241 (9)
abstracting: (p18<=0)
states: 1,901,280,261 (9)
...........................
EG iterations: 27
abstracting: (1<=p17)
states: 201,752,980 (8)
abstracting: (p17<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
.abstracting: (1<=p80)
states: 196,072,272 (8)
abstracting: (p80<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p1)
states: 191,184,840 (8)
abstracting: (p1<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p17)
states: 201,752,980 (8)
abstracting: (p17<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
.abstracting: (1<=p17)
states: 201,752,980 (8)
abstracting: (p17<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
.............................
EG iterations: 28
abstracting: (0<=p54)
states: 2,103,033,241 (9)
abstracting: (p54<=0)
states: 1,901,280,261 (9)
abstracting: (0<=p85)
states: 2,103,033,241 (9)
abstracting: (p85<=0)
states: 1
abstracting: (0<=p38)
states: 2,103,033,241 (9)
abstracting: (p38<=0)
states: 1,906,960,969 (9)
abstracting: (0<=p85)
states: 2,103,033,241 (9)
abstracting: (p85<=0)
states: 1
..........................
EG iterations: 26
abstracting: (1<=p71)
states: 191,184,840 (8)
abstracting: (p71<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-09a-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.324sec

checking: [AG [[AX [[[0<=p49 & p49<=0] | [p86<=0 & 0<=p86]]] | [AG [[[p81<=0 & 0<=p81] | [p85<=0 & 0<=p85]]] | [[[p26<=0 & 0<=p26] | [p85<=0 & 0<=p85]] & [p63<=0 & 0<=p63]]]]] | [EG [[p71<=1 & 1<=p71]] | AX [[[[p33<=1 & 1<=p33] & [p86<=1 & 1<=p86]] & [[p55<=1 & 1<=p55] & [p85<=1 & 1<=p85]]]]]]
normalized: [[~ [EX [~ [[[[p85<=1 & 1<=p85] & [p55<=1 & 1<=p55]] & [[p86<=1 & 1<=p86] & [p33<=1 & 1<=p33]]]]]] | EG [[p71<=1 & 1<=p71]]] | ~ [E [true U ~ [[[[[p63<=0 & 0<=p63] & [[p85<=0 & 0<=p85] | [p26<=0 & 0<=p26]]] | ~ [E [true U ~ [[[p85<=0 & 0<=p85] | [p81<=0 & 0<=p81]]]]]] | ~ [EX [~ [[[p86<=0 & 0<=p86] | [0<=p49 & p49<=0]]]]]]]]]]

abstracting: (p49<=0)
states: 1,901,280,261 (9)
abstracting: (0<=p49)
states: 2,103,033,241 (9)
abstracting: (0<=p86)
states: 2,103,033,241 (9)
abstracting: (p86<=0)
states: 1
.abstracting: (0<=p81)
states: 2,103,033,241 (9)
abstracting: (p81<=0)
states: 1,906,960,969 (9)
abstracting: (0<=p85)
states: 2,103,033,241 (9)
abstracting: (p85<=0)
states: 1
abstracting: (0<=p26)
states: 2,103,033,241 (9)
abstracting: (p26<=0)
states: 1,911,848,401 (9)
abstracting: (0<=p85)
states: 2,103,033,241 (9)
abstracting: (p85<=0)
states: 1
abstracting: (0<=p63)
states: 2,103,033,241 (9)
abstracting: (p63<=0)
states: 1,911,848,401 (9)
abstracting: (1<=p71)
states: 191,184,840 (8)
abstracting: (p71<=1)
states: 2,103,033,241 (9)
..........................
EG iterations: 26
abstracting: (1<=p33)
states: 196,072,272 (8)
abstracting: (p33<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p55)
states: 201,752,980 (8)
abstracting: (p55<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
.-> the formula is FALSE

FORMULA DiscoveryGPU-PT-09a-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.858sec

checking: A [[[p71<=1 & 1<=p71] & [p85<=1 & 1<=p85]] U EF [[[EG [EX [[[p30<=1 & 1<=p30] & [p85<=1 & 1<=p85]]]] & [p54<=1 & 1<=p54]] & [[p85<=1 & 1<=p85] & [EF [[[p76<=1 & 1<=p76] & [p85<=1 & 1<=p85]]] & [AX [[[p50<=1 & 1<=p50] & [p85<=1 & 1<=p85]]] | EG [[[p78<=1 & 1<=p78] & [p86<=1 & 1<=p86]]]]]]]]]
normalized: [~ [EG [~ [E [true U [[[[~ [EX [~ [[[p85<=1 & 1<=p85] & [p50<=1 & 1<=p50]]]]] | EG [[[p86<=1 & 1<=p86] & [p78<=1 & 1<=p78]]]] & E [true U [[p85<=1 & 1<=p85] & [p76<=1 & 1<=p76]]]] & [p85<=1 & 1<=p85]] & [[p54<=1 & 1<=p54] & EG [EX [[[p85<=1 & 1<=p85] & [p30<=1 & 1<=p30]]]]]]]]]] & ~ [E [~ [E [true U [[[[~ [EX [~ [[[p85<=1 & 1<=p85] & [p50<=1 & 1<=p50]]]]] | EG [[[p86<=1 & 1<=p86] & [p78<=1 & 1<=p78]]]] & E [true U [[p85<=1 & 1<=p85] & [p76<=1 & 1<=p76]]]] & [p85<=1 & 1<=p85]] & [[p54<=1 & 1<=p54] & EG [EX [[[p85<=1 & 1<=p85] & [p30<=1 & 1<=p30]]]]]]]] U [~ [E [true U [[[[~ [EX [~ [[[p85<=1 & 1<=p85] & [p50<=1 & 1<=p50]]]]] | EG [[[p86<=1 & 1<=p86] & [p78<=1 & 1<=p78]]]] & E [true U [[p85<=1 & 1<=p85] & [p76<=1 & 1<=p76]]]] & [p85<=1 & 1<=p85]] & [[p54<=1 & 1<=p54] & EG [EX [[[p85<=1 & 1<=p85] & [p30<=1 & 1<=p30]]]]]]]] & ~ [[[p85<=1 & 1<=p85] & [p71<=1 & 1<=p71]]]]]]]

abstracting: (1<=p71)
states: 191,184,840 (8)
abstracting: (p71<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p30)
states: 191,184,840 (8)
abstracting: (p30<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
..........................
EG iterations: 25
abstracting: (1<=p54)
states: 201,752,980 (8)
abstracting: (p54<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p76)
states: 196,072,272 (8)
abstracting: (p76<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p78)
states: 196,072,272 (8)
abstracting: (p78<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
..........................
EG iterations: 26
abstracting: (1<=p50)
states: 201,752,980 (8)
abstracting: (p50<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
.abstracting: (1<=p30)
states: 191,184,840 (8)
abstracting: (p30<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
..........................
EG iterations: 25
abstracting: (1<=p54)
states: 201,752,980 (8)
abstracting: (p54<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p76)
states: 196,072,272 (8)
abstracting: (p76<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p78)
states: 196,072,272 (8)
abstracting: (p78<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
..........................
EG iterations: 26
abstracting: (1<=p50)
states: 201,752,980 (8)
abstracting: (p50<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
.abstracting: (1<=p30)
states: 191,184,840 (8)
abstracting: (p30<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
..........................
EG iterations: 25
abstracting: (1<=p54)
states: 201,752,980 (8)
abstracting: (p54<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p76)
states: 196,072,272 (8)
abstracting: (p76<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p78)
states: 196,072,272 (8)
abstracting: (p78<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
..........................
EG iterations: 26
abstracting: (1<=p50)
states: 201,752,980 (8)
abstracting: (p50<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
..
EG iterations: 1
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-09a-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.107sec

checking: [[EF [EX [[p13<=1 & 1<=p13]]] & EG [[[[[p40<=1 & 1<=p40] & [p86<=1 & 1<=p86]] | [[p51<=1 & 1<=p51] & [p85<=1 & 1<=p85]]] | [AF [[p23<=1 & 1<=p23]] | AG [~ [A [[p61<=1 & 1<=p61] U [p21<=1 & 1<=p21]]]]]]]] | [AG [EX [[p1<=0 & 0<=p1]]] & ~ [A [E [[A [[p59<=1 & 1<=p59] U [p40<=1 & 1<=p40]] & ~ [[p59<=1 & 1<=p59]]] U ~ [[[[p30<=1 & 1<=p30] & [p85<=1 & 1<=p85]] & [[p10<=1 & 1<=p10] & [p85<=1 & 1<=p85]]]]] U E [[[p50<=1 & 1<=p50] & [p85<=1 & 1<=p85]] U [[p57<=1 & 1<=p57] & [p85<=1 & 1<=p85]]]]]]]
normalized: [[~ [[~ [EG [~ [E [[[p85<=1 & 1<=p85] & [p50<=1 & 1<=p50]] U [[p85<=1 & 1<=p85] & [p57<=1 & 1<=p57]]]]]] & ~ [E [~ [E [[[p85<=1 & 1<=p85] & [p50<=1 & 1<=p50]] U [[p85<=1 & 1<=p85] & [p57<=1 & 1<=p57]]]] U [~ [E [[[p85<=1 & 1<=p85] & [p50<=1 & 1<=p50]] U [[p85<=1 & 1<=p85] & [p57<=1 & 1<=p57]]]] & ~ [E [[~ [[p59<=1 & 1<=p59]] & [~ [EG [~ [[p40<=1 & 1<=p40]]]] & ~ [E [~ [[p40<=1 & 1<=p40]] U [~ [[p40<=1 & 1<=p40]] & ~ [[p59<=1 & 1<=p59]]]]]]] U ~ [[[[p85<=1 & 1<=p85] & [p30<=1 & 1<=p30]] & [[p10<=1 & 1<=p10] & [p85<=1 & 1<=p85]]]]]]]]]]] & ~ [E [true U ~ [EX [[p1<=0 & 0<=p1]]]]]] | [EG [[[~ [E [true U [~ [EG [~ [[p21<=1 & 1<=p21]]]] & ~ [E [~ [[p21<=1 & 1<=p21]] U [~ [[p61<=1 & 1<=p61]] & ~ [[p21<=1 & 1<=p21]]]]]]]] | ~ [EG [~ [[p23<=1 & 1<=p23]]]]] | [[[p85<=1 & 1<=p85] & [p51<=1 & 1<=p51]] | [[p86<=1 & 1<=p86] & [p40<=1 & 1<=p40]]]]] & E [true U EX [[p13<=1 & 1<=p13]]]]]

abstracting: (1<=p13)
states: 201,752,980 (8)
abstracting: (p13<=1)
states: 2,103,033,241 (9)
.abstracting: (1<=p40)
states: 201,752,980 (8)
abstracting: (p40<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p51)
states: 201,752,980 (8)
abstracting: (p51<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p23)
states: 191,184,840 (8)
abstracting: (p23<=1)
states: 2,103,033,241 (9)
.
EG iterations: 1
abstracting: (1<=p21)
states: 191,184,840 (8)
abstracting: (p21<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p61)
states: 191,184,840 (8)
abstracting: (p61<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p21)
states: 191,184,840 (8)
abstracting: (p21<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p21)
states: 191,184,840 (8)
abstracting: (p21<=1)
states: 2,103,033,241 (9)
...........................
EG iterations: 27
.........................
EG iterations: 25
abstracting: (0<=p1)
states: 2,103,033,241 (9)
abstracting: (p1<=0)
states: 1,911,848,401 (9)
.abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p10)
states: 191,184,840 (8)
abstracting: (p10<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p30)
states: 191,184,840 (8)
abstracting: (p30<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p59)
states: 191,184,840 (8)
abstracting: (p59<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p40)
states: 201,752,980 (8)
abstracting: (p40<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p40)
states: 201,752,980 (8)
abstracting: (p40<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p40)
states: 201,752,980 (8)
abstracting: (p40<=1)
states: 2,103,033,241 (9)
.
EG iterations: 1
abstracting: (1<=p59)
states: 191,184,840 (8)
abstracting: (p59<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p57)
states: 191,184,840 (8)
abstracting: (p57<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p50)
states: 201,752,980 (8)
abstracting: (p50<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p57)
states: 191,184,840 (8)
abstracting: (p57<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p50)
states: 201,752,980 (8)
abstracting: (p50<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p57)
states: 191,184,840 (8)
abstracting: (p57<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p50)
states: 201,752,980 (8)
abstracting: (p50<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
...........................
EG iterations: 27
-> the formula is FALSE

FORMULA DiscoveryGPU-PT-09a-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.723sec

checking: E [[EG [EF [[p48<=1 & 1<=p48]]] & ~ [AG [AF [EG [[[p40<=1 & 1<=p40] & [p86<=1 & 1<=p86]]]]]]] U [[AX [A [~ [[[p48<=1 & 1<=p48] & [p86<=1 & 1<=p86]]] U [[[p36<=1 & 1<=p36] & [p85<=1 & 1<=p85]] | [[p31<=1 & 1<=p31] & [p85<=1 & 1<=p85]]]]] | E [EG [[[[p38<=1 & 1<=p38] & [p85<=1 & 1<=p85]] & [[p48<=1 & 1<=p48] & [p86<=1 & 1<=p86]]]] U AG [AX [[[p59<=1 & 1<=p59] & [p86<=1 & 1<=p86]]]]]] | [AX [[[AX [[p77<=1 & 1<=p77]] & AX [[[p18<=1 & 1<=p18] & [p86<=1 & 1<=p86]]]] & [[p68<=1 & 1<=p68] & [[p30<=1 & 1<=p30] & [p85<=1 & 1<=p85]]]]] | [[p25<=1 & 1<=p25] & [p85<=1 & 1<=p85]]]]]
normalized: E [[E [true U EG [~ [EG [[[p86<=1 & 1<=p86] & [p40<=1 & 1<=p40]]]]]] & EG [E [true U [p48<=1 & 1<=p48]]]] U [[~ [EX [~ [[[[[p85<=1 & 1<=p85] & [p30<=1 & 1<=p30]] & [p68<=1 & 1<=p68]] & [~ [EX [~ [[[p86<=1 & 1<=p86] & [p18<=1 & 1<=p18]]]]] & ~ [EX [~ [[p77<=1 & 1<=p77]]]]]]]]] | [[p85<=1 & 1<=p85] & [p25<=1 & 1<=p25]]] | [E [EG [[[[p86<=1 & 1<=p86] & [p48<=1 & 1<=p48]] & [[p85<=1 & 1<=p85] & [p38<=1 & 1<=p38]]]] U ~ [E [true U EX [~ [[[p86<=1 & 1<=p86] & [p59<=1 & 1<=p59]]]]]]] | ~ [EX [~ [[~ [EG [~ [[[[p85<=1 & 1<=p85] & [p31<=1 & 1<=p31]] | [[p85<=1 & 1<=p85] & [p36<=1 & 1<=p36]]]]]] & ~ [E [~ [[[[p85<=1 & 1<=p85] & [p31<=1 & 1<=p31]] | [[p85<=1 & 1<=p85] & [p36<=1 & 1<=p36]]]] U [[[p86<=1 & 1<=p86] & [p48<=1 & 1<=p48]] & ~ [[[[p85<=1 & 1<=p85] & [p31<=1 & 1<=p31]] | [[p85<=1 & 1<=p85] & [p36<=1 & 1<=p36]]]]]]]]]]]]]]

abstracting: (1<=p36)
states: 196,072,272 (8)
abstracting: (p36<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p31)
states: 196,072,272 (8)
abstracting: (p31<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p48)
states: 201,752,980 (8)
abstracting: (p48<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p36)
states: 196,072,272 (8)
abstracting: (p36<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p31)
states: 196,072,272 (8)
abstracting: (p31<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p36)
states: 196,072,272 (8)
abstracting: (p36<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p31)
states: 196,072,272 (8)
abstracting: (p31<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
..........................
EG iterations: 26
.abstracting: (1<=p59)
states: 191,184,840 (8)
abstracting: (p59<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
.abstracting: (1<=p38)
states: 196,072,272 (8)
abstracting: (p38<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p48)
states: 201,752,980 (8)
abstracting: (p48<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
.......................
EG iterations: 23
abstracting: (1<=p25)
states: 191,184,840 (8)
abstracting: (p25<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p77)
states: 196,072,272 (8)
abstracting: (p77<=1)
states: 2,103,033,241 (9)
.abstracting: (1<=p18)
states: 201,752,980 (8)
abstracting: (p18<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
.abstracting: (1<=p68)
states: 191,184,840 (8)
abstracting: (p68<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p30)
states: 191,184,840 (8)
abstracting: (p30<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
.abstracting: (1<=p48)
states: 201,752,980 (8)
abstracting: (p48<=1)
states: 2,103,033,241 (9)
..........................
EG iterations: 26
abstracting: (1<=p40)
states: 201,752,980 (8)
abstracting: (p40<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
..........................
EG iterations: 26
.
EG iterations: 1
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-09a-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m29.818sec

checking: A [E [A [[[p41<=1 & 1<=p41] & [p86<=1 & 1<=p86]] U EG [[[p13<=1 & 1<=p13] & [p86<=1 & 1<=p86]]]] U [E [[p49<=1 & 1<=p49] U [[[p47<=1 & 1<=p47] & [p85<=1 & 1<=p85]] | [[1<=p73 & p73<=1] & [p86<=1 & 1<=p86]]]] & [EG [[[p50<=1 & 1<=p50] & [p85<=1 & 1<=p85]]] & EX [~ [[[p48<=1 & 1<=p48] | [[p46<=1 & 1<=p46] & [p85<=1 & 1<=p85]]]]]]]] U E [~ [[[A [AX [[p49<=1 & 1<=p49]] U E [[p66<=1 & 1<=p66] U [[p53<=1 & 1<=p53] & [p86<=1 & 1<=p86]]]] & [p52<=1 & 1<=p52]] & [[p85<=1 & 1<=p85] & E [[[p74<=1 & 1<=p74] & [p85<=1 & 1<=p85]] U [[p34<=1 & 1<=p34] & [p85<=1 & 1<=p85]]]]]] U [[p69<=1 & 1<=p69] & [p86<=1 & 1<=p86]]]]
normalized: [~ [EG [~ [E [~ [[[E [[[p85<=1 & 1<=p85] & [p74<=1 & 1<=p74]] U [[p85<=1 & 1<=p85] & [p34<=1 & 1<=p34]]] & [p85<=1 & 1<=p85]] & [[p52<=1 & 1<=p52] & [~ [EG [~ [E [[p66<=1 & 1<=p66] U [[p86<=1 & 1<=p86] & [p53<=1 & 1<=p53]]]]]] & ~ [E [~ [E [[p66<=1 & 1<=p66] U [[p86<=1 & 1<=p86] & [p53<=1 & 1<=p53]]]] U [EX [~ [[p49<=1 & 1<=p49]]] & ~ [E [[p66<=1 & 1<=p66] U [[p86<=1 & 1<=p86] & [p53<=1 & 1<=p53]]]]]]]]]]] U [[p86<=1 & 1<=p86] & [p69<=1 & 1<=p69]]]]]] & ~ [E [~ [E [~ [[[E [[[p85<=1 & 1<=p85] & [p74<=1 & 1<=p74]] U [[p85<=1 & 1<=p85] & [p34<=1 & 1<=p34]]] & [p85<=1 & 1<=p85]] & [[p52<=1 & 1<=p52] & [~ [EG [~ [E [[p66<=1 & 1<=p66] U [[p86<=1 & 1<=p86] & [p53<=1 & 1<=p53]]]]]] & ~ [E [~ [E [[p66<=1 & 1<=p66] U [[p86<=1 & 1<=p86] & [p53<=1 & 1<=p53]]]] U [EX [~ [[p49<=1 & 1<=p49]]] & ~ [E [[p66<=1 & 1<=p66] U [[p86<=1 & 1<=p86] & [p53<=1 & 1<=p53]]]]]]]]]]] U [[p86<=1 & 1<=p86] & [p69<=1 & 1<=p69]]]] U [~ [E [[~ [EG [~ [EG [[[p86<=1 & 1<=p86] & [p13<=1 & 1<=p13]]]]]] & ~ [E [~ [EG [[[p86<=1 & 1<=p86] & [p13<=1 & 1<=p13]]]] U [~ [[[p86<=1 & 1<=p86] & [p41<=1 & 1<=p41]]] & ~ [EG [[[p86<=1 & 1<=p86] & [p13<=1 & 1<=p13]]]]]]]] U [E [[p49<=1 & 1<=p49] U [[[p86<=1 & 1<=p86] & [1<=p73 & p73<=1]] | [[p85<=1 & 1<=p85] & [p47<=1 & 1<=p47]]]] & [EX [~ [[[[p85<=1 & 1<=p85] & [p46<=1 & 1<=p46]] | [p48<=1 & 1<=p48]]]] & EG [[[p85<=1 & 1<=p85] & [p50<=1 & 1<=p50]]]]]]] & ~ [E [~ [[[E [[[p85<=1 & 1<=p85] & [p74<=1 & 1<=p74]] U [[p85<=1 & 1<=p85] & [p34<=1 & 1<=p34]]] & [p85<=1 & 1<=p85]] & [[p52<=1 & 1<=p52] & [~ [EG [~ [E [[p66<=1 & 1<=p66] U [[p86<=1 & 1<=p86] & [p53<=1 & 1<=p53]]]]]] & ~ [E [~ [E [[p66<=1 & 1<=p66] U [[p86<=1 & 1<=p86] & [p53<=1 & 1<=p53]]]] U [EX [~ [[p49<=1 & 1<=p49]]] & ~ [E [[p66<=1 & 1<=p66] U [[p86<=1 & 1<=p86] & [p53<=1 & 1<=p53]]]]]]]]]]] U [[p86<=1 & 1<=p86] & [p69<=1 & 1<=p69]]]]]]]]

abstracting: (1<=p69)
states: 191,184,840 (8)
abstracting: (p69<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p53)
states: 201,752,980 (8)
abstracting: (p53<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p66)
states: 191,184,840 (8)
abstracting: (p66<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p49)
states: 201,752,980 (8)
abstracting: (p49<=1)
states: 2,103,033,241 (9)
.abstracting: (1<=p53)
states: 201,752,980 (8)
abstracting: (p53<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p66)
states: 191,184,840 (8)
abstracting: (p66<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p53)
states: 201,752,980 (8)
abstracting: (p53<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p66)
states: 191,184,840 (8)
abstracting: (p66<=1)
states: 2,103,033,241 (9)
.........................
EG iterations: 25
abstracting: (1<=p52)
states: 201,752,980 (8)
abstracting: (p52<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p34)
states: 196,072,272 (8)
abstracting: (p34<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p74)
states: 191,184,840 (8)
abstracting: (p74<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p50)
states: 201,752,980 (8)
abstracting: (p50<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
..........................
EG iterations: 26
abstracting: (1<=p48)
states: 201,752,980 (8)
abstracting: (p48<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p46)
states: 201,752,980 (8)
abstracting: (p46<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
.abstracting: (1<=p47)
states: 201,752,980 (8)
abstracting: (p47<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (p73<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p73)
states: 191,184,840 (8)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p49)
states: 201,752,980 (8)
abstracting: (p49<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p13)
states: 201,752,980 (8)
abstracting: (p13<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
..........................
EG iterations: 26
abstracting: (1<=p41)
states: 201,752,980 (8)
abstracting: (p41<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p13)
states: 201,752,980 (8)
abstracting: (p13<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
..........................
EG iterations: 26
abstracting: (1<=p13)
states: 201,752,980 (8)
abstracting: (p13<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
..........................
EG iterations: 26
.
EG iterations: 1
abstracting: (1<=p69)
states: 191,184,840 (8)
abstracting: (p69<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p53)
states: 201,752,980 (8)
abstracting: (p53<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p66)
states: 191,184,840 (8)
abstracting: (p66<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p49)
states: 201,752,980 (8)
abstracting: (p49<=1)
states: 2,103,033,241 (9)
.abstracting: (1<=p53)
states: 201,752,980 (8)
abstracting: (p53<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p66)
states: 191,184,840 (8)
abstracting: (p66<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p53)
states: 201,752,980 (8)
abstracting: (p53<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p66)
states: 191,184,840 (8)
abstracting: (p66<=1)
states: 2,103,033,241 (9)
.........................
EG iterations: 25
abstracting: (1<=p52)
states: 201,752,980 (8)
abstracting: (p52<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p34)
states: 196,072,272 (8)
abstracting: (p34<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p74)
states: 191,184,840 (8)
abstracting: (p74<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p69)
states: 191,184,840 (8)
abstracting: (p69<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p53)
states: 201,752,980 (8)
abstracting: (p53<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p66)
states: 191,184,840 (8)
abstracting: (p66<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p49)
states: 201,752,980 (8)
abstracting: (p49<=1)
states: 2,103,033,241 (9)
.abstracting: (1<=p53)
states: 201,752,980 (8)
abstracting: (p53<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p66)
states: 191,184,840 (8)
abstracting: (p66<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p53)
states: 201,752,980 (8)
abstracting: (p53<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p66)
states: 191,184,840 (8)
abstracting: (p66<=1)
states: 2,103,033,241 (9)
.........................
EG iterations: 25
abstracting: (1<=p52)
states: 201,752,980 (8)
abstracting: (p52<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p34)
states: 196,072,272 (8)
abstracting: (p34<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p74)
states: 191,184,840 (8)
abstracting: (p74<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-09a-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.720sec

checking: [~ [E [[[[~ [[[p68<=1 & 1<=p68] & [[p42<=1 & 1<=p42] & [p85<=1 & 1<=p85]]]] & [p30<=1 & 1<=p30]] & [[p85<=1 & 1<=p85] & ~ [[[p61<=1 & 1<=p61] & [p85<=1 & 1<=p85]]]]] | [[[p62<=1 & 1<=p62] & [p85<=1 & 1<=p85]] | AG [[A [[[p7<=1 & 1<=p7] & [p85<=1 & 1<=p85]] U [p37<=1 & 1<=p37]] | EX [[[p84<=1 & 1<=p84] & [p85<=1 & 1<=p85]]]]]]] U [~ [[[[p28<=1 & 1<=p28] & [p86<=1 & 1<=p86]] | E [[[p45<=1 & 1<=p45] & [p86<=1 & 1<=p86]] U [[p27<=1 & 1<=p27] & [p85<=1 & 1<=p85]]]]] | [p56<=1 & 1<=p56]]]] | EF [[[[p63<=1 & 1<=p63] & [p86<=1 & 1<=p86]] & [[p40<=1 & 1<=p40] & AF [[[p33<=0 & 0<=p33] | [p86<=0 & 0<=p86]]]]]]]
normalized: [E [true U [[~ [EG [~ [[[p86<=0 & 0<=p86] | [p33<=0 & 0<=p33]]]]] & [p40<=1 & 1<=p40]] & [[p86<=1 & 1<=p86] & [p63<=1 & 1<=p63]]]] | ~ [E [[[~ [E [true U ~ [[EX [[[p85<=1 & 1<=p85] & [p84<=1 & 1<=p84]]] | [~ [EG [~ [[p37<=1 & 1<=p37]]]] & ~ [E [~ [[p37<=1 & 1<=p37]] U [~ [[[p85<=1 & 1<=p85] & [p7<=1 & 1<=p7]]] & ~ [[p37<=1 & 1<=p37]]]]]]]]]] | [[p85<=1 & 1<=p85] & [p62<=1 & 1<=p62]]] | [[~ [[[p85<=1 & 1<=p85] & [p61<=1 & 1<=p61]]] & [p85<=1 & 1<=p85]] & [[p30<=1 & 1<=p30] & ~ [[[[p85<=1 & 1<=p85] & [p42<=1 & 1<=p42]] & [p68<=1 & 1<=p68]]]]]] U [[p56<=1 & 1<=p56] | ~ [[E [[[p86<=1 & 1<=p86] & [p45<=1 & 1<=p45]] U [[p85<=1 & 1<=p85] & [p27<=1 & 1<=p27]]] | [[p86<=1 & 1<=p86] & [p28<=1 & 1<=p28]]]]]]]]

abstracting: (1<=p28)
states: 191,184,840 (8)
abstracting: (p28<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p27)
states: 191,184,840 (8)
abstracting: (p27<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p45)
states: 201,752,980 (8)
abstracting: (p45<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p56)
states: 191,184,840 (8)
abstracting: (p56<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p68)
states: 191,184,840 (8)
abstracting: (p68<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p42)
states: 201,752,980 (8)
abstracting: (p42<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p30)
states: 191,184,840 (8)
abstracting: (p30<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p61)
states: 191,184,840 (8)
abstracting: (p61<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p62)
states: 191,184,840 (8)
abstracting: (p62<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p37)
states: 196,072,272 (8)
abstracting: (p37<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p7)
states: 191,184,840 (8)
abstracting: (p7<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p37)
states: 196,072,272 (8)
abstracting: (p37<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p37)
states: 196,072,272 (8)
abstracting: (p37<=1)
states: 2,103,033,241 (9)
...........................
EG iterations: 27
abstracting: (1<=p84)
states: 196,072,272 (8)
abstracting: (p84<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
.abstracting: (1<=p63)
states: 191,184,840 (8)
abstracting: (p63<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p40)
states: 201,752,980 (8)
abstracting: (p40<=1)
states: 2,103,033,241 (9)
abstracting: (0<=p33)
states: 2,103,033,241 (9)
abstracting: (p33<=0)
states: 1,906,960,969 (9)
abstracting: (0<=p86)
states: 2,103,033,241 (9)
abstracting: (p86<=0)
states: 1
..........................
EG iterations: 26
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-09a-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.787sec

checking: [E [AG [[[p6<=1 & 1<=p6] & [p85<=1 & 1<=p85]]] U [AG [[[[[[p77<=1 & 1<=p77] & [[p74<=1 & 1<=p74] & [p85<=1 & 1<=p85]]] | AX [[[p69<=1 & 1<=p69] & [p86<=1 & 1<=p86]]]] & [[p4<=1 & 1<=p4] | [[p32<=1 & 1<=p32] & [p86<=1 & 1<=p86]]]] & [[p13<=1 & 1<=p13] & [p86<=1 & 1<=p86]]]] & [A [AG [[[p3<=1 & 1<=p3] & [p86<=1 & 1<=p86]]] U EX [[[p18<=1 & 1<=p18] & [p86<=1 & 1<=p86]]]] | E [A [[p18<=1 & 1<=p18] U [[p42<=1 & 1<=p42] & [p85<=1 & 1<=p85]]] U [E [[p8<=1 & 1<=p8] U [[p65<=1 & 1<=p65] & [p85<=1 & 1<=p85]]] | ~ [[p28<=1 & 1<=p28]]]]]]] | EG [[EF [[[p57<=1 & 1<=p57] & [p85<=1 & 1<=p85]]] & EF [[[[p74<=1 & 1<=p74] & [p85<=1 & 1<=p85]] | [[p27<=1 & 1<=p27] & [p85<=1 & 1<=p85]]]]]]]
normalized: [EG [[E [true U [[[p85<=1 & 1<=p85] & [p27<=1 & 1<=p27]] | [[p85<=1 & 1<=p85] & [p74<=1 & 1<=p74]]]] & E [true U [[p85<=1 & 1<=p85] & [p57<=1 & 1<=p57]]]]] | E [~ [E [true U ~ [[[p85<=1 & 1<=p85] & [p6<=1 & 1<=p6]]]]] U [[E [[~ [EG [~ [[[p85<=1 & 1<=p85] & [p42<=1 & 1<=p42]]]]] & ~ [E [~ [[[p85<=1 & 1<=p85] & [p42<=1 & 1<=p42]]] U [~ [[p18<=1 & 1<=p18]] & ~ [[[p85<=1 & 1<=p85] & [p42<=1 & 1<=p42]]]]]]] U [~ [[p28<=1 & 1<=p28]] | E [[p8<=1 & 1<=p8] U [[p85<=1 & 1<=p85] & [p65<=1 & 1<=p65]]]]] | [~ [EG [~ [EX [[[p86<=1 & 1<=p86] & [p18<=1 & 1<=p18]]]]]] & ~ [E [~ [EX [[[p86<=1 & 1<=p86] & [p18<=1 & 1<=p18]]]] U [E [true U ~ [[[p86<=1 & 1<=p86] & [p3<=1 & 1<=p3]]]] & ~ [EX [[[p86<=1 & 1<=p86] & [p18<=1 & 1<=p18]]]]]]]]] & ~ [E [true U ~ [[[[p86<=1 & 1<=p86] & [p13<=1 & 1<=p13]] & [[[[p86<=1 & 1<=p86] & [p32<=1 & 1<=p32]] | [p4<=1 & 1<=p4]] & [~ [EX [~ [[[p86<=1 & 1<=p86] & [p69<=1 & 1<=p69]]]]] | [[[p85<=1 & 1<=p85] & [p74<=1 & 1<=p74]] & [p77<=1 & 1<=p77]]]]]]]]]]]

abstracting: (1<=p77)
states: 196,072,272 (8)
abstracting: (p77<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p74)
states: 191,184,840 (8)
abstracting: (p74<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p69)
states: 191,184,840 (8)
abstracting: (p69<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
.abstracting: (1<=p4)
states: 191,184,840 (8)
abstracting: (p4<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p32)
states: 196,072,272 (8)
abstracting: (p32<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p13)
states: 201,752,980 (8)
abstracting: (p13<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p18)
states: 201,752,980 (8)
abstracting: (p18<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
.abstracting: (1<=p3)
states: 191,184,840 (8)
abstracting: (p3<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p18)
states: 201,752,980 (8)
abstracting: (p18<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
.abstracting: (1<=p18)
states: 201,752,980 (8)
abstracting: (p18<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p86)
states: 2,103,033,240 (9)
abstracting: (p86<=1)
states: 2,103,033,241 (9)
...........................
EG iterations: 26
abstracting: (1<=p65)
states: 191,184,840 (8)
abstracting: (p65<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p8)
states: 191,184,840 (8)
abstracting: (p8<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p28)
states: 191,184,840 (8)
abstracting: (p28<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p42)
states: 201,752,980 (8)
abstracting: (p42<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p18)
states: 201,752,980 (8)
abstracting: (p18<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p42)
states: 201,752,980 (8)
abstracting: (p42<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p42)
states: 201,752,980 (8)
abstracting: (p42<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
.
EG iterations: 1
abstracting: (1<=p6)
states: 191,184,840 (8)
abstracting: (p6<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p57)
states: 191,184,840 (8)
abstracting: (p57<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p74)
states: 191,184,840 (8)
abstracting: (p74<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p27)
states: 191,184,840 (8)
abstracting: (p27<=1)
states: 2,103,033,241 (9)
abstracting: (1<=p85)
states: 2,103,033,240 (9)
abstracting: (p85<=1)
states: 2,103,033,241 (9)
........................
EG iterations: 24
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-09a-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m29.241sec

totally nodes used: 61678566 (6.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 78846700 161128363 239975063
used/not used/entry size/cache size: 63217243 3891621 16 1024MB
basic ops cache: hits/miss/sum: 49726568 108172923 157899491
used/not used/entry size/cache size: 16774128 3088 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: 266713 537992 804705
used/not used/entry size/cache size: 521562 7867046 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 27008213
1 24349572
2 11204138
3 3505918
4 842269
5 165730
6 27871
7 4289
8 558
9 122
>= 10 184

Total processing time: 3m52.766sec


BK_STOP 1678752346607

--------------------
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:3616 (32), effective:91 (0)

initing FirstDep: 0m 0.000sec


iterations count:3176 (28), effective:91 (0)

iterations count:237 (2), effective:3 (0)

iterations count:510 (4), effective:7 (0)

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

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

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

iterations count:425 (3), effective:13 (0)

iterations count:295 (2), effective:17 (0)

iterations count:623 (5), effective:13 (0)

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

iterations count:642 (5), effective:15 (0)

iterations count:434 (3), effective:7 (0)

iterations count:457 (4), effective:8 (0)

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

iterations count:434 (3), effective:7 (0)

iterations count:457 (4), effective:8 (0)

iterations count:434 (3), effective:7 (0)

iterations count:457 (4), effective:8 (0)

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

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

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

iterations count:298 (2), effective:4 (0)

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

iterations count:310 (2), effective:4 (0)

iterations count:608 (5), effective:12 (0)

iterations count:602 (5), effective:9 (0)

iterations count:556 (4), effective:9 (0)

iterations count:602 (5), effective:9 (0)

iterations count:556 (4), effective:9 (0)

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

iterations count:602 (5), effective:9 (0)

iterations count:556 (4), effective:9 (0)

iterations count:396 (3), effective:7 (0)

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

iterations count:566 (5), effective:10 (0)

iterations count:3169 (28), effective:90 (0)

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

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

iterations count:452 (4), effective:8 (0)

iterations count:452 (4), effective:8 (0)

iterations count:496 (4), effective:8 (0)

iterations count:452 (4), effective:8 (0)

iterations count:507 (4), effective:8 (0)

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

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

iterations count:507 (4), effective:8 (0)

iterations count:1993 (17), effective:53 (0)

iterations count:4001 (35), effective:148 (1)

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

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

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

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

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

iterations count:510 (4), effective:7 (0)

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

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

iterations count:401 (3), effective:8 (0)

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

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

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

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

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

iterations count:510 (4), effective:7 (0)

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

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

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

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

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

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

iterations count:510 (4), effective:7 (0)

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

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

iterations count:257 (2), effective:14 (0)

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

iterations count:550 (4), effective:11 (0)

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

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

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

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

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

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

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

iterations count:528 (4), effective:9 (0)

iterations count:319 (2), effective:6 (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="DiscoveryGPU-PT-09a"
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 DiscoveryGPU-PT-09a, 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 r138-smll-167819420300330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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