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.r522-tall-167987246800018.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 Anderson-PT-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987246800018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 302K Mar 31 16:48 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 Anderson-PT-06-CTLFireability-00
FORMULA_NAME Anderson-PT-06-CTLFireability-01
FORMULA_NAME Anderson-PT-06-CTLFireability-02
FORMULA_NAME Anderson-PT-06-CTLFireability-03
FORMULA_NAME Anderson-PT-06-CTLFireability-04
FORMULA_NAME Anderson-PT-06-CTLFireability-05
FORMULA_NAME Anderson-PT-06-CTLFireability-06
FORMULA_NAME Anderson-PT-06-CTLFireability-07
FORMULA_NAME Anderson-PT-06-CTLFireability-08
FORMULA_NAME Anderson-PT-06-CTLFireability-09
FORMULA_NAME Anderson-PT-06-CTLFireability-10
FORMULA_NAME Anderson-PT-06-CTLFireability-11
FORMULA_NAME Anderson-PT-06-CTLFireability-12
FORMULA_NAME Anderson-PT-06-CTLFireability-13
FORMULA_NAME Anderson-PT-06-CTLFireability-14
FORMULA_NAME Anderson-PT-06-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680839601775

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=Anderson-PT-06
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 03:53:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 03:53:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:53:23] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-04-07 03:53:23] [INFO ] Transformed 229 places.
[2023-04-07 03:53:23] [INFO ] Transformed 600 transitions.
[2023-04-07 03:53:23] [INFO ] Found NUPN structural information;
[2023-04-07 03:53:23] [INFO ] Parsed PT model containing 229 places and 600 transitions and 2280 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 93 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 600/600 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 208 transition count 579
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 208 transition count 579
Applied a total of 42 rules in 37 ms. Remains 208 /229 variables (removed 21) and now considering 579/600 (removed 21) transitions.
// Phase 1: matrix 579 rows 208 cols
[2023-04-07 03:53:23] [INFO ] Computed 15 invariants in 32 ms
[2023-04-07 03:53:23] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-04-07 03:53:23] [INFO ] Invariant cache hit.
[2023-04-07 03:53:24] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 03:53:24] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2023-04-07 03:53:24] [INFO ] Invariant cache hit.
[2023-04-07 03:53:24] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 208/229 places, 579/600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 960 ms. Remains : 208/229 places, 579/600 transitions.
Support contains 93 out of 208 places after structural reductions.
[2023-04-07 03:53:24] [INFO ] Flatten gal took : 78 ms
[2023-04-07 03:53:24] [INFO ] Flatten gal took : 46 ms
[2023-04-07 03:53:24] [INFO ] Input system was already deterministic with 579 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 98) seen :47
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 51) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :5
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 38) seen :8
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-04-07 03:53:25] [INFO ] Invariant cache hit.
[2023-04-07 03:53:26] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-04-07 03:53:26] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 6 ms returned sat
[2023-04-07 03:53:26] [INFO ] After 484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-07 03:53:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-04-07 03:53:26] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 03:53:27] [INFO ] After 820ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :16
[2023-04-07 03:53:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 03:53:27] [INFO ] After 646ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :3 sat :16
[2023-04-07 03:53:28] [INFO ] After 1637ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :16
Attempting to minimize the solution found.
Minimization took 721 ms.
[2023-04-07 03:53:29] [INFO ] After 3402ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :16
Fused 19 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 125 ms.
Support contains 24 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 579/579 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 208 transition count 549
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 178 transition count 549
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 85 place count 153 transition count 364
Iterating global reduction 0 with 25 rules applied. Total rules applied 110 place count 153 transition count 364
Applied a total of 110 rules in 52 ms. Remains 153 /208 variables (removed 55) and now considering 364/579 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 153/208 places, 364/579 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 364 rows 153 cols
[2023-04-07 03:53:30] [INFO ] Computed 15 invariants in 8 ms
[2023-04-07 03:53:31] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-04-07 03:53:31] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 6 ms returned sat
[2023-04-07 03:53:31] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 03:53:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-04-07 03:53:31] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 03:53:31] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 03:53:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 03:53:31] [INFO ] After 151ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-07 03:53:31] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-04-07 03:53:32] [INFO ] After 932ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 37 ms.
Support contains 9 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 364/364 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 146 transition count 287
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 146 transition count 287
Applied a total of 14 rules in 17 ms. Remains 146 /153 variables (removed 7) and now considering 287/364 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 146/153 places, 287/364 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Finished probabilistic random walk after 284442 steps, run visited all 7 properties in 1164 ms. (steps per millisecond=244 )
Probabilistic random walk after 284442 steps, saw 115671 distinct states, run finished after 1164 ms. (steps per millisecond=244 ) properties seen :7
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-04-07 03:53:33] [INFO ] Flatten gal took : 32 ms
[2023-04-07 03:53:33] [INFO ] Flatten gal took : 30 ms
[2023-04-07 03:53:33] [INFO ] Input system was already deterministic with 579 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 579/579 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 173 transition count 274
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 173 transition count 274
Applied a total of 70 rules in 7 ms. Remains 173 /208 variables (removed 35) and now considering 274/579 (removed 305) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 173/208 places, 274/579 transitions.
[2023-04-07 03:53:33] [INFO ] Flatten gal took : 12 ms
[2023-04-07 03:53:33] [INFO ] Flatten gal took : 11 ms
[2023-04-07 03:53:34] [INFO ] Input system was already deterministic with 274 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 579/579 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 172 transition count 273
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 172 transition count 273
Applied a total of 72 rules in 6 ms. Remains 172 /208 variables (removed 36) and now considering 273/579 (removed 306) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 172/208 places, 273/579 transitions.
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 10 ms
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 11 ms
[2023-04-07 03:53:34] [INFO ] Input system was already deterministic with 273 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 579/579 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 170 transition count 251
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 170 transition count 251
Applied a total of 76 rules in 5 ms. Remains 170 /208 variables (removed 38) and now considering 251/579 (removed 328) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 170/208 places, 251/579 transitions.
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 9 ms
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 9 ms
[2023-04-07 03:53:34] [INFO ] Input system was already deterministic with 251 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 208/208 places, 579/579 transitions.
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 28 Pre rules applied. Total rules applied 0 place count 208 transition count 551
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 180 transition count 551
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 84 place count 152 transition count 323
Iterating global reduction 0 with 28 rules applied. Total rules applied 112 place count 152 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 151 transition count 322
Applied a total of 114 rules in 25 ms. Remains 151 /208 variables (removed 57) and now considering 322/579 (removed 257) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 151/208 places, 322/579 transitions.
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 12 ms
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 13 ms
[2023-04-07 03:53:34] [INFO ] Input system was already deterministic with 322 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 579/579 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 175 transition count 286
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 175 transition count 286
Applied a total of 66 rules in 5 ms. Remains 175 /208 variables (removed 33) and now considering 286/579 (removed 293) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 175/208 places, 286/579 transitions.
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 10 ms
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 10 ms
[2023-04-07 03:53:34] [INFO ] Input system was already deterministic with 286 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 579/579 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 180 transition count 341
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 180 transition count 341
Applied a total of 56 rules in 5 ms. Remains 180 /208 variables (removed 28) and now considering 341/579 (removed 238) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 180/208 places, 341/579 transitions.
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 11 ms
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 12 ms
[2023-04-07 03:53:34] [INFO ] Input system was already deterministic with 341 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 579/579 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 176 transition count 317
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 176 transition count 317
Applied a total of 64 rules in 6 ms. Remains 176 /208 variables (removed 32) and now considering 317/579 (removed 262) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 176/208 places, 317/579 transitions.
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 10 ms
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 10 ms
[2023-04-07 03:53:34] [INFO ] Input system was already deterministic with 317 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 579/579 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 175 transition count 306
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 175 transition count 306
Applied a total of 66 rules in 7 ms. Remains 175 /208 variables (removed 33) and now considering 306/579 (removed 273) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 175/208 places, 306/579 transitions.
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 10 ms
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 11 ms
[2023-04-07 03:53:34] [INFO ] Input system was already deterministic with 306 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 208/208 places, 579/579 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 208 transition count 549
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 178 transition count 549
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 99 place count 139 transition count 210
Iterating global reduction 0 with 39 rules applied. Total rules applied 138 place count 139 transition count 210
Applied a total of 138 rules in 18 ms. Remains 139 /208 variables (removed 69) and now considering 210/579 (removed 369) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 139/208 places, 210/579 transitions.
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:53:34] [INFO ] Input system was already deterministic with 210 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 208/208 places, 579/579 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 208 transition count 549
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 178 transition count 549
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 98 place count 140 transition count 221
Iterating global reduction 0 with 38 rules applied. Total rules applied 136 place count 140 transition count 221
Applied a total of 136 rules in 15 ms. Remains 140 /208 variables (removed 68) and now considering 221/579 (removed 358) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 140/208 places, 221/579 transitions.
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:53:34] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 208/208 places, 579/579 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 208 transition count 549
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 178 transition count 549
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 99 place count 139 transition count 210
Iterating global reduction 0 with 39 rules applied. Total rules applied 138 place count 139 transition count 210
Applied a total of 138 rules in 15 ms. Remains 139 /208 variables (removed 69) and now considering 210/579 (removed 369) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 139/208 places, 210/579 transitions.
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:53:34] [INFO ] Input system was already deterministic with 210 transitions.
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
FORMULA Anderson-PT-06-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 208/208 places, 579/579 transitions.
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 28 Pre rules applied. Total rules applied 0 place count 208 transition count 551
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 180 transition count 551
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 90 place count 146 transition count 247
Iterating global reduction 0 with 34 rules applied. Total rules applied 124 place count 146 transition count 247
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 128 place count 144 transition count 245
Applied a total of 128 rules in 18 ms. Remains 144 /208 variables (removed 64) and now considering 245/579 (removed 334) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 144/208 places, 245/579 transitions.
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:53:34] [INFO ] Input system was already deterministic with 245 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 579/579 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 179 transition count 340
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 179 transition count 340
Applied a total of 58 rules in 6 ms. Remains 179 /208 variables (removed 29) and now considering 340/579 (removed 239) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 179/208 places, 340/579 transitions.
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 10 ms
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 11 ms
[2023-04-07 03:53:34] [INFO ] Input system was already deterministic with 340 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 579/579 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 172 transition count 273
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 172 transition count 273
Applied a total of 72 rules in 6 ms. Remains 172 /208 variables (removed 36) and now considering 273/579 (removed 306) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 172/208 places, 273/579 transitions.
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:53:34] [INFO ] Input system was already deterministic with 273 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 579/579 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 179 transition count 330
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 179 transition count 330
Applied a total of 58 rules in 5 ms. Remains 179 /208 variables (removed 29) and now considering 330/579 (removed 249) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 179/208 places, 330/579 transitions.
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 10 ms
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 10 ms
[2023-04-07 03:53:34] [INFO ] Input system was already deterministic with 330 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 579/579 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 174 transition count 295
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 174 transition count 295
Applied a total of 68 rules in 5 ms. Remains 174 /208 variables (removed 34) and now considering 295/579 (removed 284) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 174/208 places, 295/579 transitions.
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 9 ms
[2023-04-07 03:53:34] [INFO ] Input system was already deterministic with 295 transitions.
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 23 ms
[2023-04-07 03:53:34] [INFO ] Flatten gal took : 18 ms
[2023-04-07 03:53:34] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-04-07 03:53:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 208 places, 579 transitions and 2238 arcs took 3 ms.
Total runtime 11569 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: 579 NrArc: 2238)

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

net check time: 0m 0.000sec

init dd package: 0m 2.711sec


RS generation: 3m46.657sec


-> reachability set: #nodes 304082 (3.0e+05) #states 12,873,912 (7)



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

checking: AF [EG [EF [[[p0<=1 & 1<=p0] & [p201<=1 & 1<=p201]]]]]
normalized: ~ [EG [~ [EG [E [true U [[p201<=1 & 1<=p201] & [p0<=1 & 1<=p0]]]]]]]

abstracting: (1<=p0)
states: 3,083,726 (6)
abstracting: (p0<=1)
states: 12,873,912 (7)
abstracting: (1<=p201)
states: 96,528 (4)
abstracting: (p201<=1)
states: 12,873,912 (7)

EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA Anderson-PT-06-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 2.635sec

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

abstracting: (0<=p12)
states: 12,873,912 (7)
abstracting: (p12<=0)
states: 10,697,857 (7)
abstracting: (0<=p20)
states: 12,873,912 (7)
abstracting: (p20<=0)
states: 11,936,584 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Anderson-PT-06-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m15.848sec

checking: AX [AF [~ [E [[[p10<=1 & 1<=p10] & [p40<=1 & 1<=p40]] U ~ [AG [[[p0<=1 & 1<=p0] & [p194<=1 & 1<=p194]]]]]]]]
normalized: ~ [EX [EG [E [[[p40<=1 & 1<=p40] & [p10<=1 & 1<=p10]] U E [true U ~ [[[p194<=1 & 1<=p194] & [p0<=1 & 1<=p0]]]]]]]]

abstracting: (1<=p0)
states: 3,083,726 (6)
abstracting: (p0<=1)
states: 12,873,912 (7)
abstracting: (1<=p194)
states: 76,704 (4)
abstracting: (p194<=1)
states: 12,873,912 (7)
abstracting: (1<=p10)
states: 1,913,853 (6)
abstracting: (p10<=1)
states: 12,873,912 (7)
abstracting: (1<=p40)
states: 876,269 (5)
abstracting: (p40<=1)
states: 12,873,912 (7)

EG iterations: 0
.-> the formula is FALSE

FORMULA Anderson-PT-06-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m28.604sec

checking: EG [EF [[[[p14<=0 & 0<=p14] | [p37<=0 & 0<=p37]] & [AX [[[p7<=0 & 0<=p7] | [p29<=0 & 0<=p29]]] | AF [[[p11<=0 & 0<=p11] | [p51<=0 & 0<=p51]]]]]]]
normalized: EG [E [true U [[~ [EG [~ [[[p51<=0 & 0<=p51] | [p11<=0 & 0<=p11]]]]] | ~ [EX [~ [[[p29<=0 & 0<=p29] | [p7<=0 & 0<=p7]]]]]] & [[p37<=0 & 0<=p37] | [p14<=0 & 0<=p14]]]]]

abstracting: (0<=p14)
states: 12,873,912 (7)
abstracting: (p14<=0)
states: 12,110,712 (7)
abstracting: (0<=p37)
states: 12,873,912 (7)
abstracting: (p37<=0)
states: 11,977,469 (7)
abstracting: (0<=p7)
states: 12,873,912 (7)
abstracting: (p7<=0)
states: 11,783,232 (7)
abstracting: (0<=p29)
states: 12,873,912 (7)
abstracting: (p29<=0)
states: 11,979,164 (7)
.abstracting: (0<=p11)
states: 12,873,912 (7)
abstracting: (p11<=0)
states: 10,727,837 (7)
abstracting: (0<=p51)
states: 12,873,912 (7)
abstracting: (p51<=0)
states: 11,946,442 (7)
.....................
EG iterations: 21

EG iterations: 0
-> the formula is TRUE

FORMULA Anderson-PT-06-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.024sec

checking: ~ [E [~ [AX [EG [[[p5<=1 & 1<=p5] & [p125<=1 & 1<=p125]]]]] U [[EF [[[p17<=1 & 1<=p17] & [p32<=1 & 1<=p32]]] | EX [~ [[[p10<=1 & 1<=p10] & [p52<=1 & 1<=p52]]]]] & [[p13<=1 & 1<=p13] & [p29<=1 & 1<=p29]]]]]
normalized: ~ [E [EX [~ [EG [[[p125<=1 & 1<=p125] & [p5<=1 & 1<=p5]]]]] U [[[p13<=1 & 1<=p13] & [p29<=1 & 1<=p29]] & [EX [~ [[[p52<=1 & 1<=p52] & [p10<=1 & 1<=p10]]]] | E [true U [[p32<=1 & 1<=p32] & [p17<=1 & 1<=p17]]]]]]]

abstracting: (1<=p17)
states: 115,200 (5)
abstracting: (p17<=1)
states: 12,873,912 (7)
abstracting: (1<=p32)
states: 904,990 (5)
abstracting: (p32<=1)
states: 12,873,912 (7)

before gc: list nodes free: 2045663

after gc: idd nodes used:848701, unused:63151299; list nodes free:289898189
abstracting: (1<=p10)
states: 1,913,853 (6)
abstracting: (p10<=1)
states: 12,873,912 (7)
abstracting: (1<=p52)
states: 922,562 (5)
abstracting: (p52<=1)
states: 12,873,912 (7)
.abstracting: (1<=p29)
states: 894,748 (5)
abstracting: (p29<=1)
states: 12,873,912 (7)
abstracting: (1<=p13)
states: 966,336 (5)
abstracting: (p13<=1)
states: 12,873,912 (7)
abstracting: (1<=p5)
states: 1,753,489 (6)
abstracting: (p5<=1)
states: 12,873,912 (7)
abstracting: (1<=p125)
states: 454,992 (5)
abstracting: (p125<=1)
states: 12,873,912 (7)
............
EG iterations: 12
.MC time: 4m40.000sec

checking: AX [AF [[~ [E [AG [[[1<=p16 & p16<=1] & [p47<=1 & 1<=p47]]] U [[1<=p66 & p66<=1] & [p17<=1 & 1<=p17]]]] & [AG [[[p9<=0 & 0<=p9] | [p30<=0 & 0<=p30]]] & [AG [[p68<=0 & 0<=p68]] | [[p15<=0 & 0<=p15] | [p34<=0 & 0<=p34]]]]]]]
normalized: ~ [EX [EG [~ [[[[[[p34<=0 & 0<=p34] | [p15<=0 & 0<=p15]] | ~ [E [true U ~ [[p68<=0 & 0<=p68]]]]] & ~ [E [true U ~ [[[p30<=0 & 0<=p30] | [p9<=0 & 0<=p9]]]]]] & ~ [E [~ [E [true U ~ [[[p47<=1 & 1<=p47] & [1<=p16 & p16<=1]]]]] U [[p17<=1 & 1<=p17] & [1<=p66 & p66<=1]]]]]]]]]

abstracting: (p66<=1)
states: 12,873,912 (7)
abstracting: (1<=p66)
states: 441,600 (5)
abstracting: (1<=p17)
states: 115,200 (5)
abstracting: (p17<=1)
states: 12,873,912 (7)
abstracting: (p16<=1)
states: 12,873,912 (7)
abstracting: (1<=p16)
states: 293,760 (5)
abstracting: (1<=p47)
states: 887,032 (5)
abstracting: (p47<=1)
states: 12,873,912 (7)
abstracting: (0<=p9)
states: 12,873,912 (7)
abstracting: (p9<=0)
states: 11,230,809 (7)
abstracting: (0<=p30)
states: 12,873,912 (7)
abstracting: (p30<=0)
states: 11,946,102 (7)

before gc: list nodes free: 1571169

after gc: idd nodes used:1104360, unused:62895640; list nodes free:290837842
abstracting: (0<=p68)
states: 12,873,912 (7)
abstracting: (p68<=0)
states: 12,615,768 (7)
MC time: 4m15.000sec

checking: EG [[[[p7<=0 & 0<=p7] | [p32<=0 & 0<=p32]] & [[AX [[[p17<=0 & 0<=p17] | [p20<=0 & 0<=p20]]] | [p62<=0 & 0<=p62]] | [[p80<=0 & 0<=p80] | [[[p16<=1 & 1<=p16] & [p29<=1 & 1<=p29]] | [[p8<=1 & 1<=p8] & [p44<=1 & 1<=p44]]]]]]]
normalized: EG [[[[[[[p44<=1 & 1<=p44] & [p8<=1 & 1<=p8]] | [[p29<=1 & 1<=p29] & [p16<=1 & 1<=p16]]] | [p80<=0 & 0<=p80]] | [[p62<=0 & 0<=p62] | ~ [EX [~ [[[p20<=0 & 0<=p20] | [p17<=0 & 0<=p17]]]]]]] & [[p32<=0 & 0<=p32] | [p7<=0 & 0<=p7]]]]

abstracting: (0<=p7)
states: 12,873,912 (7)
abstracting: (p7<=0)
states: 11,783,232 (7)
abstracting: (0<=p32)
states: 12,873,912 (7)
abstracting: (p32<=0)
states: 11,968,922 (7)
abstracting: (0<=p17)
states: 12,873,912 (7)
abstracting: (p17<=0)
states: 12,758,712 (7)
abstracting: (0<=p20)
states: 12,873,912 (7)
abstracting: (p20<=0)
states: 11,936,584 (7)
.abstracting: (0<=p62)
states: 12,873,912 (7)
abstracting: (p62<=0)
states: 12,528,960 (7)
abstracting: (0<=p80)
states: 12,873,912 (7)
abstracting: (p80<=0)
states: 12,415,534 (7)
abstracting: (1<=p16)
states: 293,760 (5)
abstracting: (p16<=1)
states: 12,873,912 (7)
abstracting: (1<=p29)
states: 894,748 (5)
abstracting: (p29<=1)
states: 12,873,912 (7)
abstracting: (1<=p8)
states: 1,216,530 (6)
abstracting: (p8<=1)
states: 12,873,912 (7)
abstracting: (1<=p44)
states: 900,580 (5)
abstracting: (p44<=1)
states: 12,873,912 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Anderson-PT-06-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m29.880sec

checking: EF [EX [[[E [[EF [[[p7<=1 & 1<=p7] & [p21<=1 & 1<=p21]]] | ~ [[[p16<=1 & 1<=p16] & [p29<=1 & 1<=p29]]]] U [[AX [[[p8<=1 & 1<=p8] & [p37<=1 & 1<=p37]]] & [p0<=1 & 1<=p0]] & [[p178<=1 & 1<=p178] & [[p12<=1 & 1<=p12] & [p19<=1 & 1<=p19]]]]] | [[p2<=1 & 1<=p2] & [p110<=1 & 1<=p110]]] | [[[p17<=1 & 1<=p17] & [p43<=1 & 1<=p43]] | [[p13<=1 & 1<=p13] & [p60<=1 & 1<=p60]]]]]]
normalized: E [true U EX [[[[[p60<=1 & 1<=p60] & [p13<=1 & 1<=p13]] | [[p43<=1 & 1<=p43] & [p17<=1 & 1<=p17]]] | [[[p110<=1 & 1<=p110] & [p2<=1 & 1<=p2]] | E [[~ [[[p29<=1 & 1<=p29] & [p16<=1 & 1<=p16]]] | E [true U [[p21<=1 & 1<=p21] & [p7<=1 & 1<=p7]]]] U [[[[p19<=1 & 1<=p19] & [p12<=1 & 1<=p12]] & [p178<=1 & 1<=p178]] & [[p0<=1 & 1<=p0] & ~ [EX [~ [[[p37<=1 & 1<=p37] & [p8<=1 & 1<=p8]]]]]]]]]]]]

abstracting: (1<=p8)
states: 1,216,530 (6)
abstracting: (p8<=1)
states: 12,873,912 (7)
abstracting: (1<=p37)
states: 896,443 (5)
abstracting: (p37<=1)
states: 12,873,912 (7)
.abstracting: (1<=p0)
states: 3,083,726 (6)
abstracting: (p0<=1)
states: 12,873,912 (7)
abstracting: (1<=p178)
states: 95,765 (4)
abstracting: (p178<=1)
states: 12,873,912 (7)
abstracting: (1<=p12)
states: 2,176,055 (6)
abstracting: (p12<=1)
states: 12,873,912 (7)
abstracting: (1<=p19)
states: 950,565 (5)
abstracting: (p19<=1)
states: 12,873,912 (7)
abstracting: (1<=p7)
states: 1,090,680 (6)
abstracting: (p7<=1)
states: 12,873,912 (7)
abstracting: (1<=p21)
states: 927,470 (5)
abstracting: (p21<=1)
states: 12,873,912 (7)
abstracting: (1<=p16)
states: 293,760 (5)
abstracting: (p16<=1)
states: 12,873,912 (7)
abstracting: (1<=p29)
states: 894,748 (5)
abstracting: (p29<=1)
states: 12,873,912 (7)
abstracting: (1<=p2)
states: 1,458,359 (6)
abstracting: (p2<=1)
states: 12,873,912 (7)
abstracting: (1<=p110)
states: 498,984 (5)
abstracting: (p110<=1)
states: 12,873,912 (7)
abstracting: (1<=p17)
states: 115,200 (5)
abstracting: (p17<=1)
states: 12,873,912 (7)
abstracting: (1<=p43)
states: 910,424 (5)
abstracting: (p43<=1)
states: 12,873,912 (7)
abstracting: (1<=p13)
states: 966,336 (5)
abstracting: (p13<=1)
states: 12,873,912 (7)
abstracting: (1<=p60)
states: 457,536 (5)
abstracting: (p60<=1)
states: 12,873,912 (7)
.
before gc: list nodes free: 1020034

after gc: idd nodes used:1720480, unused:62279520; list nodes free:288098813
MC time: 4m12.000sec

checking: A [[EF [[EG [AF [[[p0<=1 & 1<=p0] & [p184<=1 & 1<=p184]]]] & [[[[[p16<=1 & 1<=p16] & [p45<=1 & 1<=p45]] & [[p1<=1 & 1<=p1] & [p159<=1 & 1<=p159]]] | [[p83<=1 & 1<=p83] | [[p16<=1 & 1<=p16] & [p91<=1 & 1<=p91]]]] & [~ [[[p12<=1 & 1<=p12] & [p49<=1 & 1<=p49]]] | [[[p9<=1 & 1<=p9] & [p25<=1 & 1<=p25]] & [[p0<=1 & 1<=p0] & [p196<=1 & 1<=p196]]]]]]] | EG [[[p2<=1 & 1<=p2] & [p164<=1 & 1<=p164]]]] U [p72<=1 & 1<=p72]]
normalized: [~ [EG [~ [[p72<=1 & 1<=p72]]]] & ~ [E [~ [[p72<=1 & 1<=p72]] U [~ [[EG [[[p164<=1 & 1<=p164] & [p2<=1 & 1<=p2]]] | E [true U [[[[[[p196<=1 & 1<=p196] & [p0<=1 & 1<=p0]] & [[p25<=1 & 1<=p25] & [p9<=1 & 1<=p9]]] | ~ [[[p49<=1 & 1<=p49] & [p12<=1 & 1<=p12]]]] & [[[[p91<=1 & 1<=p91] & [p16<=1 & 1<=p16]] | [p83<=1 & 1<=p83]] | [[[p159<=1 & 1<=p159] & [p1<=1 & 1<=p1]] & [[p45<=1 & 1<=p45] & [p16<=1 & 1<=p16]]]]] & EG [~ [EG [~ [[[p184<=1 & 1<=p184] & [p0<=1 & 1<=p0]]]]]]]]]] & ~ [[p72<=1 & 1<=p72]]]]]]

abstracting: (1<=p72)
states: 468,074 (5)
abstracting: (p72<=1)
states: 12,873,912 (7)
abstracting: (1<=p0)
states: 3,083,726 (6)
abstracting: (p0<=1)
states: 12,873,912 (7)
abstracting: (1<=p184)
states: 95,765 (4)
abstracting: (p184<=1)
states: 12,873,912 (7)
..................................
EG iterations: 34
...................................
EG iterations: 35
abstracting: (1<=p16)
states: 293,760 (5)
abstracting: (p16<=1)
states: 12,873,912 (7)
abstracting: (1<=p45)
states: 891,940 (5)
abstracting: (p45<=1)
states: 12,873,912 (7)
abstracting: (1<=p1)
states: 1,644,119 (6)
abstracting: (p1<=1)
states: 12,873,912 (7)
abstracting: (1<=p159)
states: 91,968 (4)
abstracting: (p159<=1)
states: 12,873,912 (7)
abstracting: (1<=p83)
states: 490,080 (5)
abstracting: (p83<=1)
states: 12,873,912 (7)
abstracting: (1<=p16)
states: 293,760 (5)
abstracting: (p16<=1)
states: 12,873,912 (7)
abstracting: (1<=p91)
states: 448,128 (5)
abstracting: (p91<=1)
states: 12,873,912 (7)
abstracting: (1<=p12)
states: 2,176,055 (6)
abstracting: (p12<=1)
states: 12,873,912 (7)
abstracting: (1<=p49)
states: 950,565 (5)
abstracting: (p49<=1)
states: 12,873,912 (7)
abstracting: (1<=p9)
states: 1,643,103 (6)
abstracting: (p9<=1)
states: 12,873,912 (7)
abstracting: (1<=p25)
states: 914,946 (5)
abstracting: (p25<=1)
states: 12,873,912 (7)
abstracting: (1<=p0)
states: 3,083,726 (6)
abstracting: (p0<=1)
states: 12,873,912 (7)
abstracting: (1<=p196)
states: 93,837 (4)
abstracting: (p196<=1)
states: 12,873,912 (7)
abstracting: (1<=p2)
states: 1,458,359 (6)
abstracting: (p2<=1)
states: 12,873,912 (7)
abstracting: (1<=p164)
states: 78,624 (4)
abstracting: (p164<=1)
states: 12,873,912 (7)
............
EG iterations: 12
abstracting: (1<=p72)
states: 468,074 (5)
abstracting: (p72<=1)
states: 12,873,912 (7)
abstracting: (1<=p72)
states: 468,074 (5)
abstracting: (p72<=1)
states: 12,873,912 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Anderson-PT-06-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m32.526sec

checking: ~ [E [[[[p1<=1 & 1<=p1] & [p165<=1 & 1<=p165]] | [[p16<=1 & 1<=p16] & [p60<=1 & 1<=p60]]] U [[[EX [[[p16<=1 & 1<=p16] & [p50<=1 & 1<=p50]]] & [[p17<=1 & 1<=p17] & [p23<=1 & 1<=p23]]] | EX [A [[[p17<=1 & 1<=p17] & [p45<=1 & 1<=p45]] U [[p13<=1 & 1<=p13] & [p38<=1 & 1<=p38]]]]] | [[A [[[p11<=1 & 1<=p11] & [p52<=1 & 1<=p52]] U [[p16<=1 & 1<=p16] & [p31<=1 & 1<=p31]]] & [[p15<=1 & 1<=p15] & [p22<=1 & 1<=p22]]] | ~ [AF [[[p1<=1 & 1<=p1] & [p147<=1 & 1<=p147]]]]]]]]
normalized: ~ [E [[[[p60<=1 & 1<=p60] & [p16<=1 & 1<=p16]] | [[p165<=1 & 1<=p165] & [p1<=1 & 1<=p1]]] U [[EG [~ [[[p147<=1 & 1<=p147] & [p1<=1 & 1<=p1]]]] | [[[p22<=1 & 1<=p22] & [p15<=1 & 1<=p15]] & [~ [EG [~ [[[p31<=1 & 1<=p31] & [p16<=1 & 1<=p16]]]]] & ~ [E [~ [[[p31<=1 & 1<=p31] & [p16<=1 & 1<=p16]]] U [~ [[[p52<=1 & 1<=p52] & [p11<=1 & 1<=p11]]] & ~ [[[p31<=1 & 1<=p31] & [p16<=1 & 1<=p16]]]]]]]]] | [EX [[~ [EG [~ [[[p38<=1 & 1<=p38] & [p13<=1 & 1<=p13]]]]] & ~ [E [~ [[[p38<=1 & 1<=p38] & [p13<=1 & 1<=p13]]] U [~ [[[p45<=1 & 1<=p45] & [p17<=1 & 1<=p17]]] & ~ [[[p38<=1 & 1<=p38] & [p13<=1 & 1<=p13]]]]]]]] | [[[p23<=1 & 1<=p23] & [p17<=1 & 1<=p17]] & EX [[[p50<=1 & 1<=p50] & [p16<=1 & 1<=p16]]]]]]]]

abstracting: (1<=p16)
states: 293,760 (5)
abstracting: (p16<=1)
states: 12,873,912 (7)
abstracting: (1<=p50)
states: 937,328 (5)
abstracting: (p50<=1)
states: 12,873,912 (7)
.abstracting: (1<=p17)
states: 115,200 (5)
abstracting: (p17<=1)
states: 12,873,912 (7)
abstracting: (1<=p23)
states: 922,562 (5)
abstracting: (p23<=1)
states: 12,873,912 (7)
abstracting: (1<=p13)
states: 966,336 (5)
abstracting: (p13<=1)
states: 12,873,912 (7)
abstracting: (1<=p38)
states: 886,487 (5)
abstracting: (p38<=1)
states: 12,873,912 (7)
abstracting: (1<=p17)
states: 115,200 (5)
abstracting: (p17<=1)
states: 12,873,912 (7)
abstracting: (1<=p45)
states: 891,940 (5)
abstracting: (p45<=1)
states: 12,873,912 (7)
abstracting: (1<=p13)
states: 966,336 (5)
abstracting: (p13<=1)
states: 12,873,912 (7)
abstracting: (1<=p38)
states: 886,487 (5)
abstracting: (p38<=1)
states: 12,873,912 (7)
abstracting: (1<=p13)
states: 966,336 (5)
abstracting: (p13<=1)
states: 12,873,912 (7)
abstracting: (1<=p38)
states: 886,487 (5)
abstracting: (p38<=1)
states: 12,873,912 (7)
.
EG iterations: 1
.abstracting: (1<=p16)
states: 293,760 (5)
abstracting: (p16<=1)
states: 12,873,912 (7)
abstracting: (1<=p31)
states: 914,946 (5)
abstracting: (p31<=1)
states: 12,873,912 (7)
abstracting: (1<=p11)
states: 2,146,075 (6)
abstracting: (p11<=1)
states: 12,873,912 (7)
abstracting: (1<=p52)
states: 922,562 (5)
abstracting: (p52<=1)
states: 12,873,912 (7)
abstracting: (1<=p16)
states: 293,760 (5)
abstracting: (p16<=1)
states: 12,873,912 (7)
abstracting: (1<=p31)
states: 914,946 (5)
abstracting: (p31<=1)
states: 12,873,912 (7)
abstracting: (1<=p16)
states: 293,760 (5)
abstracting: (p16<=1)
states: 12,873,912 (7)
abstracting: (1<=p31)
states: 914,946 (5)
abstracting: (p31<=1)
states: 12,873,912 (7)
.
EG iterations: 1
abstracting: (1<=p15)
states: 526,080 (5)
abstracting: (p15<=1)
states: 12,873,912 (7)
abstracting: (1<=p22)
states: 922,562 (5)
abstracting: (p22<=1)
states: 12,873,912 (7)
abstracting: (1<=p1)
states: 1,644,119 (6)
abstracting: (p1<=1)
states: 12,873,912 (7)
abstracting: (1<=p147)
states: 98,256 (4)
abstracting: (p147<=1)
states: 12,873,912 (7)
.........................
before gc: list nodes free: 488330

after gc: idd nodes used:2242075, unused:61757925; list nodes free:285699104
........
EG iterations: 33
abstracting: (1<=p1)
states: 1,644,119 (6)
abstracting: (p1<=1)
states: 12,873,912 (7)
abstracting: (1<=p165)
states: 96,528 (4)
abstracting: (p165<=1)
states: 12,873,912 (7)
abstracting: (1<=p16)
states: 293,760 (5)
abstracting: (p16<=1)
states: 12,873,912 (7)
abstracting: (1<=p60)
states: 457,536 (5)
abstracting: (p60<=1)
states: 12,873,912 (7)
-> the formula is FALSE

FORMULA Anderson-PT-06-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m 2.138sec

checking: E [A [E [A [[[p16<=1 & 1<=p16] & [p66<=1 & 1<=p66]] U AF [[[p7<=1 & 1<=p7] & [p22<=1 & 1<=p22]]]] U E [EX [[[p10<=1 & 1<=p10] & [p36<=1 & 1<=p36]]] U [[[p10<=1 & 1<=p10] & [p40<=1 & 1<=p40]] & [[p4<=1 & 1<=p4] & [p144<=1 & 1<=p144]]]]] U [[p13<=1 & 1<=p13] & [p51<=1 & 1<=p51]]] U ~ [[E [~ [[[p15<=1 & 1<=p15] & [p60<=1 & 1<=p60]]] U [~ [[[p0<=1 & 1<=p0] & [p181<=1 & 1<=p181]]] | [AF [[[p10<=1 & 1<=p10] & [p25<=1 & 1<=p25]]] | EX [[[p17<=1 & 1<=p17] & [p38<=1 & 1<=p38]]]]]] | AX [[[p12<=1 & 1<=p12] & [p22<=1 & 1<=p22]]]]]]
normalized: E [[~ [EG [~ [[[p51<=1 & 1<=p51] & [p13<=1 & 1<=p13]]]]] & ~ [E [~ [[[p51<=1 & 1<=p51] & [p13<=1 & 1<=p13]]] U [~ [E [[~ [EG [EG [~ [[[p22<=1 & 1<=p22] & [p7<=1 & 1<=p7]]]]]] & ~ [E [EG [~ [[[p22<=1 & 1<=p22] & [p7<=1 & 1<=p7]]]] U [~ [[[p66<=1 & 1<=p66] & [p16<=1 & 1<=p16]]] & EG [~ [[[p22<=1 & 1<=p22] & [p7<=1 & 1<=p7]]]]]]]] U E [EX [[[p36<=1 & 1<=p36] & [p10<=1 & 1<=p10]]] U [[[p144<=1 & 1<=p144] & [p4<=1 & 1<=p4]] & [[p40<=1 & 1<=p40] & [p10<=1 & 1<=p10]]]]]] & ~ [[[p51<=1 & 1<=p51] & [p13<=1 & 1<=p13]]]]]]] U ~ [[~ [EX [~ [[[p22<=1 & 1<=p22] & [p12<=1 & 1<=p12]]]]] | E [~ [[[p60<=1 & 1<=p60] & [p15<=1 & 1<=p15]]] U [[EX [[[p38<=1 & 1<=p38] & [p17<=1 & 1<=p17]]] | ~ [EG [~ [[[p25<=1 & 1<=p25] & [p10<=1 & 1<=p10]]]]]] | ~ [[[p181<=1 & 1<=p181] & [p0<=1 & 1<=p0]]]]]]]]

abstracting: (1<=p0)
states: 3,083,726 (6)
abstracting: (p0<=1)
states: 12,873,912 (7)
abstracting: (1<=p181)
states: 74,784 (4)
abstracting: (p181<=1)
states: 12,873,912 (7)
abstracting: (1<=p10)
states: 1,913,853 (6)
abstracting: (p10<=1)
states: 12,873,912 (7)
abstracting: (1<=p25)
states: 914,946 (5)
abstracting: (p25<=1)
states: 12,873,912 (7)
.
EG iterations: 1
abstracting: (1<=p17)
states: 115,200 (5)
abstracting: (p17<=1)
states: 12,873,912 (7)
abstracting: (1<=p38)
states: 886,487 (5)
abstracting: (p38<=1)
states: 12,873,912 (7)
.abstracting: (1<=p15)
states: 526,080 (5)
abstracting: (p15<=1)
states: 12,873,912 (7)
abstracting: (1<=p60)
states: 457,536 (5)
abstracting: (p60<=1)
states: 12,873,912 (7)
abstracting: (1<=p12)
states: 2,176,055 (6)
abstracting: (p12<=1)
states: 12,873,912 (7)
abstracting: (1<=p22)
states: 922,562 (5)
abstracting: (p22<=1)
states: 12,873,912 (7)
.abstracting: (1<=p13)
states: 966,336 (5)
abstracting: (p13<=1)
states: 12,873,912 (7)
abstracting: (1<=p51)
states: 927,470 (5)
abstracting: (p51<=1)
states: 12,873,912 (7)
abstracting: (1<=p10)
states: 1,913,853 (6)
abstracting: (p10<=1)
states: 12,873,912 (7)
abstracting: (1<=p40)
states: 876,269 (5)
abstracting: (p40<=1)
states: 12,873,912 (7)
abstracting: (1<=p4)
states: 1,548,389 (6)
abstracting: (p4<=1)
states: 12,873,912 (7)
abstracting: (1<=p144)
states: 79,320 (4)
abstracting: (p144<=1)
states: 12,873,912 (7)
abstracting: (1<=p10)
states: 1,913,853 (6)
abstracting: (p10<=1)
states: 12,873,912 (7)
abstracting: (1<=p36)
states: 927,810 (5)
abstracting: (p36<=1)
states: 12,873,912 (7)
.abstracting: (1<=p7)
states: 1,090,680 (6)
abstracting: (p7<=1)
states: 12,873,912 (7)
abstracting: (1<=p22)
states: 922,562 (5)
abstracting: (p22<=1)
states: 12,873,912 (7)
.
EG iterations: 1
abstracting: (1<=p16)
states: 293,760 (5)
abstracting: (p16<=1)
states: 12,873,912 (7)
abstracting: (1<=p66)
states: 441,600 (5)
abstracting: (p66<=1)
states: 12,873,912 (7)
abstracting: (1<=p7)
states: 1,090,680 (6)
abstracting: (p7<=1)
states: 12,873,912 (7)
abstracting: (1<=p22)
states: 922,562 (5)
abstracting: (p22<=1)
states: 12,873,912 (7)
.
EG iterations: 1
abstracting: (1<=p7)
states: 1,090,680 (6)
abstracting: (p7<=1)
states: 12,873,912 (7)
abstracting: (1<=p22)
states: 922,562 (5)
abstracting: (p22<=1)
states: 12,873,912 (7)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p13)
states: 966,336 (5)
abstracting: (p13<=1)
states: 12,873,912 (7)
abstracting: (1<=p51)
states: 927,470 (5)
abstracting: (p51<=1)
states: 12,873,912 (7)
abstracting: (1<=p13)
states: 966,336 (5)
abstracting: (p13<=1)
states: 12,873,912 (7)
abstracting: (1<=p51)
states: 927,470 (5)
abstracting: (p51<=1)
states: 12,873,912 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Anderson-PT-06-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m57.864sec

checking: [EX [[[p3<=1 & 1<=p3] & [p169<=1 & 1<=p169]]] | E [[~ [EX [[[[p13<=1 & 1<=p13] & [p99<=1 & 1<=p99]] | [[p8<=1 & 1<=p8] & [p40<=1 & 1<=p40]]]]] | [[AF [~ [[[p15<=1 & 1<=p15] & [p34<=1 & 1<=p34]]]] | EF [~ [[[p7<=1 & 1<=p7] & [p24<=1 & 1<=p24]]]]] & A [EX [[[p9<=1 & 1<=p9] & [p42<=1 & 1<=p42]]] U AG [[p77<=1 & 1<=p77]]]]] U AG [[[[[p7<=1 & 1<=p7] & [p49<=1 & 1<=p49]] | EX [[[p9<=1 & 1<=p9] & [p21<=1 & 1<=p21]]]] & ~ [[[[p7<=1 & 1<=p7] & [p54<=1 & 1<=p54]] | [[[p7<=1 & 1<=p7] & [p19<=1 & 1<=p19]] | [[p12<=1 & 1<=p12] & [[p42<=1 & 1<=p42] & [p70<=1 & 1<=p70]]]]]]]]]]
normalized: [E [[[[~ [EG [E [true U ~ [[p77<=1 & 1<=p77]]]]] & ~ [E [E [true U ~ [[p77<=1 & 1<=p77]]] U [~ [EX [[[p42<=1 & 1<=p42] & [p9<=1 & 1<=p9]]]] & E [true U ~ [[p77<=1 & 1<=p77]]]]]]] & [E [true U ~ [[[p24<=1 & 1<=p24] & [p7<=1 & 1<=p7]]]] | ~ [EG [[[p34<=1 & 1<=p34] & [p15<=1 & 1<=p15]]]]]] | ~ [EX [[[[p40<=1 & 1<=p40] & [p8<=1 & 1<=p8]] | [[p99<=1 & 1<=p99] & [p13<=1 & 1<=p13]]]]]] U ~ [E [true U ~ [[~ [[[[[[p70<=1 & 1<=p70] & [p42<=1 & 1<=p42]] & [p12<=1 & 1<=p12]] | [[p19<=1 & 1<=p19] & [p7<=1 & 1<=p7]]] | [[p54<=1 & 1<=p54] & [p7<=1 & 1<=p7]]]] & [EX [[[p21<=1 & 1<=p21] & [p9<=1 & 1<=p9]]] | [[p49<=1 & 1<=p49] & [p7<=1 & 1<=p7]]]]]]]] | EX [[[p169<=1 & 1<=p169] & [p3<=1 & 1<=p3]]]]

abstracting: (1<=p3)
states: 1,522,919 (6)
abstracting: (p3<=1)
states: 12,873,912 (7)
abstracting: (1<=p169)
states: 75,552 (4)
abstracting: (p169<=1)
states: 12,873,912 (7)
.abstracting: (1<=p7)
states: 1,090,680 (6)
abstracting: (p7<=1)
states: 12,873,912 (7)
abstracting: (1<=p49)
states: 950,565 (5)
abstracting: (p49<=1)
states: 12,873,912 (7)
abstracting: (1<=p9)
states: 1,643,103 (6)
abstracting: (p9<=1)
states: 12,873,912 (7)
abstracting: (1<=p21)
states: 927,470 (5)
abstracting: (p21<=1)
states: 12,873,912 (7)
.abstracting: (1<=p7)
states: 1,090,680 (6)
abstracting: (p7<=1)
states: 12,873,912 (7)
abstracting: (1<=p54)
states: 967,349 (5)
abstracting: (p54<=1)
states: 12,873,912 (7)
abstracting: (1<=p7)
states: 1,090,680 (6)
abstracting: (p7<=1)
states: 12,873,912 (7)
abstracting: (1<=p19)
states: 950,565 (5)
abstracting: (p19<=1)
states: 12,873,912 (7)
abstracting: (1<=p12)
states: 2,176,055 (6)
abstracting: (p12<=1)
states: 12,873,912 (7)
abstracting: (1<=p42)
states: 908,682 (5)
abstracting: (p42<=1)
states: 12,873,912 (7)
abstracting: (1<=p70)
states: 344,952 (5)
abstracting: (p70<=1)
states: 12,873,912 (7)
abstracting: (1<=p13)
states: 966,336 (5)
abstracting: (p13<=1)
states: 12,873,912 (7)
abstracting: (1<=p99)
states: 457,536 (5)
abstracting: (p99<=1)
states: 12,873,912 (7)
abstracting: (1<=p8)
states: 1,216,530 (6)
abstracting: (p8<=1)
states: 12,873,912 (7)
abstracting: (1<=p40)
states: 876,269 (5)
abstracting: (p40<=1)
states: 12,873,912 (7)
.abstracting: (1<=p15)
states: 526,080 (5)
abstracting: (p15<=1)
states: 12,873,912 (7)
abstracting: (1<=p34)
states: 894,748 (5)
abstracting: (p34<=1)
states: 12,873,912 (7)
............
EG iterations: 12
abstracting: (1<=p7)
states: 1,090,680 (6)
abstracting: (p7<=1)
states: 12,873,912 (7)
abstracting: (1<=p24)
states: 967,349 (5)
abstracting: (p24<=1)
states: 12,873,912 (7)
abstracting: (1<=p77)
states: 275,376 (5)
abstracting: (p77<=1)
states: 12,873,912 (7)
abstracting: (1<=p9)
states: 1,643,103 (6)
abstracting: (p9<=1)
states: 12,873,912 (7)
abstracting: (1<=p42)
states: 908,682 (5)
abstracting: (p42<=1)
states: 12,873,912 (7)
.abstracting: (1<=p77)
states: 275,376 (5)
abstracting: (p77<=1)
states: 12,873,912 (7)
abstracting: (1<=p77)
states: 275,376 (5)
abstracting: (p77<=1)
states: 12,873,912 (7)

EG iterations: 0
-> the formula is FALSE

FORMULA Anderson-PT-06-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m34.011sec

checking: E [~ [[~ [EG [AG [[[p5<=1 & 1<=p5] & [p155<=1 & 1<=p155]]]]] & [[[[p10<=1 & 1<=p10] & [p26<=1 & 1<=p26]] | [AG [[[p10<=1 & 1<=p10] & [p54<=1 & 1<=p54]]] & [[[p15<=1 & 1<=p15] & [p39<=1 & 1<=p39]] | [[[p15<=1 & 1<=p15] & [p52<=1 & 1<=p52]] | [[p14<=1 & 1<=p14] & [p20<=1 & 1<=p20]]]]]] & E [AG [~ [[[p4<=1 & 1<=p4] & [p120<=1 & 1<=p120]]]] U [[p17<=1 & 1<=p17] & [p28<=1 & 1<=p28]]]]]] U EF [[AF [[[p16<=1 & 1<=p16] & [p41<=1 & 1<=p41]]] | [[[p14<=1 & 1<=p14] & [p43<=1 & 1<=p43]] | [A [[[p12<=1 & 1<=p12] & [p40<=1 & 1<=p40]] U [[p13<=1 & 1<=p13] & [p50<=1 & 1<=p50]]] & A [[[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]] U [p62<=1 & 1<=p62]]]]]]]
normalized: E [~ [[[E [~ [E [true U [[p120<=1 & 1<=p120] & [p4<=1 & 1<=p4]]]] U [[p28<=1 & 1<=p28] & [p17<=1 & 1<=p17]]] & [[[[[[p20<=1 & 1<=p20] & [p14<=1 & 1<=p14]] | [[p52<=1 & 1<=p52] & [p15<=1 & 1<=p15]]] | [[p39<=1 & 1<=p39] & [p15<=1 & 1<=p15]]] & ~ [E [true U ~ [[[p54<=1 & 1<=p54] & [p10<=1 & 1<=p10]]]]]] | [[p26<=1 & 1<=p26] & [p10<=1 & 1<=p10]]]] & ~ [EG [~ [E [true U ~ [[[p155<=1 & 1<=p155] & [p5<=1 & 1<=p5]]]]]]]]] U E [true U [[[[~ [EG [~ [[p62<=1 & 1<=p62]]]] & ~ [E [~ [[p62<=1 & 1<=p62]] U [~ [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]] & ~ [[p62<=1 & 1<=p62]]]]]] & [~ [EG [~ [[[p50<=1 & 1<=p50] & [p13<=1 & 1<=p13]]]]] & ~ [E [~ [[[p50<=1 & 1<=p50] & [p13<=1 & 1<=p13]]] U [~ [[[p40<=1 & 1<=p40] & [p12<=1 & 1<=p12]]] & ~ [[[p50<=1 & 1<=p50] & [p13<=1 & 1<=p13]]]]]]]] | [[p43<=1 & 1<=p43] & [p14<=1 & 1<=p14]]] | ~ [EG [~ [[[p41<=1 & 1<=p41] & [p16<=1 & 1<=p16]]]]]]]]

abstracting: (1<=p16)
states: 293,760 (5)
abstracting: (p16<=1)
states: 12,873,912 (7)
abstracting: (1<=p41)
states: 876,269 (5)
abstracting: (p41<=1)
states: 12,873,912 (7)
.
EG iterations: 1
abstracting: (1<=p14)
states: 763,200 (5)
abstracting: (p14<=1)
states: 12,873,912 (7)
abstracting: (1<=p43)
states: 910,424 (5)
abstracting: (p43<=1)
states: 12,873,912 (7)
abstracting: (1<=p13)
states: 966,336 (5)
abstracting: (p13<=1)
states: 12,873,912 (7)
abstracting: (1<=p50)
states: 937,328 (5)
abstracting: (p50<=1)
states: 12,873,912 (7)
abstracting: (1<=p12)
states: 2,176,055 (6)
abstracting: (p12<=1)
states: 12,873,912 (7)
abstracting: (1<=p40)
states: 876,269 (5)
abstracting: (p40<=1)
states: 12,873,912 (7)
abstracting: (1<=p13)
states: 966,336 (5)
abstracting: (p13<=1)
states: 12,873,912 (7)
abstracting: (1<=p50)
states: 937,328 (5)
abstracting: (p50<=1)
states: 12,873,912 (7)
abstracting: (1<=p13)
states: 966,336 (5)
abstracting: (p13<=1)
states: 12,873,912 (7)
abstracting: (1<=p50)
states: 937,328 (5)
abstracting: (p50<=1)
states: 12,873,912 (7)
.
EG iterations: 1
abstracting: (1<=p62)
states: 344,952 (5)
abstracting: (p62<=1)
states: 12,873,912 (7)
abstracting: (1<=p12)
states: 2,176,055 (6)
abstracting: (p12<=1)
states: 12,873,912 (7)
abstracting: (1<=p26)
states: 904,990 (5)
abstracting: (p26<=1)
states: 12,873,912 (7)
abstracting: (1<=p62)
states: 344,952 (5)
abstracting: (p62<=1)
states: 12,873,912 (7)
abstracting: (1<=p62)
states: 344,952 (5)
abstracting: (p62<=1)
states: 12,873,912 (7)
.
EG iterations: 1

before gc: list nodes free: 5223273

after gc: idd nodes used:2367826, unused:61632174; list nodes free:285078219
abstracting: (1<=p5)
states: 1,753,489 (6)
abstracting: (p5<=1)
states: 12,873,912 (7)
abstracting: (1<=p155)
states: 80,910 (4)
abstracting: (p155<=1)
states: 12,873,912 (7)
.
EG iterations: 1
abstracting: (1<=p10)
states: 1,913,853 (6)
abstracting: (p10<=1)
states: 12,873,912 (7)
abstracting: (1<=p26)
states: 904,990 (5)
abstracting: (p26<=1)
states: 12,873,912 (7)
abstracting: (1<=p10)
states: 1,913,853 (6)
abstracting: (p10<=1)
states: 12,873,912 (7)
abstracting: (1<=p54)
states: 967,349 (5)
abstracting: (p54<=1)
states: 12,873,912 (7)
abstracting: (1<=p15)
states: 526,080 (5)
abstracting: (p15<=1)
states: 12,873,912 (7)
abstracting: (1<=p39)
states: 879,509 (5)
abstracting: (p39<=1)
states: 12,873,912 (7)
abstracting: (1<=p15)
states: 526,080 (5)
abstracting: (p15<=1)
states: 12,873,912 (7)
abstracting: (1<=p52)
states: 922,562 (5)
abstracting: (p52<=1)
states: 12,873,912 (7)
abstracting: (1<=p14)
states: 763,200 (5)
abstracting: (p14<=1)
states: 12,873,912 (7)
abstracting: (1<=p20)
states: 937,328 (5)
abstracting: (p20<=1)
states: 12,873,912 (7)
abstracting: (1<=p17)
states: 115,200 (5)
abstracting: (p17<=1)
states: 12,873,912 (7)
abstracting: (1<=p28)
states: 894,748 (5)
abstracting: (p28<=1)
states: 12,873,912 (7)
abstracting: (1<=p4)
states: 1,548,389 (6)
abstracting: (p4<=1)
states: 12,873,912 (7)
abstracting: (1<=p120)
states: 501,672 (5)
abstracting: (p120<=1)
states: 12,873,912 (7)
MC time: 4m56.066sec

checking: ~ [A [[[~ [[AG [[p92<=1 & 1<=p92]] | A [[[p13<=1 & 1<=p13] & [p21<=1 & 1<=p21]] U [[p0<=1 & 1<=p0] & [p203<=1 & 1<=p203]]]]] | [[[p11<=1 & 1<=p11] & [p52<=1 & 1<=p52]] | EG [[[[[p7<=1 & 1<=p7] & [p19<=1 & 1<=p19]] & [[p15<=1 & 1<=p15] & [p41<=1 & 1<=p41]]] | [[p13<=1 & 1<=p13] & [p49<=1 & 1<=p49]]]]]] | [AX [~ [[[p3<=1 & 1<=p3] & [p151<=1 & 1<=p151]]]] | [[[[[p10<=1 & 1<=p10] & [p23<=1 & 1<=p23]] | [[p6<=1 & 1<=p6] & [p148<=1 & 1<=p148]]] & AG [[[p17<=1 & 1<=p17] & [p38<=1 & 1<=p38]]]] | EG [[[p5<=1 & 1<=p5] & [p131<=1 & 1<=p131]]]]]] U ~ [AF [~ [E [[[p8<=1 & 1<=p8] & [p46<=1 & 1<=p46]] U [[p14<=1 & 1<=p14] & [p54<=1 & 1<=p54]]]]]]]]
normalized: ~ [[~ [EG [~ [EG [E [[[p46<=1 & 1<=p46] & [p8<=1 & 1<=p8]] U [[p54<=1 & 1<=p54] & [p14<=1 & 1<=p14]]]]]]] & ~ [E [~ [EG [E [[[p46<=1 & 1<=p46] & [p8<=1 & 1<=p8]] U [[p54<=1 & 1<=p54] & [p14<=1 & 1<=p14]]]]] U [~ [[[[EG [[[p131<=1 & 1<=p131] & [p5<=1 & 1<=p5]]] | [~ [E [true U ~ [[[p38<=1 & 1<=p38] & [p17<=1 & 1<=p17]]]]] & [[[p148<=1 & 1<=p148] & [p6<=1 & 1<=p6]] | [[p23<=1 & 1<=p23] & [p10<=1 & 1<=p10]]]]] | ~ [EX [[[p151<=1 & 1<=p151] & [p3<=1 & 1<=p3]]]]] | [[EG [[[[p49<=1 & 1<=p49] & [p13<=1 & 1<=p13]] | [[[p41<=1 & 1<=p41] & [p15<=1 & 1<=p15]] & [[p19<=1 & 1<=p19] & [p7<=1 & 1<=p7]]]]] | [[p52<=1 & 1<=p52] & [p11<=1 & 1<=p11]]] | ~ [[[~ [EG [~ [[[p203<=1 & 1<=p203] & [p0<=1 & 1<=p0]]]]] & ~ [E [~ [[[p203<=1 & 1<=p203] & [p0<=1 & 1<=p0]]] U [~ [[[p21<=1 & 1<=p21] & [p13<=1 & 1<=p13]]] & ~ [[[p203<=1 & 1<=p203] & [p0<=1 & 1<=p0]]]]]]] | ~ [E [true U ~ [[p92<=1 & 1<=p92]]]]]]]]] & ~ [EG [E [[[p46<=1 & 1<=p46] & [p8<=1 & 1<=p8]] U [[p54<=1 & 1<=p54] & [p14<=1 & 1<=p14]]]]]]]]]]

abstracting: (1<=p14)
states: 763,200 (5)
abstracting: (p14<=1)
states: 12,873,912 (7)
abstracting: (1<=p54)
states: 967,349 (5)
abstracting: (p54<=1)
states: 12,873,912 (7)
abstracting: (1<=p8)
states: 1,216,530 (6)
abstracting: (p8<=1)
states: 12,873,912 (7)
abstracting: (1<=p46)
states: 887,032 (5)
abstracting: (p46<=1)
states: 12,873,912 (7)
...............
EG iterations: 15
abstracting: (1<=p92)
states: 415,458 (5)
abstracting: (p92<=1)
states: 12,873,912 (7)
abstracting: (1<=p0)
states: 3,083,726 (6)
abstracting: (p0<=1)
states: 12,873,912 (7)
abstracting: (1<=p203)
states: 83,910 (4)
abstracting: (p203<=1)
states: 12,873,912 (7)
abstracting: (1<=p13)
states: 966,336 (5)
abstracting: (p13<=1)
states: 12,873,912 (7)
abstracting: (1<=p21)
states: 927,470 (5)
abstracting: (p21<=1)
states: 12,873,912 (7)
abstracting: (1<=p0)
states: 3,083,726 (6)
abstracting: (p0<=1)
states: 12,873,912 (7)
abstracting: (1<=p203)
states: 83,910 (4)
abstracting: (p203<=1)
states: 12,873,912 (7)
abstracting: (1<=p0)
states: 3,083,726 (6)
abstracting: (p0<=1)
states: 12,873,912 (7)
abstracting: (1<=p203)
states: 83,910 (4)
abstracting: (p203<=1)
states: 12,873,912 (7)
..................................
EG iterations: 34
abstracting: (1<=p11)
states: 2,146,075 (6)
abstracting: (p11<=1)
states: 12,873,912 (7)
abstracting: (1<=p52)
states: 922,562 (5)
abstracting: (p52<=1)
states: 12,873,912 (7)
abstracting: (1<=p7)
states: 1,090,680 (6)
abstracting: (p7<=1)
states: 12,873,912 (7)
abstracting: (1<=p19)
states: 950,565 (5)
abstracting: (p19<=1)
states: 12,873,912 (7)
abstracting: (1<=p15)
states: 526,080 (5)
abstracting: (p15<=1)
states: 12,873,912 (7)
abstracting: (1<=p41)
states: 876,269 (5)
abstracting: (p41<=1)
states: 12,873,912 (7)
abstracting: (1<=p13)
states: 966,336 (5)
abstracting: (p13<=1)
states: 12,873,912 (7)
abstracting: (1<=p49)
states: 950,565 (5)
abstracting: (p49<=1)
states: 12,873,912 (7)
..................
EG iterations: 18
abstracting: (1<=p3)
states: 1,522,919 (6)
abstracting: (p3<=1)
states: 12,873,912 (7)
abstracting: (1<=p151)
states: 74,784 (4)
abstracting: (p151<=1)
states: 12,873,912 (7)
.abstracting: (1<=p10)
states: 1,913,853 (6)
abstracting: (p10<=1)
states: 12,873,912 (7)
abstracting: (1<=p23)
states: 922,562 (5)
abstracting: (p23<=1)
states: 12,873,912 (7)
abstracting: (1<=p6)
states: 1,862,911 (6)
abstracting: (p6<=1)
states: 12,873,912 (7)
abstracting: (1<=p148)
states: 95,765 (4)
abstracting: (p148<=1)
states: 12,873,912 (7)
abstracting: (1<=p17)
states: 115,200 (5)
abstracting: (p17<=1)
states: 12,873,912 (7)
abstracting: (1<=p38)
states: 886,487 (5)
abstracting: (p38<=1)
states: 12,873,912 (7)
abstracting: (1<=p5)
states: 1,753,489 (6)
abstracting: (p5<=1)
states: 12,873,912 (7)
abstracting: (1<=p131)
states: 475,078 (5)
abstracting: (p131<=1)
states: 12,873,912 (7)
............
EG iterations: 12
abstracting: (1<=p14)
states: 763,200 (5)
abstracting: (p14<=1)
states: 12,873,912 (7)
abstracting: (1<=p54)
states: 967,349 (5)
abstracting: (p54<=1)
states: 12,873,912 (7)
abstracting: (1<=p8)
states: 1,216,530 (6)
abstracting: (p8<=1)
states: 12,873,912 (7)
abstracting: (1<=p46)
states: 887,032 (5)
abstracting: (p46<=1)
states: 12,873,912 (7)
...............
EG iterations: 15
abstracting: (1<=p14)
states: 763,200 (5)
abstracting: (p14<=1)
states: 12,873,912 (7)
abstracting: (1<=p54)
states: 967,349 (5)
abstracting: (p54<=1)
states: 12,873,912 (7)
abstracting: (1<=p8)
states: 1,216,530 (6)
abstracting: (p8<=1)
states: 12,873,912 (7)
abstracting: (1<=p46)
states: 887,032 (5)
abstracting: (p46<=1)
states: 12,873,912 (7)
...............
EG iterations: 15

EG iterations: 0
-> the formula is TRUE

FORMULA Anderson-PT-06-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m15.140sec

checking: [EG [[A [~ [EG [[[p10<=1 & 1<=p10] & [p48<=1 & 1<=p48]]]] U [EX [[[p3<=1 & 1<=p3] & [p169<=1 & 1<=p169]]] & EG [[[p15<=1 & 1<=p15] & [p49<=1 & 1<=p49]]]]] | EX [AG [[[p3<=0 & 0<=p3] | [p127<=0 & 0<=p127]]]]]] & [A [[[[~ [EG [[[p12<=1 & 1<=p12] & [p28<=1 & 1<=p28]]]] & ~ [[[p6<=1 & 1<=p6] & [p112<=1 & 1<=p112]]]] & [[p7<=1 & 1<=p7] & [p40<=1 & 1<=p40]]] | ~ [EG [[[p14<=1 & 1<=p14] & [p28<=1 & 1<=p28]]]]] U AF [AX [[[p84<=1 & 1<=p84] & [[p0<=1 & 1<=p0] & [p198<=1 & 1<=p198]]]]]] & EF [[[AX [E [[[p9<=1 & 1<=p9] & [p19<=1 & 1<=p19]] U [[p13<=1 & 1<=p13] & [p20<=1 & 1<=p20]]]] & AX [[[p17<=1 & 1<=p17] & [p45<=1 & 1<=p45]]]] & [EF [[[p17<=1 & 1<=p17] & [p49<=1 & 1<=p49]]] & A [E [[p88<=1 & 1<=p88] U [[p13<=1 & 1<=p13] & [p32<=1 & 1<=p32]]] U [[[p16<=1 & 1<=p16] & [p33<=1 & 1<=p33]] | [[p17<=1 & 1<=p17] & [p82<=1 & 1<=p82]]]]]]]]]
normalized: [[E [true U [[[~ [EG [~ [[[[p82<=1 & 1<=p82] & [p17<=1 & 1<=p17]] | [[p33<=1 & 1<=p33] & [p16<=1 & 1<=p16]]]]]] & ~ [E [~ [[[[p82<=1 & 1<=p82] & [p17<=1 & 1<=p17]] | [[p33<=1 & 1<=p33] & [p16<=1 & 1<=p16]]]] U [~ [E [[p88<=1 & 1<=p88] U [[p32<=1 & 1<=p32] & [p13<=1 & 1<=p13]]]] & ~ [[[[p82<=1 & 1<=p82] & [p17<=1 & 1<=p17]] | [[p33<=1 & 1<=p33] & [p16<=1 & 1<=p16]]]]]]]] & E [true U [[p49<=1 & 1<=p49] & [p17<=1 & 1<=p17]]]] & [~ [EX [~ [[[p45<=1 & 1<=p45] & [p17<=1 & 1<=p17]]]]] & ~ [EX [~ [E [[[p19<=1 & 1<=p19] & [p9<=1 & 1<=p9]] U [[p20<=1 & 1<=p20] & [p13<=1 & 1<=p13]]]]]]]]] & [~ [EG [EG [EX [~ [[[[p198<=1 & 1<=p198] & [p0<=1 & 1<=p0]] & [p84<=1 & 1<=p84]]]]]]] & ~ [E [EG [EX [~ [[[[p198<=1 & 1<=p198] & [p0<=1 & 1<=p0]] & [p84<=1 & 1<=p84]]]]] U [~ [[~ [EG [[[p28<=1 & 1<=p28] & [p14<=1 & 1<=p14]]]] | [[[p40<=1 & 1<=p40] & [p7<=1 & 1<=p7]] & [~ [[[p112<=1 & 1<=p112] & [p6<=1 & 1<=p6]]] & ~ [EG [[[p28<=1 & 1<=p28] & [p12<=1 & 1<=p12]]]]]]]] & EG [EX [~ [[[[p198<=1 & 1<=p198] & [p0<=1 & 1<=p0]] & [p84<=1 & 1<=p84]]]]]]]]]] & EG [[EX [~ [E [true U ~ [[[p127<=0 & 0<=p127] | [p3<=0 & 0<=p3]]]]]] | [~ [EG [~ [[EG [[[p49<=1 & 1<=p49] & [p15<=1 & 1<=p15]]] & EX [[[p169<=1 & 1<=p169] & [p3<=1 & 1<=p3]]]]]]] & ~ [E [~ [[EG [[[p49<=1 & 1<=p49] & [p15<=1 & 1<=p15]]] & EX [[[p169<=1 & 1<=p169] & [p3<=1 & 1<=p3]]]]] U [EG [[[p48<=1 & 1<=p48] & [p10<=1 & 1<=p10]]] & ~ [[EG [[[p49<=1 & 1<=p49] & [p15<=1 & 1<=p15]]] & EX [[[p169<=1 & 1<=p169] & [p3<=1 & 1<=p3]]]]]]]]]]]]

abstracting: (1<=p3)
states: 1,522,919 (6)
abstracting: (p3<=1)
states: 12,873,912 (7)
abstracting: (1<=p169)
states: 75,552 (4)
abstracting: (p169<=1)
states: 12,873,912 (7)
.abstracting: (1<=p15)
states: 526,080 (5)
abstracting: (p15<=1)
states: 12,873,912 (7)
abstracting: (1<=p49)
states: 950,565 (5)
abstracting: (p49<=1)
states: 12,873,912 (7)
............
EG iterations: 12
abstracting: (1<=p10)
states: 1,913,853 (6)
abstracting: (p10<=1)
states: 12,873,912 (7)
abstracting: (1<=p48)
states: 922,808 (5)
abstracting: (p48<=1)
states: 12,873,912 (7)
.....................
EG iterations: 21
abstracting: (1<=p3)
states: 1,522,919 (6)
abstracting: (p3<=1)
states: 12,873,912 (7)
abstracting: (1<=p169)
states: 75,552 (4)
abstracting: (p169<=1)
states: 12,873,912 (7)
.abstracting: (1<=p15)
states: 526,080 (5)
abstracting: (p15<=1)
states: 12,873,912 (7)
abstracting: (1<=p49)
states: 950,565 (5)
abstracting: (p49<=1)
states: 12,873,912 (7)
............
EG iterations: 12
abstracting: (1<=p3)
states: 1,522,919 (6)
abstracting: (p3<=1)
states: 12,873,912 (7)
abstracting: (1<=p169)
states: 75,552 (4)
abstracting: (p169<=1)
states: 12,873,912 (7)
.abstracting: (1<=p15)
states: 526,080 (5)
abstracting: (p15<=1)
states: 12,873,912 (7)
abstracting: (1<=p49)
states: 950,565 (5)
abstracting: (p49<=1)
states: 12,873,912 (7)
............
EG iterations: 12

EG iterations: 0
abstracting: (0<=p3)
states: 12,873,912 (7)
abstracting: (p3<=0)
states: 11,350,993 (7)
abstracting: (0<=p127)
states: 12,873,912 (7)
abstracting: (p127<=0)
states: 12,418,344 (7)
..
EG iterations: 1
abstracting: (1<=p84)
states: 423,376 (5)
abstracting: (p84<=1)
states: 12,873,912 (7)
abstracting: (1<=p0)
states: 3,083,726 (6)
abstracting: (p0<=1)
states: 12,873,912 (7)
abstracting: (1<=p198)
states: 83,028 (4)
abstracting: (p198<=1)
states: 12,873,912 (7)
.
EG iterations: 0
abstracting: (1<=p12)
states: 2,176,055 (6)
abstracting: (p12<=1)
states: 12,873,912 (7)
abstracting: (1<=p28)
states: 894,748 (5)
abstracting: (p28<=1)
states: 12,873,912 (7)
......................
EG iterations: 22
abstracting: (1<=p6)
states: 1,862,911 (6)
abstracting: (p6<=1)
states: 12,873,912 (7)
abstracting: (1<=p112)
states: 493,205 (5)
abstracting: (p112<=1)
states: 12,873,912 (7)
abstracting: (1<=p7)
states: 1,090,680 (6)
abstracting: (p7<=1)
states: 12,873,912 (7)
abstracting: (1<=p40)
states: 876,269 (5)
abstracting: (p40<=1)
states: 12,873,912 (7)
abstracting: (1<=p14)
states: 763,200 (5)
abstracting: (p14<=1)
states: 12,873,912 (7)
abstracting: (1<=p28)
states: 894,748 (5)
abstracting: (p28<=1)
states: 12,873,912 (7)
...............
EG iterations: 15
abstracting: (1<=p84)
states: 423,376 (5)
abstracting: (p84<=1)
states: 12,873,912 (7)
abstracting: (1<=p0)
states: 3,083,726 (6)
abstracting: (p0<=1)
states: 12,873,912 (7)
abstracting: (1<=p198)
states: 83,028 (4)
abstracting: (p198<=1)
states: 12,873,912 (7)
.
EG iterations: 0
abstracting: (1<=p84)
states: 423,376 (5)
abstracting: (p84<=1)
states: 12,873,912 (7)
abstracting: (1<=p0)
states: 3,083,726 (6)
abstracting: (p0<=1)
states: 12,873,912 (7)
abstracting: (1<=p198)
states: 83,028 (4)
abstracting: (p198<=1)
states: 12,873,912 (7)
.
EG iterations: 0

EG iterations: 0
abstracting: (1<=p13)
states: 966,336 (5)
abstracting: (p13<=1)
states: 12,873,912 (7)
abstracting: (1<=p20)
states: 937,328 (5)
abstracting: (p20<=1)
states: 12,873,912 (7)
abstracting: (1<=p9)
states: 1,643,103 (6)
abstracting: (p9<=1)
states: 12,873,912 (7)
abstracting: (1<=p19)
states: 950,565 (5)
abstracting: (p19<=1)
states: 12,873,912 (7)
.abstracting: (1<=p17)
states: 115,200 (5)
abstracting: (p17<=1)
states: 12,873,912 (7)
abstracting: (1<=p45)
states: 891,940 (5)
abstracting: (p45<=1)
states: 12,873,912 (7)
.abstracting: (1<=p17)
states: 115,200 (5)
abstracting: (p17<=1)
states: 12,873,912 (7)
abstracting: (1<=p49)
states: 950,565 (5)
abstracting: (p49<=1)
states: 12,873,912 (7)

before gc: list nodes free: 4628002

after gc: idd nodes used:2904771, unused:61095229; list nodes free:282683715
MC time: 4m29.000sec

checking: ~ [E [~ [AX [EG [[[p5<=1 & 1<=p5] & [p125<=1 & 1<=p125]]]]] U [[EF [[[p17<=1 & 1<=p17] & [p32<=1 & 1<=p32]]] | EX [~ [[[p10<=1 & 1<=p10] & [p52<=1 & 1<=p52]]]]] & [[p13<=1 & 1<=p13] & [p29<=1 & 1<=p29]]]]]
normalized: ~ [E [EX [~ [EG [[[p125<=1 & 1<=p125] & [p5<=1 & 1<=p5]]]]] U [[[p29<=1 & 1<=p29] & [p13<=1 & 1<=p13]] & [EX [~ [[[p52<=1 & 1<=p52] & [p10<=1 & 1<=p10]]]] | E [true U [[p32<=1 & 1<=p32] & [p17<=1 & 1<=p17]]]]]]]

abstracting: (1<=p17)
states: 115,200 (5)
abstracting: (p17<=1)
states: 12,873,912 (7)
abstracting: (1<=p32)
states: 904,990 (5)
abstracting: (p32<=1)
states: 12,873,912 (7)
abstracting: (1<=p10)
states: 1,913,853 (6)
abstracting: (p10<=1)
states: 12,873,912 (7)
abstracting: (1<=p52)
states: 922,562 (5)
abstracting: (p52<=1)
states: 12,873,912 (7)
.abstracting: (1<=p13)
states: 966,336 (5)
abstracting: (p13<=1)
states: 12,873,912 (7)
abstracting: (1<=p29)
states: 894,748 (5)
abstracting: (p29<=1)
states: 12,873,912 (7)
abstracting: (1<=p5)
states: 1,753,489 (6)
abstracting: (p5<=1)
states: 12,873,912 (7)
abstracting: (1<=p125)
states: 454,992 (5)
abstracting: (p125<=1)
states: 12,873,912 (7)
............
EG iterations: 12
.
before gc: list nodes free: 1151513

after gc: idd nodes used:2947606, unused:61052394; list nodes free:282505522
-> the formula is FALSE

FORMULA Anderson-PT-06-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m22.925sec

checking: AX [AF [[~ [E [AG [[[1<=p16 & p16<=1] & [p47<=1 & 1<=p47]]] U [[1<=p66 & p66<=1] & [p17<=1 & 1<=p17]]]] & [AG [[[p9<=0 & 0<=p9] | [p30<=0 & 0<=p30]]] & [AG [[p68<=0 & 0<=p68]] | [[p15<=0 & 0<=p15] | [p34<=0 & 0<=p34]]]]]]]
normalized: ~ [EX [EG [~ [[~ [E [~ [E [true U ~ [[[p47<=1 & 1<=p47] & [1<=p16 & p16<=1]]]]] U [[p17<=1 & 1<=p17] & [1<=p66 & p66<=1]]]] & [[[[p34<=0 & 0<=p34] | [p15<=0 & 0<=p15]] | ~ [E [true U ~ [[p68<=0 & 0<=p68]]]]] & ~ [E [true U ~ [[[p30<=0 & 0<=p30] | [p9<=0 & 0<=p9]]]]]]]]]]]

abstracting: (0<=p9)
states: 12,873,912 (7)
abstracting: (p9<=0)
states: 11,230,809 (7)
abstracting: (0<=p30)
states: 12,873,912 (7)
abstracting: (p30<=0)
states: 11,946,102 (7)
abstracting: (0<=p68)
states: 12,873,912 (7)
abstracting: (p68<=0)
states: 12,615,768 (7)

before gc: list nodes free: 1657133

after gc: idd nodes used:2963775, unused:61036225; list nodes free:284541983

before gc: list nodes free: 1765533

after gc: idd nodes used:2978943, unused:61021057; list nodes free:284479707

before gc: list nodes free: 1107184

after gc: idd nodes used:2968386, unused:61031614; list nodes free:284524583
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5991448 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16103532 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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.001sec

20581 49644 60329 118035 156534 150634 163760 159037 171591 171015 206294 192312 192739 244733 213083 262547 230725 256365 266728 269609 275114 286362 332676 336415 304696 339564 358168 327809 312944 354084 369164 336917
iterations count:3255724 (5623), effective:37608 (64)

initing FirstDep: 0m 0.002sec

107890 122669 192021 227492
iterations count:431585 (745), effective:7120 (12)
161050 246963 274167
iterations count:335218 (578), effective:5340 (9)

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

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

iterations count:806 (1), effective:5 (0)
17169 21489 25509 44958 70443 89400 154238 168548 196733 194597 203865 225998 221653 214655
iterations count:1451401 (2506), effective:20891 (36)
126869 149298 219912 246426 244476
sat_reach.icc:155: Timeout: after 279 sec


iterations count:2066 (3), effective:5 (0)

iterations count:579 (1), effective:0 (0)
114342 139147 209207 224729 226220
iterations count:524972 (906), effective:8321 (14)
132562 151491 152531 227784 231698 238496
sat_reach.icc:155: Timeout: after 254 sec

146339 169999 236984 262665 273037
iterations count:570355 (985), effective:8101 (13)

sat_reach.icc:155: Timeout: after 251 sec


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

iterations count:2351 (4), effective:5 (0)

iterations count:7947 (13), effective:102 (0)

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

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

iterations count:15031 (25), effective:166 (0)

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

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

iterations count:8832 (15), effective:90 (0)

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

iterations count:11849 (20), effective:140 (0)

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

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

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

iterations count:26085 (45), effective:304 (0)

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

iterations count:5290 (9), effective:89 (0)

iterations count:1670 (2), effective:27 (0)
81628 142337 159829 165387 236645 247376 259804 255745 275562 277672 278395 278702 278934 276861 276528 275915 276251
iterations count:1789751 (3091), effective:23599 (40)

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

iterations count:10798 (18), effective:133 (0)
147109
sat_reach.icc:155: Timeout: after 295 sec


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

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

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

iterations count:2349 (4), effective:5 (0)

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

iterations count:579 (1), effective:0 (0)
148445 199154 209564 269361
iterations count:491923 (849), effective:8111 (14)

iterations count:579 (1), effective:0 (0)
25731 63122 72209 146144 150799 177573
sat_reach.icc:155: Timeout: after 268 sec

17169 21489 25509 44958 70443 89400 154238 168548 196733 194597 203865 225998 221653 214655
iterations count:1451401 (2506), effective:20891 (36)
126869 149298 219912 246426 244476 251041
iterations count:639758 (1104), effective:9481 (16)
114342 139147 209207 224729 226220
iterations count:524972 (906), effective:8321 (14)
132562 151491 152531 227784 231698 238496 253190 268647 265360 260108 256877 266957 275530 279588 276585 281973 281973 282281 283909 281621 279974 278635 280272 278203 280320 280973 291031 297460 298262 302108 301603 303564 305552 304390 305834 306717 306034 303436 303935 303330 303489 299517 302127 301140 299165 304738 305218 308863 310314 308174 308931 309745 306342 312526 313491 312019 307998 309677 304570 307980 307163 304186 306207 305835 301014 307398 309254 308920 311611 312301 309189 312256 313342 309841 308745 309807 305123 307689 307113 306239 306395 300227 303187 304003 301911 297597 299736 300998 302459 300625 302984 300937 302736 303418 299928 301296 299873 299921 298047 300120 298331 300760 301327

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="Anderson-PT-06"
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 Anderson-PT-06, 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 r522-tall-167987246800018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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