fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r106-tall-167814483100730
Last Updated
May 14, 2023

About the Execution of Marcie+red for DLCround-PT-10a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5484.867 12131.00 17524.00 251.50 TFFFTTFFTTTTTTTF 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-167814483100730.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-10a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483100730
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.3K Feb 25 19:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 19:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 19:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 19:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 11K Feb 25 20:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 25 20:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 20:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Feb 25 20:20 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 660K 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-10a-CTLFireability-00
FORMULA_NAME DLCround-PT-10a-CTLFireability-01
FORMULA_NAME DLCround-PT-10a-CTLFireability-02
FORMULA_NAME DLCround-PT-10a-CTLFireability-03
FORMULA_NAME DLCround-PT-10a-CTLFireability-04
FORMULA_NAME DLCround-PT-10a-CTLFireability-05
FORMULA_NAME DLCround-PT-10a-CTLFireability-06
FORMULA_NAME DLCround-PT-10a-CTLFireability-07
FORMULA_NAME DLCround-PT-10a-CTLFireability-08
FORMULA_NAME DLCround-PT-10a-CTLFireability-09
FORMULA_NAME DLCround-PT-10a-CTLFireability-10
FORMULA_NAME DLCround-PT-10a-CTLFireability-11
FORMULA_NAME DLCround-PT-10a-CTLFireability-12
FORMULA_NAME DLCround-PT-10a-CTLFireability-13
FORMULA_NAME DLCround-PT-10a-CTLFireability-14
FORMULA_NAME DLCround-PT-10a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678462660049

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-10a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 15:37:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 15:37:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 15:37:41] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2023-03-10 15:37:41] [INFO ] Transformed 337 places.
[2023-03-10 15:37:41] [INFO ] Transformed 2605 transitions.
[2023-03-10 15:37:41] [INFO ] Found NUPN structural information;
[2023-03-10 15:37:41] [INFO ] Parsed PT model containing 337 places and 2605 transitions and 10130 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 247 transitions
Reduce redundant transitions removed 247 transitions.
FORMULA DLCround-PT-10a-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 133 out of 337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 337/337 places, 2358/2358 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 323 transition count 2150
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 323 transition count 2150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 323 transition count 2149
Drop transitions removed 718 transitions
Redundant transition composition rules discarded 718 transitions
Iterating global reduction 1 with 718 rules applied. Total rules applied 747 place count 323 transition count 1431
Applied a total of 747 rules in 93 ms. Remains 323 /337 variables (removed 14) and now considering 1431/2358 (removed 927) transitions.
[2023-03-10 15:37:42] [INFO ] Flow matrix only has 203 transitions (discarded 1228 similar events)
// Phase 1: matrix 203 rows 323 cols
[2023-03-10 15:37:42] [INFO ] Computed 213 place invariants in 12 ms
[2023-03-10 15:37:42] [INFO ] Implicit Places using invariants in 702 ms returned [125, 129, 130, 132, 133, 135, 136, 137, 139, 140, 141, 144, 147, 148, 149, 150, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 163, 165, 166, 167, 169, 170, 172, 173, 174, 175, 178, 181, 182, 183, 184, 185, 187, 189, 191, 194, 195, 197, 199, 201, 202, 203, 205, 206, 208, 210, 211, 213, 214, 215, 218, 220, 222, 223, 224, 226, 227, 229, 233, 235, 236, 237, 239, 241, 242, 247, 248, 249, 250, 251, 254, 255, 259, 261, 263, 268, 269, 273, 275, 276, 277, 278, 281, 282, 283, 285, 286, 287, 288, 289, 291, 293, 295, 296, 298, 299, 300, 303, 305, 306, 307, 308, 309, 310, 312, 313, 315, 316, 317, 318, 319, 320, 322]
Discarding 123 places :
Ensure Unique test removed 665 transitions
Reduce isomorphic transitions removed 665 transitions.
Implicit Place search using SMT only with invariants took 934 ms to find 123 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/337 places, 766/2358 transitions.
Drop transitions removed 496 transitions
Redundant transition composition rules discarded 496 transitions
Iterating global reduction 0 with 496 rules applied. Total rules applied 496 place count 200 transition count 270
Applied a total of 496 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 270/766 (removed 496) transitions.
[2023-03-10 15:37:42] [INFO ] Flow matrix only has 203 transitions (discarded 67 similar events)
// Phase 1: matrix 203 rows 200 cols
[2023-03-10 15:37:42] [INFO ] Computed 90 place invariants in 5 ms
[2023-03-10 15:37:42] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-10 15:37:42] [INFO ] Flow matrix only has 203 transitions (discarded 67 similar events)
[2023-03-10 15:37:42] [INFO ] Invariant cache hit.
[2023-03-10 15:37:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 15:37:42] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 200/337 places, 270/2358 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1206 ms. Remains : 200/337 places, 270/2358 transitions.
Support contains 133 out of 200 places after structural reductions.
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 39 ms
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 21 ms
[2023-03-10 15:37:43] [INFO ] Input system was already deterministic with 270 transitions.
Support contains 131 out of 200 places (down from 133) after GAL structural reductions.
Finished random walk after 932 steps, including 0 resets, run visited all 71 properties in 95 ms. (steps per millisecond=9 )
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 13 ms
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 12 ms
[2023-03-10 15:37:43] [INFO ] Input system was already deterministic with 270 transitions.
Computed a total of 76 stabilizing places and 1 stable transitions
Graph (complete) has 359 edges and 200 vertex of which 125 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 270/270 transitions.
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 128 transition count 270
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 87 place count 113 transition count 240
Iterating global reduction 1 with 15 rules applied. Total rules applied 102 place count 113 transition count 240
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 105 place count 113 transition count 237
Applied a total of 105 rules in 4 ms. Remains 113 /200 variables (removed 87) and now considering 237/270 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 113/200 places, 237/270 transitions.
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 7 ms
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 7 ms
[2023-03-10 15:37:43] [INFO ] Input system was already deterministic with 237 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 270/270 transitions.
Graph (trivial) has 246 edges and 200 vertex of which 109 / 200 are part of one of the 14 SCC in 2 ms
Free SCC test removed 95 places
Ensure Unique test removed 221 transitions
Reduce isomorphic transitions removed 221 transitions.
Graph (complete) has 138 edges and 105 vertex of which 34 are kept as prefixes of interest. Removing 71 places using SCC suffix rule.0 ms
Discarding 71 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 34 transition count 48
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 33 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 32 transition count 47
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 16 place count 22 transition count 36
Iterating global reduction 3 with 10 rules applied. Total rules applied 26 place count 22 transition count 36
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 28 place count 22 transition count 34
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 30 place count 21 transition count 33
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 32 place count 21 transition count 31
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 33 place count 21 transition count 31
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 34 place count 20 transition count 30
Iterating global reduction 5 with 1 rules applied. Total rules applied 35 place count 20 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 36 place count 20 transition count 29
Applied a total of 36 rules in 15 ms. Remains 20 /200 variables (removed 180) and now considering 29/270 (removed 241) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 20/200 places, 29/270 transitions.
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:37:43] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 270/270 transitions.
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 129 transition count 270
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 84 place count 116 transition count 244
Iterating global reduction 1 with 13 rules applied. Total rules applied 97 place count 116 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 116 transition count 242
Applied a total of 99 rules in 4 ms. Remains 116 /200 variables (removed 84) and now considering 242/270 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 116/200 places, 242/270 transitions.
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 7 ms
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 6 ms
[2023-03-10 15:37:43] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 270/270 transitions.
Graph (trivial) has 252 edges and 200 vertex of which 109 / 200 are part of one of the 15 SCC in 0 ms
Free SCC test removed 94 places
Ensure Unique test removed 219 transitions
Reduce isomorphic transitions removed 219 transitions.
Graph (complete) has 140 edges and 106 vertex of which 34 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.1 ms
Discarding 72 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 34 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 32 transition count 49
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 18 place count 20 transition count 36
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 20 transition count 36
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 20 transition count 33
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 20 transition count 33
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 19 transition count 32
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 19 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 19 transition count 31
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 19 transition count 30
Applied a total of 38 rules in 6 ms. Remains 19 /200 variables (removed 181) and now considering 30/270 (removed 240) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 19/200 places, 30/270 transitions.
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:37:43] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 270/270 transitions.
Graph (trivial) has 266 edges and 200 vertex of which 123 / 200 are part of one of the 15 SCC in 0 ms
Free SCC test removed 108 places
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 251 transitions.
Graph (complete) has 108 edges and 92 vertex of which 18 are kept as prefixes of interest. Removing 74 places using SCC suffix rule.0 ms
Discarding 74 places :
Also discarding 0 output transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 15 place count 5 transition count 6
Iterating global reduction 0 with 13 rules applied. Total rules applied 28 place count 5 transition count 6
Applied a total of 28 rules in 2 ms. Remains 5 /200 variables (removed 195) and now considering 6/270 (removed 264) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 5/200 places, 6/270 transitions.
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 0 ms
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 0 ms
[2023-03-10 15:37:43] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
FORMULA DLCround-PT-10a-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 270/270 transitions.
Graph (trivial) has 267 edges and 200 vertex of which 123 / 200 are part of one of the 15 SCC in 0 ms
Free SCC test removed 108 places
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Graph (complete) has 107 edges and 92 vertex of which 18 are kept as prefixes of interest. Removing 74 places using SCC suffix rule.0 ms
Discarding 74 places :
Also discarding 0 output transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 15 place count 5 transition count 5
Iterating global reduction 0 with 13 rules applied. Total rules applied 28 place count 5 transition count 5
Applied a total of 28 rules in 2 ms. Remains 5 /200 variables (removed 195) and now considering 5/270 (removed 265) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 5/200 places, 5/270 transitions.
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 0 ms
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:37:43] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 270/270 transitions.
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 128 transition count 270
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 87 place count 113 transition count 240
Iterating global reduction 1 with 15 rules applied. Total rules applied 102 place count 113 transition count 240
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 105 place count 113 transition count 237
Applied a total of 105 rules in 3 ms. Remains 113 /200 variables (removed 87) and now considering 237/270 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 113/200 places, 237/270 transitions.
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 11 ms
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 6 ms
[2023-03-10 15:37:43] [INFO ] Input system was already deterministic with 237 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 270/270 transitions.
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 148 transition count 270
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 64 place count 136 transition count 246
Iterating global reduction 1 with 12 rules applied. Total rules applied 76 place count 136 transition count 246
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 78 place count 136 transition count 244
Applied a total of 78 rules in 3 ms. Remains 136 /200 variables (removed 64) and now considering 244/270 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 136/200 places, 244/270 transitions.
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 7 ms
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 6 ms
[2023-03-10 15:37:43] [INFO ] Input system was already deterministic with 244 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 270/270 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 130 transition count 270
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 84 place count 116 transition count 242
Iterating global reduction 1 with 14 rules applied. Total rules applied 98 place count 116 transition count 242
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 101 place count 116 transition count 239
Applied a total of 101 rules in 3 ms. Remains 116 /200 variables (removed 84) and now considering 239/270 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 116/200 places, 239/270 transitions.
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 5 ms
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 5 ms
[2023-03-10 15:37:43] [INFO ] Input system was already deterministic with 239 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 270/270 transitions.
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 128 transition count 270
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 87 place count 113 transition count 240
Iterating global reduction 1 with 15 rules applied. Total rules applied 102 place count 113 transition count 240
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 105 place count 113 transition count 237
Applied a total of 105 rules in 3 ms. Remains 113 /200 variables (removed 87) and now considering 237/270 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 113/200 places, 237/270 transitions.
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 5 ms
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 5 ms
[2023-03-10 15:37:43] [INFO ] Input system was already deterministic with 237 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 270/270 transitions.
Graph (trivial) has 249 edges and 200 vertex of which 109 / 200 are part of one of the 15 SCC in 0 ms
Free SCC test removed 94 places
Ensure Unique test removed 220 transitions
Reduce isomorphic transitions removed 220 transitions.
Graph (complete) has 139 edges and 106 vertex of which 34 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.0 ms
Discarding 72 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 34 transition count 49
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 33 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 32 transition count 48
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 18 place count 20 transition count 35
Iterating global reduction 3 with 12 rules applied. Total rules applied 30 place count 20 transition count 35
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 20 transition count 32
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 20 transition count 32
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 19 transition count 31
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 19 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 19 transition count 30
Applied a total of 37 rules in 5 ms. Remains 19 /200 variables (removed 181) and now considering 30/270 (removed 240) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 19/200 places, 30/270 transitions.
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 0 ms
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 0 ms
[2023-03-10 15:37:43] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 270/270 transitions.
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 134 transition count 270
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 78 place count 122 transition count 246
Iterating global reduction 1 with 12 rules applied. Total rules applied 90 place count 122 transition count 246
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 92 place count 122 transition count 244
Applied a total of 92 rules in 2 ms. Remains 122 /200 variables (removed 78) and now considering 244/270 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 122/200 places, 244/270 transitions.
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 6 ms
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 6 ms
[2023-03-10 15:37:43] [INFO ] Input system was already deterministic with 244 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 270/270 transitions.
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 132 transition count 270
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 81 place count 119 transition count 244
Iterating global reduction 1 with 13 rules applied. Total rules applied 94 place count 119 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 96 place count 119 transition count 242
Applied a total of 96 rules in 3 ms. Remains 119 /200 variables (removed 81) and now considering 242/270 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 119/200 places, 242/270 transitions.
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 5 ms
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 5 ms
[2023-03-10 15:37:43] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 270/270 transitions.
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 125 transition count 270
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 91 place count 109 transition count 238
Iterating global reduction 1 with 16 rules applied. Total rules applied 107 place count 109 transition count 238
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 110 place count 109 transition count 235
Applied a total of 110 rules in 2 ms. Remains 109 /200 variables (removed 91) and now considering 235/270 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 109/200 places, 235/270 transitions.
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 5 ms
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 5 ms
[2023-03-10 15:37:43] [INFO ] Input system was already deterministic with 235 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 270/270 transitions.
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 142 transition count 270
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 71 place count 129 transition count 244
Iterating global reduction 1 with 13 rules applied. Total rules applied 84 place count 129 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 86 place count 129 transition count 242
Applied a total of 86 rules in 3 ms. Remains 129 /200 variables (removed 71) and now considering 242/270 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 129/200 places, 242/270 transitions.
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 5 ms
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 5 ms
[2023-03-10 15:37:43] [INFO ] Input system was already deterministic with 242 transitions.
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 8 ms
[2023-03-10 15:37:43] [INFO ] Flatten gal took : 9 ms
[2023-03-10 15:37:43] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-10 15:37:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 200 places, 270 transitions and 629 arcs took 1 ms.
Total runtime 2343 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: 200 NrTr: 270 NrArc: 629)

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

net check time: 0m 0.000sec

init dd package: 0m 2.705sec


RS generation: 0m 0.051sec


-> reachability set: #nodes 2401 (2.4e+03) #states 42,326,323,200,001 (13)



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

checking: EF [EX [EG [EX [[p72<=1 & 1<=p72]]]]]
normalized: E [true U EX [EG [EX [[p72<=1 & 1<=p72]]]]]

abstracting: (1<=p72)
states: 4,702,924,800,000 (12)
abstracting: (p72<=1)
states: 42,326,323,200,001 (13)
..
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m 0.222sec

checking: AG [EF [[[p113<=1 & 1<=p113] & [p197<=1 & 1<=p197]]]]
normalized: ~ [E [true U ~ [E [true U [[p197<=1 & 1<=p197] & [p113<=1 & 1<=p113]]]]]]

abstracting: (1<=p113)
states: 5,290,790,400,000 (12)
abstracting: (p113<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p197)
states: 42,326,323,200,000 (13)
abstracting: (p197<=1)
states: 42,326,323,200,001 (13)
-> the formula is TRUE

FORMULA DLCround-PT-10a-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.048sec

checking: AG [EX [[EX [[[0<=p47 & p47<=0] | [p165<=0 & 0<=p165]]] & [[[p78<=0 & 0<=p78] | [p182<=0 & 0<=p182]] | [[p70<=0 & 0<=p70] | [p174<=0 & 0<=p174]]]]]]
normalized: ~ [E [true U ~ [EX [[[[[p174<=0 & 0<=p174] | [p70<=0 & 0<=p70]] | [[p182<=0 & 0<=p182] | [p78<=0 & 0<=p78]]] & EX [[[p165<=0 & 0<=p165] | [0<=p47 & p47<=0]]]]]]]]

abstracting: (p47<=0)
states: 37,623,398,400,001 (13)
abstracting: (0<=p47)
states: 42,326,323,200,001 (13)
abstracting: (0<=p165)
states: 42,326,323,200,001 (13)
abstracting: (p165<=0)
states: 1
.abstracting: (0<=p78)
states: 42,326,323,200,001 (13)
abstracting: (p78<=0)
states: 37,623,398,400,001 (13)
abstracting: (0<=p182)
states: 42,326,323,200,001 (13)
abstracting: (p182<=0)
states: 1
abstracting: (0<=p70)
states: 42,326,323,200,001 (13)
abstracting: (p70<=0)
states: 37,623,398,400,001 (13)
abstracting: (0<=p174)
states: 42,326,323,200,001 (13)
abstracting: (p174<=0)
states: 1
.-> the formula is TRUE

FORMULA DLCround-PT-10a-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.133sec

checking: EF [[[p107<=1 & 1<=p107] & [[p167<=1 & 1<=p167] & AG [E [[[p85<=1 & 1<=p85] & [p188<=1 & 1<=p188]] U [[p49<=1 & 1<=p49] & [p134<=1 & 1<=p134]]]]]]]
normalized: E [true U [[~ [E [true U ~ [E [[[p188<=1 & 1<=p188] & [p85<=1 & 1<=p85]] U [[p134<=1 & 1<=p134] & [p49<=1 & 1<=p49]]]]]] & [p167<=1 & 1<=p167]] & [p107<=1 & 1<=p107]]]

abstracting: (1<=p107)
states: 4,232,632,320,000 (12)
abstracting: (p107<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p167)
states: 42,326,323,200,000 (13)
abstracting: (p167<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p49)
states: 4,702,924,800,000 (12)
abstracting: (p49<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p134)
states: 42,326,323,200,000 (13)
abstracting: (p134<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p85)
states: 4,232,632,320,000 (12)
abstracting: (p85<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p188)
states: 42,326,323,200,000 (13)
abstracting: (p188<=1)
states: 42,326,323,200,001 (13)
-> the formula is FALSE

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

MC time: 0m 0.095sec

checking: AX [[AF [EX [[[[p71<=0 & 0<=p71] | [p181<=0 & 0<=p181]] | [[p123<=0 & 0<=p123] | [p153<=0 & 0<=p153]]]]] | [[p33<=1 & 1<=p33] & [p173<=1 & 1<=p173]]]]
normalized: ~ [EX [~ [[[[p173<=1 & 1<=p173] & [p33<=1 & 1<=p33]] | ~ [EG [~ [EX [[[[p153<=0 & 0<=p153] | [p123<=0 & 0<=p123]] | [[p181<=0 & 0<=p181] | [p71<=0 & 0<=p71]]]]]]]]]]]

abstracting: (0<=p71)
states: 42,326,323,200,001 (13)
abstracting: (p71<=0)
states: 37,623,398,400,001 (13)
abstracting: (0<=p181)
states: 42,326,323,200,001 (13)
abstracting: (p181<=0)
states: 1
abstracting: (0<=p123)
states: 42,326,323,200,001 (13)
abstracting: (p123<=0)
states: 37,035,532,800,001 (13)
abstracting: (0<=p153)
states: 42,326,323,200,001 (13)
abstracting: (p153<=0)
states: 1
..
EG iterations: 1
abstracting: (1<=p33)
states: 4,232,632,320,000 (12)
abstracting: (p33<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p173)
states: 42,326,323,200,000 (13)
abstracting: (p173<=1)
states: 42,326,323,200,001 (13)
.-> the formula is TRUE

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

MC time: 0m 0.061sec

checking: EX [AG [AF [[[[p52<=1 & 1<=p52] | [p29<=0 & 0<=p29]] | [[p157<=0 & 0<=p157] | ~ [A [[[p106<=1 & 1<=p106] & [p193<=1 & 1<=p193]] U [[p62<=1 & 1<=p62] & [p136<=1 & 1<=p136]]]]]]]]]
normalized: EX [~ [E [true U EG [~ [[[~ [[~ [EG [~ [[[p136<=1 & 1<=p136] & [p62<=1 & 1<=p62]]]]] & ~ [E [~ [[[p136<=1 & 1<=p136] & [p62<=1 & 1<=p62]]] U [~ [[[p193<=1 & 1<=p193] & [p106<=1 & 1<=p106]]] & ~ [[[p136<=1 & 1<=p136] & [p62<=1 & 1<=p62]]]]]]]] | [p157<=0 & 0<=p157]] | [[p29<=0 & 0<=p29] | [p52<=1 & 1<=p52]]]]]]]]

abstracting: (1<=p52)
states: 4,702,924,800,000 (12)
abstracting: (p52<=1)
states: 42,326,323,200,001 (13)
abstracting: (0<=p29)
states: 42,326,323,200,001 (13)
abstracting: (p29<=0)
states: 38,093,690,880,001 (13)
abstracting: (0<=p157)
states: 42,326,323,200,001 (13)
abstracting: (p157<=0)
states: 1
abstracting: (1<=p62)
states: 4,702,924,800,000 (12)
abstracting: (p62<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p136)
states: 42,326,323,200,000 (13)
abstracting: (p136<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p106)
states: 4,232,632,320,000 (12)
abstracting: (p106<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p193)
states: 42,326,323,200,000 (13)
abstracting: (p193<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p62)
states: 4,702,924,800,000 (12)
abstracting: (p62<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p136)
states: 42,326,323,200,000 (13)
abstracting: (p136<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p62)
states: 4,702,924,800,000 (12)
abstracting: (p62<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p136)
states: 42,326,323,200,000 (13)
abstracting: (p136<=1)
states: 42,326,323,200,001 (13)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.204sec

checking: EF [[EG [EF [[[[p96<=1 & 1<=p96] & [p145<=1 & 1<=p145]] | [[[p120<=1 & 1<=p120] & [p198<=1 & 1<=p198]] | [p43<=1 & 1<=p43]]]]] | [[p40<=1 & 1<=p40] & [p164<=1 & 1<=p164]]]]
normalized: E [true U [[[p164<=1 & 1<=p164] & [p40<=1 & 1<=p40]] | EG [E [true U [[[p43<=1 & 1<=p43] | [[p198<=1 & 1<=p198] & [p120<=1 & 1<=p120]]] | [[p145<=1 & 1<=p145] & [p96<=1 & 1<=p96]]]]]]]

abstracting: (1<=p96)
states: 4,702,924,800,000 (12)
abstracting: (p96<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p145)
states: 42,326,323,200,000 (13)
abstracting: (p145<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p120)
states: 5,290,790,400,000 (12)
abstracting: (p120<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p198)
states: 42,326,323,200,000 (13)
abstracting: (p198<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p43)
states: 4,232,632,320,000 (12)
abstracting: (p43<=1)
states: 42,326,323,200,001 (13)

EG iterations: 0
abstracting: (1<=p40)
states: 4,232,632,320,000 (12)
abstracting: (p40<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p164)
states: 42,326,323,200,000 (13)
abstracting: (p164<=1)
states: 42,326,323,200,001 (13)
-> the formula is TRUE

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

MC time: 0m 0.047sec

checking: EF [AG [[EF [[[[p11<=0 & 0<=p11] | [p147<=0 & 0<=p147]] & [[p76<=0 & 0<=p76] | [p179<=0 & 0<=p179]]]] & [[p27<=0 & 0<=p27] | [EG [[[p123<=1 & 1<=p123] & [p164<=1 & 1<=p164]]] | [[p58<=1 & 1<=p58] & [p169<=1 & 1<=p169]]]]]]]
normalized: E [true U ~ [E [true U ~ [[[[[[p169<=1 & 1<=p169] & [p58<=1 & 1<=p58]] | EG [[[p164<=1 & 1<=p164] & [p123<=1 & 1<=p123]]]] | [p27<=0 & 0<=p27]] & E [true U [[[p179<=0 & 0<=p179] | [p76<=0 & 0<=p76]] & [[p147<=0 & 0<=p147] | [p11<=0 & 0<=p11]]]]]]]]]

abstracting: (0<=p11)
states: 42,326,323,200,001 (13)
abstracting: (p11<=0)
states: 35,271,936,000,001 (13)
abstracting: (0<=p147)
states: 42,326,323,200,001 (13)
abstracting: (p147<=0)
states: 1
abstracting: (0<=p76)
states: 42,326,323,200,001 (13)
abstracting: (p76<=0)
states: 37,623,398,400,001 (13)
abstracting: (0<=p179)
states: 42,326,323,200,001 (13)
abstracting: (p179<=0)
states: 1
abstracting: (0<=p27)
states: 42,326,323,200,001 (13)
abstracting: (p27<=0)
states: 38,093,690,880,001 (13)
abstracting: (1<=p123)
states: 5,290,790,400,000 (12)
abstracting: (p123<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p164)
states: 42,326,323,200,000 (13)
abstracting: (p164<=1)
states: 42,326,323,200,001 (13)
.
EG iterations: 1
abstracting: (1<=p58)
states: 5,290,790,400,000 (12)
abstracting: (p58<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p169)
states: 42,326,323,200,000 (13)
abstracting: (p169<=1)
states: 42,326,323,200,001 (13)
-> the formula is FALSE

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

MC time: 0m 0.128sec

checking: EF [AX [[AG [[[[p59<=0 & 0<=p59] | [p171<=0 & 0<=p171]] & [p20<=0 & 0<=p20]]] | AX [[E [[[p92<=1 & 1<=p92] & [p189<=1 & 1<=p189]] U [[p73<=1 & 1<=p73] & [p180<=1 & 1<=p180]]] & [[p115<=0 & 0<=p115] | [p159<=0 & 0<=p159]]]]]]]
normalized: E [true U ~ [EX [~ [[~ [EX [~ [[[[p159<=0 & 0<=p159] | [p115<=0 & 0<=p115]] & E [[[p189<=1 & 1<=p189] & [p92<=1 & 1<=p92]] U [[p180<=1 & 1<=p180] & [p73<=1 & 1<=p73]]]]]]] | ~ [E [true U ~ [[[p20<=0 & 0<=p20] & [[p171<=0 & 0<=p171] | [p59<=0 & 0<=p59]]]]]]]]]]]

abstracting: (0<=p59)
states: 42,326,323,200,001 (13)
abstracting: (p59<=0)
states: 37,035,532,800,001 (13)
abstracting: (0<=p171)
states: 42,326,323,200,001 (13)
abstracting: (p171<=0)
states: 1
abstracting: (0<=p20)
states: 42,326,323,200,001 (13)
abstracting: (p20<=0)
states: 35,271,936,000,001 (13)
abstracting: (1<=p73)
states: 4,702,924,800,000 (12)
abstracting: (p73<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p180)
states: 42,326,323,200,000 (13)
abstracting: (p180<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p92)
states: 4,702,924,800,000 (12)
abstracting: (p92<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p189)
states: 42,326,323,200,000 (13)
abstracting: (p189<=1)
states: 42,326,323,200,001 (13)
abstracting: (0<=p115)
states: 42,326,323,200,001 (13)
abstracting: (p115<=0)
states: 37,035,532,800,001 (13)
abstracting: (0<=p159)
states: 42,326,323,200,001 (13)
abstracting: (p159<=0)
states: 1
..-> the formula is FALSE

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

MC time: 0m 0.230sec

checking: EX [[EF [[[p24<=1 & 1<=p24] & [p149<=1 & 1<=p149]]] | AX [[[EF [[p124<=1 & 1<=p124]] & [[[p102<=0 & 0<=p102] | [p194<=0 & 0<=p194]] | [[p80<=0 & 0<=p80] | [p140<=0 & 0<=p140]]]] & [[[p49<=0 & 0<=p49] | [p166<=0 & 0<=p166]] & [[p107<=0 & 0<=p107] | [p148<=0 & 0<=p148]]]]]]]
normalized: EX [[~ [EX [~ [[[[[p148<=0 & 0<=p148] | [p107<=0 & 0<=p107]] & [[p166<=0 & 0<=p166] | [p49<=0 & 0<=p49]]] & [[[[p140<=0 & 0<=p140] | [p80<=0 & 0<=p80]] | [[p194<=0 & 0<=p194] | [p102<=0 & 0<=p102]]] & E [true U [p124<=1 & 1<=p124]]]]]]] | E [true U [[p149<=1 & 1<=p149] & [p24<=1 & 1<=p24]]]]]

abstracting: (1<=p24)
states: 7,054,387,200,000 (12)
abstracting: (p24<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p149)
states: 42,326,323,200,000 (13)
abstracting: (p149<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p124)
states: 5,290,790,400,000 (12)
abstracting: (p124<=1)
states: 42,326,323,200,001 (13)
abstracting: (0<=p102)
states: 42,326,323,200,001 (13)
abstracting: (p102<=0)
states: 38,093,690,880,001 (13)
abstracting: (0<=p194)
states: 42,326,323,200,001 (13)
abstracting: (p194<=0)
states: 1
abstracting: (0<=p80)
states: 42,326,323,200,001 (13)
abstracting: (p80<=0)
states: 38,093,690,880,001 (13)
abstracting: (0<=p140)
states: 42,326,323,200,001 (13)
abstracting: (p140<=0)
states: 1
abstracting: (0<=p49)
states: 42,326,323,200,001 (13)
abstracting: (p49<=0)
states: 37,623,398,400,001 (13)
abstracting: (0<=p166)
states: 42,326,323,200,001 (13)
abstracting: (p166<=0)
states: 1
abstracting: (0<=p107)
states: 42,326,323,200,001 (13)
abstracting: (p107<=0)
states: 38,093,690,880,001 (13)
abstracting: (0<=p148)
states: 42,326,323,200,001 (13)
abstracting: (p148<=0)
states: 1
..-> the formula is TRUE

FORMULA DLCround-PT-10a-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.110sec

checking: [EF [~ [A [~ [[EX [[[p13<=1 & 1<=p13] & [p148<=1 & 1<=p148]]] & A [[[p44<=1 & 1<=p44] & [p161<=1 & 1<=p161]] U [[p123<=1 & 1<=p123] & [p185<=1 & 1<=p185]]]]] U AG [[[p15<=1 & 1<=p15] & [p141<=1 & 1<=p141]]]]]] | AX [[[[p29<=0 & 0<=p29] | [p159<=0 & 0<=p159]] & AF [[[[p78<=1 & 1<=p78] & [p138<=1 & 1<=p138]] | [[p30<=1 & 1<=p30] & [p156<=1 & 1<=p156]]]]]]]
normalized: [~ [EX [~ [[~ [EG [~ [[[[p156<=1 & 1<=p156] & [p30<=1 & 1<=p30]] | [[p138<=1 & 1<=p138] & [p78<=1 & 1<=p78]]]]]] & [[p159<=0 & 0<=p159] | [p29<=0 & 0<=p29]]]]]] | E [true U ~ [[~ [EG [E [true U ~ [[[p141<=1 & 1<=p141] & [p15<=1 & 1<=p15]]]]]] & ~ [E [E [true U ~ [[[p141<=1 & 1<=p141] & [p15<=1 & 1<=p15]]]] U [[[~ [EG [~ [[[p185<=1 & 1<=p185] & [p123<=1 & 1<=p123]]]]] & ~ [E [~ [[[p185<=1 & 1<=p185] & [p123<=1 & 1<=p123]]] U [~ [[[p161<=1 & 1<=p161] & [p44<=1 & 1<=p44]]] & ~ [[[p185<=1 & 1<=p185] & [p123<=1 & 1<=p123]]]]]]] & EX [[[p148<=1 & 1<=p148] & [p13<=1 & 1<=p13]]]] & E [true U ~ [[[p141<=1 & 1<=p141] & [p15<=1 & 1<=p15]]]]]]]]]]]

abstracting: (1<=p15)
states: 6,046,617,600,000 (12)
abstracting: (p15<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p141)
states: 42,326,323,200,000 (13)
abstracting: (p141<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p13)
states: 6,046,617,600,000 (12)
abstracting: (p13<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p148)
states: 42,326,323,200,000 (13)
abstracting: (p148<=1)
states: 42,326,323,200,001 (13)
.abstracting: (1<=p123)
states: 5,290,790,400,000 (12)
abstracting: (p123<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p185)
states: 42,326,323,200,000 (13)
abstracting: (p185<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p44)
states: 4,232,632,320,000 (12)
abstracting: (p44<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p161)
states: 42,326,323,200,000 (13)
abstracting: (p161<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p123)
states: 5,290,790,400,000 (12)
abstracting: (p123<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p185)
states: 42,326,323,200,000 (13)
abstracting: (p185<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p123)
states: 5,290,790,400,000 (12)
abstracting: (p123<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p185)
states: 42,326,323,200,000 (13)
abstracting: (p185<=1)
states: 42,326,323,200,001 (13)
.
EG iterations: 1
abstracting: (1<=p15)
states: 6,046,617,600,000 (12)
abstracting: (p15<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p141)
states: 42,326,323,200,000 (13)
abstracting: (p141<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p15)
states: 6,046,617,600,000 (12)
abstracting: (p15<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p141)
states: 42,326,323,200,000 (13)
abstracting: (p141<=1)
states: 42,326,323,200,001 (13)

EG iterations: 0
abstracting: (0<=p29)
states: 42,326,323,200,001 (13)
abstracting: (p29<=0)
states: 38,093,690,880,001 (13)
abstracting: (0<=p159)
states: 42,326,323,200,001 (13)
abstracting: (p159<=0)
states: 1
abstracting: (1<=p78)
states: 4,702,924,800,000 (12)
abstracting: (p78<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p138)
states: 42,326,323,200,000 (13)
abstracting: (p138<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p30)
states: 4,232,632,320,000 (12)
abstracting: (p30<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p156)
states: 42,326,323,200,000 (13)
abstracting: (p156<=1)
states: 42,326,323,200,001 (13)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA DLCround-PT-10a-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.165sec

checking: [AX [EX [[[p39<=0 & 0<=p39] | [p130<=0 & 0<=p130]]]] & [AX [AX [[[[[p11<=0 & 0<=p11] | [p132<=0 & 0<=p132]] & [[p88<=0 & 0<=p88] | [p187<=0 & 0<=p187]]] & [[[p44<=0 & 0<=p44] | [p130<=0 & 0<=p130]] & [[p99<=0 & 0<=p99] | [p146<=0 & 0<=p146]]]]]] | [EX [[EF [[[p42<=0 & 0<=p42] | [p162<=0 & 0<=p162]]] | AX [[[p20<=0 & 0<=p20] | [p139<=0 & 0<=p139]]]]] & [EX [[[[p80<=0 & 0<=p80] | [[p15<=0 & 0<=p15] | [p133<=0 & 0<=p133]]] & ~ [A [[[p29<=1 & 1<=p29] & [p158<=1 & 1<=p158]] U [[p96<=1 & 1<=p96] & [p191<=1 & 1<=p191]]]]]] & AF [EG [[[p95<=0 & 0<=p95] | [p191<=0 & 0<=p191]]]]]]]]
normalized: [[[[~ [EG [~ [EG [[[p191<=0 & 0<=p191] | [p95<=0 & 0<=p95]]]]]] & EX [[~ [[~ [EG [~ [[[p191<=1 & 1<=p191] & [p96<=1 & 1<=p96]]]]] & ~ [E [~ [[[p191<=1 & 1<=p191] & [p96<=1 & 1<=p96]]] U [~ [[[p158<=1 & 1<=p158] & [p29<=1 & 1<=p29]]] & ~ [[[p191<=1 & 1<=p191] & [p96<=1 & 1<=p96]]]]]]]] & [[[p133<=0 & 0<=p133] | [p15<=0 & 0<=p15]] | [p80<=0 & 0<=p80]]]]] & EX [[~ [EX [~ [[[p139<=0 & 0<=p139] | [p20<=0 & 0<=p20]]]]] | E [true U [[p162<=0 & 0<=p162] | [p42<=0 & 0<=p42]]]]]] | ~ [EX [EX [~ [[[[[p146<=0 & 0<=p146] | [p99<=0 & 0<=p99]] & [[p130<=0 & 0<=p130] | [p44<=0 & 0<=p44]]] & [[[p187<=0 & 0<=p187] | [p88<=0 & 0<=p88]] & [[p132<=0 & 0<=p132] | [p11<=0 & 0<=p11]]]]]]]]] & ~ [EX [~ [EX [[[p130<=0 & 0<=p130] | [p39<=0 & 0<=p39]]]]]]]

abstracting: (0<=p39)
states: 42,326,323,200,001 (13)
abstracting: (p39<=0)
states: 38,093,690,880,001 (13)
abstracting: (0<=p130)
states: 42,326,323,200,001 (13)
abstracting: (p130<=0)
states: 1
..abstracting: (0<=p11)
states: 42,326,323,200,001 (13)
abstracting: (p11<=0)
states: 35,271,936,000,001 (13)
abstracting: (0<=p132)
states: 42,326,323,200,001 (13)
abstracting: (p132<=0)
states: 1
abstracting: (0<=p88)
states: 42,326,323,200,001 (13)
abstracting: (p88<=0)
states: 38,093,690,880,001 (13)
abstracting: (0<=p187)
states: 42,326,323,200,001 (13)
abstracting: (p187<=0)
states: 1
abstracting: (0<=p44)
states: 42,326,323,200,001 (13)
abstracting: (p44<=0)
states: 38,093,690,880,001 (13)
abstracting: (0<=p130)
states: 42,326,323,200,001 (13)
abstracting: (p130<=0)
states: 1
abstracting: (0<=p99)
states: 42,326,323,200,001 (13)
abstracting: (p99<=0)
states: 38,093,690,880,001 (13)
abstracting: (0<=p146)
states: 42,326,323,200,001 (13)
abstracting: (p146<=0)
states: 1
..abstracting: (0<=p42)
states: 42,326,323,200,001 (13)
abstracting: (p42<=0)
states: 38,093,690,880,001 (13)
abstracting: (0<=p162)
states: 42,326,323,200,001 (13)
abstracting: (p162<=0)
states: 1
abstracting: (0<=p20)
states: 42,326,323,200,001 (13)
abstracting: (p20<=0)
states: 35,271,936,000,001 (13)
abstracting: (0<=p139)
states: 42,326,323,200,001 (13)
abstracting: (p139<=0)
states: 1
..abstracting: (0<=p80)
states: 42,326,323,200,001 (13)
abstracting: (p80<=0)
states: 38,093,690,880,001 (13)
abstracting: (0<=p15)
states: 42,326,323,200,001 (13)
abstracting: (p15<=0)
states: 36,279,705,600,001 (13)
abstracting: (0<=p133)
states: 42,326,323,200,001 (13)
abstracting: (p133<=0)
states: 1
abstracting: (1<=p96)
states: 4,702,924,800,000 (12)
abstracting: (p96<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p191)
states: 42,326,323,200,000 (13)
abstracting: (p191<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p29)
states: 4,232,632,320,000 (12)
abstracting: (p29<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p158)
states: 42,326,323,200,000 (13)
abstracting: (p158<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p96)
states: 4,702,924,800,000 (12)
abstracting: (p96<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p191)
states: 42,326,323,200,000 (13)
abstracting: (p191<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p96)
states: 4,702,924,800,000 (12)
abstracting: (p96<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p191)
states: 42,326,323,200,000 (13)
abstracting: (p191<=1)
states: 42,326,323,200,001 (13)
.
EG iterations: 1
.abstracting: (0<=p95)
states: 42,326,323,200,001 (13)
abstracting: (p95<=0)
states: 37,623,398,400,001 (13)
abstracting: (0<=p191)
states: 42,326,323,200,001 (13)
abstracting: (p191<=0)
states: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.089sec

checking: [AF [E [[[p95<=1 & 1<=p95] & [p190<=1 & 1<=p190]] U [[[A [[[p107<=1 & 1<=p107] & [p195<=1 & 1<=p195]] U [[p67<=1 & 1<=p67] & [p176<=1 & 1<=p176]]] | [AF [[[p24<=1 & 1<=p24] & [p155<=1 & 1<=p155]]] | [[[p87<=1 & 1<=p87] & [p187<=1 & 1<=p187]] & [[p66<=1 & 1<=p66] & [p178<=1 & 1<=p178]]]]] & [p114<=1 & 1<=p114]] & [[p196<=1 & 1<=p196] & [A [[[p123<=1 & 1<=p123] & [p191<=1 & 1<=p191]] U [[p62<=1 & 1<=p62] & [p137<=1 & 1<=p137]]] | A [[[p42<=1 & 1<=p42] & [p162<=1 & 1<=p162]] U [[p6<=1 & 1<=p6] & [p132<=1 & 1<=p132]]]]]]]] | [~ [E [AF [[[p64<=1 & 1<=p64] & [p177<=1 & 1<=p177]]] U EX [[[p33<=1 & 1<=p33] & [p126<=1 & 1<=p126]]]]] & ~ [A [[[p69<=1 & 1<=p69] & [p136<=1 & 1<=p136]] U [[[p37<=1 & 1<=p37] & [p160<=1 & 1<=p160]] | [[[p5<=1 & 1<=p5] & [p150<=1 & 1<=p150]] & [[p107<=1 & 1<=p107] & [p199<=1 & 1<=p199]]]]]]]]
normalized: [[~ [[~ [EG [~ [[[[[p199<=1 & 1<=p199] & [p107<=1 & 1<=p107]] & [[p150<=1 & 1<=p150] & [p5<=1 & 1<=p5]]] | [[p160<=1 & 1<=p160] & [p37<=1 & 1<=p37]]]]]] & ~ [E [~ [[[[[p199<=1 & 1<=p199] & [p107<=1 & 1<=p107]] & [[p150<=1 & 1<=p150] & [p5<=1 & 1<=p5]]] | [[p160<=1 & 1<=p160] & [p37<=1 & 1<=p37]]]] U [~ [[[p136<=1 & 1<=p136] & [p69<=1 & 1<=p69]]] & ~ [[[[[p199<=1 & 1<=p199] & [p107<=1 & 1<=p107]] & [[p150<=1 & 1<=p150] & [p5<=1 & 1<=p5]]] | [[p160<=1 & 1<=p160] & [p37<=1 & 1<=p37]]]]]]]]] & ~ [E [~ [EG [~ [[[p177<=1 & 1<=p177] & [p64<=1 & 1<=p64]]]]] U EX [[[p126<=1 & 1<=p126] & [p33<=1 & 1<=p33]]]]]] | ~ [EG [~ [E [[[p190<=1 & 1<=p190] & [p95<=1 & 1<=p95]] U [[[[~ [EG [~ [[[p132<=1 & 1<=p132] & [p6<=1 & 1<=p6]]]]] & ~ [E [~ [[[p132<=1 & 1<=p132] & [p6<=1 & 1<=p6]]] U [~ [[[p162<=1 & 1<=p162] & [p42<=1 & 1<=p42]]] & ~ [[[p132<=1 & 1<=p132] & [p6<=1 & 1<=p6]]]]]]] | [~ [EG [~ [[[p137<=1 & 1<=p137] & [p62<=1 & 1<=p62]]]]] & ~ [E [~ [[[p137<=1 & 1<=p137] & [p62<=1 & 1<=p62]]] U [~ [[[p191<=1 & 1<=p191] & [p123<=1 & 1<=p123]]] & ~ [[[p137<=1 & 1<=p137] & [p62<=1 & 1<=p62]]]]]]]] & [p196<=1 & 1<=p196]] & [[p114<=1 & 1<=p114] & [[[[[p178<=1 & 1<=p178] & [p66<=1 & 1<=p66]] & [[p187<=1 & 1<=p187] & [p87<=1 & 1<=p87]]] | ~ [EG [~ [[[p155<=1 & 1<=p155] & [p24<=1 & 1<=p24]]]]]] | [~ [EG [~ [[[p176<=1 & 1<=p176] & [p67<=1 & 1<=p67]]]]] & ~ [E [~ [[[p176<=1 & 1<=p176] & [p67<=1 & 1<=p67]]] U [~ [[[p195<=1 & 1<=p195] & [p107<=1 & 1<=p107]]] & ~ [[[p176<=1 & 1<=p176] & [p67<=1 & 1<=p67]]]]]]]]]]]]]]]

abstracting: (1<=p67)
states: 4,702,924,800,000 (12)
abstracting: (p67<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p176)
states: 42,326,323,200,000 (13)
abstracting: (p176<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p107)
states: 4,232,632,320,000 (12)
abstracting: (p107<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p195)
states: 42,326,323,200,000 (13)
abstracting: (p195<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p67)
states: 4,702,924,800,000 (12)
abstracting: (p67<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p176)
states: 42,326,323,200,000 (13)
abstracting: (p176<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p67)
states: 4,702,924,800,000 (12)
abstracting: (p67<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p176)
states: 42,326,323,200,000 (13)
abstracting: (p176<=1)
states: 42,326,323,200,001 (13)
.
EG iterations: 1
abstracting: (1<=p24)
states: 7,054,387,200,000 (12)
abstracting: (p24<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p155)
states: 42,326,323,200,000 (13)
abstracting: (p155<=1)
states: 42,326,323,200,001 (13)
..
EG iterations: 2
abstracting: (1<=p87)
states: 4,232,632,320,000 (12)
abstracting: (p87<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p187)
states: 42,326,323,200,000 (13)
abstracting: (p187<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p66)
states: 4,702,924,800,000 (12)
abstracting: (p66<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p178)
states: 42,326,323,200,000 (13)
abstracting: (p178<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p114)
states: 5,290,790,400,000 (12)
abstracting: (p114<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p196)
states: 42,326,323,200,000 (13)
abstracting: (p196<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p62)
states: 4,702,924,800,000 (12)
abstracting: (p62<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p137)
states: 42,326,323,200,000 (13)
abstracting: (p137<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p123)
states: 5,290,790,400,000 (12)
abstracting: (p123<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p191)
states: 42,326,323,200,000 (13)
abstracting: (p191<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p62)
states: 4,702,924,800,000 (12)
abstracting: (p62<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p137)
states: 42,326,323,200,000 (13)
abstracting: (p137<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p62)
states: 4,702,924,800,000 (12)
abstracting: (p62<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p137)
states: 42,326,323,200,000 (13)
abstracting: (p137<=1)
states: 42,326,323,200,001 (13)
.
EG iterations: 1
abstracting: (1<=p6)
states: 7,054,387,200,000 (12)
abstracting: (p6<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p132)
states: 42,326,323,200,000 (13)
abstracting: (p132<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p42)
states: 4,232,632,320,000 (12)
abstracting: (p42<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p162)
states: 42,326,323,200,000 (13)
abstracting: (p162<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p6)
states: 7,054,387,200,000 (12)
abstracting: (p6<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p132)
states: 42,326,323,200,000 (13)
abstracting: (p132<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p6)
states: 7,054,387,200,000 (12)
abstracting: (p6<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p132)
states: 42,326,323,200,000 (13)
abstracting: (p132<=1)
states: 42,326,323,200,001 (13)
.
EG iterations: 1
abstracting: (1<=p95)
states: 4,702,924,800,000 (12)
abstracting: (p95<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p190)
states: 42,326,323,200,000 (13)
abstracting: (p190<=1)
states: 42,326,323,200,001 (13)
.
EG iterations: 1
abstracting: (1<=p33)
states: 4,232,632,320,000 (12)
abstracting: (p33<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p126)
states: 42,326,323,200,000 (13)
abstracting: (p126<=1)
states: 42,326,323,200,001 (13)
.abstracting: (1<=p64)
states: 4,702,924,800,000 (12)
abstracting: (p64<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p177)
states: 42,326,323,200,000 (13)
abstracting: (p177<=1)
states: 42,326,323,200,001 (13)
.
EG iterations: 1
abstracting: (1<=p37)
states: 4,232,632,320,000 (12)
abstracting: (p37<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p160)
states: 42,326,323,200,000 (13)
abstracting: (p160<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p5)
states: 8,465,264,640,000 (12)
abstracting: (p5<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p150)
states: 42,326,323,200,000 (13)
abstracting: (p150<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p107)
states: 4,232,632,320,000 (12)
abstracting: (p107<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p199)
states: 42,326,323,200,000 (13)
abstracting: (p199<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p69)
states: 4,702,924,800,000 (12)
abstracting: (p69<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p136)
states: 42,326,323,200,000 (13)
abstracting: (p136<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p37)
states: 4,232,632,320,000 (12)
abstracting: (p37<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p160)
states: 42,326,323,200,000 (13)
abstracting: (p160<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p5)
states: 8,465,264,640,000 (12)
abstracting: (p5<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p150)
states: 42,326,323,200,000 (13)
abstracting: (p150<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p107)
states: 4,232,632,320,000 (12)
abstracting: (p107<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p199)
states: 42,326,323,200,000 (13)
abstracting: (p199<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p37)
states: 4,232,632,320,000 (12)
abstracting: (p37<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p160)
states: 42,326,323,200,000 (13)
abstracting: (p160<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p5)
states: 8,465,264,640,000 (12)
abstracting: (p5<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p150)
states: 42,326,323,200,000 (13)
abstracting: (p150<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p107)
states: 4,232,632,320,000 (12)
abstracting: (p107<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p199)
states: 42,326,323,200,000 (13)
abstracting: (p199<=1)
states: 42,326,323,200,001 (13)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.794sec

checking: AG [[[[p43<=0 & 0<=p43] | [[p186<=0 & 0<=p186] | A [[[[p38<=1 & 1<=p38] & [p129<=1 & 1<=p129]] | [[[p33<=1 & 1<=p33] & [p168<=1 & 1<=p168]] | [[[p108<=1 & 1<=p108] & [p149<=1 & 1<=p149]] & [[p73<=1 & 1<=p73] & [p184<=1 & 1<=p184]]]]] U [AF [[[p78<=1 & 1<=p78] & [p175<=1 & 1<=p175]]] | [[[p96<=1 & 1<=p96] & [p144<=1 & 1<=p144]] | [[p51<=1 & 1<=p51] & [p131<=1 & 1<=p131]]]]]]] | [[[E [AX [[[p67<=1 & 1<=p67] & [p176<=1 & 1<=p176]]] U ~ [[[p122<=1 & 1<=p122] & [p155<=1 & 1<=p155]]]] & AX [EX [[p39<=1 & 1<=p39]]]] & [EX [AG [[p83<=0 & 0<=p83]]] & [EG [[[[p44<=1 & 1<=p44] & [p129<=1 & 1<=p129]] | [[p20<=1 & 1<=p20] & [p142<=1 & 1<=p142]]]] | [~ [A [[[p11<=1 & 1<=p11] & [p151<=1 & 1<=p151]] U [[p31<=1 & 1<=p31] & [p127<=1 & 1<=p127]]]] | [[p123<=1 & 1<=p123] & [p154<=1 & 1<=p154]]]]]] | [[EF [[[p76<=1 & 1<=p76] & [p183<=1 & 1<=p183]]] & [A [[[p115<=1 & 1<=p115] & [p159<=1 & 1<=p159]] U [[p5<=1 & 1<=p5] & [p125<=1 & 1<=p125]]] | AX [[[p77<=1 & 1<=p77] & [p180<=1 & 1<=p180]]]]] | [[[p123<=1 & 1<=p123] & [p172<=1 & 1<=p172]] & [~ [E [[[p44<=1 & 1<=p44] & [p163<=1 & 1<=p163]] U [[p58<=1 & 1<=p58] & [p170<=1 & 1<=p170]]]] & [[[p60<=0 & 0<=p60] | [p135<=0 & 0<=p135]] & [[p24<=0 & 0<=p24] | [p143<=0 & 0<=p143]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[p143<=0 & 0<=p143] | [p24<=0 & 0<=p24]] & [[p135<=0 & 0<=p135] | [p60<=0 & 0<=p60]]] & ~ [E [[[p163<=1 & 1<=p163] & [p44<=1 & 1<=p44]] U [[p170<=1 & 1<=p170] & [p58<=1 & 1<=p58]]]]] & [[p172<=1 & 1<=p172] & [p123<=1 & 1<=p123]]] | [[~ [EX [~ [[[p180<=1 & 1<=p180] & [p77<=1 & 1<=p77]]]]] | [~ [EG [~ [[[p125<=1 & 1<=p125] & [p5<=1 & 1<=p5]]]]] & ~ [E [~ [[[p125<=1 & 1<=p125] & [p5<=1 & 1<=p5]]] U [~ [[[p159<=1 & 1<=p159] & [p115<=1 & 1<=p115]]] & ~ [[[p125<=1 & 1<=p125] & [p5<=1 & 1<=p5]]]]]]]] & E [true U [[p183<=1 & 1<=p183] & [p76<=1 & 1<=p76]]]]] | [[[[[[p154<=1 & 1<=p154] & [p123<=1 & 1<=p123]] | ~ [[~ [EG [~ [[[p127<=1 & 1<=p127] & [p31<=1 & 1<=p31]]]]] & ~ [E [~ [[[p127<=1 & 1<=p127] & [p31<=1 & 1<=p31]]] U [~ [[[p151<=1 & 1<=p151] & [p11<=1 & 1<=p11]]] & ~ [[[p127<=1 & 1<=p127] & [p31<=1 & 1<=p31]]]]]]]]] | EG [[[[p142<=1 & 1<=p142] & [p20<=1 & 1<=p20]] | [[p129<=1 & 1<=p129] & [p44<=1 & 1<=p44]]]]] & EX [~ [E [true U ~ [[p83<=0 & 0<=p83]]]]]] & [~ [EX [~ [EX [[p39<=1 & 1<=p39]]]]] & E [~ [EX [~ [[[p176<=1 & 1<=p176] & [p67<=1 & 1<=p67]]]]] U ~ [[[p155<=1 & 1<=p155] & [p122<=1 & 1<=p122]]]]]]] | [[[~ [EG [~ [[[[[p131<=1 & 1<=p131] & [p51<=1 & 1<=p51]] | [[p144<=1 & 1<=p144] & [p96<=1 & 1<=p96]]] | ~ [EG [~ [[[p175<=1 & 1<=p175] & [p78<=1 & 1<=p78]]]]]]]]] & ~ [E [~ [[[[[p131<=1 & 1<=p131] & [p51<=1 & 1<=p51]] | [[p144<=1 & 1<=p144] & [p96<=1 & 1<=p96]]] | ~ [EG [~ [[[p175<=1 & 1<=p175] & [p78<=1 & 1<=p78]]]]]]] U [~ [[[[[[p184<=1 & 1<=p184] & [p73<=1 & 1<=p73]] & [[p149<=1 & 1<=p149] & [p108<=1 & 1<=p108]]] | [[p168<=1 & 1<=p168] & [p33<=1 & 1<=p33]]] | [[p129<=1 & 1<=p129] & [p38<=1 & 1<=p38]]]] & ~ [[[[[p131<=1 & 1<=p131] & [p51<=1 & 1<=p51]] | [[p144<=1 & 1<=p144] & [p96<=1 & 1<=p96]]] | ~ [EG [~ [[[p175<=1 & 1<=p175] & [p78<=1 & 1<=p78]]]]]]]]]]] | [p186<=0 & 0<=p186]] | [p43<=0 & 0<=p43]]]]]]

abstracting: (0<=p43)
states: 42,326,323,200,001 (13)
abstracting: (p43<=0)
states: 38,093,690,880,001 (13)
abstracting: (0<=p186)
states: 42,326,323,200,001 (13)
abstracting: (p186<=0)
states: 1
abstracting: (1<=p78)
states: 4,702,924,800,000 (12)
abstracting: (p78<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p175)
states: 42,326,323,200,000 (13)
abstracting: (p175<=1)
states: 42,326,323,200,001 (13)
.
EG iterations: 1
abstracting: (1<=p96)
states: 4,702,924,800,000 (12)
abstracting: (p96<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p144)
states: 42,326,323,200,000 (13)
abstracting: (p144<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p51)
states: 4,702,924,800,000 (12)
abstracting: (p51<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p131)
states: 42,326,323,200,000 (13)
abstracting: (p131<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p38)
states: 4,232,632,320,000 (12)
abstracting: (p38<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p129)
states: 42,326,323,200,000 (13)
abstracting: (p129<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p33)
states: 4,232,632,320,000 (12)
abstracting: (p33<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p168)
states: 42,326,323,200,000 (13)
abstracting: (p168<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p108)
states: 4,232,632,320,000 (12)
abstracting: (p108<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p149)
states: 42,326,323,200,000 (13)
abstracting: (p149<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p73)
states: 4,702,924,800,000 (12)
abstracting: (p73<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p184)
states: 42,326,323,200,000 (13)
abstracting: (p184<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p78)
states: 4,702,924,800,000 (12)
abstracting: (p78<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p175)
states: 42,326,323,200,000 (13)
abstracting: (p175<=1)
states: 42,326,323,200,001 (13)
.
EG iterations: 1
abstracting: (1<=p96)
states: 4,702,924,800,000 (12)
abstracting: (p96<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p144)
states: 42,326,323,200,000 (13)
abstracting: (p144<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p51)
states: 4,702,924,800,000 (12)
abstracting: (p51<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p131)
states: 42,326,323,200,000 (13)
abstracting: (p131<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p78)
states: 4,702,924,800,000 (12)
abstracting: (p78<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p175)
states: 42,326,323,200,000 (13)
abstracting: (p175<=1)
states: 42,326,323,200,001 (13)
.
EG iterations: 1
abstracting: (1<=p96)
states: 4,702,924,800,000 (12)
abstracting: (p96<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p144)
states: 42,326,323,200,000 (13)
abstracting: (p144<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p51)
states: 4,702,924,800,000 (12)
abstracting: (p51<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p131)
states: 42,326,323,200,000 (13)
abstracting: (p131<=1)
states: 42,326,323,200,001 (13)
.
EG iterations: 1
abstracting: (1<=p122)
states: 5,290,790,400,000 (12)
abstracting: (p122<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p155)
states: 42,326,323,200,000 (13)
abstracting: (p155<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p67)
states: 4,702,924,800,000 (12)
abstracting: (p67<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p176)
states: 42,326,323,200,000 (13)
abstracting: (p176<=1)
states: 42,326,323,200,001 (13)
.abstracting: (1<=p39)
states: 4,232,632,320,000 (12)
abstracting: (p39<=1)
states: 42,326,323,200,001 (13)
..abstracting: (0<=p83)
states: 42,326,323,200,001 (13)
abstracting: (p83<=0)
states: 38,093,690,880,001 (13)
.abstracting: (1<=p44)
states: 4,232,632,320,000 (12)
abstracting: (p44<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p129)
states: 42,326,323,200,000 (13)
abstracting: (p129<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p20)
states: 7,054,387,200,000 (12)
abstracting: (p20<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p142)
states: 42,326,323,200,000 (13)
abstracting: (p142<=1)
states: 42,326,323,200,001 (13)
.
EG iterations: 1
abstracting: (1<=p31)
states: 4,232,632,320,000 (12)
abstracting: (p31<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p127)
states: 42,326,323,200,000 (13)
abstracting: (p127<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p11)
states: 7,054,387,200,000 (12)
abstracting: (p11<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p151)
states: 42,326,323,200,000 (13)
abstracting: (p151<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p31)
states: 4,232,632,320,000 (12)
abstracting: (p31<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p127)
states: 42,326,323,200,000 (13)
abstracting: (p127<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p31)
states: 4,232,632,320,000 (12)
abstracting: (p31<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p127)
states: 42,326,323,200,000 (13)
abstracting: (p127<=1)
states: 42,326,323,200,001 (13)
.
EG iterations: 1
abstracting: (1<=p123)
states: 5,290,790,400,000 (12)
abstracting: (p123<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p154)
states: 42,326,323,200,000 (13)
abstracting: (p154<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p76)
states: 4,702,924,800,000 (12)
abstracting: (p76<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p183)
states: 42,326,323,200,000 (13)
abstracting: (p183<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p5)
states: 8,465,264,640,000 (12)
abstracting: (p5<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p125)
states: 42,326,323,200,000 (13)
abstracting: (p125<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p115)
states: 5,290,790,400,000 (12)
abstracting: (p115<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p159)
states: 42,326,323,200,000 (13)
abstracting: (p159<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p5)
states: 8,465,264,640,000 (12)
abstracting: (p5<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p125)
states: 42,326,323,200,000 (13)
abstracting: (p125<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p5)
states: 8,465,264,640,000 (12)
abstracting: (p5<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p125)
states: 42,326,323,200,000 (13)
abstracting: (p125<=1)
states: 42,326,323,200,001 (13)
..
EG iterations: 2
abstracting: (1<=p77)
states: 4,702,924,800,000 (12)
abstracting: (p77<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p180)
states: 42,326,323,200,000 (13)
abstracting: (p180<=1)
states: 42,326,323,200,001 (13)
.abstracting: (1<=p123)
states: 5,290,790,400,000 (12)
abstracting: (p123<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p172)
states: 42,326,323,200,000 (13)
abstracting: (p172<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p58)
states: 5,290,790,400,000 (12)
abstracting: (p58<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p170)
states: 42,326,323,200,000 (13)
abstracting: (p170<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p44)
states: 4,232,632,320,000 (12)
abstracting: (p44<=1)
states: 42,326,323,200,001 (13)
abstracting: (1<=p163)
states: 42,326,323,200,000 (13)
abstracting: (p163<=1)
states: 42,326,323,200,001 (13)
abstracting: (0<=p60)
states: 42,326,323,200,001 (13)
abstracting: (p60<=0)
states: 37,035,532,800,001 (13)
abstracting: (0<=p135)
states: 42,326,323,200,001 (13)
abstracting: (p135<=0)
states: 1
abstracting: (0<=p24)
states: 42,326,323,200,001 (13)
abstracting: (p24<=0)
states: 35,271,936,000,001 (13)
abstracting: (0<=p143)
states: 42,326,323,200,001 (13)
abstracting: (p143<=0)
states: 1
-> the formula is FALSE

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

MC time: 0m 0.578sec

totally nodes used: 469203 (4.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4892185 10957575 15849760
used/not used/entry size/cache size: 10350732 56758132 16 1024MB
basic ops cache: hits/miss/sum: 397741 824986 1222727
used/not used/entry size/cache size: 1167275 15609941 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: 29280 62681 91961
used/not used/entry size/cache size: 62523 8326085 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 66667474
1 415984
2 23155
3 2101
4 144
5 6
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 7.411sec


BK_STOP 1678462672180

--------------------
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:2471 (9), effective:110 (0)

initing FirstDep: 0m 0.000sec


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

iterations count:559 (2), effective:8 (0)

iterations count:320 (1), effective:8 (0)

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

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

iterations count:769 (2), effective:19 (0)

iterations count:565 (2), effective:8 (0)

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

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

iterations count:843 (3), effective:12 (0)

iterations count:561 (2), effective:8 (0)

iterations count:315 (1), effective:8 (0)

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

iterations count:559 (2), effective:8 (0)

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

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

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

iterations count:591 (2), effective:13 (0)

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

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

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

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

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

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

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

iterations count:428 (1), effective:30 (0)

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

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

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

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

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

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

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

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

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

iterations count:914 (3), effective:20 (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-10a"
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-10a, 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-167814483100730"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-10a.tgz
mv DLCround-PT-10a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;