Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r106-tall-167814483100682.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 DLCround-PT-07a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483100682
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 7.4K Feb 25 19:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 19:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 18:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 18:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 19:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 19:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 19:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 19:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 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 398K 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 DLCround-PT-07a-CTLFireability-00
FORMULA_NAME DLCround-PT-07a-CTLFireability-01
FORMULA_NAME DLCround-PT-07a-CTLFireability-02
FORMULA_NAME DLCround-PT-07a-CTLFireability-03
FORMULA_NAME DLCround-PT-07a-CTLFireability-04
FORMULA_NAME DLCround-PT-07a-CTLFireability-05
FORMULA_NAME DLCround-PT-07a-CTLFireability-06
FORMULA_NAME DLCround-PT-07a-CTLFireability-07
FORMULA_NAME DLCround-PT-07a-CTLFireability-08
FORMULA_NAME DLCround-PT-07a-CTLFireability-09
FORMULA_NAME DLCround-PT-07a-CTLFireability-10
FORMULA_NAME DLCround-PT-07a-CTLFireability-11
FORMULA_NAME DLCround-PT-07a-CTLFireability-12
FORMULA_NAME DLCround-PT-07a-CTLFireability-13
FORMULA_NAME DLCround-PT-07a-CTLFireability-14
FORMULA_NAME DLCround-PT-07a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678455529941

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=DLCround-PT-07a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 13:38:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 13:38:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 13:38:51] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-03-10 13:38:51] [INFO ] Transformed 229 places.
[2023-03-10 13:38:51] [INFO ] Transformed 1597 transitions.
[2023-03-10 13:38:51] [INFO ] Found NUPN structural information;
[2023-03-10 13:38:51] [INFO ] Parsed PT model containing 229 places and 1597 transitions and 6125 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 137 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 1437/1437 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 226 transition count 1410
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 226 transition count 1410
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 226 transition count 1409
Drop transitions removed 504 transitions
Redundant transition composition rules discarded 504 transitions
Iterating global reduction 1 with 504 rules applied. Total rules applied 511 place count 226 transition count 905
Applied a total of 511 rules in 59 ms. Remains 226 /229 variables (removed 3) and now considering 905/1437 (removed 532) transitions.
[2023-03-10 13:38:51] [INFO ] Flow matrix only has 166 transitions (discarded 739 similar events)
// Phase 1: matrix 166 rows 226 cols
[2023-03-10 13:38:51] [INFO ] Computed 132 place invariants in 18 ms
[2023-03-10 13:38:52] [INFO ] Implicit Places using invariants in 585 ms returned [106, 108, 109, 112, 115, 116, 122, 124, 125, 126, 128, 129, 130, 132, 136, 138, 140, 141, 142, 144, 145, 148, 149, 150, 153, 154, 156, 158, 162, 166, 170, 176, 181, 182, 183, 188, 190, 192, 194, 195, 196, 202, 203, 204, 210, 213, 215, 219, 221, 223, 224]
Discarding 51 places :
Ensure Unique test removed 226 transitions
Reduce isomorphic transitions removed 226 transitions.
Implicit Place search using SMT only with invariants took 613 ms to find 51 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 175/229 places, 679/1437 transitions.
Drop transitions removed 439 transitions
Redundant transition composition rules discarded 439 transitions
Iterating global reduction 0 with 439 rules applied. Total rules applied 439 place count 175 transition count 240
Applied a total of 439 rules in 11 ms. Remains 175 /175 variables (removed 0) and now considering 240/679 (removed 439) transitions.
[2023-03-10 13:38:52] [INFO ] Flow matrix only has 166 transitions (discarded 74 similar events)
// Phase 1: matrix 166 rows 175 cols
[2023-03-10 13:38:52] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-10 13:38:52] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-10 13:38:52] [INFO ] Flow matrix only has 166 transitions (discarded 74 similar events)
[2023-03-10 13:38:52] [INFO ] Invariant cache hit.
[2023-03-10 13:38:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-10 13:38:52] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 175/229 places, 240/1437 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 825 ms. Remains : 175/229 places, 240/1437 transitions.
Support contains 137 out of 175 places after structural reductions.
[2023-03-10 13:38:52] [INFO ] Flatten gal took : 36 ms
[2023-03-10 13:38:52] [INFO ] Flatten gal took : 20 ms
[2023-03-10 13:38:52] [INFO ] Input system was already deterministic with 240 transitions.
Finished random walk after 2560 steps, including 0 resets, run visited all 102 properties in 113 ms. (steps per millisecond=22 )
[2023-03-10 13:38:52] [INFO ] Flatten gal took : 10 ms
[2023-03-10 13:38:52] [INFO ] Flatten gal took : 11 ms
[2023-03-10 13:38:52] [INFO ] Input system was already deterministic with 240 transitions.
Computed a total of 70 stabilizing places and 1 stable transitions
Graph (complete) has 338 edges and 175 vertex of which 114 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 240/240 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 115 transition count 240
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 84 place count 91 transition count 192
Iterating global reduction 1 with 24 rules applied. Total rules applied 108 place count 91 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 111 place count 91 transition count 189
Applied a total of 111 rules in 7 ms. Remains 91 /175 variables (removed 84) and now considering 189/240 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 91/175 places, 189/240 transitions.
[2023-03-10 13:38:52] [INFO ] Flatten gal took : 6 ms
[2023-03-10 13:38:52] [INFO ] Flatten gal took : 5 ms
[2023-03-10 13:38:52] [INFO ] Input system was already deterministic with 189 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 240/240 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 115 transition count 240
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 87 place count 88 transition count 186
Iterating global reduction 1 with 27 rules applied. Total rules applied 114 place count 88 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 117 place count 88 transition count 183
Applied a total of 117 rules in 7 ms. Remains 88 /175 variables (removed 87) and now considering 183/240 (removed 57) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 88/175 places, 183/240 transitions.
[2023-03-10 13:38:52] [INFO ] Flatten gal took : 5 ms
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 5 ms
[2023-03-10 13:38:53] [INFO ] Input system was already deterministic with 183 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 240/240 transitions.
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 123 transition count 240
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 74 place count 101 transition count 196
Iterating global reduction 1 with 22 rules applied. Total rules applied 96 place count 101 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 99 place count 101 transition count 193
Applied a total of 99 rules in 9 ms. Remains 101 /175 variables (removed 74) and now considering 193/240 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 101/175 places, 193/240 transitions.
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 8 ms
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 7 ms
[2023-03-10 13:38:53] [INFO ] Input system was already deterministic with 193 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 240/240 transitions.
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 130 transition count 240
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 64 place count 111 transition count 202
Iterating global reduction 1 with 19 rules applied. Total rules applied 83 place count 111 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 86 place count 111 transition count 199
Applied a total of 86 rules in 4 ms. Remains 111 /175 variables (removed 64) and now considering 199/240 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 111/175 places, 199/240 transitions.
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 6 ms
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 5 ms
[2023-03-10 13:38:53] [INFO ] Input system was already deterministic with 199 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 240/240 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 116 transition count 240
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 87 place count 88 transition count 184
Iterating global reduction 1 with 28 rules applied. Total rules applied 115 place count 88 transition count 184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 118 place count 88 transition count 181
Applied a total of 118 rules in 4 ms. Remains 88 /175 variables (removed 87) and now considering 181/240 (removed 59) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 88/175 places, 181/240 transitions.
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 5 ms
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 5 ms
[2023-03-10 13:38:53] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 240/240 transitions.
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 119 transition count 240
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 83 place count 92 transition count 186
Iterating global reduction 1 with 27 rules applied. Total rules applied 110 place count 92 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 113 place count 92 transition count 183
Applied a total of 113 rules in 3 ms. Remains 92 /175 variables (removed 83) and now considering 183/240 (removed 57) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 92/175 places, 183/240 transitions.
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 4 ms
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 5 ms
[2023-03-10 13:38:53] [INFO ] Input system was already deterministic with 183 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 240/240 transitions.
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 118 transition count 240
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 82 place count 93 transition count 190
Iterating global reduction 1 with 25 rules applied. Total rules applied 107 place count 93 transition count 190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 110 place count 93 transition count 187
Applied a total of 110 rules in 3 ms. Remains 93 /175 variables (removed 82) and now considering 187/240 (removed 53) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 93/175 places, 187/240 transitions.
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 5 ms
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 5 ms
[2023-03-10 13:38:53] [INFO ] Input system was already deterministic with 187 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 240/240 transitions.
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 118 transition count 240
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 82 place count 93 transition count 190
Iterating global reduction 1 with 25 rules applied. Total rules applied 107 place count 93 transition count 190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 110 place count 93 transition count 187
Applied a total of 110 rules in 3 ms. Remains 93 /175 variables (removed 82) and now considering 187/240 (removed 53) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 93/175 places, 187/240 transitions.
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 5 ms
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 5 ms
[2023-03-10 13:38:53] [INFO ] Input system was already deterministic with 187 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 240/240 transitions.
Graph (trivial) has 220 edges and 175 vertex of which 99 / 175 are part of one of the 12 SCC in 3 ms
Free SCC test removed 87 places
Ensure Unique test removed 202 transitions
Reduce isomorphic transitions removed 202 transitions.
Graph (complete) has 136 edges and 88 vertex of which 28 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 28 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 27 transition count 37
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 20 place count 11 transition count 14
Iterating global reduction 2 with 16 rules applied. Total rules applied 36 place count 11 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 9 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 9 transition count 11
Applied a total of 41 rules in 12 ms. Remains 9 /175 variables (removed 166) and now considering 11/240 (removed 229) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 9/175 places, 11/240 transitions.
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 1 ms
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 1 ms
[2023-03-10 13:38:53] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
FORMULA DLCround-PT-07a-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 240/240 transitions.
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 118 transition count 240
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 81 place count 94 transition count 192
Iterating global reduction 1 with 24 rules applied. Total rules applied 105 place count 94 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 108 place count 94 transition count 189
Applied a total of 108 rules in 3 ms. Remains 94 /175 variables (removed 81) and now considering 189/240 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 94/175 places, 189/240 transitions.
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 4 ms
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 4 ms
[2023-03-10 13:38:53] [INFO ] Input system was already deterministic with 189 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 240/240 transitions.
Graph (trivial) has 213 edges and 175 vertex of which 93 / 175 are part of one of the 12 SCC in 0 ms
Free SCC test removed 81 places
Ensure Unique test removed 187 transitions
Reduce isomorphic transitions removed 187 transitions.
Graph (complete) has 151 edges and 94 vertex of which 34 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 34 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 32 transition count 51
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 23 place count 15 transition count 26
Iterating global reduction 2 with 17 rules applied. Total rules applied 40 place count 15 transition count 26
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 13 transition count 24
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 13 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 13 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 12 transition count 21
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 12 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 12 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 12 transition count 19
Applied a total of 51 rules in 7 ms. Remains 12 /175 variables (removed 163) and now considering 19/240 (removed 221) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 12/175 places, 19/240 transitions.
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 0 ms
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 1 ms
[2023-03-10 13:38:53] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 240/240 transitions.
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 129 transition count 240
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 67 place count 108 transition count 198
Iterating global reduction 1 with 21 rules applied. Total rules applied 88 place count 108 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 89 place count 108 transition count 197
Applied a total of 89 rules in 3 ms. Remains 108 /175 variables (removed 67) and now considering 197/240 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 108/175 places, 197/240 transitions.
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 5 ms
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 11 ms
[2023-03-10 13:38:53] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 240/240 transitions.
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 121 transition count 240
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 77 place count 98 transition count 194
Iterating global reduction 1 with 23 rules applied. Total rules applied 100 place count 98 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 102 place count 98 transition count 192
Applied a total of 102 rules in 3 ms. Remains 98 /175 variables (removed 77) and now considering 192/240 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 98/175 places, 192/240 transitions.
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 4 ms
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 5 ms
[2023-03-10 13:38:53] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 240/240 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 116 transition count 240
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 85 place count 90 transition count 188
Iterating global reduction 1 with 26 rules applied. Total rules applied 111 place count 90 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 114 place count 90 transition count 185
Applied a total of 114 rules in 3 ms. Remains 90 /175 variables (removed 85) and now considering 185/240 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 90/175 places, 185/240 transitions.
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 4 ms
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 4 ms
[2023-03-10 13:38:53] [INFO ] Input system was already deterministic with 185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 240/240 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 134 transition count 240
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 63 place count 112 transition count 196
Iterating global reduction 1 with 22 rules applied. Total rules applied 85 place count 112 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 88 place count 112 transition count 193
Applied a total of 88 rules in 3 ms. Remains 112 /175 variables (removed 63) and now considering 193/240 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 112/175 places, 193/240 transitions.
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 5 ms
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 7 ms
[2023-03-10 13:38:53] [INFO ] Input system was already deterministic with 193 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 240/240 transitions.
Graph (trivial) has 205 edges and 175 vertex of which 88 / 175 are part of one of the 11 SCC in 1 ms
Free SCC test removed 77 places
Ensure Unique test removed 178 transitions
Reduce isomorphic transitions removed 178 transitions.
Graph (complete) has 160 edges and 98 vertex of which 38 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.1 ms
Discarding 60 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 38 transition count 61
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 37 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 36 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 36 transition count 59
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 35 transition count 59
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 24 place count 19 transition count 35
Iterating global reduction 3 with 16 rules applied. Total rules applied 40 place count 19 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 18 transition count 34
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 46 place count 18 transition count 30
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 18 transition count 30
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 17 transition count 29
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 17 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 17 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 17 transition count 27
Applied a total of 51 rules in 15 ms. Remains 17 /175 variables (removed 158) and now considering 27/240 (removed 213) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 17/175 places, 27/240 transitions.
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 4 ms
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 1 ms
[2023-03-10 13:38:53] [INFO ] Input system was already deterministic with 27 transitions.
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 10 ms
[2023-03-10 13:38:53] [INFO ] Flatten gal took : 11 ms
[2023-03-10 13:38:53] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 18 ms.
[2023-03-10 13:38:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 175 places, 240 transitions and 592 arcs took 1 ms.
Total runtime 2238 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: 175 NrTr: 240 NrArc: 592)

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

net check time: 0m 0.000sec

init dd package: 0m 2.736sec


RS generation: 0m 0.086sec


-> reachability set: #nodes 5134 (5.1e+03) #states 151,200,000,001 (11)



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

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

abstracting: (1<=p16)
states: 25,200,000,000 (10)
abstracting: (p16<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p120)
states: 151,200,000,000 (11)
abstracting: (p120<=1)
states: 151,200,000,001 (11)
.-> the formula is TRUE

FORMULA DLCround-PT-07a-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.071sec

checking: EF [AG [[~ [[p64<=1 & 1<=p64]] | ~ [[p164<=1 & 1<=p164]]]]]
normalized: E [true U ~ [E [true U ~ [[~ [[p64<=1 & 1<=p64]] | ~ [[p164<=1 & 1<=p164]]]]]]]

abstracting: (1<=p164)
states: 151,200,000,000 (11)
abstracting: (p164<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p64)
states: 15,120,000,000 (10)
abstracting: (p64<=1)
states: 151,200,000,001 (11)
-> the formula is FALSE

FORMULA DLCround-PT-07a-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: AF [[EX [EF [AG [[[p83<=1 & 1<=p83] & [p163<=1 & 1<=p163]]]]] & AF [~ [A [[[p33<=1 & 1<=p33] & [p143<=1 & 1<=p143]] U [p47<=1 & 1<=p47]]]]]]
normalized: ~ [EG [~ [[~ [EG [[~ [EG [~ [[p47<=1 & 1<=p47]]]] & ~ [E [~ [[p47<=1 & 1<=p47]] U [~ [[[p143<=1 & 1<=p143] & [p33<=1 & 1<=p33]]] & ~ [[p47<=1 & 1<=p47]]]]]]]] & EX [E [true U ~ [E [true U ~ [[[p163<=1 & 1<=p163] & [p83<=1 & 1<=p83]]]]]]]]]]]

abstracting: (1<=p83)
states: 15,120,000,000 (10)
abstracting: (p83<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p163)
states: 151,200,000,000 (11)
abstracting: (p163<=1)
states: 151,200,000,001 (11)
.abstracting: (1<=p47)
states: 15,120,000,000 (10)
abstracting: (p47<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p33)
states: 15,120,000,000 (10)
abstracting: (p33<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p143)
states: 151,200,000,000 (11)
abstracting: (p143<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p47)
states: 15,120,000,000 (10)
abstracting: (p47<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p47)
states: 15,120,000,000 (10)
abstracting: (p47<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA DLCround-PT-07a-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.088sec

checking: EG [AF [[EF [[AF [[[p59<=1 & 1<=p59] & [p122<=1 & 1<=p122]]] & [p96<=0 & 0<=p96]]] & EX [[[p45<=1 & 1<=p45] & [p145<=1 & 1<=p145]]]]]]
normalized: EG [~ [EG [~ [[EX [[[p145<=1 & 1<=p145] & [p45<=1 & 1<=p45]]] & E [true U [[p96<=0 & 0<=p96] & ~ [EG [~ [[[p122<=1 & 1<=p122] & [p59<=1 & 1<=p59]]]]]]]]]]]]

abstracting: (1<=p59)
states: 15,120,000,000 (10)
abstracting: (p59<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p122)
states: 151,200,000,000 (11)
abstracting: (p122<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
abstracting: (0<=p96)
states: 151,200,000,001 (11)
abstracting: (p96<=0)
states: 136,080,000,001 (11)
abstracting: (1<=p45)
states: 15,120,000,000 (10)
abstracting: (p45<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p145)
states: 151,200,000,000 (11)
abstracting: (p145<=1)
states: 151,200,000,001 (11)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA DLCround-PT-07a-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.155sec

checking: AG [[AF [[AG [[[p19<=1 & 1<=p19] & [p137<=1 & 1<=p137]]] | [p94<=0 & 0<=p94]]] | [[p43<=1 & 1<=p43] & [p115<=1 & 1<=p115]]]]
normalized: ~ [E [true U ~ [[[[p115<=1 & 1<=p115] & [p43<=1 & 1<=p43]] | ~ [EG [~ [[[p94<=0 & 0<=p94] | ~ [E [true U ~ [[[p137<=1 & 1<=p137] & [p19<=1 & 1<=p19]]]]]]]]]]]]]

abstracting: (1<=p19)
states: 25,200,000,000 (10)
abstracting: (p19<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p137)
states: 151,200,000,000 (11)
abstracting: (p137<=1)
states: 151,200,000,001 (11)
abstracting: (0<=p94)
states: 151,200,000,001 (11)
abstracting: (p94<=0)
states: 136,080,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p43)
states: 15,120,000,000 (10)
abstracting: (p43<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p115)
states: 151,200,000,000 (11)
abstracting: (p115<=1)
states: 151,200,000,001 (11)
-> the formula is FALSE

FORMULA DLCround-PT-07a-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: EF [AG [[[p59<=0 & 0<=p59] | [AX [[[p19<=0 & 0<=p19] | [p121<=0 & 0<=p121]]] & [[p41<=1 & 1<=p41] | [[p96<=0 & 0<=p96] & [[p7<=0 & 0<=p7] | [p106<=0 & 0<=p106]]]]]]]]
normalized: E [true U ~ [E [true U ~ [[[[[[[p106<=0 & 0<=p106] | [p7<=0 & 0<=p7]] & [p96<=0 & 0<=p96]] | [p41<=1 & 1<=p41]] & ~ [EX [~ [[[p121<=0 & 0<=p121] | [p19<=0 & 0<=p19]]]]]] | [p59<=0 & 0<=p59]]]]]]

abstracting: (0<=p59)
states: 151,200,000,001 (11)
abstracting: (p59<=0)
states: 136,080,000,001 (11)
abstracting: (0<=p19)
states: 151,200,000,001 (11)
abstracting: (p19<=0)
states: 126,000,000,001 (11)
abstracting: (0<=p121)
states: 151,200,000,001 (11)
abstracting: (p121<=0)
states: 1
.abstracting: (1<=p41)
states: 15,120,000,000 (10)
abstracting: (p41<=1)
states: 151,200,000,001 (11)
abstracting: (0<=p96)
states: 151,200,000,001 (11)
abstracting: (p96<=0)
states: 136,080,000,001 (11)
abstracting: (0<=p7)
states: 151,200,000,001 (11)
abstracting: (p7<=0)
states: 129,600,000,001 (11)
abstracting: (0<=p106)
states: 151,200,000,001 (11)
abstracting: (p106<=0)
states: 1
-> the formula is FALSE

FORMULA DLCround-PT-07a-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: AF [[AF [E [~ [AX [[[p44<=1 & 1<=p44] & [p114<=1 & 1<=p114]]]] U A [[[p4<=1 & 1<=p4] & [p125<=1 & 1<=p125]] U [[p69<=1 & 1<=p69] & [p158<=1 & 1<=p158]]]]] | [[p31<=1 & 1<=p31] & [p141<=1 & 1<=p141]]]]
normalized: ~ [EG [~ [[[[p141<=1 & 1<=p141] & [p31<=1 & 1<=p31]] | ~ [EG [~ [E [EX [~ [[[p114<=1 & 1<=p114] & [p44<=1 & 1<=p44]]]] U [~ [EG [~ [[[p158<=1 & 1<=p158] & [p69<=1 & 1<=p69]]]]] & ~ [E [~ [[[p158<=1 & 1<=p158] & [p69<=1 & 1<=p69]]] U [~ [[[p125<=1 & 1<=p125] & [p4<=1 & 1<=p4]]] & ~ [[[p158<=1 & 1<=p158] & [p69<=1 & 1<=p69]]]]]]]]]]]]]]]

abstracting: (1<=p69)
states: 15,120,000,000 (10)
abstracting: (p69<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p158)
states: 151,200,000,000 (11)
abstracting: (p158<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p4)
states: 21,600,000,000 (10)
abstracting: (p4<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p125)
states: 151,200,000,000 (11)
abstracting: (p125<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p69)
states: 15,120,000,000 (10)
abstracting: (p69<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p158)
states: 151,200,000,000 (11)
abstracting: (p158<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p69)
states: 15,120,000,000 (10)
abstracting: (p69<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p158)
states: 151,200,000,000 (11)
abstracting: (p158<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p44)
states: 15,120,000,000 (10)
abstracting: (p44<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p114)
states: 151,200,000,000 (11)
abstracting: (p114<=1)
states: 151,200,000,001 (11)
..
EG iterations: 1
abstracting: (1<=p31)
states: 15,120,000,000 (10)
abstracting: (p31<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p141)
states: 151,200,000,000 (11)
abstracting: (p141<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DLCround-PT-07a-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.085sec

checking: [AX [AG [[[[p55<=1 & 1<=p55] & [p150<=1 & 1<=p150]] | [[p72<=0 & 0<=p72] | [p160<=0 & 0<=p160]]]]] & A [[[p85<=1 & 1<=p85] & [p162<=1 & 1<=p162]] U EX [[[[p30<=1 & 1<=p30] & [p106<=1 & 1<=p106]] | EX [AF [[[p76<=1 & 1<=p76] & [p164<=1 & 1<=p164]]]]]]]]
normalized: [[~ [EG [~ [EX [[EX [~ [EG [~ [[[p164<=1 & 1<=p164] & [p76<=1 & 1<=p76]]]]]] | [[p106<=1 & 1<=p106] & [p30<=1 & 1<=p30]]]]]]] & ~ [E [~ [EX [[EX [~ [EG [~ [[[p164<=1 & 1<=p164] & [p76<=1 & 1<=p76]]]]]] | [[p106<=1 & 1<=p106] & [p30<=1 & 1<=p30]]]]] U [~ [[[p162<=1 & 1<=p162] & [p85<=1 & 1<=p85]]] & ~ [EX [[EX [~ [EG [~ [[[p164<=1 & 1<=p164] & [p76<=1 & 1<=p76]]]]]] | [[p106<=1 & 1<=p106] & [p30<=1 & 1<=p30]]]]]]]]] & ~ [EX [E [true U ~ [[[[p160<=0 & 0<=p160] | [p72<=0 & 0<=p72]] | [[p150<=1 & 1<=p150] & [p55<=1 & 1<=p55]]]]]]]]

abstracting: (1<=p55)
states: 15,120,000,000 (10)
abstracting: (p55<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p150)
states: 151,200,000,000 (11)
abstracting: (p150<=1)
states: 151,200,000,001 (11)
abstracting: (0<=p72)
states: 151,200,000,001 (11)
abstracting: (p72<=0)
states: 136,080,000,001 (11)
abstracting: (0<=p160)
states: 151,200,000,001 (11)
abstracting: (p160<=0)
states: 1
.abstracting: (1<=p30)
states: 15,120,000,000 (10)
abstracting: (p30<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p106)
states: 151,200,000,000 (11)
abstracting: (p106<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p76)
states: 15,120,000,000 (10)
abstracting: (p76<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p164)
states: 151,200,000,000 (11)
abstracting: (p164<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
..abstracting: (1<=p85)
states: 15,120,000,000 (10)
abstracting: (p85<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p162)
states: 151,200,000,000 (11)
abstracting: (p162<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p30)
states: 15,120,000,000 (10)
abstracting: (p30<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p106)
states: 151,200,000,000 (11)
abstracting: (p106<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p76)
states: 15,120,000,000 (10)
abstracting: (p76<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p164)
states: 151,200,000,000 (11)
abstracting: (p164<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
..abstracting: (1<=p30)
states: 15,120,000,000 (10)
abstracting: (p30<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p106)
states: 151,200,000,000 (11)
abstracting: (p106<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p76)
states: 15,120,000,000 (10)
abstracting: (p76<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p164)
states: 151,200,000,000 (11)
abstracting: (p164<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
...
EG iterations: 1
-> the formula is FALSE

FORMULA DLCround-PT-07a-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.164sec

checking: EX [A [[E [[[p79<=1 & 1<=p79] | ~ [[[p44<=1 & 1<=p44] & [p162<=1 & 1<=p162]]]] U [[[p51<=1 & 1<=p51] & [p152<=1 & 1<=p152]] & [[p30<=1 & 1<=p30] & ~ [[[p94<=1 & 1<=p94] & [p168<=1 & 1<=p168]]]]]] | [[p83<=1 & 1<=p83] & [p161<=1 & 1<=p161]]] U EF [[p91<=1 & 1<=p91]]]]
normalized: EX [[~ [EG [~ [E [true U [p91<=1 & 1<=p91]]]]] & ~ [E [~ [E [true U [p91<=1 & 1<=p91]]] U [~ [[[[p161<=1 & 1<=p161] & [p83<=1 & 1<=p83]] | E [[~ [[[p162<=1 & 1<=p162] & [p44<=1 & 1<=p44]]] | [p79<=1 & 1<=p79]] U [[~ [[[p168<=1 & 1<=p168] & [p94<=1 & 1<=p94]]] & [p30<=1 & 1<=p30]] & [[p152<=1 & 1<=p152] & [p51<=1 & 1<=p51]]]]]] & ~ [E [true U [p91<=1 & 1<=p91]]]]]]]]

abstracting: (1<=p91)
states: 15,120,000,000 (10)
abstracting: (p91<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p51)
states: 15,120,000,000 (10)
abstracting: (p51<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p152)
states: 151,200,000,000 (11)
abstracting: (p152<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p30)
states: 15,120,000,000 (10)
abstracting: (p30<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p94)
states: 15,120,000,000 (10)
abstracting: (p94<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p168)
states: 151,200,000,000 (11)
abstracting: (p168<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p79)
states: 15,120,000,000 (10)
abstracting: (p79<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p44)
states: 15,120,000,000 (10)
abstracting: (p44<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p162)
states: 151,200,000,000 (11)
abstracting: (p162<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p83)
states: 15,120,000,000 (10)
abstracting: (p83<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p161)
states: 151,200,000,000 (11)
abstracting: (p161<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p91)
states: 15,120,000,000 (10)
abstracting: (p91<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p91)
states: 15,120,000,000 (10)
abstracting: (p91<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA DLCround-PT-07a-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.187sec

checking: [EX [[AG [[[[p94<=1 & 1<=p94] & [p174<=1 & 1<=p174]] | [[p75<=0 & 0<=p75] | [0<=p124 & p124<=0]]]] | ~ [E [~ [[[[p54<=1 & 1<=p54] & [p159<=1 & 1<=p159]] & [[p81<=1 & 1<=p81] & [p126<=1 & 1<=p126]]]] U ~ [AF [[[p25<=1 & 1<=p25] & [p109<=1 & 1<=p109]]]]]]]] | EX [[[[[p19<=0 & 0<=p19] | [p124<=0 & 0<=p124]] & [p23<=0 & 0<=p23]] & [[p89<=1 & 1<=p89] & [p131<=1 & 1<=p131]]]]]
normalized: [EX [[[[p131<=1 & 1<=p131] & [p89<=1 & 1<=p89]] & [[p23<=0 & 0<=p23] & [[p124<=0 & 0<=p124] | [p19<=0 & 0<=p19]]]]] | EX [[~ [E [~ [[[[p126<=1 & 1<=p126] & [p81<=1 & 1<=p81]] & [[p159<=1 & 1<=p159] & [p54<=1 & 1<=p54]]]] U EG [~ [[[p109<=1 & 1<=p109] & [p25<=1 & 1<=p25]]]]]] | ~ [E [true U ~ [[[[0<=p124 & p124<=0] | [p75<=0 & 0<=p75]] | [[p174<=1 & 1<=p174] & [p94<=1 & 1<=p94]]]]]]]]]

abstracting: (1<=p94)
states: 15,120,000,000 (10)
abstracting: (p94<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p174)
states: 151,200,000,000 (11)
abstracting: (p174<=1)
states: 151,200,000,001 (11)
abstracting: (0<=p75)
states: 151,200,000,001 (11)
abstracting: (p75<=0)
states: 136,080,000,001 (11)
abstracting: (p124<=0)
states: 1
abstracting: (0<=p124)
states: 151,200,000,001 (11)
abstracting: (1<=p25)
states: 25,200,000,000 (10)
abstracting: (p25<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p109)
states: 151,200,000,000 (11)
abstracting: (p109<=1)
states: 151,200,000,001 (11)
..
EG iterations: 2
abstracting: (1<=p54)
states: 15,120,000,000 (10)
abstracting: (p54<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p159)
states: 151,200,000,000 (11)
abstracting: (p159<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p81)
states: 15,120,000,000 (10)
abstracting: (p81<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p126)
states: 151,200,000,000 (11)
abstracting: (p126<=1)
states: 151,200,000,001 (11)
.abstracting: (0<=p19)
states: 151,200,000,001 (11)
abstracting: (p19<=0)
states: 126,000,000,001 (11)
abstracting: (0<=p124)
states: 151,200,000,001 (11)
abstracting: (p124<=0)
states: 1
abstracting: (0<=p23)
states: 151,200,000,001 (11)
abstracting: (p23<=0)
states: 126,000,000,001 (11)
abstracting: (1<=p89)
states: 15,120,000,000 (10)
abstracting: (p89<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p131)
states: 151,200,000,000 (11)
abstracting: (p131<=1)
states: 151,200,000,001 (11)
.-> the formula is FALSE

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

MC time: 0m 0.066sec

checking: EF [EG [[AX [[[p53<=1 & 1<=p53] & [p152<=1 & 1<=p152]]] & [A [[[[p25<=1 & 1<=p25] & [p133<=1 & 1<=p133]] | [[p29<=1 & 1<=p29] & [p143<=1 & 1<=p143]]] U [[p69<=1 & 1<=p69] | [[p8<=1 & 1<=p8] & [p135<=1 & 1<=p135]]]] | [[AX [[[p58<=1 & 1<=p58] & [p156<=1 & 1<=p156]]] & E [[[p42<=1 & 1<=p42] & [p145<=1 & 1<=p145]] U [[p83<=1 & 1<=p83] & [p127<=1 & 1<=p127]]]] & [[p84<=1 & 1<=p84] & [p128<=1 & 1<=p128]]]]]]]
normalized: E [true U EG [[[[[[p128<=1 & 1<=p128] & [p84<=1 & 1<=p84]] & [E [[[p145<=1 & 1<=p145] & [p42<=1 & 1<=p42]] U [[p127<=1 & 1<=p127] & [p83<=1 & 1<=p83]]] & ~ [EX [~ [[[p156<=1 & 1<=p156] & [p58<=1 & 1<=p58]]]]]]] | [~ [EG [~ [[[[p135<=1 & 1<=p135] & [p8<=1 & 1<=p8]] | [p69<=1 & 1<=p69]]]]] & ~ [E [~ [[[[p135<=1 & 1<=p135] & [p8<=1 & 1<=p8]] | [p69<=1 & 1<=p69]]] U [~ [[[[p143<=1 & 1<=p143] & [p29<=1 & 1<=p29]] | [[p133<=1 & 1<=p133] & [p25<=1 & 1<=p25]]]] & ~ [[[[p135<=1 & 1<=p135] & [p8<=1 & 1<=p8]] | [p69<=1 & 1<=p69]]]]]]]] & ~ [EX [~ [[[p152<=1 & 1<=p152] & [p53<=1 & 1<=p53]]]]]]]]

abstracting: (1<=p53)
states: 15,120,000,000 (10)
abstracting: (p53<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p152)
states: 151,200,000,000 (11)
abstracting: (p152<=1)
states: 151,200,000,001 (11)
.abstracting: (1<=p69)
states: 15,120,000,000 (10)
abstracting: (p69<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p8)
states: 25,200,000,000 (10)
abstracting: (p8<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p135)
states: 151,200,000,000 (11)
abstracting: (p135<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p25)
states: 25,200,000,000 (10)
abstracting: (p25<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p133)
states: 151,200,000,000 (11)
abstracting: (p133<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p29)
states: 15,120,000,000 (10)
abstracting: (p29<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p143)
states: 151,200,000,000 (11)
abstracting: (p143<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p69)
states: 15,120,000,000 (10)
abstracting: (p69<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p8)
states: 25,200,000,000 (10)
abstracting: (p8<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p135)
states: 151,200,000,000 (11)
abstracting: (p135<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p69)
states: 15,120,000,000 (10)
abstracting: (p69<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p8)
states: 25,200,000,000 (10)
abstracting: (p8<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p135)
states: 151,200,000,000 (11)
abstracting: (p135<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p58)
states: 15,120,000,000 (10)
abstracting: (p58<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p156)
states: 151,200,000,000 (11)
abstracting: (p156<=1)
states: 151,200,000,001 (11)
.abstracting: (1<=p83)
states: 15,120,000,000 (10)
abstracting: (p83<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p127)
states: 151,200,000,000 (11)
abstracting: (p127<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p42)
states: 15,120,000,000 (10)
abstracting: (p42<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p145)
states: 151,200,000,000 (11)
abstracting: (p145<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p84)
states: 15,120,000,000 (10)
abstracting: (p84<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p128)
states: 151,200,000,000 (11)
abstracting: (p128<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DLCround-PT-07a-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.118sec

checking: E [[EF [~ [[[[[p44<=1 & 1<=p44] & [p162<=1 & 1<=p162]] | [[p43<=1 & 1<=p43] & [p147<=1 & 1<=p147]]] | [A [[[p7<=1 & 1<=p7] & [p106<=1 & 1<=p106]] U [p101<=1 & 1<=p101]] | AX [[[p35<=1 & 1<=p35] & [p141<=1 & 1<=p141]]]]]]] | ~ [EF [~ [[[[p4<=1 & 1<=p4] & [p39<=1 & 1<=p39]] & [[p115<=1 & 1<=p115] & EF [[[p44<=1 & 1<=p44] & [p112<=1 & 1<=p112]]]]]]]]] U AG [AF [[E [[[p89<=1 & 1<=p89] & [p129<=1 & 1<=p129]] U [[p58<=1 & 1<=p58] & [p119<=1 & 1<=p119]]] & A [[[p82<=1 & 1<=p82] & [p126<=1 & 1<=p126]] U [p68<=1 & 1<=p68]]]]]]
normalized: E [[~ [E [true U ~ [[[E [true U [[p112<=1 & 1<=p112] & [p44<=1 & 1<=p44]]] & [p115<=1 & 1<=p115]] & [[p39<=1 & 1<=p39] & [p4<=1 & 1<=p4]]]]]] | E [true U ~ [[[~ [EX [~ [[[p141<=1 & 1<=p141] & [p35<=1 & 1<=p35]]]]] | [~ [EG [~ [[p101<=1 & 1<=p101]]]] & ~ [E [~ [[p101<=1 & 1<=p101]] U [~ [[[p106<=1 & 1<=p106] & [p7<=1 & 1<=p7]]] & ~ [[p101<=1 & 1<=p101]]]]]]] | [[[p147<=1 & 1<=p147] & [p43<=1 & 1<=p43]] | [[p162<=1 & 1<=p162] & [p44<=1 & 1<=p44]]]]]]] U ~ [E [true U EG [~ [[[~ [EG [~ [[p68<=1 & 1<=p68]]]] & ~ [E [~ [[p68<=1 & 1<=p68]] U [~ [[[p126<=1 & 1<=p126] & [p82<=1 & 1<=p82]]] & ~ [[p68<=1 & 1<=p68]]]]]] & E [[[p129<=1 & 1<=p129] & [p89<=1 & 1<=p89]] U [[p119<=1 & 1<=p119] & [p58<=1 & 1<=p58]]]]]]]]]

abstracting: (1<=p58)
states: 15,120,000,000 (10)
abstracting: (p58<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p119)
states: 151,200,000,000 (11)
abstracting: (p119<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p89)
states: 15,120,000,000 (10)
abstracting: (p89<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p129)
states: 151,200,000,000 (11)
abstracting: (p129<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p68)
states: 15,120,000,000 (10)
abstracting: (p68<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p82)
states: 15,120,000,000 (10)
abstracting: (p82<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p126)
states: 151,200,000,000 (11)
abstracting: (p126<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p68)
states: 15,120,000,000 (10)
abstracting: (p68<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p68)
states: 15,120,000,000 (10)
abstracting: (p68<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p44)
states: 15,120,000,000 (10)
abstracting: (p44<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p162)
states: 151,200,000,000 (11)
abstracting: (p162<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p43)
states: 15,120,000,000 (10)
abstracting: (p43<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p147)
states: 151,200,000,000 (11)
abstracting: (p147<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p101)
states: 15,120,000,000 (10)
abstracting: (p101<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p7)
states: 21,600,000,000 (10)
abstracting: (p7<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p106)
states: 151,200,000,000 (11)
abstracting: (p106<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p101)
states: 15,120,000,000 (10)
abstracting: (p101<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p101)
states: 15,120,000,000 (10)
abstracting: (p101<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p35)
states: 15,120,000,000 (10)
abstracting: (p35<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p141)
states: 151,200,000,000 (11)
abstracting: (p141<=1)
states: 151,200,000,001 (11)
.abstracting: (1<=p4)
states: 21,600,000,000 (10)
abstracting: (p4<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p39)
states: 15,120,000,000 (10)
abstracting: (p39<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p115)
states: 151,200,000,000 (11)
abstracting: (p115<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p44)
states: 15,120,000,000 (10)
abstracting: (p44<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p112)
states: 151,200,000,000 (11)
abstracting: (p112<=1)
states: 151,200,000,001 (11)
-> the formula is FALSE

FORMULA DLCround-PT-07a-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.221sec

checking: E [[[~ [[~ [[[p74<=1 & 1<=p74] & [p158<=1 & 1<=p158]]] & E [[[p51<=1 & 1<=p51] & [p151<=1 & 1<=p151]] U [[p21<=1 & 1<=p21] & [p128<=1 & 1<=p128]]]]] | E [[~ [E [[[p74<=1 & 1<=p74] & [p148<=1 & 1<=p148]] U [[p44<=1 & 1<=p44] & [p158<=1 & 1<=p158]]]] & EF [[[p33<=1 & 1<=p33] & [p140<=1 & 1<=p140]]]] U [AF [[[p26<=1 & 1<=p26] & [p143<=1 & 1<=p143]]] & EG [[[p7<=1 & 1<=p7] & [p123<=1 & 1<=p123]]]]]] | [AG [[[~ [[[p19<=1 & 1<=p19] & [p117<=1 & 1<=p117]]] | [p45<=1 & 1<=p45]] | [[[p104<=1 & 1<=p104] & [p171<=1 & 1<=p171]] | [[~ [[[p104<=1 & 1<=p104] & [p134<=1 & 1<=p134]]] & [[p36<=1 & 1<=p36] & [p147<=1 & 1<=p147]]] | [[p42<=1 & 1<=p42] & [p146<=1 & 1<=p146]]]]]] | [[p74<=1 & 1<=p74] & [p165<=1 & 1<=p165]]]] U [AX [~ [EG [A [[[p105<=1 & 1<=p105] & [p172<=1 & 1<=p172]] U [[p31<=1 & 1<=p31] & [p109<=1 & 1<=p109]]]]]] & EG [[[p2<=1 & 1<=p2] & [p110<=1 & 1<=p110]]]]]
normalized: E [[[[[p165<=1 & 1<=p165] & [p74<=1 & 1<=p74]] | ~ [E [true U ~ [[[[[[p146<=1 & 1<=p146] & [p42<=1 & 1<=p42]] | [[[p147<=1 & 1<=p147] & [p36<=1 & 1<=p36]] & ~ [[[p134<=1 & 1<=p134] & [p104<=1 & 1<=p104]]]]] | [[p171<=1 & 1<=p171] & [p104<=1 & 1<=p104]]] | [[p45<=1 & 1<=p45] | ~ [[[p117<=1 & 1<=p117] & [p19<=1 & 1<=p19]]]]]]]]] | [E [[E [true U [[p140<=1 & 1<=p140] & [p33<=1 & 1<=p33]]] & ~ [E [[[p148<=1 & 1<=p148] & [p74<=1 & 1<=p74]] U [[p158<=1 & 1<=p158] & [p44<=1 & 1<=p44]]]]] U [EG [[[p123<=1 & 1<=p123] & [p7<=1 & 1<=p7]]] & ~ [EG [~ [[[p143<=1 & 1<=p143] & [p26<=1 & 1<=p26]]]]]]] | ~ [[E [[[p151<=1 & 1<=p151] & [p51<=1 & 1<=p51]] U [[p128<=1 & 1<=p128] & [p21<=1 & 1<=p21]]] & ~ [[[p158<=1 & 1<=p158] & [p74<=1 & 1<=p74]]]]]]] U [EG [[[p110<=1 & 1<=p110] & [p2<=1 & 1<=p2]]] & ~ [EX [EG [[~ [EG [~ [[[p109<=1 & 1<=p109] & [p31<=1 & 1<=p31]]]]] & ~ [E [~ [[[p109<=1 & 1<=p109] & [p31<=1 & 1<=p31]]] U [~ [[[p172<=1 & 1<=p172] & [p105<=1 & 1<=p105]]] & ~ [[[p109<=1 & 1<=p109] & [p31<=1 & 1<=p31]]]]]]]]]]]]

abstracting: (1<=p31)
states: 15,120,000,000 (10)
abstracting: (p31<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p109)
states: 151,200,000,000 (11)
abstracting: (p109<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p105)
states: 15,120,000,000 (10)
abstracting: (p105<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p172)
states: 151,200,000,000 (11)
abstracting: (p172<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p31)
states: 15,120,000,000 (10)
abstracting: (p31<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p109)
states: 151,200,000,000 (11)
abstracting: (p109<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p31)
states: 15,120,000,000 (10)
abstracting: (p31<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p109)
states: 151,200,000,000 (11)
abstracting: (p109<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
.
EG iterations: 1
.abstracting: (1<=p2)
states: 21,600,000,000 (10)
abstracting: (p2<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p110)
states: 151,200,000,000 (11)
abstracting: (p110<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p74)
states: 15,120,000,000 (10)
abstracting: (p74<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p158)
states: 151,200,000,000 (11)
abstracting: (p158<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p21)
states: 25,200,000,000 (10)
abstracting: (p21<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p128)
states: 151,200,000,000 (11)
abstracting: (p128<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p51)
states: 15,120,000,000 (10)
abstracting: (p51<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p151)
states: 151,200,000,000 (11)
abstracting: (p151<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p26)
states: 15,120,000,000 (10)
abstracting: (p26<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p143)
states: 151,200,000,000 (11)
abstracting: (p143<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p7)
states: 21,600,000,000 (10)
abstracting: (p7<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p123)
states: 151,200,000,000 (11)
abstracting: (p123<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p44)
states: 15,120,000,000 (10)
abstracting: (p44<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p158)
states: 151,200,000,000 (11)
abstracting: (p158<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p74)
states: 15,120,000,000 (10)
abstracting: (p74<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p148)
states: 151,200,000,000 (11)
abstracting: (p148<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p33)
states: 15,120,000,000 (10)
abstracting: (p33<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p140)
states: 151,200,000,000 (11)
abstracting: (p140<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p19)
states: 25,200,000,000 (10)
abstracting: (p19<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p117)
states: 151,200,000,000 (11)
abstracting: (p117<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p45)
states: 15,120,000,000 (10)
abstracting: (p45<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p104)
states: 15,120,000,000 (10)
abstracting: (p104<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p171)
states: 151,200,000,000 (11)
abstracting: (p171<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p104)
states: 15,120,000,000 (10)
abstracting: (p104<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p134)
states: 151,200,000,000 (11)
abstracting: (p134<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p36)
states: 15,120,000,000 (10)
abstracting: (p36<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p147)
states: 151,200,000,000 (11)
abstracting: (p147<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p42)
states: 15,120,000,000 (10)
abstracting: (p42<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p146)
states: 151,200,000,000 (11)
abstracting: (p146<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p74)
states: 15,120,000,000 (10)
abstracting: (p74<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p165)
states: 151,200,000,000 (11)
abstracting: (p165<=1)
states: 151,200,000,001 (11)
-> the formula is TRUE

FORMULA DLCround-PT-07a-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.670sec

checking: [EF [[[[p64<=1 & 1<=p64] & [p151<=1 & 1<=p151]] & [EF [[[p86<=1 & 1<=p86] & [p130<=1 & 1<=p130]]] & [[p69<=1 & 1<=p69] & [p124<=1 & 1<=p124]]]]] & [[EF [EX [EX [[[p50<=1 & 1<=p50] & [p149<=1 & 1<=p149]]]]] | [AG [[~ [A [[[p56<=1 & 1<=p56] & [p155<=1 & 1<=p155]] U [p44<=1 & 1<=p44]]] & EX [[[p94<=1 & 1<=p94] & [p153<=1 & 1<=p153]]]]] | [AX [[[p7<=0 & 0<=p7] | [p118<=0 & 0<=p118]]] & ~ [E [[[p73<=1 & 1<=p73] & [p124<=1 & 1<=p124]] U [[p38<=1 & 1<=p38] & [p111<=1 & 1<=p111]]]]]]] & [E [A [[~ [[[p74<=1 & 1<=p74] & [p148<=1 & 1<=p148]]] & [[[p88<=1 & 1<=p88] & [p167<=1 & 1<=p167]] | [[p7<=1 & 1<=p7] & [p126<=1 & 1<=p126]]]] U ~ [EX [[[p96<=1 & 1<=p96] & [p134<=1 & 1<=p134]]]]] U EF [[[[[p32<=1 & 1<=p32] & [p108<=1 & 1<=p108]] | [[p74<=1 & 1<=p74] & [p165<=1 & 1<=p165]]] & ~ [[p16<=1 & 1<=p16]]]]] | [EF [[EG [[[p56<=1 & 1<=p56] & [p154<=1 & 1<=p154]]] & AX [[[p13<=1 & 1<=p13] & [p136<=1 & 1<=p136]]]]] | AF [[E [[p76<=1 & 1<=p76] U [[p94<=1 & 1<=p94] & [p132<=1 & 1<=p132]]] & [[p93<=0 & 0<=p93] | [p169<=0 & 0<=p169]]]]]]]]
normalized: [[[[~ [EG [~ [[[[p169<=0 & 0<=p169] | [p93<=0 & 0<=p93]] & E [[p76<=1 & 1<=p76] U [[p132<=1 & 1<=p132] & [p94<=1 & 1<=p94]]]]]]] | E [true U [~ [EX [~ [[[p136<=1 & 1<=p136] & [p13<=1 & 1<=p13]]]]] & EG [[[p154<=1 & 1<=p154] & [p56<=1 & 1<=p56]]]]]] | E [[~ [EG [EX [[[p134<=1 & 1<=p134] & [p96<=1 & 1<=p96]]]]] & ~ [E [EX [[[p134<=1 & 1<=p134] & [p96<=1 & 1<=p96]]] U [~ [[[[[p126<=1 & 1<=p126] & [p7<=1 & 1<=p7]] | [[p167<=1 & 1<=p167] & [p88<=1 & 1<=p88]]] & ~ [[[p148<=1 & 1<=p148] & [p74<=1 & 1<=p74]]]]] & EX [[[p134<=1 & 1<=p134] & [p96<=1 & 1<=p96]]]]]]] U E [true U [~ [[p16<=1 & 1<=p16]] & [[[p165<=1 & 1<=p165] & [p74<=1 & 1<=p74]] | [[p108<=1 & 1<=p108] & [p32<=1 & 1<=p32]]]]]]] & [[[~ [E [[[p124<=1 & 1<=p124] & [p73<=1 & 1<=p73]] U [[p111<=1 & 1<=p111] & [p38<=1 & 1<=p38]]]] & ~ [EX [~ [[[p118<=0 & 0<=p118] | [p7<=0 & 0<=p7]]]]]] | ~ [E [true U ~ [[EX [[[p153<=1 & 1<=p153] & [p94<=1 & 1<=p94]]] & ~ [[~ [EG [~ [[p44<=1 & 1<=p44]]]] & ~ [E [~ [[p44<=1 & 1<=p44]] U [~ [[[p155<=1 & 1<=p155] & [p56<=1 & 1<=p56]]] & ~ [[p44<=1 & 1<=p44]]]]]]]]]]]] | E [true U EX [EX [[[p149<=1 & 1<=p149] & [p50<=1 & 1<=p50]]]]]]] & E [true U [[[[p124<=1 & 1<=p124] & [p69<=1 & 1<=p69]] & E [true U [[p130<=1 & 1<=p130] & [p86<=1 & 1<=p86]]]] & [[p151<=1 & 1<=p151] & [p64<=1 & 1<=p64]]]]]

abstracting: (1<=p64)
states: 15,120,000,000 (10)
abstracting: (p64<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p151)
states: 151,200,000,000 (11)
abstracting: (p151<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p86)
states: 15,120,000,000 (10)
abstracting: (p86<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p130)
states: 151,200,000,000 (11)
abstracting: (p130<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p69)
states: 15,120,000,000 (10)
abstracting: (p69<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p124)
states: 151,200,000,000 (11)
abstracting: (p124<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p50)
states: 15,120,000,000 (10)
abstracting: (p50<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p149)
states: 151,200,000,000 (11)
abstracting: (p149<=1)
states: 151,200,000,001 (11)
..abstracting: (1<=p44)
states: 15,120,000,000 (10)
abstracting: (p44<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p56)
states: 15,120,000,000 (10)
abstracting: (p56<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p155)
states: 151,200,000,000 (11)
abstracting: (p155<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p44)
states: 15,120,000,000 (10)
abstracting: (p44<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p44)
states: 15,120,000,000 (10)
abstracting: (p44<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p94)
states: 15,120,000,000 (10)
abstracting: (p94<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p153)
states: 151,200,000,000 (11)
abstracting: (p153<=1)
states: 151,200,000,001 (11)
.abstracting: (0<=p7)
states: 151,200,000,001 (11)
abstracting: (p7<=0)
states: 129,600,000,001 (11)
abstracting: (0<=p118)
states: 151,200,000,001 (11)
abstracting: (p118<=0)
states: 1
.abstracting: (1<=p38)
states: 15,120,000,000 (10)
abstracting: (p38<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p111)
states: 151,200,000,000 (11)
abstracting: (p111<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p73)
states: 15,120,000,000 (10)
abstracting: (p73<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p124)
states: 151,200,000,000 (11)
abstracting: (p124<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p32)
states: 15,120,000,000 (10)
abstracting: (p32<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p108)
states: 151,200,000,000 (11)
abstracting: (p108<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p74)
states: 15,120,000,000 (10)
abstracting: (p74<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p165)
states: 151,200,000,000 (11)
abstracting: (p165<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p16)
states: 25,200,000,000 (10)
abstracting: (p16<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p96)
states: 15,120,000,000 (10)
abstracting: (p96<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p134)
states: 151,200,000,000 (11)
abstracting: (p134<=1)
states: 151,200,000,001 (11)
.abstracting: (1<=p74)
states: 15,120,000,000 (10)
abstracting: (p74<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p148)
states: 151,200,000,000 (11)
abstracting: (p148<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p88)
states: 15,120,000,000 (10)
abstracting: (p88<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p167)
states: 151,200,000,000 (11)
abstracting: (p167<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p7)
states: 21,600,000,000 (10)
abstracting: (p7<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p126)
states: 151,200,000,000 (11)
abstracting: (p126<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p96)
states: 15,120,000,000 (10)
abstracting: (p96<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p134)
states: 151,200,000,000 (11)
abstracting: (p134<=1)
states: 151,200,000,001 (11)
.abstracting: (1<=p96)
states: 15,120,000,000 (10)
abstracting: (p96<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p134)
states: 151,200,000,000 (11)
abstracting: (p134<=1)
states: 151,200,000,001 (11)
..
EG iterations: 1
abstracting: (1<=p56)
states: 15,120,000,000 (10)
abstracting: (p56<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p154)
states: 151,200,000,000 (11)
abstracting: (p154<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p13)
states: 25,200,000,000 (10)
abstracting: (p13<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p136)
states: 151,200,000,000 (11)
abstracting: (p136<=1)
states: 151,200,000,001 (11)
.abstracting: (1<=p94)
states: 15,120,000,000 (10)
abstracting: (p94<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p132)
states: 151,200,000,000 (11)
abstracting: (p132<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p76)
states: 15,120,000,000 (10)
abstracting: (p76<=1)
states: 151,200,000,001 (11)
abstracting: (0<=p93)
states: 151,200,000,001 (11)
abstracting: (p93<=0)
states: 136,080,000,001 (11)
abstracting: (0<=p169)
states: 151,200,000,001 (11)
abstracting: (p169<=0)
states: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA DLCround-PT-07a-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.305sec

checking: [E [[[[p13<=1 & 1<=p13] & [p111<=1 & 1<=p111]] | ~ [AG [[[p33<=1 & 1<=p33] & [p144<=1 & 1<=p144]]]]] U ~ [[[[AF [~ [[[p32<=1 & 1<=p32] & [p142<=1 & 1<=p142]]]] | A [[[p34<=1 & 1<=p34] & [p107<=1 & 1<=p107]] U [[p37<=1 & 1<=p37] | [[p83<=1 & 1<=p83] & [p166<=1 & 1<=p166]]]]] & E [[[p13<=1 & 1<=p13] & [p130<=1 & 1<=p130]] U [p17<=1 & 1<=p17]]] & [EF [[p5<=1 & 1<=p5]] & A [[[[p44<=1 & 1<=p44] & [p111<=1 & 1<=p111]] | [[p70<=1 & 1<=p70] & [p157<=1 & 1<=p157]]] U E [[[p99<=1 & 1<=p99] & [p173<=1 & 1<=p173]] U [[p41<=1 & 1<=p41] & [p148<=1 & 1<=p148]]]]]]]] & E [[AF [~ [[~ [[[p25<=1 & 1<=p25] & [p138<=1 & 1<=p138]]] & ~ [[[p70<=1 & 1<=p70] & [p160<=1 & 1<=p160]]]]]] | [[[~ [[[[p104<=1 & 1<=p104] & [p134<=1 & 1<=p134]] & [[p7<=1 & 1<=p7] & [p116<=1 & 1<=p116]]]] | E [[[p80<=1 & 1<=p80] & [p164<=1 & 1<=p164]] U [[p103<=1 & 1<=p103] & [p172<=1 & 1<=p172]]]] & EX [~ [[p85<=1 & 1<=p85]]]] | [[[[[p74<=1 & 1<=p74] & [p152<=1 & 1<=p152]] | [[p105<=1 & 1<=p105] & [p139<=1 & 1<=p139]]] | [A [[p46<=1 & 1<=p46] U [[p72<=1 & 1<=p72] & [p157<=1 & 1<=p157]]] | EG [[[p82<=1 & 1<=p82] & [p127<=1 & 1<=p127]]]]] & ~ [EX [[[p84<=1 & 1<=p84] & [p162<=1 & 1<=p162]]]]]]] U [[p31<=1 & 1<=p31] | [~ [AX [[[[p40<=1 & 1<=p40] & [p113<=1 & 1<=p113]] & [[p83<=1 & 1<=p83] & [p126<=1 & 1<=p126]]]]] & AX [AF [[[p64<=1 & 1<=p64] & [p141<=1 & 1<=p141]]]]]]]]
normalized: [E [[[[~ [EX [[[p162<=1 & 1<=p162] & [p84<=1 & 1<=p84]]]] & [[EG [[[p127<=1 & 1<=p127] & [p82<=1 & 1<=p82]]] | [~ [EG [~ [[[p157<=1 & 1<=p157] & [p72<=1 & 1<=p72]]]]] & ~ [E [~ [[[p157<=1 & 1<=p157] & [p72<=1 & 1<=p72]]] U [~ [[p46<=1 & 1<=p46]] & ~ [[[p157<=1 & 1<=p157] & [p72<=1 & 1<=p72]]]]]]]] | [[[p139<=1 & 1<=p139] & [p105<=1 & 1<=p105]] | [[p152<=1 & 1<=p152] & [p74<=1 & 1<=p74]]]]] | [EX [~ [[p85<=1 & 1<=p85]]] & [E [[[p164<=1 & 1<=p164] & [p80<=1 & 1<=p80]] U [[p172<=1 & 1<=p172] & [p103<=1 & 1<=p103]]] | ~ [[[[p116<=1 & 1<=p116] & [p7<=1 & 1<=p7]] & [[p134<=1 & 1<=p134] & [p104<=1 & 1<=p104]]]]]]] | ~ [EG [[~ [[[p160<=1 & 1<=p160] & [p70<=1 & 1<=p70]]] & ~ [[[p138<=1 & 1<=p138] & [p25<=1 & 1<=p25]]]]]]] U [[~ [EX [EG [~ [[[p141<=1 & 1<=p141] & [p64<=1 & 1<=p64]]]]]] & EX [~ [[[[p126<=1 & 1<=p126] & [p83<=1 & 1<=p83]] & [[p113<=1 & 1<=p113] & [p40<=1 & 1<=p40]]]]]] | [p31<=1 & 1<=p31]]] & E [[E [true U ~ [[[p144<=1 & 1<=p144] & [p33<=1 & 1<=p33]]]] | [[p111<=1 & 1<=p111] & [p13<=1 & 1<=p13]]] U ~ [[[[~ [EG [~ [E [[[p173<=1 & 1<=p173] & [p99<=1 & 1<=p99]] U [[p148<=1 & 1<=p148] & [p41<=1 & 1<=p41]]]]]] & ~ [E [~ [E [[[p173<=1 & 1<=p173] & [p99<=1 & 1<=p99]] U [[p148<=1 & 1<=p148] & [p41<=1 & 1<=p41]]]] U [~ [[[[p157<=1 & 1<=p157] & [p70<=1 & 1<=p70]] | [[p111<=1 & 1<=p111] & [p44<=1 & 1<=p44]]]] & ~ [E [[[p173<=1 & 1<=p173] & [p99<=1 & 1<=p99]] U [[p148<=1 & 1<=p148] & [p41<=1 & 1<=p41]]]]]]]] & E [true U [p5<=1 & 1<=p5]]] & [E [[[p130<=1 & 1<=p130] & [p13<=1 & 1<=p13]] U [p17<=1 & 1<=p17]] & [[~ [EG [~ [[[[p166<=1 & 1<=p166] & [p83<=1 & 1<=p83]] | [p37<=1 & 1<=p37]]]]] & ~ [E [~ [[[[p166<=1 & 1<=p166] & [p83<=1 & 1<=p83]] | [p37<=1 & 1<=p37]]] U [~ [[[p107<=1 & 1<=p107] & [p34<=1 & 1<=p34]]] & ~ [[[[p166<=1 & 1<=p166] & [p83<=1 & 1<=p83]] | [p37<=1 & 1<=p37]]]]]]] | ~ [EG [[[p142<=1 & 1<=p142] & [p32<=1 & 1<=p32]]]]]]]]]]

abstracting: (1<=p32)
states: 15,120,000,000 (10)
abstracting: (p32<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p142)
states: 151,200,000,000 (11)
abstracting: (p142<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p37)
states: 15,120,000,000 (10)
abstracting: (p37<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p83)
states: 15,120,000,000 (10)
abstracting: (p83<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p166)
states: 151,200,000,000 (11)
abstracting: (p166<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p34)
states: 15,120,000,000 (10)
abstracting: (p34<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p107)
states: 151,200,000,000 (11)
abstracting: (p107<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p37)
states: 15,120,000,000 (10)
abstracting: (p37<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p83)
states: 15,120,000,000 (10)
abstracting: (p83<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p166)
states: 151,200,000,000 (11)
abstracting: (p166<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p37)
states: 15,120,000,000 (10)
abstracting: (p37<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p83)
states: 15,120,000,000 (10)
abstracting: (p83<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p166)
states: 151,200,000,000 (11)
abstracting: (p166<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p17)
states: 25,200,000,000 (10)
abstracting: (p17<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p13)
states: 25,200,000,000 (10)
abstracting: (p13<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p130)
states: 151,200,000,000 (11)
abstracting: (p130<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p5)
states: 21,600,000,000 (10)
abstracting: (p5<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p41)
states: 15,120,000,000 (10)
abstracting: (p41<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p148)
states: 151,200,000,000 (11)
abstracting: (p148<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p99)
states: 15,120,000,000 (10)
abstracting: (p99<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p173)
states: 151,200,000,000 (11)
abstracting: (p173<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p44)
states: 15,120,000,000 (10)
abstracting: (p44<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p111)
states: 151,200,000,000 (11)
abstracting: (p111<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p70)
states: 15,120,000,000 (10)
abstracting: (p70<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p157)
states: 151,200,000,000 (11)
abstracting: (p157<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p41)
states: 15,120,000,000 (10)
abstracting: (p41<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p148)
states: 151,200,000,000 (11)
abstracting: (p148<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p99)
states: 15,120,000,000 (10)
abstracting: (p99<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p173)
states: 151,200,000,000 (11)
abstracting: (p173<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p41)
states: 15,120,000,000 (10)
abstracting: (p41<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p148)
states: 151,200,000,000 (11)
abstracting: (p148<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p99)
states: 15,120,000,000 (10)
abstracting: (p99<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p173)
states: 151,200,000,000 (11)
abstracting: (p173<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p13)
states: 25,200,000,000 (10)
abstracting: (p13<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p111)
states: 151,200,000,000 (11)
abstracting: (p111<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p33)
states: 15,120,000,000 (10)
abstracting: (p33<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p144)
states: 151,200,000,000 (11)
abstracting: (p144<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p31)
states: 15,120,000,000 (10)
abstracting: (p31<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p40)
states: 15,120,000,000 (10)
abstracting: (p40<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p113)
states: 151,200,000,000 (11)
abstracting: (p113<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p83)
states: 15,120,000,000 (10)
abstracting: (p83<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p126)
states: 151,200,000,000 (11)
abstracting: (p126<=1)
states: 151,200,000,001 (11)
.abstracting: (1<=p64)
states: 15,120,000,000 (10)
abstracting: (p64<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p141)
states: 151,200,000,000 (11)
abstracting: (p141<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
.abstracting: (1<=p25)
states: 25,200,000,000 (10)
abstracting: (p25<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p138)
states: 151,200,000,000 (11)
abstracting: (p138<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p70)
states: 15,120,000,000 (10)
abstracting: (p70<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p160)
states: 151,200,000,000 (11)
abstracting: (p160<=1)
states: 151,200,000,001 (11)
..
EG iterations: 2
abstracting: (1<=p104)
states: 15,120,000,000 (10)
abstracting: (p104<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p134)
states: 151,200,000,000 (11)
abstracting: (p134<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p7)
states: 21,600,000,000 (10)
abstracting: (p7<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p116)
states: 151,200,000,000 (11)
abstracting: (p116<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p103)
states: 15,120,000,000 (10)
abstracting: (p103<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p172)
states: 151,200,000,000 (11)
abstracting: (p172<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p80)
states: 15,120,000,000 (10)
abstracting: (p80<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p164)
states: 151,200,000,000 (11)
abstracting: (p164<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p85)
states: 15,120,000,000 (10)
abstracting: (p85<=1)
states: 151,200,000,001 (11)
.abstracting: (1<=p74)
states: 15,120,000,000 (10)
abstracting: (p74<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p152)
states: 151,200,000,000 (11)
abstracting: (p152<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p105)
states: 15,120,000,000 (10)
abstracting: (p105<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p139)
states: 151,200,000,000 (11)
abstracting: (p139<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p72)
states: 15,120,000,000 (10)
abstracting: (p72<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p157)
states: 151,200,000,000 (11)
abstracting: (p157<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p46)
states: 15,120,000,000 (10)
abstracting: (p46<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p72)
states: 15,120,000,000 (10)
abstracting: (p72<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p157)
states: 151,200,000,000 (11)
abstracting: (p157<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p72)
states: 15,120,000,000 (10)
abstracting: (p72<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p157)
states: 151,200,000,000 (11)
abstracting: (p157<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p82)
states: 15,120,000,000 (10)
abstracting: (p82<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p127)
states: 151,200,000,000 (11)
abstracting: (p127<=1)
states: 151,200,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p84)
states: 15,120,000,000 (10)
abstracting: (p84<=1)
states: 151,200,000,001 (11)
abstracting: (1<=p162)
states: 151,200,000,000 (11)
abstracting: (p162<=1)
states: 151,200,000,001 (11)
.-> the formula is TRUE

FORMULA DLCround-PT-07a-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.520sec

totally nodes used: 528596 (5.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4016470 9035618 13052088
used/not used/entry size/cache size: 8759151 58349713 16 1024MB
basic ops cache: hits/miss/sum: 585730 1292275 1878005
used/not used/entry size/cache size: 1643616 15133600 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: 22748 55562 78310
used/not used/entry size/cache size: 55398 8333210 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 66611572
1 468878
2 25723
3 2508
4 168
5 14
6 1
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 7.321sec


BK_STOP 1678455542016

--------------------
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:2377 (9), effective:94 (0)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

iterations count:772 (3), effective:11 (0)

iterations count:949 (3), effective:20 (0)

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

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

iterations count:748 (3), effective:11 (0)

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

iterations count:769 (3), effective:10 (0)

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

iterations count:769 (3), effective:10 (0)

iterations count:769 (3), effective:10 (0)

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

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

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

iterations count:506 (2), effective:9 (0)

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

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

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

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

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

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

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

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

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

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

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

iterations count:576 (2), effective:16 (0)

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

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

iterations count:778 (3), effective:10 (0)

iterations count:796 (3), effective:19 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:318 (1), effective:12 (0)

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

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

iterations count:529 (2), effective:10 (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="DLCround-PT-07a"
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 DLCround-PT-07a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r106-tall-167814483100682"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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