About the Execution of Marcie+red for DLCround-PT-11a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5519.600 | 16754.00 | 25223.00 | 395.90 | FTTTFTTTTTFFFTTF | 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-167814483100746.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-11a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483100746
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.7K Feb 25 20:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 20:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 19:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 19:30 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.5K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 21:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 21:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 20:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 20:38 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 762K 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-11a-CTLFireability-00
FORMULA_NAME DLCround-PT-11a-CTLFireability-01
FORMULA_NAME DLCround-PT-11a-CTLFireability-02
FORMULA_NAME DLCround-PT-11a-CTLFireability-03
FORMULA_NAME DLCround-PT-11a-CTLFireability-04
FORMULA_NAME DLCround-PT-11a-CTLFireability-05
FORMULA_NAME DLCround-PT-11a-CTLFireability-06
FORMULA_NAME DLCround-PT-11a-CTLFireability-07
FORMULA_NAME DLCround-PT-11a-CTLFireability-08
FORMULA_NAME DLCround-PT-11a-CTLFireability-09
FORMULA_NAME DLCround-PT-11a-CTLFireability-10
FORMULA_NAME DLCround-PT-11a-CTLFireability-11
FORMULA_NAME DLCround-PT-11a-CTLFireability-12
FORMULA_NAME DLCround-PT-11a-CTLFireability-13
FORMULA_NAME DLCround-PT-11a-CTLFireability-14
FORMULA_NAME DLCround-PT-11a-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678465791044
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-11a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 16:29:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 16:29:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:29:52] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2023-03-10 16:29:52] [INFO ] Transformed 377 places.
[2023-03-10 16:29:52] [INFO ] Transformed 2993 transitions.
[2023-03-10 16:29:52] [INFO ] Found NUPN structural information;
[2023-03-10 16:29:52] [INFO ] Parsed PT model containing 377 places and 2993 transitions and 11677 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 280 transitions
Reduce redundant transitions removed 280 transitions.
FORMULA DLCround-PT-11a-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11a-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 136 out of 377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 377/377 places, 2713/2713 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 365 transition count 2529
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 365 transition count 2529
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 365 transition count 2526
Drop transitions removed 891 transitions
Redundant transition composition rules discarded 891 transitions
Iterating global reduction 1 with 891 rules applied. Total rules applied 918 place count 365 transition count 1635
Applied a total of 918 rules in 109 ms. Remains 365 /377 variables (removed 12) and now considering 1635/2713 (removed 1078) transitions.
[2023-03-10 16:29:53] [INFO ] Flow matrix only has 219 transitions (discarded 1416 similar events)
// Phase 1: matrix 219 rows 365 cols
[2023-03-10 16:29:53] [INFO ] Computed 244 place invariants in 34 ms
[2023-03-10 16:29:53] [INFO ] Implicit Places using invariants in 978 ms returned [137, 139, 141, 143, 145, 147, 148, 151, 152, 153, 154, 156, 157, 159, 161, 162, 163, 164, 165, 166, 167, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 183, 185, 186, 187, 189, 191, 193, 195, 196, 197, 198, 200, 201, 203, 205, 208, 209, 210, 211, 213, 215, 216, 217, 221, 224, 225, 226, 227, 229, 231, 232, 233, 235, 237, 240, 241, 242, 244, 245, 246, 248, 249, 250, 251, 253, 254, 256, 257, 258, 259, 261, 264, 265, 266, 268, 269, 270, 272, 274, 277, 278, 279, 280, 282, 285, 286, 287, 288, 289, 292, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 309, 310, 312, 313, 314, 315, 316, 317, 319, 320, 321, 322, 323, 324, 325, 327, 331, 334, 335, 336, 337, 340, 343, 344, 345, 346, 347, 348, 350, 351, 352, 353, 355, 357, 358, 359, 360, 361, 363, 364]
Discarding 157 places :
Ensure Unique test removed 864 transitions
Reduce isomorphic transitions removed 864 transitions.
Implicit Place search using SMT only with invariants took 1146 ms to find 157 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 208/377 places, 771/2713 transitions.
Drop transitions removed 477 transitions
Redundant transition composition rules discarded 477 transitions
Iterating global reduction 0 with 477 rules applied. Total rules applied 477 place count 208 transition count 294
Applied a total of 477 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 294/771 (removed 477) transitions.
[2023-03-10 16:29:53] [INFO ] Flow matrix only has 219 transitions (discarded 75 similar events)
// Phase 1: matrix 219 rows 208 cols
[2023-03-10 16:29:53] [INFO ] Computed 87 place invariants in 2 ms
[2023-03-10 16:29:54] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-10 16:29:54] [INFO ] Flow matrix only has 219 transitions (discarded 75 similar events)
[2023-03-10 16:29:54] [INFO ] Invariant cache hit.
[2023-03-10 16:29:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:29:54] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 208/377 places, 294/2713 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1438 ms. Remains : 208/377 places, 294/2713 transitions.
Support contains 136 out of 208 places after structural reductions.
[2023-03-10 16:29:54] [INFO ] Flatten gal took : 46 ms
[2023-03-10 16:29:54] [INFO ] Flatten gal took : 20 ms
[2023-03-10 16:29:54] [INFO ] Input system was already deterministic with 294 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 69) seen :68
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 16:29:54] [INFO ] Flow matrix only has 219 transitions (discarded 75 similar events)
[2023-03-10 16:29:54] [INFO ] Invariant cache hit.
[2023-03-10 16:29:55] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 16:29:55] [INFO ] [Nat]Absence check using 87 positive place invariants in 15 ms returned sat
[2023-03-10 16:29:55] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA DLCround-PT-11a-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 16 ms
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 13 ms
[2023-03-10 16:29:55] [INFO ] Input system was already deterministic with 294 transitions.
Computed a total of 72 stabilizing places and 1 stable transitions
Graph (complete) has 380 edges and 208 vertex of which 137 are kept as prefixes of interest. Removing 71 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 294/294 transitions.
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 142 transition count 294
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 83 place count 125 transition count 260
Iterating global reduction 1 with 17 rules applied. Total rules applied 100 place count 125 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 125 transition count 259
Applied a total of 101 rules in 4 ms. Remains 125 /208 variables (removed 83) and now considering 259/294 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 125/208 places, 259/294 transitions.
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 9 ms
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 7 ms
[2023-03-10 16:29:55] [INFO ] Input system was already deterministic with 259 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 294/294 transitions.
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 145 transition count 294
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 79 place count 129 transition count 262
Iterating global reduction 1 with 16 rules applied. Total rules applied 95 place count 129 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 129 transition count 261
Applied a total of 96 rules in 5 ms. Remains 129 /208 variables (removed 79) and now considering 261/294 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 129/208 places, 261/294 transitions.
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 18 ms
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 8 ms
[2023-03-10 16:29:55] [INFO ] Input system was already deterministic with 261 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 208/208 places, 294/294 transitions.
Graph (trivial) has 247 edges and 208 vertex of which 106 / 208 are part of one of the 14 SCC in 3 ms
Free SCC test removed 92 places
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 209 transitions.
Graph (complete) has 171 edges and 116 vertex of which 52 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.1 ms
Discarding 64 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 52 transition count 82
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 49 transition count 80
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 13 place count 47 transition count 79
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 22 place count 38 transition count 69
Iterating global reduction 3 with 9 rules applied. Total rules applied 31 place count 38 transition count 69
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 36 place count 38 transition count 64
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 39 place count 38 transition count 64
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 42 place count 35 transition count 61
Iterating global reduction 3 with 3 rules applied. Total rules applied 45 place count 35 transition count 61
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 48 place count 35 transition count 58
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 35 transition count 57
Applied a total of 49 rules in 30 ms. Remains 35 /208 variables (removed 173) and now considering 57/294 (removed 237) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 35/208 places, 57/294 transitions.
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 1 ms
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 2 ms
[2023-03-10 16:29:55] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 294/294 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 146 transition count 294
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 80 place count 128 transition count 258
Iterating global reduction 1 with 18 rules applied. Total rules applied 98 place count 128 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 99 place count 128 transition count 257
Applied a total of 99 rules in 4 ms. Remains 128 /208 variables (removed 80) and now considering 257/294 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 128/208 places, 257/294 transitions.
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 7 ms
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 7 ms
[2023-03-10 16:29:55] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 294/294 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 138 transition count 294
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 89 place count 119 transition count 256
Iterating global reduction 1 with 19 rules applied. Total rules applied 108 place count 119 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 109 place count 119 transition count 255
Applied a total of 109 rules in 13 ms. Remains 119 /208 variables (removed 89) and now considering 255/294 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 119/208 places, 255/294 transitions.
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 6 ms
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 6 ms
[2023-03-10 16:29:55] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 294/294 transitions.
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 140 transition count 294
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 87 place count 121 transition count 256
Iterating global reduction 1 with 19 rules applied. Total rules applied 106 place count 121 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 107 place count 121 transition count 255
Applied a total of 107 rules in 12 ms. Remains 121 /208 variables (removed 87) and now considering 255/294 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 121/208 places, 255/294 transitions.
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 6 ms
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 8 ms
[2023-03-10 16:29:55] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 294/294 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 147 transition count 294
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 79 place count 129 transition count 258
Iterating global reduction 1 with 18 rules applied. Total rules applied 97 place count 129 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 98 place count 129 transition count 257
Applied a total of 98 rules in 17 ms. Remains 129 /208 variables (removed 79) and now considering 257/294 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 129/208 places, 257/294 transitions.
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 6 ms
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 6 ms
[2023-03-10 16:29:55] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 294/294 transitions.
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 143 transition count 294
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 82 place count 126 transition count 260
Iterating global reduction 1 with 17 rules applied. Total rules applied 99 place count 126 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 126 transition count 259
Applied a total of 100 rules in 3 ms. Remains 126 /208 variables (removed 82) and now considering 259/294 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 126/208 places, 259/294 transitions.
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 6 ms
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 9 ms
[2023-03-10 16:29:55] [INFO ] Input system was already deterministic with 259 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 294/294 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 138 transition count 294
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 89 place count 119 transition count 256
Iterating global reduction 1 with 19 rules applied. Total rules applied 108 place count 119 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 109 place count 119 transition count 255
Applied a total of 109 rules in 18 ms. Remains 119 /208 variables (removed 89) and now considering 255/294 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 119/208 places, 255/294 transitions.
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 6 ms
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 6 ms
[2023-03-10 16:29:55] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 294/294 transitions.
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 142 transition count 294
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 83 place count 125 transition count 260
Iterating global reduction 1 with 17 rules applied. Total rules applied 100 place count 125 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 125 transition count 259
Applied a total of 101 rules in 3 ms. Remains 125 /208 variables (removed 83) and now considering 259/294 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 125/208 places, 259/294 transitions.
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:29:55] [INFO ] Input system was already deterministic with 259 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 294/294 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 147 transition count 294
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 77 place count 131 transition count 262
Iterating global reduction 1 with 16 rules applied. Total rules applied 93 place count 131 transition count 262
Applied a total of 93 rules in 3 ms. Remains 131 /208 variables (removed 77) and now considering 262/294 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 131/208 places, 262/294 transitions.
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 6 ms
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:29:55] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 294/294 transitions.
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 142 transition count 294
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 84 place count 124 transition count 258
Iterating global reduction 1 with 18 rules applied. Total rules applied 102 place count 124 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 103 place count 124 transition count 257
Applied a total of 103 rules in 3 ms. Remains 124 /208 variables (removed 84) and now considering 257/294 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 124/208 places, 257/294 transitions.
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 10 ms
[2023-03-10 16:29:55] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 208/208 places, 294/294 transitions.
Graph (trivial) has 243 edges and 208 vertex of which 102 / 208 are part of one of the 15 SCC in 0 ms
Free SCC test removed 87 places
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Graph (complete) has 179 edges and 121 vertex of which 59 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.0 ms
Discarding 62 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 59 transition count 90
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 56 transition count 86
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 17 place count 52 transition count 85
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 28 place count 41 transition count 71
Iterating global reduction 3 with 11 rules applied. Total rules applied 39 place count 41 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 41 transition count 70
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 45 place count 41 transition count 65
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 48 place count 41 transition count 65
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 38 transition count 62
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 38 transition count 62
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 38 transition count 59
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 58 place count 38 transition count 58
Applied a total of 58 rules in 12 ms. Remains 38 /208 variables (removed 170) and now considering 58/294 (removed 236) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 38/208 places, 58/294 transitions.
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 1 ms
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 1 ms
[2023-03-10 16:29:55] [INFO ] Input system was already deterministic with 58 transitions.
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 15 ms
[2023-03-10 16:29:55] [INFO ] Flatten gal took : 23 ms
[2023-03-10 16:29:56] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 12 ms.
[2023-03-10 16:29:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 208 places, 294 transitions and 674 arcs took 1 ms.
Total runtime 3566 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: 208 NrTr: 294 NrArc: 674)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.004sec
net check time: 0m 0.000sec
init dd package: 0m 2.727sec
RS generation: 0m 0.111sec
-> reachability set: #nodes 6294 (6.3e+03) #states 496,011,600,000,001 (14)
starting MCC model checker
--------------------------
checking: EF [EX [[[p46<=1 & 1<=p46] & [p176<=1 & 1<=p176]]]]
normalized: E [true U EX [[[p46<=1 & 1<=p46] & [p176<=1 & 1<=p176]]]]
abstracting: (1<=p176)
states: 496,011,600,000,000 (14)
abstracting: (p176<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p46)
states: 49,601,160,000,000 (13)
abstracting: (p46<=1)
states: 496,011,600,000,001 (14)
.-> the formula is TRUE
FORMULA DLCround-PT-11a-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.254sec
checking: AX [EX [EX [AF [[[p82<=1 & 1<=p82] & [p151<=1 & 1<=p151]]]]]]
normalized: ~ [EX [~ [EX [EX [~ [EG [~ [[[p151<=1 & 1<=p151] & [p82<=1 & 1<=p82]]]]]]]]]]
abstracting: (1<=p82)
states: 55,112,400,000,000 (13)
abstracting: (p82<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p151)
states: 496,011,600,000,000 (14)
abstracting: (p151<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
...-> the formula is TRUE
FORMULA DLCround-PT-11a-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.831sec
checking: AG [EX [AF [[[EF [[[p23<=1 & 1<=p23] & [p166<=1 & 1<=p166]]] | AG [[p46<=1 & 1<=p46]]] | [[[p16<=1 & 1<=p16] & [p152<=1 & 1<=p152]] | [[p68<=1 & 1<=p68] & [p185<=1 & 1<=p185]]]]]]]
normalized: ~ [E [true U ~ [EX [~ [EG [~ [[[[[p185<=1 & 1<=p185] & [p68<=1 & 1<=p68]] | [[p152<=1 & 1<=p152] & [p16<=1 & 1<=p16]]] | [~ [E [true U ~ [[p46<=1 & 1<=p46]]]] | E [true U [[p166<=1 & 1<=p166] & [p23<=1 & 1<=p23]]]]]]]]]]]]
abstracting: (1<=p23)
states: 70,858,800,000,000 (13)
abstracting: (p23<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p166)
states: 496,011,600,000,000 (14)
abstracting: (p166<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p46)
states: 49,601,160,000,000 (13)
abstracting: (p46<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p16)
states: 82,668,600,000,000 (13)
abstracting: (p16<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p152)
states: 496,011,600,000,000 (14)
abstracting: (p152<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p68)
states: 55,112,400,000,000 (13)
abstracting: (p68<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p185)
states: 496,011,600,000,000 (14)
abstracting: (p185<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA DLCround-PT-11a-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.047sec
checking: [EG [[[[p70<=0 & 0<=p70] | [p150<=0 & 0<=p150]] & [AX [[p101<=0 & 0<=p101]] | [[[p88<=0 & 0<=p88] | [p152<=0 & 0<=p152]] & [[p89<=0 & 0<=p89] | [p193<=0 & 0<=p193]]]]]] & E [[[p51<=1 & 1<=p51] & [p188<=1 & 1<=p188]] U AG [~ [[[p103<=1 & 1<=p103] & [p197<=1 & 1<=p197]]]]]]
normalized: [E [[[p188<=1 & 1<=p188] & [p51<=1 & 1<=p51]] U ~ [E [true U [[p197<=1 & 1<=p197] & [p103<=1 & 1<=p103]]]]] & EG [[[[[[p193<=0 & 0<=p193] | [p89<=0 & 0<=p89]] & [[p152<=0 & 0<=p152] | [p88<=0 & 0<=p88]]] | ~ [EX [~ [[p101<=0 & 0<=p101]]]]] & [[p150<=0 & 0<=p150] | [p70<=0 & 0<=p70]]]]]
abstracting: (0<=p70)
states: 496,011,600,000,001 (14)
abstracting: (p70<=0)
states: 446,410,440,000,001 (14)
abstracting: (0<=p150)
states: 496,011,600,000,001 (14)
abstracting: (p150<=0)
states: 1
abstracting: (0<=p101)
states: 496,011,600,000,001 (14)
abstracting: (p101<=0)
states: 446,410,440,000,001 (14)
.abstracting: (0<=p88)
states: 496,011,600,000,001 (14)
abstracting: (p88<=0)
states: 440,899,200,000,001 (14)
abstracting: (0<=p152)
states: 496,011,600,000,001 (14)
abstracting: (p152<=0)
states: 1
abstracting: (0<=p89)
states: 496,011,600,000,001 (14)
abstracting: (p89<=0)
states: 440,899,200,000,001 (14)
abstracting: (0<=p193)
states: 496,011,600,000,001 (14)
abstracting: (p193<=0)
states: 1
.
EG iterations: 1
abstracting: (1<=p103)
states: 49,601,160,000,000 (13)
abstracting: (p103<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p197)
states: 496,011,600,000,000 (14)
abstracting: (p197<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p51)
states: 49,601,160,000,000 (13)
abstracting: (p51<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p188)
states: 496,011,600,000,000 (14)
abstracting: (p188<=1)
states: 496,011,600,000,001 (14)
-> the formula is FALSE
FORMULA DLCround-PT-11a-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.160sec
checking: A [[AF [[AF [~ [[[p57<=1 & 1<=p57] & [p147<=1 & 1<=p147]]]] | ~ [AX [[p62<=1 & 1<=p62]]]]] | E [EF [~ [A [[[p96<=1 & 1<=p96] & [p195<=1 & 1<=p195]] U [[p5<=1 & 1<=p5] & [p162<=1 & 1<=p162]]]]] U [[[p132<=1 & 1<=p132] & [p205<=1 & 1<=p205]] | AX [[[p23<=1 & 1<=p23] & [p140<=1 & 1<=p140]]]]]] U ~ [AF [AX [[p43<=1 & 1<=p43]]]]]
normalized: [~ [EG [~ [EG [EX [~ [[p43<=1 & 1<=p43]]]]]]] & ~ [E [~ [EG [EX [~ [[p43<=1 & 1<=p43]]]]] U [~ [[E [E [true U ~ [[~ [EG [~ [[[p162<=1 & 1<=p162] & [p5<=1 & 1<=p5]]]]] & ~ [E [~ [[[p162<=1 & 1<=p162] & [p5<=1 & 1<=p5]]] U [~ [[[p195<=1 & 1<=p195] & [p96<=1 & 1<=p96]]] & ~ [[[p162<=1 & 1<=p162] & [p5<=1 & 1<=p5]]]]]]]]] U [~ [EX [~ [[[p140<=1 & 1<=p140] & [p23<=1 & 1<=p23]]]]] | [[p205<=1 & 1<=p205] & [p132<=1 & 1<=p132]]]] | ~ [EG [~ [[EX [~ [[p62<=1 & 1<=p62]]] | ~ [EG [[[p147<=1 & 1<=p147] & [p57<=1 & 1<=p57]]]]]]]]]] & ~ [EG [EX [~ [[p43<=1 & 1<=p43]]]]]]]]]
abstracting: (1<=p43)
states: 49,601,160,000,000 (13)
abstracting: (p43<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 0
abstracting: (1<=p57)
states: 62,001,450,000,000 (13)
abstracting: (p57<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p147)
states: 496,011,600,000,000 (14)
abstracting: (p147<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
abstracting: (1<=p62)
states: 55,112,400,000,000 (13)
abstracting: (p62<=1)
states: 496,011,600,000,001 (14)
..
EG iterations: 1
abstracting: (1<=p132)
states: 49,601,160,000,000 (13)
abstracting: (p132<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p205)
states: 496,011,600,000,000 (14)
abstracting: (p205<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p23)
states: 70,858,800,000,000 (13)
abstracting: (p23<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p140)
states: 496,011,600,000,000 (14)
abstracting: (p140<=1)
states: 496,011,600,000,001 (14)
.abstracting: (1<=p5)
states: 99,202,320,000,000 (13)
abstracting: (p5<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p162)
states: 496,011,600,000,000 (14)
abstracting: (p162<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p96)
states: 55,112,400,000,000 (13)
abstracting: (p96<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p195)
states: 496,011,600,000,000 (14)
abstracting: (p195<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p5)
states: 99,202,320,000,000 (13)
abstracting: (p5<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p162)
states: 496,011,600,000,000 (14)
abstracting: (p162<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p5)
states: 99,202,320,000,000 (13)
abstracting: (p5<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p162)
states: 496,011,600,000,000 (14)
abstracting: (p162<=1)
states: 496,011,600,000,001 (14)
..
EG iterations: 2
abstracting: (1<=p43)
states: 49,601,160,000,000 (13)
abstracting: (p43<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 0
abstracting: (1<=p43)
states: 49,601,160,000,000 (13)
abstracting: (p43<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA DLCround-PT-11a-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.804sec
checking: EF [[EF [AG [[[[p110<=0 & 0<=p110] | [p201<=0 & 0<=p201]] & [p119<=0 & 0<=p119]]]] & [[AX [[[[p38<=1 & 1<=p38] & [p141<=1 & 1<=p141]] | [[p102<=1 & 1<=p102] & [p156<=1 & 1<=p156]]]] | EF [[[p16<=0 & 0<=p16] | [p165<=0 & 0<=p165]]]] | [[p117<=1 & 1<=p117] | [[p126<=1 & 1<=p126] | [[p47<=1 & 1<=p47] & [p178<=1 & 1<=p178]]]]]]]
normalized: E [true U [[[[[[p178<=1 & 1<=p178] & [p47<=1 & 1<=p47]] | [p126<=1 & 1<=p126]] | [p117<=1 & 1<=p117]] | [E [true U [[p165<=0 & 0<=p165] | [p16<=0 & 0<=p16]]] | ~ [EX [~ [[[[p156<=1 & 1<=p156] & [p102<=1 & 1<=p102]] | [[p141<=1 & 1<=p141] & [p38<=1 & 1<=p38]]]]]]]] & E [true U ~ [E [true U ~ [[[p119<=0 & 0<=p119] & [[p201<=0 & 0<=p201] | [p110<=0 & 0<=p110]]]]]]]]]
abstracting: (0<=p110)
states: 496,011,600,000,001 (14)
abstracting: (p110<=0)
states: 440,899,200,000,001 (14)
abstracting: (0<=p201)
states: 496,011,600,000,001 (14)
abstracting: (p201<=0)
states: 1
abstracting: (0<=p119)
states: 496,011,600,000,001 (14)
abstracting: (p119<=0)
states: 446,410,440,000,001 (14)
abstracting: (1<=p38)
states: 55,112,400,000,000 (13)
abstracting: (p38<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p141)
states: 496,011,600,000,000 (14)
abstracting: (p141<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p102)
states: 49,601,160,000,000 (13)
abstracting: (p102<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p156)
states: 496,011,600,000,000 (14)
abstracting: (p156<=1)
states: 496,011,600,000,001 (14)
.abstracting: (0<=p16)
states: 496,011,600,000,001 (14)
abstracting: (p16<=0)
states: 413,343,000,000,001 (14)
abstracting: (0<=p165)
states: 496,011,600,000,001 (14)
abstracting: (p165<=0)
states: 1
abstracting: (1<=p117)
states: 49,601,160,000,000 (13)
abstracting: (p117<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p126)
states: 49,601,160,000,000 (13)
abstracting: (p126<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p47)
states: 49,601,160,000,000 (13)
abstracting: (p47<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p178)
states: 496,011,600,000,000 (14)
abstracting: (p178<=1)
states: 496,011,600,000,001 (14)
-> the formula is FALSE
FORMULA DLCround-PT-11a-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.273sec
checking: EF [[A [AG [[[[p13<=1 & 1<=p13] | [[p41<=1 & 1<=p41] & [p174<=1 & 1<=p174]]] & ~ [[[p105<=1 & 1<=p105] & [p194<=1 & 1<=p194]]]]] U EG [[[p115<=1 & 1<=p115] & [p203<=1 & 1<=p203]]]] | A [~ [EF [[[[p120<=1 & 1<=p120] & [p162<=1 & 1<=p162]] & [[p127<=1 & 1<=p127] & [p207<=1 & 1<=p207]]]]] U EG [EX [[[p78<=1 & 1<=p78] & [p148<=1 & 1<=p148]]]]]]]
normalized: E [true U [[~ [EG [~ [EG [EX [[[p148<=1 & 1<=p148] & [p78<=1 & 1<=p78]]]]]]] & ~ [E [~ [EG [EX [[[p148<=1 & 1<=p148] & [p78<=1 & 1<=p78]]]]] U [E [true U [[[p207<=1 & 1<=p207] & [p127<=1 & 1<=p127]] & [[p162<=1 & 1<=p162] & [p120<=1 & 1<=p120]]]] & ~ [EG [EX [[[p148<=1 & 1<=p148] & [p78<=1 & 1<=p78]]]]]]]]] | [~ [EG [~ [EG [[[p203<=1 & 1<=p203] & [p115<=1 & 1<=p115]]]]]] & ~ [E [~ [EG [[[p203<=1 & 1<=p203] & [p115<=1 & 1<=p115]]]] U [E [true U ~ [[~ [[[p194<=1 & 1<=p194] & [p105<=1 & 1<=p105]]] & [[[p174<=1 & 1<=p174] & [p41<=1 & 1<=p41]] | [p13<=1 & 1<=p13]]]]] & ~ [EG [[[p203<=1 & 1<=p203] & [p115<=1 & 1<=p115]]]]]]]]]]
abstracting: (1<=p115)
states: 55,112,400,000,000 (13)
abstracting: (p115<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p203)
states: 496,011,600,000,000 (14)
abstracting: (p203<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
abstracting: (1<=p13)
states: 82,668,600,000,000 (13)
abstracting: (p13<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p41)
states: 55,112,400,000,000 (13)
abstracting: (p41<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p174)
states: 496,011,600,000,000 (14)
abstracting: (p174<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p105)
states: 49,601,160,000,000 (13)
abstracting: (p105<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p194)
states: 496,011,600,000,000 (14)
abstracting: (p194<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p115)
states: 55,112,400,000,000 (13)
abstracting: (p115<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p203)
states: 496,011,600,000,000 (14)
abstracting: (p203<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
abstracting: (1<=p115)
states: 55,112,400,000,000 (13)
abstracting: (p115<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p203)
states: 496,011,600,000,000 (14)
abstracting: (p203<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p78)
states: 49,601,160,000,000 (13)
abstracting: (p78<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p148)
states: 496,011,600,000,000 (14)
abstracting: (p148<=1)
states: 496,011,600,000,001 (14)
..
EG iterations: 1
abstracting: (1<=p120)
states: 49,601,160,000,000 (13)
abstracting: (p120<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p162)
states: 496,011,600,000,000 (14)
abstracting: (p162<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p127)
states: 49,601,160,000,000 (13)
abstracting: (p127<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p207)
states: 496,011,600,000,000 (14)
abstracting: (p207<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p78)
states: 49,601,160,000,000 (13)
abstracting: (p78<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p148)
states: 496,011,600,000,000 (14)
abstracting: (p148<=1)
states: 496,011,600,000,001 (14)
..
EG iterations: 1
abstracting: (1<=p78)
states: 49,601,160,000,000 (13)
abstracting: (p78<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p148)
states: 496,011,600,000,000 (14)
abstracting: (p148<=1)
states: 496,011,600,000,001 (14)
..
EG iterations: 1
..
EG iterations: 2
-> the formula is TRUE
FORMULA DLCround-PT-11a-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.615sec
checking: AG [E [[[p46<=1 & 1<=p46] & [[p145<=1 & 1<=p145] & [E [AF [[[p59<=1 & 1<=p59] & [p183<=1 & 1<=p183]]] U A [[[p10<=1 & 1<=p10] & [p138<=1 & 1<=p138]] U [[p36<=1 & 1<=p36] & [p141<=1 & 1<=p141]]]] | [[p20<=1 & 1<=p20] & [[p159<=1 & 1<=p159] & [p117<=1 & 1<=p117]]]]]] U EF [[[[p96<=1 & 1<=p96] & [p172<=1 & 1<=p172]] | [[p41<=1 & 1<=p41] & [p180<=1 & 1<=p180]]]]]]
normalized: ~ [E [true U ~ [E [[[[[[[p117<=1 & 1<=p117] & [p159<=1 & 1<=p159]] & [p20<=1 & 1<=p20]] | E [~ [EG [~ [[[p183<=1 & 1<=p183] & [p59<=1 & 1<=p59]]]]] U [~ [EG [~ [[[p141<=1 & 1<=p141] & [p36<=1 & 1<=p36]]]]] & ~ [E [~ [[[p141<=1 & 1<=p141] & [p36<=1 & 1<=p36]]] U [~ [[[p138<=1 & 1<=p138] & [p10<=1 & 1<=p10]]] & ~ [[[p141<=1 & 1<=p141] & [p36<=1 & 1<=p36]]]]]]]]] & [p145<=1 & 1<=p145]] & [p46<=1 & 1<=p46]] U E [true U [[[p180<=1 & 1<=p180] & [p41<=1 & 1<=p41]] | [[p172<=1 & 1<=p172] & [p96<=1 & 1<=p96]]]]]]]]
abstracting: (1<=p96)
states: 55,112,400,000,000 (13)
abstracting: (p96<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p172)
states: 496,011,600,000,000 (14)
abstracting: (p172<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p41)
states: 55,112,400,000,000 (13)
abstracting: (p41<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p180)
states: 496,011,600,000,000 (14)
abstracting: (p180<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p46)
states: 49,601,160,000,000 (13)
abstracting: (p46<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p145)
states: 496,011,600,000,000 (14)
abstracting: (p145<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p36)
states: 55,112,400,000,000 (13)
abstracting: (p36<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p141)
states: 496,011,600,000,000 (14)
abstracting: (p141<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p10)
states: 99,202,320,000,000 (13)
abstracting: (p10<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p138)
states: 496,011,600,000,000 (14)
abstracting: (p138<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p36)
states: 55,112,400,000,000 (13)
abstracting: (p36<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p141)
states: 496,011,600,000,000 (14)
abstracting: (p141<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p36)
states: 55,112,400,000,000 (13)
abstracting: (p36<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p141)
states: 496,011,600,000,000 (14)
abstracting: (p141<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
abstracting: (1<=p59)
states: 62,001,450,000,000 (13)
abstracting: (p59<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p183)
states: 496,011,600,000,000 (14)
abstracting: (p183<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
abstracting: (1<=p20)
states: 70,858,800,000,000 (13)
abstracting: (p20<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p159)
states: 496,011,600,000,000 (14)
abstracting: (p159<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p117)
states: 49,601,160,000,000 (13)
abstracting: (p117<=1)
states: 496,011,600,000,001 (14)
-> the formula is TRUE
FORMULA DLCround-PT-11a-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.834sec
checking: EF [[AG [[[[p135<=1 & 1<=p135] & [p173<=1 & 1<=p173]] | [AF [[[p75<=0 & 0<=p75] | [p149<=0 & 0<=p149]]] | ~ [E [[[p110<=1 & 1<=p110] & [p199<=1 & 1<=p199]] U [[p10<=1 & 1<=p10] & [p163<=1 & 1<=p163]]]]]]] | EX [[[EG [[[p26<=0 & 0<=p26] | [p139<=0 & 0<=p139]]] & [[p33<=0 & 0<=p33] | [p169<=0 & 0<=p169]]] | [[[p12<=0 & 0<=p12] & [[p56<=0 & 0<=p56] | [p182<=0 & 0<=p182]]] & [[p29<=1 & 1<=p29] & [p171<=1 & 1<=p171]]]]]]]
normalized: E [true U [EX [[[[[p171<=1 & 1<=p171] & [p29<=1 & 1<=p29]] & [[[p182<=0 & 0<=p182] | [p56<=0 & 0<=p56]] & [p12<=0 & 0<=p12]]] | [[[p169<=0 & 0<=p169] | [p33<=0 & 0<=p33]] & EG [[[p139<=0 & 0<=p139] | [p26<=0 & 0<=p26]]]]]] | ~ [E [true U ~ [[[~ [E [[[p199<=1 & 1<=p199] & [p110<=1 & 1<=p110]] U [[p163<=1 & 1<=p163] & [p10<=1 & 1<=p10]]]] | ~ [EG [~ [[[p149<=0 & 0<=p149] | [p75<=0 & 0<=p75]]]]]] | [[p173<=1 & 1<=p173] & [p135<=1 & 1<=p135]]]]]]]]
abstracting: (1<=p135)
states: 49,601,160,000,000 (13)
abstracting: (p135<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p173)
states: 496,011,600,000,000 (14)
abstracting: (p173<=1)
states: 496,011,600,000,001 (14)
abstracting: (0<=p75)
states: 496,011,600,000,001 (14)
abstracting: (p75<=0)
states: 446,410,440,000,001 (14)
abstracting: (0<=p149)
states: 496,011,600,000,001 (14)
abstracting: (p149<=0)
states: 1
.
EG iterations: 1
abstracting: (1<=p10)
states: 99,202,320,000,000 (13)
abstracting: (p10<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p163)
states: 496,011,600,000,000 (14)
abstracting: (p163<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p110)
states: 55,112,400,000,000 (13)
abstracting: (p110<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p199)
states: 496,011,600,000,000 (14)
abstracting: (p199<=1)
states: 496,011,600,000,001 (14)
abstracting: (0<=p26)
states: 496,011,600,000,001 (14)
abstracting: (p26<=0)
states: 446,410,440,000,001 (14)
abstracting: (0<=p139)
states: 496,011,600,000,001 (14)
abstracting: (p139<=0)
states: 1
.
EG iterations: 1
abstracting: (0<=p33)
states: 496,011,600,000,001 (14)
abstracting: (p33<=0)
states: 446,410,440,000,001 (14)
abstracting: (0<=p169)
states: 496,011,600,000,001 (14)
abstracting: (p169<=0)
states: 1
abstracting: (0<=p12)
states: 496,011,600,000,001 (14)
abstracting: (p12<=0)
states: 413,343,000,000,001 (14)
abstracting: (0<=p56)
states: 496,011,600,000,001 (14)
abstracting: (p56<=0)
states: 434,010,150,000,001 (14)
abstracting: (0<=p182)
states: 496,011,600,000,001 (14)
abstracting: (p182<=0)
states: 1
abstracting: (1<=p29)
states: 49,601,160,000,000 (13)
abstracting: (p29<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p171)
states: 496,011,600,000,000 (14)
abstracting: (p171<=1)
states: 496,011,600,000,001 (14)
.-> the formula is TRUE
FORMULA DLCround-PT-11a-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.396sec
checking: E [[[p95<=1 & 1<=p95] & [p192<=1 & 1<=p192]] U A [AG [[EF [[[p63<=1 & 1<=p63] & [p186<=1 & 1<=p186]]] | [[[p106<=1 & 1<=p106] & [p157<=1 & 1<=p157]] | [[[p68<=1 & 1<=p68] & [p170<=1 & 1<=p170]] & [[p87<=1 & 1<=p87] & [p204<=1 & 1<=p204]]]]]] U [A [[[p107<=1 & 1<=p107] & [p196<=1 & 1<=p196]] U A [[[p16<=1 & 1<=p16] & [p161<=1 & 1<=p161]] U [[p50<=1 & 1<=p50] & [p179<=1 & 1<=p179]]]] & EF [AG [[[p110<=1 & 1<=p110] & [p199<=1 & 1<=p199]]]]]]]
normalized: E [[[p192<=1 & 1<=p192] & [p95<=1 & 1<=p95]] U [~ [EG [~ [[E [true U ~ [E [true U ~ [[[p199<=1 & 1<=p199] & [p110<=1 & 1<=p110]]]]]] & [~ [EG [~ [[~ [EG [~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]]]] & ~ [E [~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]] U [~ [[[p161<=1 & 1<=p161] & [p16<=1 & 1<=p16]]] & ~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]]]] & ~ [E [~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]] U [~ [[[p161<=1 & 1<=p161] & [p16<=1 & 1<=p16]]] & ~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]]]]]]] U [~ [[[p196<=1 & 1<=p196] & [p107<=1 & 1<=p107]]] & ~ [[~ [EG [~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]]]] & ~ [E [~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]] U [~ [[[p161<=1 & 1<=p161] & [p16<=1 & 1<=p16]]] & ~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]]]]]]]]]]]]]]] & ~ [E [~ [[E [true U ~ [E [true U ~ [[[p199<=1 & 1<=p199] & [p110<=1 & 1<=p110]]]]]] & [~ [EG [~ [[~ [EG [~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]]]] & ~ [E [~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]] U [~ [[[p161<=1 & 1<=p161] & [p16<=1 & 1<=p16]]] & ~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]]]] & ~ [E [~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]] U [~ [[[p161<=1 & 1<=p161] & [p16<=1 & 1<=p16]]] & ~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]]]]]]] U [~ [[[p196<=1 & 1<=p196] & [p107<=1 & 1<=p107]]] & ~ [[~ [EG [~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]]]] & ~ [E [~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]] U [~ [[[p161<=1 & 1<=p161] & [p16<=1 & 1<=p16]]] & ~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]]]]]]]]]]]]] U [E [true U ~ [[[[[[p204<=1 & 1<=p204] & [p87<=1 & 1<=p87]] & [[p170<=1 & 1<=p170] & [p68<=1 & 1<=p68]]] | [[p157<=1 & 1<=p157] & [p106<=1 & 1<=p106]]] | E [true U [[p186<=1 & 1<=p186] & [p63<=1 & 1<=p63]]]]]] & ~ [[E [true U ~ [E [true U ~ [[[p199<=1 & 1<=p199] & [p110<=1 & 1<=p110]]]]]] & [~ [EG [~ [[~ [EG [~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]]]] & ~ [E [~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]] U [~ [[[p161<=1 & 1<=p161] & [p16<=1 & 1<=p16]]] & ~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]]]] & ~ [E [~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]] U [~ [[[p161<=1 & 1<=p161] & [p16<=1 & 1<=p16]]] & ~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]]]]]]] U [~ [[[p196<=1 & 1<=p196] & [p107<=1 & 1<=p107]]] & ~ [[~ [EG [~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]]]] & ~ [E [~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]] U [~ [[[p161<=1 & 1<=p161] & [p16<=1 & 1<=p16]]] & ~ [[[p179<=1 & 1<=p179] & [p50<=1 & 1<=p50]]]]]]]]]]]]]]]]]]]
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p16)
states: 82,668,600,000,000 (13)
abstracting: (p16<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p161)
states: 496,011,600,000,000 (14)
abstracting: (p161<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
abstracting: (1<=p107)
states: 49,601,160,000,000 (13)
abstracting: (p107<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p196)
states: 496,011,600,000,000 (14)
abstracting: (p196<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p16)
states: 82,668,600,000,000 (13)
abstracting: (p16<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p161)
states: 496,011,600,000,000 (14)
abstracting: (p161<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p16)
states: 82,668,600,000,000 (13)
abstracting: (p16<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p161)
states: 496,011,600,000,000 (14)
abstracting: (p161<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p110)
states: 55,112,400,000,000 (13)
abstracting: (p110<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p199)
states: 496,011,600,000,000 (14)
abstracting: (p199<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p63)
states: 55,112,400,000,000 (13)
abstracting: (p63<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p186)
states: 496,011,600,000,000 (14)
abstracting: (p186<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p106)
states: 49,601,160,000,000 (13)
abstracting: (p106<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p157)
states: 496,011,600,000,000 (14)
abstracting: (p157<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p68)
states: 55,112,400,000,000 (13)
abstracting: (p68<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p170)
states: 496,011,600,000,000 (14)
abstracting: (p170<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p87)
states: 55,112,400,000,000 (13)
abstracting: (p87<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p204)
states: 496,011,600,000,000 (14)
abstracting: (p204<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p16)
states: 82,668,600,000,000 (13)
abstracting: (p16<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p161)
states: 496,011,600,000,000 (14)
abstracting: (p161<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
abstracting: (1<=p107)
states: 49,601,160,000,000 (13)
abstracting: (p107<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p196)
states: 496,011,600,000,000 (14)
abstracting: (p196<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p16)
states: 82,668,600,000,000 (13)
abstracting: (p16<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p161)
states: 496,011,600,000,000 (14)
abstracting: (p161<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p16)
states: 82,668,600,000,000 (13)
abstracting: (p16<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p161)
states: 496,011,600,000,000 (14)
abstracting: (p161<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p110)
states: 55,112,400,000,000 (13)
abstracting: (p110<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p199)
states: 496,011,600,000,000 (14)
abstracting: (p199<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p16)
states: 82,668,600,000,000 (13)
abstracting: (p16<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p161)
states: 496,011,600,000,000 (14)
abstracting: (p161<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
abstracting: (1<=p107)
states: 49,601,160,000,000 (13)
abstracting: (p107<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p196)
states: 496,011,600,000,000 (14)
abstracting: (p196<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p16)
states: 82,668,600,000,000 (13)
abstracting: (p16<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p161)
states: 496,011,600,000,000 (14)
abstracting: (p161<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p16)
states: 82,668,600,000,000 (13)
abstracting: (p16<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p161)
states: 496,011,600,000,000 (14)
abstracting: (p161<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p50)
states: 49,601,160,000,000 (13)
abstracting: (p50<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p179)
states: 496,011,600,000,000 (14)
abstracting: (p179<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p110)
states: 55,112,400,000,000 (13)
abstracting: (p110<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p199)
states: 496,011,600,000,000 (14)
abstracting: (p199<=1)
states: 496,011,600,000,001 (14)
EG iterations: 0
abstracting: (1<=p95)
states: 55,112,400,000,000 (13)
abstracting: (p95<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p192)
states: 496,011,600,000,000 (14)
abstracting: (p192<=1)
states: 496,011,600,000,001 (14)
-> the formula is FALSE
FORMULA DLCround-PT-11a-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.360sec
checking: EF [[[EF [AX [[[p84<=1 & 1<=p84] & [p153<=1 & 1<=p153]]]] & [p77<=1 & 1<=p77]] & [[p190<=1 & 1<=p190] & [[EF [[[p32<=0 & 0<=p32] | [p198<=0 & 0<=p198]]] | [[[p51<=1 & 1<=p51] & [p144<=1 & 1<=p144]] | [~ [E [[p48<=1 & 1<=p48] U [[p107<=1 & 1<=p107] & [p196<=1 & 1<=p196]]]] & ~ [A [[[p27<=1 & 1<=p27] & [p137<=1 & 1<=p137]] U [[p124<=1 & 1<=p124] & [p164<=1 & 1<=p164]]]]]]] & [EX [[[p59<=1 & 1<=p59] & [p184<=1 & 1<=p184]]] | [[p31<=1 & 1<=p31] & [p172<=1 & 1<=p172]]]]]]]
normalized: E [true U [[[[[[p172<=1 & 1<=p172] & [p31<=1 & 1<=p31]] | EX [[[p184<=1 & 1<=p184] & [p59<=1 & 1<=p59]]]] & [[[~ [[~ [EG [~ [[[p164<=1 & 1<=p164] & [p124<=1 & 1<=p124]]]]] & ~ [E [~ [[[p164<=1 & 1<=p164] & [p124<=1 & 1<=p124]]] U [~ [[[p137<=1 & 1<=p137] & [p27<=1 & 1<=p27]]] & ~ [[[p164<=1 & 1<=p164] & [p124<=1 & 1<=p124]]]]]]]] & ~ [E [[p48<=1 & 1<=p48] U [[p196<=1 & 1<=p196] & [p107<=1 & 1<=p107]]]]] | [[p144<=1 & 1<=p144] & [p51<=1 & 1<=p51]]] | E [true U [[p198<=0 & 0<=p198] | [p32<=0 & 0<=p32]]]]] & [p190<=1 & 1<=p190]] & [[p77<=1 & 1<=p77] & E [true U ~ [EX [~ [[[p153<=1 & 1<=p153] & [p84<=1 & 1<=p84]]]]]]]]]
abstracting: (1<=p84)
states: 55,112,400,000,000 (13)
abstracting: (p84<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p153)
states: 496,011,600,000,000 (14)
abstracting: (p153<=1)
states: 496,011,600,000,001 (14)
.abstracting: (1<=p77)
states: 49,601,160,000,000 (13)
abstracting: (p77<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p190)
states: 496,011,600,000,000 (14)
abstracting: (p190<=1)
states: 496,011,600,000,001 (14)
abstracting: (0<=p32)
states: 496,011,600,000,001 (14)
abstracting: (p32<=0)
states: 446,410,440,000,001 (14)
abstracting: (0<=p198)
states: 496,011,600,000,001 (14)
abstracting: (p198<=0)
states: 1
abstracting: (1<=p51)
states: 49,601,160,000,000 (13)
abstracting: (p51<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p144)
states: 496,011,600,000,000 (14)
abstracting: (p144<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p107)
states: 49,601,160,000,000 (13)
abstracting: (p107<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p196)
states: 496,011,600,000,000 (14)
abstracting: (p196<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p48)
states: 49,601,160,000,000 (13)
abstracting: (p48<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p124)
states: 49,601,160,000,000 (13)
abstracting: (p124<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p164)
states: 496,011,600,000,000 (14)
abstracting: (p164<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p27)
states: 49,601,160,000,000 (13)
abstracting: (p27<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p137)
states: 496,011,600,000,000 (14)
abstracting: (p137<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p124)
states: 49,601,160,000,000 (13)
abstracting: (p124<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p164)
states: 496,011,600,000,000 (14)
abstracting: (p164<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p124)
states: 49,601,160,000,000 (13)
abstracting: (p124<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p164)
states: 496,011,600,000,000 (14)
abstracting: (p164<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
abstracting: (1<=p59)
states: 62,001,450,000,000 (13)
abstracting: (p59<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p184)
states: 496,011,600,000,000 (14)
abstracting: (p184<=1)
states: 496,011,600,000,001 (14)
.abstracting: (1<=p31)
states: 49,601,160,000,000 (13)
abstracting: (p31<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p172)
states: 496,011,600,000,000 (14)
abstracting: (p172<=1)
states: 496,011,600,000,001 (14)
-> the formula is FALSE
FORMULA DLCround-PT-11a-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.582sec
checking: [AG [[[EF [[[p134<=0 & 0<=p134] | [p206<=0 & 0<=p206]]] | [[p124<=1 & 1<=p124] & [p162<=1 & 1<=p162]]] | [[p40<=0 & 0<=p40] | [p175<=0 & 0<=p175]]]] & EX [A [[[EF [[[p116<=1 & 1<=p116] & [p202<=1 & 1<=p202]]] | [[p87<=1 & 1<=p87] & [p200<=1 & 1<=p200]]] | [~ [[[p72<=1 & 1<=p72] & [p189<=1 & 1<=p189]]] | [[p113<=1 & 1<=p113] & [p160<=1 & 1<=p160]]]] U [EX [[[[p87<=1 & 1<=p87] & [p181<=1 & 1<=p181]] & [[p116<=1 & 1<=p116] & [p161<=1 & 1<=p161]]]] | AF [~ [[[p29<=1 & 1<=p29] & [p170<=1 & 1<=p170]]]]]]]]
normalized: [EX [[~ [EG [~ [[~ [EG [[[p170<=1 & 1<=p170] & [p29<=1 & 1<=p29]]]] | EX [[[[p161<=1 & 1<=p161] & [p116<=1 & 1<=p116]] & [[p181<=1 & 1<=p181] & [p87<=1 & 1<=p87]]]]]]]] & ~ [E [~ [[~ [EG [[[p170<=1 & 1<=p170] & [p29<=1 & 1<=p29]]]] | EX [[[[p161<=1 & 1<=p161] & [p116<=1 & 1<=p116]] & [[p181<=1 & 1<=p181] & [p87<=1 & 1<=p87]]]]]] U [~ [[[[[p160<=1 & 1<=p160] & [p113<=1 & 1<=p113]] | ~ [[[p189<=1 & 1<=p189] & [p72<=1 & 1<=p72]]]] | [[[p200<=1 & 1<=p200] & [p87<=1 & 1<=p87]] | E [true U [[p202<=1 & 1<=p202] & [p116<=1 & 1<=p116]]]]]] & ~ [[~ [EG [[[p170<=1 & 1<=p170] & [p29<=1 & 1<=p29]]]] | EX [[[[p161<=1 & 1<=p161] & [p116<=1 & 1<=p116]] & [[p181<=1 & 1<=p181] & [p87<=1 & 1<=p87]]]]]]]]]]] & ~ [E [true U ~ [[[[p175<=0 & 0<=p175] | [p40<=0 & 0<=p40]] | [[[p162<=1 & 1<=p162] & [p124<=1 & 1<=p124]] | E [true U [[p206<=0 & 0<=p206] | [p134<=0 & 0<=p134]]]]]]]]]
abstracting: (0<=p134)
states: 496,011,600,000,001 (14)
abstracting: (p134<=0)
states: 446,410,440,000,001 (14)
abstracting: (0<=p206)
states: 496,011,600,000,001 (14)
abstracting: (p206<=0)
states: 1
abstracting: (1<=p124)
states: 49,601,160,000,000 (13)
abstracting: (p124<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p162)
states: 496,011,600,000,000 (14)
abstracting: (p162<=1)
states: 496,011,600,000,001 (14)
abstracting: (0<=p40)
states: 496,011,600,000,001 (14)
abstracting: (p40<=0)
states: 440,899,200,000,001 (14)
abstracting: (0<=p175)
states: 496,011,600,000,001 (14)
abstracting: (p175<=0)
states: 1
abstracting: (1<=p87)
states: 55,112,400,000,000 (13)
abstracting: (p87<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p181)
states: 496,011,600,000,000 (14)
abstracting: (p181<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p116)
states: 55,112,400,000,000 (13)
abstracting: (p116<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p161)
states: 496,011,600,000,000 (14)
abstracting: (p161<=1)
states: 496,011,600,000,001 (14)
.abstracting: (1<=p29)
states: 49,601,160,000,000 (13)
abstracting: (p29<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p170)
states: 496,011,600,000,000 (14)
abstracting: (p170<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
abstracting: (1<=p116)
states: 55,112,400,000,000 (13)
abstracting: (p116<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p202)
states: 496,011,600,000,000 (14)
abstracting: (p202<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p87)
states: 55,112,400,000,000 (13)
abstracting: (p87<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p200)
states: 496,011,600,000,000 (14)
abstracting: (p200<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p72)
states: 49,601,160,000,000 (13)
abstracting: (p72<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p189)
states: 496,011,600,000,000 (14)
abstracting: (p189<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p113)
states: 55,112,400,000,000 (13)
abstracting: (p113<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p160)
states: 496,011,600,000,000 (14)
abstracting: (p160<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p87)
states: 55,112,400,000,000 (13)
abstracting: (p87<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p181)
states: 496,011,600,000,000 (14)
abstracting: (p181<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p116)
states: 55,112,400,000,000 (13)
abstracting: (p116<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p161)
states: 496,011,600,000,000 (14)
abstracting: (p161<=1)
states: 496,011,600,000,001 (14)
.abstracting: (1<=p29)
states: 49,601,160,000,000 (13)
abstracting: (p29<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p170)
states: 496,011,600,000,000 (14)
abstracting: (p170<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
abstracting: (1<=p87)
states: 55,112,400,000,000 (13)
abstracting: (p87<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p181)
states: 496,011,600,000,000 (14)
abstracting: (p181<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p116)
states: 55,112,400,000,000 (13)
abstracting: (p116<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p161)
states: 496,011,600,000,000 (14)
abstracting: (p161<=1)
states: 496,011,600,000,001 (14)
.abstracting: (1<=p29)
states: 49,601,160,000,000 (13)
abstracting: (p29<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p170)
states: 496,011,600,000,000 (14)
abstracting: (p170<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE
FORMULA DLCround-PT-11a-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.738sec
checking: [EG [[AF [[EF [[[p16<=1 & 1<=p16] & [p142<=1 & 1<=p142]]] | [[p128<=0 & 0<=p128] | [[p33<=1 & 1<=p33] & [p170<=1 & 1<=p170]]]]] | [AX [EF [[[p96<=1 & 1<=p96] & [p172<=1 & 1<=p172]]]] & [~ [A [[[p80<=1 & 1<=p80] & [p153<=1 & 1<=p153]] U [[p17<=1 & 1<=p17] & [p155<=1 & 1<=p155]]]] & [[p106<=0 & 0<=p106] | [p187<=0 & 0<=p187]]]]]] & AG [AF [[EF [[[p16<=0 & 0<=p16] | [p168<=0 & 0<=p168]]] & [[[[p46<=0 & 0<=p46] | [p146<=0 & 0<=p146]] | [[p23<=0 & 0<=p23] | [p146<=0 & 0<=p146]]] & [[[p38<=1 & 1<=p38] & [p143<=1 & 1<=p143]] | [[p46<=1 & 1<=p46] & [p177<=1 & 1<=p177]]]]]]]]
normalized: [~ [E [true U EG [~ [[[[[[p177<=1 & 1<=p177] & [p46<=1 & 1<=p46]] | [[p143<=1 & 1<=p143] & [p38<=1 & 1<=p38]]] & [[[p146<=0 & 0<=p146] | [p23<=0 & 0<=p23]] | [[p146<=0 & 0<=p146] | [p46<=0 & 0<=p46]]]] & E [true U [[p168<=0 & 0<=p168] | [p16<=0 & 0<=p16]]]]]]]] & EG [[[[[[p187<=0 & 0<=p187] | [p106<=0 & 0<=p106]] & ~ [[~ [EG [~ [[[p155<=1 & 1<=p155] & [p17<=1 & 1<=p17]]]]] & ~ [E [~ [[[p155<=1 & 1<=p155] & [p17<=1 & 1<=p17]]] U [~ [[[p153<=1 & 1<=p153] & [p80<=1 & 1<=p80]]] & ~ [[[p155<=1 & 1<=p155] & [p17<=1 & 1<=p17]]]]]]]]] & ~ [EX [~ [E [true U [[p172<=1 & 1<=p172] & [p96<=1 & 1<=p96]]]]]]] | ~ [EG [~ [[[[[p170<=1 & 1<=p170] & [p33<=1 & 1<=p33]] | [p128<=0 & 0<=p128]] | E [true U [[p142<=1 & 1<=p142] & [p16<=1 & 1<=p16]]]]]]]]]]
abstracting: (1<=p16)
states: 82,668,600,000,000 (13)
abstracting: (p16<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p142)
states: 496,011,600,000,000 (14)
abstracting: (p142<=1)
states: 496,011,600,000,001 (14)
abstracting: (0<=p128)
states: 496,011,600,000,001 (14)
abstracting: (p128<=0)
states: 446,410,440,000,001 (14)
abstracting: (1<=p33)
states: 49,601,160,000,000 (13)
abstracting: (p33<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p170)
states: 496,011,600,000,000 (14)
abstracting: (p170<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
abstracting: (1<=p96)
states: 55,112,400,000,000 (13)
abstracting: (p96<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p172)
states: 496,011,600,000,000 (14)
abstracting: (p172<=1)
states: 496,011,600,000,001 (14)
.abstracting: (1<=p17)
states: 70,858,800,000,000 (13)
abstracting: (p17<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p155)
states: 496,011,600,000,000 (14)
abstracting: (p155<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p80)
states: 55,112,400,000,000 (13)
abstracting: (p80<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p153)
states: 496,011,600,000,000 (14)
abstracting: (p153<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p17)
states: 70,858,800,000,000 (13)
abstracting: (p17<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p155)
states: 496,011,600,000,000 (14)
abstracting: (p155<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p17)
states: 70,858,800,000,000 (13)
abstracting: (p17<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p155)
states: 496,011,600,000,000 (14)
abstracting: (p155<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
abstracting: (0<=p106)
states: 496,011,600,000,001 (14)
abstracting: (p106<=0)
states: 446,410,440,000,001 (14)
abstracting: (0<=p187)
states: 496,011,600,000,001 (14)
abstracting: (p187<=0)
states: 1
EG iterations: 0
abstracting: (0<=p16)
states: 496,011,600,000,001 (14)
abstracting: (p16<=0)
states: 413,343,000,000,001 (14)
abstracting: (0<=p168)
states: 496,011,600,000,001 (14)
abstracting: (p168<=0)
states: 1
abstracting: (0<=p46)
states: 496,011,600,000,001 (14)
abstracting: (p46<=0)
states: 446,410,440,000,001 (14)
abstracting: (0<=p146)
states: 496,011,600,000,001 (14)
abstracting: (p146<=0)
states: 1
abstracting: (0<=p23)
states: 496,011,600,000,001 (14)
abstracting: (p23<=0)
states: 425,152,800,000,001 (14)
abstracting: (0<=p146)
states: 496,011,600,000,001 (14)
abstracting: (p146<=0)
states: 1
abstracting: (1<=p38)
states: 55,112,400,000,000 (13)
abstracting: (p38<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p143)
states: 496,011,600,000,000 (14)
abstracting: (p143<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p46)
states: 49,601,160,000,000 (13)
abstracting: (p46<=1)
states: 496,011,600,000,001 (14)
abstracting: (1<=p177)
states: 496,011,600,000,000 (14)
abstracting: (p177<=1)
states: 496,011,600,000,001 (14)
.
EG iterations: 1
-> the formula is FALSE
FORMULA DLCround-PT-11a-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.214sec
totally nodes used: 921341 (9.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 9566058 21193777 30759835
used/not used/entry size/cache size: 18543442 48565422 16 1024MB
basic ops cache: hits/miss/sum: 859524 1721131 2580655
used/not used/entry size/cache size: 2218377 14558839 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: 60876 132469 193345
used/not used/entry size/cache size: 131650 8256958 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 66256282
1 791326
2 54421
3 6219
4 569
5 42
6 5
7 0
8 0
9 0
>= 10 0
Total processing time: 0m10.797sec
BK_STOP 1678465807798
--------------------
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:3321 (11), effective:121 (0)
initing FirstDep: 0m 0.000sec
iterations count:790 (2), effective:9 (0)
iterations count:612 (2), effective:7 (0)
iterations count:296 (1), effective:1 (0)
iterations count:867 (2), effective:10 (0)
iterations count:302 (1), effective:1 (0)
iterations count:297 (1), effective:1 (0)
iterations count:627 (2), effective:9 (0)
iterations count:619 (2), effective:9 (0)
iterations count:297 (1), effective:1 (0)
iterations count:600 (2), effective:10 (0)
iterations count:294 (1), effective:0 (0)
iterations count:1097 (3), effective:19 (0)
iterations count:294 (1), effective:0 (0)
iterations count:618 (2), effective:9 (0)
iterations count:618 (2), effective:9 (0)
iterations count:297 (1), effective:1 (0)
iterations count:484 (1), effective:8 (0)
iterations count:294 (1), effective:0 (0)
iterations count:309 (1), effective:4 (0)
iterations count:962 (3), effective:19 (0)
iterations count:574 (1), effective:1 (0)
iterations count:297 (1), effective:1 (0)
iterations count:297 (1), effective:1 (0)
iterations count:426 (1), effective:1 (0)
iterations count:297 (1), effective:1 (0)
iterations count:305 (1), effective:1 (0)
iterations count:619 (2), effective:9 (0)
iterations count:297 (1), effective:1 (0)
iterations count:297 (1), effective:1 (0)
iterations count:426 (1), effective:1 (0)
iterations count:297 (1), effective:1 (0)
iterations count:305 (1), effective:1 (0)
iterations count:297 (1), effective:1 (0)
iterations count:297 (1), effective:1 (0)
iterations count:426 (1), effective:1 (0)
iterations count:297 (1), effective:1 (0)
iterations count:305 (1), effective:1 (0)
iterations count:304 (1), effective:1 (0)
iterations count:466 (1), effective:9 (0)
iterations count:296 (1), effective:1 (0)
iterations count:296 (1), effective:1 (0)
iterations count:618 (2), effective:9 (0)
iterations count:596 (2), effective:6 (0)
iterations count:618 (2), effective:9 (0)
iterations count:303 (1), effective:1 (0)
iterations count:297 (1), effective:1 (0)
iterations count:301 (1), effective:2 (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-11a"
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-11a, 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-167814483100746"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-11a.tgz
mv DLCround-PT-11a 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 ;