About the Execution of Marcie+red for DLCround-PT-03a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5449.728 | 8929.00 | 13249.00 | 288.70 | FTFFFFTTTTTFFTTF | normal |
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-167814483000618.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-03a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483000618
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 18:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 18:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 25 18:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:52 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 148K 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-03a-CTLFireability-00
FORMULA_NAME DLCround-PT-03a-CTLFireability-01
FORMULA_NAME DLCround-PT-03a-CTLFireability-02
FORMULA_NAME DLCround-PT-03a-CTLFireability-03
FORMULA_NAME DLCround-PT-03a-CTLFireability-04
FORMULA_NAME DLCround-PT-03a-CTLFireability-05
FORMULA_NAME DLCround-PT-03a-CTLFireability-06
FORMULA_NAME DLCround-PT-03a-CTLFireability-07
FORMULA_NAME DLCround-PT-03a-CTLFireability-08
FORMULA_NAME DLCround-PT-03a-CTLFireability-09
FORMULA_NAME DLCround-PT-03a-CTLFireability-10
FORMULA_NAME DLCround-PT-03a-CTLFireability-11
FORMULA_NAME DLCround-PT-03a-CTLFireability-12
FORMULA_NAME DLCround-PT-03a-CTLFireability-13
FORMULA_NAME DLCround-PT-03a-CTLFireability-14
FORMULA_NAME DLCround-PT-03a-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678445647522
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-03a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 10:54:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 10:54:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 10:54:09] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2023-03-10 10:54:09] [INFO ] Transformed 113 places.
[2023-03-10 10:54:09] [INFO ] Transformed 617 transitions.
[2023-03-10 10:54:09] [INFO ] Found NUPN structural information;
[2023-03-10 10:54:09] [INFO ] Parsed PT model containing 113 places and 617 transitions and 2269 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 72 transitions
Reduce redundant transitions removed 72 transitions.
FORMULA DLCround-PT-03a-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 545/545 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 109 transition count 517
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 109 transition count 517
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 109 transition count 516
Drop transitions removed 158 transitions
Redundant transition composition rules discarded 158 transitions
Iterating global reduction 1 with 158 rules applied. Total rules applied 167 place count 109 transition count 358
Applied a total of 167 rules in 32 ms. Remains 109 /113 variables (removed 4) and now considering 358/545 (removed 187) transitions.
[2023-03-10 10:54:09] [INFO ] Flow matrix only has 101 transitions (discarded 257 similar events)
// Phase 1: matrix 101 rows 109 cols
[2023-03-10 10:54:09] [INFO ] Computed 52 place invariants in 13 ms
[2023-03-10 10:54:09] [INFO ] Implicit Places using invariants in 313 ms returned [66, 70, 71, 75, 79, 80, 82, 86, 89, 92, 99, 100, 105, 107, 108]
Discarding 15 places :
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Implicit Place search using SMT only with invariants took 343 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/113 places, 306/545 transitions.
Drop transitions removed 167 transitions
Redundant transition composition rules discarded 167 transitions
Iterating global reduction 0 with 167 rules applied. Total rules applied 167 place count 94 transition count 139
Applied a total of 167 rules in 4 ms. Remains 94 /94 variables (removed 0) and now considering 139/306 (removed 167) transitions.
[2023-03-10 10:54:09] [INFO ] Flow matrix only has 101 transitions (discarded 38 similar events)
// Phase 1: matrix 101 rows 94 cols
[2023-03-10 10:54:09] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-10 10:54:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-10 10:54:09] [INFO ] Flow matrix only has 101 transitions (discarded 38 similar events)
[2023-03-10 10:54:09] [INFO ] Invariant cache hit.
[2023-03-10 10:54:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 10:54:10] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 94/113 places, 139/545 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 500 ms. Remains : 94/113 places, 139/545 transitions.
Support contains 64 out of 94 places after structural reductions.
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 30 ms
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 11 ms
[2023-03-10 10:54:10] [INFO ] Input system was already deterministic with 139 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 45) seen :44
Finished Best-First random walk after 620 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=124 )
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 7 ms
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 7 ms
[2023-03-10 10:54:10] [INFO ] Input system was already deterministic with 139 transitions.
Computed a total of 30 stabilizing places and 1 stable transitions
Graph (complete) has 184 edges and 94 vertex of which 69 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 139/139 transitions.
Graph (trivial) has 72 edges and 94 vertex of which 24 / 94 are part of one of the 5 SCC in 3 ms
Free SCC test removed 19 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Graph (complete) has 144 edges and 75 vertex of which 59 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 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 59 transition count 98
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 58 transition count 93
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 15 place count 53 transition count 92
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 21 place count 47 transition count 82
Iterating global reduction 3 with 6 rules applied. Total rules applied 27 place count 47 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 29 place count 47 transition count 80
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 31 place count 46 transition count 79
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 34 place count 46 transition count 76
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 35 place count 46 transition count 76
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 36 place count 45 transition count 75
Iterating global reduction 5 with 1 rules applied. Total rules applied 37 place count 45 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 38 place count 45 transition count 74
Applied a total of 38 rules in 21 ms. Remains 45 /94 variables (removed 49) and now considering 74/139 (removed 65) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 45/94 places, 74/139 transitions.
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 3 ms
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 2 ms
[2023-03-10 10:54:10] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 139/139 transitions.
Graph (trivial) has 109 edges and 94 vertex of which 48 / 94 are part of one of the 7 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Graph (complete) has 91 edges and 53 vertex of which 32 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 32 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 30 transition count 45
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 13 place count 23 transition count 37
Iterating global reduction 2 with 7 rules applied. Total rules applied 20 place count 23 transition count 37
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 23 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 22 transition count 35
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 21 transition count 34
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 21 transition count 34
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 21 transition count 34
Applied a total of 26 rules in 6 ms. Remains 21 /94 variables (removed 73) and now considering 34/139 (removed 105) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 21/94 places, 34/139 transitions.
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 2 ms
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 2 ms
[2023-03-10 10:54:10] [INFO ] Input system was already deterministic with 34 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 139/139 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 71 transition count 139
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 37 place count 57 transition count 113
Iterating global reduction 1 with 14 rules applied. Total rules applied 51 place count 57 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 54 place count 57 transition count 110
Applied a total of 54 rules in 3 ms. Remains 57 /94 variables (removed 37) and now considering 110/139 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 57/94 places, 110/139 transitions.
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 3 ms
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 4 ms
[2023-03-10 10:54:10] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 139/139 transitions.
Graph (trivial) has 128 edges and 94 vertex of which 60 / 94 are part of one of the 8 SCC in 0 ms
Free SCC test removed 52 places
Ensure Unique test removed 117 transitions
Reduce isomorphic transitions removed 117 transitions.
Graph (complete) has 66 edges and 42 vertex of which 18 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 18 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 17 transition count 21
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 11 place count 10 transition count 14
Iterating global reduction 2 with 7 rules applied. Total rules applied 18 place count 10 transition count 14
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 10 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 9 transition count 12
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 8 transition count 11
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 8 transition count 11
Applied a total of 23 rules in 3 ms. Remains 8 /94 variables (removed 86) and now considering 11/139 (removed 128) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 8/94 places, 11/139 transitions.
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 1 ms
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 1 ms
[2023-03-10 10:54:10] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 139/139 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 71 transition count 139
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 37 place count 57 transition count 114
Iterating global reduction 1 with 14 rules applied. Total rules applied 51 place count 57 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 57 transition count 112
Applied a total of 53 rules in 3 ms. Remains 57 /94 variables (removed 37) and now considering 112/139 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 57/94 places, 112/139 transitions.
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 4 ms
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 3 ms
[2023-03-10 10:54:10] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 139/139 transitions.
Graph (trivial) has 122 edges and 94 vertex of which 58 / 94 are part of one of the 8 SCC in 1 ms
Free SCC test removed 50 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Graph (complete) has 71 edges and 44 vertex of which 23 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 8 place count 17 transition count 21
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 17 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 17 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 16 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 15 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 15 transition count 19
Applied a total of 18 rules in 4 ms. Remains 15 /94 variables (removed 79) and now considering 19/139 (removed 120) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 15/94 places, 19/139 transitions.
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 0 ms
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 1 ms
[2023-03-10 10:54:10] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 139/139 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 73 transition count 139
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 34 place count 60 transition count 116
Iterating global reduction 1 with 13 rules applied. Total rules applied 47 place count 60 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 60 transition count 114
Applied a total of 49 rules in 3 ms. Remains 60 /94 variables (removed 34) and now considering 114/139 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 60/94 places, 114/139 transitions.
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 4 ms
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 4 ms
[2023-03-10 10:54:10] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 139/139 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 70 transition count 139
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 37 place count 57 transition count 115
Iterating global reduction 1 with 13 rules applied. Total rules applied 50 place count 57 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 57 transition count 112
Applied a total of 53 rules in 3 ms. Remains 57 /94 variables (removed 37) and now considering 112/139 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 57/94 places, 112/139 transitions.
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 3 ms
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 3 ms
[2023-03-10 10:54:10] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 139/139 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 72 transition count 139
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 36 place count 58 transition count 114
Iterating global reduction 1 with 14 rules applied. Total rules applied 50 place count 58 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 58 transition count 111
Applied a total of 53 rules in 2 ms. Remains 58 /94 variables (removed 36) and now considering 111/139 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 58/94 places, 111/139 transitions.
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 4 ms
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 4 ms
[2023-03-10 10:54:10] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 139/139 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 69 transition count 139
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 39 place count 55 transition count 114
Iterating global reduction 1 with 14 rules applied. Total rules applied 53 place count 55 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 56 place count 55 transition count 111
Applied a total of 56 rules in 2 ms. Remains 55 /94 variables (removed 39) and now considering 111/139 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 55/94 places, 111/139 transitions.
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 3 ms
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 3 ms
[2023-03-10 10:54:10] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 139/139 transitions.
Graph (trivial) has 75 edges and 94 vertex of which 25 / 94 are part of one of the 4 SCC in 0 ms
Free SCC test removed 21 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Graph (complete) has 137 edges and 73 vertex of which 57 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 57 transition count 89
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 54 transition count 86
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 15 place count 51 transition count 85
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 22 place count 44 transition count 75
Iterating global reduction 3 with 7 rules applied. Total rules applied 29 place count 44 transition count 75
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 44 transition count 73
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 35 place count 44 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 37 place count 42 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 42 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 42 transition count 69
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 42 transition count 67
Applied a total of 43 rules in 11 ms. Remains 42 /94 variables (removed 52) and now considering 67/139 (removed 72) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 42/94 places, 67/139 transitions.
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 2 ms
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 2 ms
[2023-03-10 10:54:10] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 139/139 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 72 transition count 139
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 35 place count 59 transition count 116
Iterating global reduction 1 with 13 rules applied. Total rules applied 48 place count 59 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 59 transition count 114
Applied a total of 50 rules in 2 ms. Remains 59 /94 variables (removed 35) and now considering 114/139 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 59/94 places, 114/139 transitions.
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 4 ms
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 4 ms
[2023-03-10 10:54:10] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 139/139 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 76 transition count 139
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 31 place count 63 transition count 116
Iterating global reduction 1 with 13 rules applied. Total rules applied 44 place count 63 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 63 transition count 114
Applied a total of 46 rules in 2 ms. Remains 63 /94 variables (removed 31) and now considering 114/139 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 63/94 places, 114/139 transitions.
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 4 ms
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 4 ms
[2023-03-10 10:54:10] [INFO ] Input system was already deterministic with 114 transitions.
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 5 ms
[2023-03-10 10:54:10] [INFO ] Flatten gal took : 6 ms
[2023-03-10 10:54:10] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-10 10:54:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 94 places, 139 transitions and 322 arcs took 1 ms.
Total runtime 1588 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: 94 NrTr: 139 NrArc: 322)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 2.878sec
RS generation: 0m 0.006sec
-> reachability set: #nodes 328 (3.3e+02) #states 13,891,501 (7)
starting MCC model checker
--------------------------
checking: EX [AG [[p55<=0 & 0<=p55]]]
normalized: EX [~ [E [true U ~ [[p55<=0 & 0<=p55]]]]]
abstracting: (0<=p55)
states: 13,891,501 (7)
abstracting: (p55<=0)
states: 12,502,351 (7)
.-> the formula is FALSE
FORMULA DLCround-PT-03a-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: EG [[EF [[p34<=1 & 1<=p34]] & AF [AG [AF [[[p48<=0 & 0<=p48] | [p80<=0 & 0<=p80]]]]]]]
normalized: EG [[~ [EG [E [true U EG [~ [[[p80<=0 & 0<=p80] | [p48<=0 & 0<=p48]]]]]]] & E [true U [p34<=1 & 1<=p34]]]]
abstracting: (1<=p34)
states: 1,389,150 (6)
abstracting: (p34<=1)
states: 13,891,501 (7)
abstracting: (0<=p48)
states: 13,891,501 (7)
abstracting: (p48<=0)
states: 12,348,001 (7)
abstracting: (0<=p80)
states: 13,891,501 (7)
abstracting: (p80<=0)
states: 1
.
EG iterations: 1
EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA DLCround-PT-03a-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: AX [EF [[AG [[[p45<=0 & 0<=p45] | [p89<=0 & 0<=p89]]] & EG [[[p9<=0 & 0<=p9] | [p82<=0 & 0<=p82]]]]]]
normalized: ~ [EX [~ [E [true U [EG [[[p82<=0 & 0<=p82] | [p9<=0 & 0<=p9]]] & ~ [E [true U ~ [[[p89<=0 & 0<=p89] | [p45<=0 & 0<=p45]]]]]]]]]]
abstracting: (0<=p45)
states: 13,891,501 (7)
abstracting: (p45<=0)
states: 12,348,001 (7)
abstracting: (0<=p89)
states: 13,891,501 (7)
abstracting: (p89<=0)
states: 1
abstracting: (0<=p9)
states: 13,891,501 (7)
abstracting: (p9<=0)
states: 11,907,001 (7)
abstracting: (0<=p82)
states: 13,891,501 (7)
abstracting: (p82<=0)
states: 1
.
EG iterations: 1
.-> the formula is FALSE
FORMULA DLCround-PT-03a-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: EX [[EX [[p45<=1 & 1<=p45]] | [[[p48<=1 & 1<=p48] & [p91<=1 & 1<=p91]] | [[p53<=1 & 1<=p53] & [p78<=1 & 1<=p78]]]]]
normalized: EX [[[[[p78<=1 & 1<=p78] & [p53<=1 & 1<=p53]] | [[p91<=1 & 1<=p91] & [p48<=1 & 1<=p48]]] | EX [[p45<=1 & 1<=p45]]]]
abstracting: (1<=p45)
states: 1,543,500 (6)
abstracting: (p45<=1)
states: 13,891,501 (7)
.abstracting: (1<=p48)
states: 1,543,500 (6)
abstracting: (p48<=1)
states: 13,891,501 (7)
abstracting: (1<=p91)
states: 13,891,500 (7)
abstracting: (p91<=1)
states: 13,891,501 (7)
abstracting: (1<=p53)
states: 1,543,500 (6)
abstracting: (p53<=1)
states: 13,891,501 (7)
abstracting: (1<=p78)
states: 13,891,500 (7)
abstracting: (p78<=1)
states: 13,891,501 (7)
.-> the formula is TRUE
FORMULA DLCround-PT-03a-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: AX [[EX [~ [A [~ [[[p7<=1 & 1<=p7] & [p70<=1 & 1<=p70]]] U AX [[[p45<=1 & 1<=p45] & [p72<=1 & 1<=p72]]]]]] | [[p11<=1 & 1<=p11] & [p66<=1 & 1<=p66]]]]
normalized: ~ [EX [~ [[[[p66<=1 & 1<=p66] & [p11<=1 & 1<=p11]] | EX [~ [[~ [EG [EX [~ [[[p72<=1 & 1<=p72] & [p45<=1 & 1<=p45]]]]]] & ~ [E [EX [~ [[[p72<=1 & 1<=p72] & [p45<=1 & 1<=p45]]]] U [[[p70<=1 & 1<=p70] & [p7<=1 & 1<=p7]] & EX [~ [[[p72<=1 & 1<=p72] & [p45<=1 & 1<=p45]]]]]]]]]]]]]]
abstracting: (1<=p45)
states: 1,543,500 (6)
abstracting: (p45<=1)
states: 13,891,501 (7)
abstracting: (1<=p72)
states: 13,891,500 (7)
abstracting: (p72<=1)
states: 13,891,501 (7)
.abstracting: (1<=p7)
states: 1,984,500 (6)
abstracting: (p7<=1)
states: 13,891,501 (7)
abstracting: (1<=p70)
states: 13,891,500 (7)
abstracting: (p70<=1)
states: 13,891,501 (7)
abstracting: (1<=p45)
states: 1,543,500 (6)
abstracting: (p45<=1)
states: 13,891,501 (7)
abstracting: (1<=p72)
states: 13,891,500 (7)
abstracting: (p72<=1)
states: 13,891,501 (7)
.abstracting: (1<=p45)
states: 1,543,500 (6)
abstracting: (p45<=1)
states: 13,891,501 (7)
abstracting: (1<=p72)
states: 13,891,500 (7)
abstracting: (p72<=1)
states: 13,891,501 (7)
..
EG iterations: 1
.abstracting: (1<=p11)
states: 1,984,500 (6)
abstracting: (p11<=1)
states: 13,891,501 (7)
abstracting: (1<=p66)
states: 13,891,500 (7)
abstracting: (p66<=1)
states: 13,891,501 (7)
.-> the formula is TRUE
FORMULA DLCround-PT-03a-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: EX [[EF [[p0<=1 & 1<=p0]] | [AF [AG [[[p63<=0 & 0<=p63] | [p83<=0 & 0<=p83]]]] & EF [[[[p34<=0 & 0<=p34] | [p88<=0 & 0<=p88]] | [[p44<=0 & 0<=p44] | [p90<=0 & 0<=p90]]]]]]]
normalized: EX [[[E [true U [[[p90<=0 & 0<=p90] | [p44<=0 & 0<=p44]] | [[p88<=0 & 0<=p88] | [p34<=0 & 0<=p34]]]] & ~ [EG [E [true U ~ [[[p83<=0 & 0<=p83] | [p63<=0 & 0<=p63]]]]]]] | E [true U [p0<=1 & 1<=p0]]]]
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 13,891,501 (7)
abstracting: (0<=p63)
states: 13,891,501 (7)
abstracting: (p63<=0)
states: 12,502,351 (7)
abstracting: (0<=p83)
states: 13,891,501 (7)
abstracting: (p83<=0)
states: 1
EG iterations: 0
abstracting: (0<=p34)
states: 13,891,501 (7)
abstracting: (p34<=0)
states: 12,502,351 (7)
abstracting: (0<=p88)
states: 13,891,501 (7)
abstracting: (p88<=0)
states: 1
abstracting: (0<=p44)
states: 13,891,501 (7)
abstracting: (p44<=0)
states: 12,348,001 (7)
abstracting: (0<=p90)
states: 13,891,501 (7)
abstracting: (p90<=0)
states: 1
.-> the formula is FALSE
FORMULA DLCround-PT-03a-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: EF [[A [~ [AX [[[p44<=1 & 1<=p44] & [p71<=1 & 1<=p71]]]] U EX [[[p55<=1 & 1<=p55] & [p93<=1 & 1<=p93]]]] & [EG [[p56<=0 & 0<=p56]] & [[p2<=0 & 0<=p2] | [p65<=0 & 0<=p65]]]]]
normalized: E [true U [[[[p65<=0 & 0<=p65] | [p2<=0 & 0<=p2]] & EG [[p56<=0 & 0<=p56]]] & [~ [EG [~ [EX [[[p93<=1 & 1<=p93] & [p55<=1 & 1<=p55]]]]]] & ~ [E [~ [EX [[[p93<=1 & 1<=p93] & [p55<=1 & 1<=p55]]]] U [~ [EX [~ [[[p71<=1 & 1<=p71] & [p44<=1 & 1<=p44]]]]] & ~ [EX [[[p93<=1 & 1<=p93] & [p55<=1 & 1<=p55]]]]]]]]]]
abstracting: (1<=p55)
states: 1,389,150 (6)
abstracting: (p55<=1)
states: 13,891,501 (7)
abstracting: (1<=p93)
states: 13,891,500 (7)
abstracting: (p93<=1)
states: 13,891,501 (7)
.abstracting: (1<=p44)
states: 1,543,500 (6)
abstracting: (p44<=1)
states: 13,891,501 (7)
abstracting: (1<=p71)
states: 13,891,500 (7)
abstracting: (p71<=1)
states: 13,891,501 (7)
.abstracting: (1<=p55)
states: 1,389,150 (6)
abstracting: (p55<=1)
states: 13,891,501 (7)
abstracting: (1<=p93)
states: 13,891,500 (7)
abstracting: (p93<=1)
states: 13,891,501 (7)
.abstracting: (1<=p55)
states: 1,389,150 (6)
abstracting: (p55<=1)
states: 13,891,501 (7)
abstracting: (1<=p93)
states: 13,891,500 (7)
abstracting: (p93<=1)
states: 13,891,501 (7)
...
EG iterations: 2
abstracting: (0<=p56)
states: 13,891,501 (7)
abstracting: (p56<=0)
states: 12,502,351 (7)
.
EG iterations: 1
abstracting: (0<=p2)
states: 13,891,501 (7)
abstracting: (p2<=0)
states: 11,907,001 (7)
abstracting: (0<=p65)
states: 13,891,501 (7)
abstracting: (p65<=0)
states: 1
-> the formula is TRUE
FORMULA DLCround-PT-03a-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: EG [[[p32<=0 & 0<=p32] | [[p87<=0 & 0<=p87] | A [A [[[p50<=1 & 1<=p50] & [p92<=1 & 1<=p92]] U [[p30<=1 & 1<=p30] & [p67<=1 & 1<=p67]]] U EG [[[p57<=1 & 1<=p57] & [p84<=1 & 1<=p84]]]]]]]
normalized: EG [[[[~ [EG [~ [EG [[[p84<=1 & 1<=p84] & [p57<=1 & 1<=p57]]]]]] & ~ [E [~ [EG [[[p84<=1 & 1<=p84] & [p57<=1 & 1<=p57]]]] U [~ [[~ [EG [~ [[[p67<=1 & 1<=p67] & [p30<=1 & 1<=p30]]]]] & ~ [E [~ [[[p67<=1 & 1<=p67] & [p30<=1 & 1<=p30]]] U [~ [[[p92<=1 & 1<=p92] & [p50<=1 & 1<=p50]]] & ~ [[[p67<=1 & 1<=p67] & [p30<=1 & 1<=p30]]]]]]]] & ~ [EG [[[p84<=1 & 1<=p84] & [p57<=1 & 1<=p57]]]]]]]] | [p87<=0 & 0<=p87]] | [p32<=0 & 0<=p32]]]
abstracting: (0<=p32)
states: 13,891,501 (7)
abstracting: (p32<=0)
states: 12,502,351 (7)
abstracting: (0<=p87)
states: 13,891,501 (7)
abstracting: (p87<=0)
states: 1
abstracting: (1<=p57)
states: 1,389,150 (6)
abstracting: (p57<=1)
states: 13,891,501 (7)
abstracting: (1<=p84)
states: 13,891,500 (7)
abstracting: (p84<=1)
states: 13,891,501 (7)
.
EG iterations: 1
abstracting: (1<=p30)
states: 1,389,150 (6)
abstracting: (p30<=1)
states: 13,891,501 (7)
abstracting: (1<=p67)
states: 13,891,500 (7)
abstracting: (p67<=1)
states: 13,891,501 (7)
abstracting: (1<=p50)
states: 1,543,500 (6)
abstracting: (p50<=1)
states: 13,891,501 (7)
abstracting: (1<=p92)
states: 13,891,500 (7)
abstracting: (p92<=1)
states: 13,891,501 (7)
abstracting: (1<=p30)
states: 1,389,150 (6)
abstracting: (p30<=1)
states: 13,891,501 (7)
abstracting: (1<=p67)
states: 13,891,500 (7)
abstracting: (p67<=1)
states: 13,891,501 (7)
abstracting: (1<=p30)
states: 1,389,150 (6)
abstracting: (p30<=1)
states: 13,891,501 (7)
abstracting: (1<=p67)
states: 13,891,500 (7)
abstracting: (p67<=1)
states: 13,891,501 (7)
.
EG iterations: 1
abstracting: (1<=p57)
states: 1,389,150 (6)
abstracting: (p57<=1)
states: 13,891,501 (7)
abstracting: (1<=p84)
states: 13,891,500 (7)
abstracting: (p84<=1)
states: 13,891,501 (7)
.
EG iterations: 1
abstracting: (1<=p57)
states: 1,389,150 (6)
abstracting: (p57<=1)
states: 13,891,501 (7)
abstracting: (1<=p84)
states: 13,891,500 (7)
abstracting: (p84<=1)
states: 13,891,501 (7)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA DLCround-PT-03a-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: EF [[[[p8<=1 & 1<=p8] & AF [EG [[[p44<=0 & 0<=p44] | [p70<=0 & 0<=p70]]]]] & [[p43<=1 & 1<=p43] & [[[p14<=0 & 0<=p14] | [p82<=0 & 0<=p82]] & [[[p37<=1 & 1<=p37] & [p74<=1 & 1<=p74]] | [[p61<=1 & 1<=p61] & [p84<=1 & 1<=p84]]]]]]]
normalized: E [true U [[[[[[p84<=1 & 1<=p84] & [p61<=1 & 1<=p61]] | [[p74<=1 & 1<=p74] & [p37<=1 & 1<=p37]]] & [[p82<=0 & 0<=p82] | [p14<=0 & 0<=p14]]] & [p43<=1 & 1<=p43]] & [~ [EG [~ [EG [[[p70<=0 & 0<=p70] | [p44<=0 & 0<=p44]]]]]] & [p8<=1 & 1<=p8]]]]
abstracting: (1<=p8)
states: 1,984,500 (6)
abstracting: (p8<=1)
states: 13,891,501 (7)
abstracting: (0<=p44)
states: 13,891,501 (7)
abstracting: (p44<=0)
states: 12,348,001 (7)
abstracting: (0<=p70)
states: 13,891,501 (7)
abstracting: (p70<=0)
states: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p43)
states: 1,543,500 (6)
abstracting: (p43<=1)
states: 13,891,501 (7)
abstracting: (0<=p14)
states: 13,891,501 (7)
abstracting: (p14<=0)
states: 11,907,001 (7)
abstracting: (0<=p82)
states: 13,891,501 (7)
abstracting: (p82<=0)
states: 1
abstracting: (1<=p37)
states: 1,543,500 (6)
abstracting: (p37<=1)
states: 13,891,501 (7)
abstracting: (1<=p74)
states: 13,891,500 (7)
abstracting: (p74<=1)
states: 13,891,501 (7)
abstracting: (1<=p61)
states: 1,389,150 (6)
abstracting: (p61<=1)
states: 13,891,501 (7)
abstracting: (1<=p84)
states: 13,891,500 (7)
abstracting: (p84<=1)
states: 13,891,501 (7)
-> the formula is TRUE
FORMULA DLCround-PT-03a-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: E [AF [EX [[~ [[[[p11<=1 & 1<=p11] & [p76<=1 & 1<=p76]] & [[p19<=1 & 1<=p19] & [p84<=1 & 1<=p84]]]] | [[p26<=1 & 1<=p26] & [p79<=1 & 1<=p79]]]]] U [[[p14<=1 & 1<=p14] & [p76<=1 & 1<=p76]] & [[p21<=1 & 1<=p21] & [p85<=1 & 1<=p85]]]]
normalized: E [~ [EG [~ [EX [[[[p79<=1 & 1<=p79] & [p26<=1 & 1<=p26]] | ~ [[[[p84<=1 & 1<=p84] & [p19<=1 & 1<=p19]] & [[p76<=1 & 1<=p76] & [p11<=1 & 1<=p11]]]]]]]]] U [[[p85<=1 & 1<=p85] & [p21<=1 & 1<=p21]] & [[p76<=1 & 1<=p76] & [p14<=1 & 1<=p14]]]]
abstracting: (1<=p14)
states: 1,984,500 (6)
abstracting: (p14<=1)
states: 13,891,501 (7)
abstracting: (1<=p76)
states: 13,891,500 (7)
abstracting: (p76<=1)
states: 13,891,501 (7)
abstracting: (1<=p21)
states: 1,984,500 (6)
abstracting: (p21<=1)
states: 13,891,501 (7)
abstracting: (1<=p85)
states: 13,891,500 (7)
abstracting: (p85<=1)
states: 13,891,501 (7)
abstracting: (1<=p11)
states: 1,984,500 (6)
abstracting: (p11<=1)
states: 13,891,501 (7)
abstracting: (1<=p76)
states: 13,891,500 (7)
abstracting: (p76<=1)
states: 13,891,501 (7)
abstracting: (1<=p19)
states: 2,778,300 (6)
abstracting: (p19<=1)
states: 13,891,501 (7)
abstracting: (1<=p84)
states: 13,891,500 (7)
abstracting: (p84<=1)
states: 13,891,501 (7)
abstracting: (1<=p26)
states: 1,984,500 (6)
abstracting: (p26<=1)
states: 13,891,501 (7)
abstracting: (1<=p79)
states: 13,891,500 (7)
abstracting: (p79<=1)
states: 13,891,501 (7)
..
EG iterations: 1
-> the formula is TRUE
FORMULA DLCround-PT-03a-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: E [EF [~ [EX [~ [[[p34<=1 & 1<=p34] & [[p88<=1 & 1<=p88] & [p26<=1 & 1<=p26]]]]]]] U [[EF [[[[p35<=1 & 1<=p35] & [p66<=1 & 1<=p66]] | [[p26<=1 & 1<=p26] & [p80<=1 & 1<=p80]]]] & EF [[[p1<=1 & 1<=p1] & [p75<=1 & 1<=p75]]]] & [EG [[AF [[[p49<=1 & 1<=p49] & [p77<=1 & 1<=p77]]] | ~ [[[p30<=1 & 1<=p30] & [p69<=1 & 1<=p69]]]]] & [[p14<=1 & 1<=p14] & [p67<=1 & 1<=p67]]]]]
normalized: E [E [true U ~ [EX [~ [[[[p26<=1 & 1<=p26] & [p88<=1 & 1<=p88]] & [p34<=1 & 1<=p34]]]]]] U [[[[p67<=1 & 1<=p67] & [p14<=1 & 1<=p14]] & EG [[~ [[[p69<=1 & 1<=p69] & [p30<=1 & 1<=p30]]] | ~ [EG [~ [[[p77<=1 & 1<=p77] & [p49<=1 & 1<=p49]]]]]]]] & [E [true U [[p75<=1 & 1<=p75] & [p1<=1 & 1<=p1]]] & E [true U [[[p80<=1 & 1<=p80] & [p26<=1 & 1<=p26]] | [[p66<=1 & 1<=p66] & [p35<=1 & 1<=p35]]]]]]]
abstracting: (1<=p35)
states: 1,389,150 (6)
abstracting: (p35<=1)
states: 13,891,501 (7)
abstracting: (1<=p66)
states: 13,891,500 (7)
abstracting: (p66<=1)
states: 13,891,501 (7)
abstracting: (1<=p26)
states: 1,984,500 (6)
abstracting: (p26<=1)
states: 13,891,501 (7)
abstracting: (1<=p80)
states: 13,891,500 (7)
abstracting: (p80<=1)
states: 13,891,501 (7)
abstracting: (1<=p1)
states: 1,984,500 (6)
abstracting: (p1<=1)
states: 13,891,501 (7)
abstracting: (1<=p75)
states: 13,891,500 (7)
abstracting: (p75<=1)
states: 13,891,501 (7)
abstracting: (1<=p49)
states: 1,543,500 (6)
abstracting: (p49<=1)
states: 13,891,501 (7)
abstracting: (1<=p77)
states: 13,891,500 (7)
abstracting: (p77<=1)
states: 13,891,501 (7)
.
EG iterations: 1
abstracting: (1<=p30)
states: 1,389,150 (6)
abstracting: (p30<=1)
states: 13,891,501 (7)
abstracting: (1<=p69)
states: 13,891,500 (7)
abstracting: (p69<=1)
states: 13,891,501 (7)
.
EG iterations: 1
abstracting: (1<=p14)
states: 1,984,500 (6)
abstracting: (p14<=1)
states: 13,891,501 (7)
abstracting: (1<=p67)
states: 13,891,500 (7)
abstracting: (p67<=1)
states: 13,891,501 (7)
abstracting: (1<=p34)
states: 1,389,150 (6)
abstracting: (p34<=1)
states: 13,891,501 (7)
abstracting: (1<=p88)
states: 13,891,500 (7)
abstracting: (p88<=1)
states: 13,891,501 (7)
abstracting: (1<=p26)
states: 1,984,500 (6)
abstracting: (p26<=1)
states: 13,891,501 (7)
.-> the formula is FALSE
FORMULA DLCround-PT-03a-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: [A [A [[[p53<=1 & 1<=p53] & [p75<=1 & 1<=p75]] U A [A [[[p36<=1 & 1<=p36] & [p88<=1 & 1<=p88]] U [[p26<=1 & 1<=p26] & [p86<=1 & 1<=p86]]] U [[[p63<=1 & 1<=p63] & [p82<=1 & 1<=p82]] & [[p35<=1 & 1<=p35] & [[p68<=1 & 1<=p68] & EF [[p28<=1 & 1<=p28]]]]]]] U ~ [[A [[[p30<=1 & 1<=p30] & [p87<=1 & 1<=p87]] U [[p20<=1 & 1<=p20] & [p85<=1 & 1<=p85]]] & ~ [[p35<=1 & 1<=p35]]]]] & [EF [[[p49<=0 & 0<=p49] | [p92<=0 & 0<=p92]]] & AF [[AG [[[p64<=0 & 0<=p64] | [[p19<=0 & 0<=p19] | [p84<=0 & 0<=p84]]]] & [[p29<=0 & 0<=p29] | [p67<=0 & 0<=p67]]]]]]
normalized: [[~ [EG [~ [[[[p67<=0 & 0<=p67] | [p29<=0 & 0<=p29]] & ~ [E [true U ~ [[[[p84<=0 & 0<=p84] | [p19<=0 & 0<=p19]] | [p64<=0 & 0<=p64]]]]]]]]] & E [true U [[p92<=0 & 0<=p92] | [p49<=0 & 0<=p49]]]] & [~ [EG [[~ [[p35<=1 & 1<=p35]] & [~ [EG [~ [[[p85<=1 & 1<=p85] & [p20<=1 & 1<=p20]]]]] & ~ [E [~ [[[p85<=1 & 1<=p85] & [p20<=1 & 1<=p20]]] U [~ [[[p87<=1 & 1<=p87] & [p30<=1 & 1<=p30]]] & ~ [[[p85<=1 & 1<=p85] & [p20<=1 & 1<=p20]]]]]]]]]] & ~ [E [[~ [[p35<=1 & 1<=p35]] & [~ [EG [~ [[[p85<=1 & 1<=p85] & [p20<=1 & 1<=p20]]]]] & ~ [E [~ [[[p85<=1 & 1<=p85] & [p20<=1 & 1<=p20]]] U [~ [[[p87<=1 & 1<=p87] & [p30<=1 & 1<=p30]]] & ~ [[[p85<=1 & 1<=p85] & [p20<=1 & 1<=p20]]]]]]]] U [~ [[~ [EG [~ [[~ [EG [~ [[[[E [true U [p28<=1 & 1<=p28]] & [p68<=1 & 1<=p68]] & [p35<=1 & 1<=p35]] & [[p82<=1 & 1<=p82] & [p63<=1 & 1<=p63]]]]]] & ~ [E [~ [[[[E [true U [p28<=1 & 1<=p28]] & [p68<=1 & 1<=p68]] & [p35<=1 & 1<=p35]] & [[p82<=1 & 1<=p82] & [p63<=1 & 1<=p63]]]] U [~ [[~ [EG [~ [[[p86<=1 & 1<=p86] & [p26<=1 & 1<=p26]]]]] & ~ [E [~ [[[p86<=1 & 1<=p86] & [p26<=1 & 1<=p26]]] U [~ [[[p88<=1 & 1<=p88] & [p36<=1 & 1<=p36]]] & ~ [[[p86<=1 & 1<=p86] & [p26<=1 & 1<=p26]]]]]]]] & ~ [[[[E [true U [p28<=1 & 1<=p28]] & [p68<=1 & 1<=p68]] & [p35<=1 & 1<=p35]] & [[p82<=1 & 1<=p82] & [p63<=1 & 1<=p63]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[[E [true U [p28<=1 & 1<=p28]] & [p68<=1 & 1<=p68]] & [p35<=1 & 1<=p35]] & [[p82<=1 & 1<=p82] & [p63<=1 & 1<=p63]]]]]] & ~ [E [~ [[[[E [true U [p28<=1 & 1<=p28]] & [p68<=1 & 1<=p68]] & [p35<=1 & 1<=p35]] & [[p82<=1 & 1<=p82] & [p63<=1 & 1<=p63]]]] U [~ [[~ [EG [~ [[[p86<=1 & 1<=p86] & [p26<=1 & 1<=p26]]]]] & ~ [E [~ [[[p86<=1 & 1<=p86] & [p26<=1 & 1<=p26]]] U [~ [[[p88<=1 & 1<=p88] & [p36<=1 & 1<=p36]]] & ~ [[[p86<=1 & 1<=p86] & [p26<=1 & 1<=p26]]]]]]]] & ~ [[[[E [true U [p28<=1 & 1<=p28]] & [p68<=1 & 1<=p68]] & [p35<=1 & 1<=p35]] & [[p82<=1 & 1<=p82] & [p63<=1 & 1<=p63]]]]]]]]] U [~ [[[p75<=1 & 1<=p75] & [p53<=1 & 1<=p53]]] & ~ [[~ [EG [~ [[[[E [true U [p28<=1 & 1<=p28]] & [p68<=1 & 1<=p68]] & [p35<=1 & 1<=p35]] & [[p82<=1 & 1<=p82] & [p63<=1 & 1<=p63]]]]]] & ~ [E [~ [[[[E [true U [p28<=1 & 1<=p28]] & [p68<=1 & 1<=p68]] & [p35<=1 & 1<=p35]] & [[p82<=1 & 1<=p82] & [p63<=1 & 1<=p63]]]] U [~ [[~ [EG [~ [[[p86<=1 & 1<=p86] & [p26<=1 & 1<=p26]]]]] & ~ [E [~ [[[p86<=1 & 1<=p86] & [p26<=1 & 1<=p26]]] U [~ [[[p88<=1 & 1<=p88] & [p36<=1 & 1<=p36]]] & ~ [[[p86<=1 & 1<=p86] & [p26<=1 & 1<=p26]]]]]]]] & ~ [[[[E [true U [p28<=1 & 1<=p28]] & [p68<=1 & 1<=p68]] & [p35<=1 & 1<=p35]] & [[p82<=1 & 1<=p82] & [p63<=1 & 1<=p63]]]]]]]]]]]]]] & [~ [[p35<=1 & 1<=p35]] & [~ [EG [~ [[[p85<=1 & 1<=p85] & [p20<=1 & 1<=p20]]]]] & ~ [E [~ [[[p85<=1 & 1<=p85] & [p20<=1 & 1<=p20]]] U [~ [[[p87<=1 & 1<=p87] & [p30<=1 & 1<=p30]]] & ~ [[[p85<=1 & 1<=p85] & [p20<=1 & 1<=p20]]]]]]]]]]]]]
abstracting: (1<=p20)
states: 1,984,500 (6)
abstracting: (p20<=1)
states: 13,891,501 (7)
abstracting: (1<=p85)
states: 13,891,500 (7)
abstracting: (p85<=1)
states: 13,891,501 (7)
abstracting: (1<=p30)
states: 1,389,150 (6)
abstracting: (p30<=1)
states: 13,891,501 (7)
abstracting: (1<=p87)
states: 13,891,500 (7)
abstracting: (p87<=1)
states: 13,891,501 (7)
abstracting: (1<=p20)
states: 1,984,500 (6)
abstracting: (p20<=1)
states: 13,891,501 (7)
abstracting: (1<=p85)
states: 13,891,500 (7)
abstracting: (p85<=1)
states: 13,891,501 (7)
abstracting: (1<=p20)
states: 1,984,500 (6)
abstracting: (p20<=1)
states: 13,891,501 (7)
abstracting: (1<=p85)
states: 13,891,500 (7)
abstracting: (p85<=1)
states: 13,891,501 (7)
.
EG iterations: 1
abstracting: (1<=p35)
states: 1,389,150 (6)
abstracting: (p35<=1)
states: 13,891,501 (7)
abstracting: (1<=p63)
states: 1,389,150 (6)
abstracting: (p63<=1)
states: 13,891,501 (7)
abstracting: (1<=p82)
states: 13,891,500 (7)
abstracting: (p82<=1)
states: 13,891,501 (7)
abstracting: (1<=p35)
states: 1,389,150 (6)
abstracting: (p35<=1)
states: 13,891,501 (7)
abstracting: (1<=p68)
states: 13,891,500 (7)
abstracting: (p68<=1)
states: 13,891,501 (7)
abstracting: (1<=p28)
states: 1,389,150 (6)
abstracting: (p28<=1)
states: 13,891,501 (7)
abstracting: (1<=p26)
states: 1,984,500 (6)
abstracting: (p26<=1)
states: 13,891,501 (7)
abstracting: (1<=p86)
states: 13,891,500 (7)
abstracting: (p86<=1)
states: 13,891,501 (7)
abstracting: (1<=p36)
states: 1,389,150 (6)
abstracting: (p36<=1)
states: 13,891,501 (7)
abstracting: (1<=p88)
states: 13,891,500 (7)
abstracting: (p88<=1)
states: 13,891,501 (7)
abstracting: (1<=p26)
states: 1,984,500 (6)
abstracting: (p26<=1)
states: 13,891,501 (7)
abstracting: (1<=p86)
states: 13,891,500 (7)
abstracting: (p86<=1)
states: 13,891,501 (7)
abstracting: (1<=p26)
states: 1,984,500 (6)
abstracting: (p26<=1)
states: 13,891,501 (7)
abstracting: (1<=p86)
states: 13,891,500 (7)
abstracting: (p86<=1)
states: 13,891,501 (7)
..
EG iterations: 2
abstracting: (1<=p63)
states: 1,389,150 (6)
abstracting: (p63<=1)
states: 13,891,501 (7)
abstracting: (1<=p82)
states: 13,891,500 (7)
abstracting: (p82<=1)
states: 13,891,501 (7)
abstracting: (1<=p35)
states: 1,389,150 (6)
abstracting: (p35<=1)
states: 13,891,501 (7)
abstracting: (1<=p68)
states: 13,891,500 (7)
abstracting: (p68<=1)
states: 13,891,501 (7)
abstracting: (1<=p28)
states: 1,389,150 (6)
abstracting: (p28<=1)
states: 13,891,501 (7)
abstracting: (1<=p63)
states: 1,389,150 (6)
abstracting: (p63<=1)
states: 13,891,501 (7)
abstracting: (1<=p82)
states: 13,891,500 (7)
abstracting: (p82<=1)
states: 13,891,501 (7)
abstracting: (1<=p35)
states: 1,389,150 (6)
abstracting: (p35<=1)
states: 13,891,501 (7)
abstracting: (1<=p68)
states: 13,891,500 (7)
abstracting: (p68<=1)
states: 13,891,501 (7)
abstracting: (1<=p28)
states: 1,389,150 (6)
abstracting: (p28<=1)
states: 13,891,501 (7)
.
EG iterations: 1
abstracting: (1<=p53)
states: 1,543,500 (6)
abstracting: (p53<=1)
states: 13,891,501 (7)
abstracting: (1<=p75)
states: 13,891,500 (7)
abstracting: (p75<=1)
states: 13,891,501 (7)
abstracting: (1<=p63)
states: 1,389,150 (6)
abstracting: (p63<=1)
states: 13,891,501 (7)
abstracting: (1<=p82)
states: 13,891,500 (7)
abstracting: (p82<=1)
states: 13,891,501 (7)
abstracting: (1<=p35)
states: 1,389,150 (6)
abstracting: (p35<=1)
states: 13,891,501 (7)
abstracting: (1<=p68)
states: 13,891,500 (7)
abstracting: (p68<=1)
states: 13,891,501 (7)
abstracting: (1<=p28)
states: 1,389,150 (6)
abstracting: (p28<=1)
states: 13,891,501 (7)
abstracting: (1<=p26)
states: 1,984,500 (6)
abstracting: (p26<=1)
states: 13,891,501 (7)
abstracting: (1<=p86)
states: 13,891,500 (7)
abstracting: (p86<=1)
states: 13,891,501 (7)
abstracting: (1<=p36)
states: 1,389,150 (6)
abstracting: (p36<=1)
states: 13,891,501 (7)
abstracting: (1<=p88)
states: 13,891,500 (7)
abstracting: (p88<=1)
states: 13,891,501 (7)
abstracting: (1<=p26)
states: 1,984,500 (6)
abstracting: (p26<=1)
states: 13,891,501 (7)
abstracting: (1<=p86)
states: 13,891,500 (7)
abstracting: (p86<=1)
states: 13,891,501 (7)
abstracting: (1<=p26)
states: 1,984,500 (6)
abstracting: (p26<=1)
states: 13,891,501 (7)
abstracting: (1<=p86)
states: 13,891,500 (7)
abstracting: (p86<=1)
states: 13,891,501 (7)
..
EG iterations: 2
abstracting: (1<=p63)
states: 1,389,150 (6)
abstracting: (p63<=1)
states: 13,891,501 (7)
abstracting: (1<=p82)
states: 13,891,500 (7)
abstracting: (p82<=1)
states: 13,891,501 (7)
abstracting: (1<=p35)
states: 1,389,150 (6)
abstracting: (p35<=1)
states: 13,891,501 (7)
abstracting: (1<=p68)
states: 13,891,500 (7)
abstracting: (p68<=1)
states: 13,891,501 (7)
abstracting: (1<=p28)
states: 1,389,150 (6)
abstracting: (p28<=1)
states: 13,891,501 (7)
abstracting: (1<=p63)
states: 1,389,150 (6)
abstracting: (p63<=1)
states: 13,891,501 (7)
abstracting: (1<=p82)
states: 13,891,500 (7)
abstracting: (p82<=1)
states: 13,891,501 (7)
abstracting: (1<=p35)
states: 1,389,150 (6)
abstracting: (p35<=1)
states: 13,891,501 (7)
abstracting: (1<=p68)
states: 13,891,500 (7)
abstracting: (p68<=1)
states: 13,891,501 (7)
abstracting: (1<=p28)
states: 1,389,150 (6)
abstracting: (p28<=1)
states: 13,891,501 (7)
.
EG iterations: 1
abstracting: (1<=p63)
states: 1,389,150 (6)
abstracting: (p63<=1)
states: 13,891,501 (7)
abstracting: (1<=p82)
states: 13,891,500 (7)
abstracting: (p82<=1)
states: 13,891,501 (7)
abstracting: (1<=p35)
states: 1,389,150 (6)
abstracting: (p35<=1)
states: 13,891,501 (7)
abstracting: (1<=p68)
states: 13,891,500 (7)
abstracting: (p68<=1)
states: 13,891,501 (7)
abstracting: (1<=p28)
states: 1,389,150 (6)
abstracting: (p28<=1)
states: 13,891,501 (7)
abstracting: (1<=p26)
states: 1,984,500 (6)
abstracting: (p26<=1)
states: 13,891,501 (7)
abstracting: (1<=p86)
states: 13,891,500 (7)
abstracting: (p86<=1)
states: 13,891,501 (7)
abstracting: (1<=p36)
states: 1,389,150 (6)
abstracting: (p36<=1)
states: 13,891,501 (7)
abstracting: (1<=p88)
states: 13,891,500 (7)
abstracting: (p88<=1)
states: 13,891,501 (7)
abstracting: (1<=p26)
states: 1,984,500 (6)
abstracting: (p26<=1)
states: 13,891,501 (7)
abstracting: (1<=p86)
states: 13,891,500 (7)
abstracting: (p86<=1)
states: 13,891,501 (7)
abstracting: (1<=p26)
states: 1,984,500 (6)
abstracting: (p26<=1)
states: 13,891,501 (7)
abstracting: (1<=p86)
states: 13,891,500 (7)
abstracting: (p86<=1)
states: 13,891,501 (7)
..
EG iterations: 2
abstracting: (1<=p63)
states: 1,389,150 (6)
abstracting: (p63<=1)
states: 13,891,501 (7)
abstracting: (1<=p82)
states: 13,891,500 (7)
abstracting: (p82<=1)
states: 13,891,501 (7)
abstracting: (1<=p35)
states: 1,389,150 (6)
abstracting: (p35<=1)
states: 13,891,501 (7)
abstracting: (1<=p68)
states: 13,891,500 (7)
abstracting: (p68<=1)
states: 13,891,501 (7)
abstracting: (1<=p28)
states: 1,389,150 (6)
abstracting: (p28<=1)
states: 13,891,501 (7)
abstracting: (1<=p63)
states: 1,389,150 (6)
abstracting: (p63<=1)
states: 13,891,501 (7)
abstracting: (1<=p82)
states: 13,891,500 (7)
abstracting: (p82<=1)
states: 13,891,501 (7)
abstracting: (1<=p35)
states: 1,389,150 (6)
abstracting: (p35<=1)
states: 13,891,501 (7)
abstracting: (1<=p68)
states: 13,891,500 (7)
abstracting: (p68<=1)
states: 13,891,501 (7)
abstracting: (1<=p28)
states: 1,389,150 (6)
abstracting: (p28<=1)
states: 13,891,501 (7)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p20)
states: 1,984,500 (6)
abstracting: (p20<=1)
states: 13,891,501 (7)
abstracting: (1<=p85)
states: 13,891,500 (7)
abstracting: (p85<=1)
states: 13,891,501 (7)
abstracting: (1<=p30)
states: 1,389,150 (6)
abstracting: (p30<=1)
states: 13,891,501 (7)
abstracting: (1<=p87)
states: 13,891,500 (7)
abstracting: (p87<=1)
states: 13,891,501 (7)
abstracting: (1<=p20)
states: 1,984,500 (6)
abstracting: (p20<=1)
states: 13,891,501 (7)
abstracting: (1<=p85)
states: 13,891,500 (7)
abstracting: (p85<=1)
states: 13,891,501 (7)
abstracting: (1<=p20)
states: 1,984,500 (6)
abstracting: (p20<=1)
states: 13,891,501 (7)
abstracting: (1<=p85)
states: 13,891,500 (7)
abstracting: (p85<=1)
states: 13,891,501 (7)
.
EG iterations: 1
abstracting: (1<=p35)
states: 1,389,150 (6)
abstracting: (p35<=1)
states: 13,891,501 (7)
abstracting: (1<=p20)
states: 1,984,500 (6)
abstracting: (p20<=1)
states: 13,891,501 (7)
abstracting: (1<=p85)
states: 13,891,500 (7)
abstracting: (p85<=1)
states: 13,891,501 (7)
abstracting: (1<=p30)
states: 1,389,150 (6)
abstracting: (p30<=1)
states: 13,891,501 (7)
abstracting: (1<=p87)
states: 13,891,500 (7)
abstracting: (p87<=1)
states: 13,891,501 (7)
abstracting: (1<=p20)
states: 1,984,500 (6)
abstracting: (p20<=1)
states: 13,891,501 (7)
abstracting: (1<=p85)
states: 13,891,500 (7)
abstracting: (p85<=1)
states: 13,891,501 (7)
abstracting: (1<=p20)
states: 1,984,500 (6)
abstracting: (p20<=1)
states: 13,891,501 (7)
abstracting: (1<=p85)
states: 13,891,500 (7)
abstracting: (p85<=1)
states: 13,891,501 (7)
.
EG iterations: 1
abstracting: (1<=p35)
states: 1,389,150 (6)
abstracting: (p35<=1)
states: 13,891,501 (7)
.
EG iterations: 1
abstracting: (0<=p49)
states: 13,891,501 (7)
abstracting: (p49<=0)
states: 12,348,001 (7)
abstracting: (0<=p92)
states: 13,891,501 (7)
abstracting: (p92<=0)
states: 1
abstracting: (0<=p64)
states: 13,891,501 (7)
abstracting: (p64<=0)
states: 12,502,351 (7)
abstracting: (0<=p19)
states: 13,891,501 (7)
abstracting: (p19<=0)
states: 11,113,201 (7)
abstracting: (0<=p84)
states: 13,891,501 (7)
abstracting: (p84<=0)
states: 1
abstracting: (0<=p29)
states: 13,891,501 (7)
abstracting: (p29<=0)
states: 12,502,351 (7)
abstracting: (0<=p67)
states: 13,891,501 (7)
abstracting: (p67<=0)
states: 1
EG iterations: 0
-> the formula is FALSE
FORMULA DLCround-PT-03a-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.033sec
checking: AG [E [[[[~ [[[[p84<=1 & 1<=p84] & [1<=p62 & p62<=1]] | [[p63<=1 & 1<=p63] & [p82<=1 & 1<=p82]]]] & [p11<=1 & 1<=p11]] & [[p82<=1 & 1<=p82] & [p44<=1 & 1<=p44]]] & [[[p73<=1 & 1<=p73] & [p19<=1 & 1<=p19]] & [[p84<=1 & 1<=p84] & AG [[[[p45<=1 & 1<=p45] & [p72<=1 & 1<=p72]] & [[p8<=1 & 1<=p8] & [p66<=1 & 1<=p66]]]]]]] U [~ [[[[p2<=1 & 1<=p2] & [[p65<=1 & 1<=p65] & [p45<=1 & 1<=p45]]] & [[p58<=1 & 1<=p58] & [[p93<=1 & 1<=p93] & [[[p57<=1 & 1<=p57] & [p81<=1 & 1<=p81]] | [[p26<=1 & 1<=p26] & [p80<=1 & 1<=p80]]]]]]] | [~ [[~ [[[p34<=1 & 1<=p34] & [p88<=1 & 1<=p88]]] | [p2<=1 & 1<=p2]]] & [[p35<=1 & 1<=p35] & [p93<=1 & 1<=p93]]]]]]
normalized: ~ [E [true U ~ [E [[[[~ [E [true U ~ [[[[p66<=1 & 1<=p66] & [p8<=1 & 1<=p8]] & [[p72<=1 & 1<=p72] & [p45<=1 & 1<=p45]]]]]] & [p84<=1 & 1<=p84]] & [[p19<=1 & 1<=p19] & [p73<=1 & 1<=p73]]] & [[[p44<=1 & 1<=p44] & [p82<=1 & 1<=p82]] & [[p11<=1 & 1<=p11] & ~ [[[[p82<=1 & 1<=p82] & [p63<=1 & 1<=p63]] | [[1<=p62 & p62<=1] & [p84<=1 & 1<=p84]]]]]]] U [[[[p93<=1 & 1<=p93] & [p35<=1 & 1<=p35]] & ~ [[[p2<=1 & 1<=p2] | ~ [[[p88<=1 & 1<=p88] & [p34<=1 & 1<=p34]]]]]] | ~ [[[[[[[p80<=1 & 1<=p80] & [p26<=1 & 1<=p26]] | [[p81<=1 & 1<=p81] & [p57<=1 & 1<=p57]]] & [p93<=1 & 1<=p93]] & [p58<=1 & 1<=p58]] & [[[p45<=1 & 1<=p45] & [p65<=1 & 1<=p65]] & [p2<=1 & 1<=p2]]]]]]]]]
abstracting: (1<=p2)
states: 1,984,500 (6)
abstracting: (p2<=1)
states: 13,891,501 (7)
abstracting: (1<=p65)
states: 13,891,500 (7)
abstracting: (p65<=1)
states: 13,891,501 (7)
abstracting: (1<=p45)
states: 1,543,500 (6)
abstracting: (p45<=1)
states: 13,891,501 (7)
abstracting: (1<=p58)
states: 1,389,150 (6)
abstracting: (p58<=1)
states: 13,891,501 (7)
abstracting: (1<=p93)
states: 13,891,500 (7)
abstracting: (p93<=1)
states: 13,891,501 (7)
abstracting: (1<=p57)
states: 1,389,150 (6)
abstracting: (p57<=1)
states: 13,891,501 (7)
abstracting: (1<=p81)
states: 13,891,500 (7)
abstracting: (p81<=1)
states: 13,891,501 (7)
abstracting: (1<=p26)
states: 1,984,500 (6)
abstracting: (p26<=1)
states: 13,891,501 (7)
abstracting: (1<=p80)
states: 13,891,500 (7)
abstracting: (p80<=1)
states: 13,891,501 (7)
abstracting: (1<=p34)
states: 1,389,150 (6)
abstracting: (p34<=1)
states: 13,891,501 (7)
abstracting: (1<=p88)
states: 13,891,500 (7)
abstracting: (p88<=1)
states: 13,891,501 (7)
abstracting: (1<=p2)
states: 1,984,500 (6)
abstracting: (p2<=1)
states: 13,891,501 (7)
abstracting: (1<=p35)
states: 1,389,150 (6)
abstracting: (p35<=1)
states: 13,891,501 (7)
abstracting: (1<=p93)
states: 13,891,500 (7)
abstracting: (p93<=1)
states: 13,891,501 (7)
abstracting: (1<=p84)
states: 13,891,500 (7)
abstracting: (p84<=1)
states: 13,891,501 (7)
abstracting: (p62<=1)
states: 13,891,501 (7)
abstracting: (1<=p62)
states: 1,389,150 (6)
abstracting: (1<=p63)
states: 1,389,150 (6)
abstracting: (p63<=1)
states: 13,891,501 (7)
abstracting: (1<=p82)
states: 13,891,500 (7)
abstracting: (p82<=1)
states: 13,891,501 (7)
abstracting: (1<=p11)
states: 1,984,500 (6)
abstracting: (p11<=1)
states: 13,891,501 (7)
abstracting: (1<=p82)
states: 13,891,500 (7)
abstracting: (p82<=1)
states: 13,891,501 (7)
abstracting: (1<=p44)
states: 1,543,500 (6)
abstracting: (p44<=1)
states: 13,891,501 (7)
abstracting: (1<=p73)
states: 13,891,500 (7)
abstracting: (p73<=1)
states: 13,891,501 (7)
abstracting: (1<=p19)
states: 2,778,300 (6)
abstracting: (p19<=1)
states: 13,891,501 (7)
abstracting: (1<=p84)
states: 13,891,500 (7)
abstracting: (p84<=1)
states: 13,891,501 (7)
abstracting: (1<=p45)
states: 1,543,500 (6)
abstracting: (p45<=1)
states: 13,891,501 (7)
abstracting: (1<=p72)
states: 13,891,500 (7)
abstracting: (p72<=1)
states: 13,891,501 (7)
abstracting: (1<=p8)
states: 1,984,500 (6)
abstracting: (p8<=1)
states: 13,891,501 (7)
abstracting: (1<=p66)
states: 13,891,500 (7)
abstracting: (p66<=1)
states: 13,891,501 (7)
-> the formula is FALSE
FORMULA DLCround-PT-03a-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
totally nodes used: 29651 (3.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 178157 395880 574037
used/not used/entry size/cache size: 413024 66695840 16 1024MB
basic ops cache: hits/miss/sum: 24734 49645 74379
used/not used/entry size/cache size: 77230 16699986 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: 2105 3724 5829
used/not used/entry size/cache size: 3724 8384884 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 67079476
1 29132
2 249
3 7
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.622sec
BK_STOP 1678445656451
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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:796 (5), effective:57 (0)
initing FirstDep: 0m 0.000sec
iterations count:402 (2), effective:10 (0)
iterations count:360 (2), effective:10 (0)
iterations count:334 (2), effective:9 (0)
iterations count:308 (2), effective:9 (0)
iterations count:173 (1), effective:6 (0)
iterations count:139 (1), effective:0 (0)
iterations count:394 (2), effective:10 (0)
iterations count:147 (1), effective:1 (0)
iterations count:232 (1), effective:9 (0)
iterations count:144 (1), effective:1 (0)
iterations count:141 (1), effective:1 (0)
iterations count:477 (3), effective:24 (0)
iterations count:334 (2), effective:13 (0)
iterations count:358 (2), effective:10 (0)
iterations count:300 (2), effective:7 (0)
iterations count:139 (1), effective:0 (0)
iterations count:141 (1), effective:1 (0)
iterations count:359 (2), effective:10 (0)
iterations count:171 (1), effective:1 (0)
iterations count:359 (2), effective:10 (0)
iterations count:143 (1), effective:1 (0)
iterations count:359 (2), effective:10 (0)
iterations count:359 (2), effective:10 (0)
iterations count:171 (1), effective:1 (0)
iterations count:359 (2), effective:10 (0)
iterations count:143 (1), effective:1 (0)
iterations count:359 (2), effective:10 (0)
iterations count:149 (1), effective:1 (0)
iterations count:359 (2), effective:10 (0)
iterations count:171 (1), effective:1 (0)
iterations count:359 (2), effective:10 (0)
iterations count:143 (1), effective:1 (0)
iterations count:359 (2), effective:10 (0)
iterations count:141 (1), effective:1 (0)
iterations count:139 (1), effective:0 (0)
iterations count:141 (1), effective:1 (0)
iterations count:163 (1), effective:1 (0)
iterations count:373 (2), effective:14 (0)
iterations count:147 (1), effective:1 (0)
iterations count:139 (1), effective:0 (0)
iterations count:477 (3), effective:30 (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-03a"
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-03a, 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-167814483000618"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-03a.tgz
mv DLCround-PT-03a 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 '
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 ;