About the Execution of Marcie+red for Anderson-PT-04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5749.283 | 19491.00 | 25856.00 | 239.20 | TTFFFFTTTTTTTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r522-tall-167987246800002.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-04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987246800002
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 6.4K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 23 15:20 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 103K 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-04-CTLFireability-00
FORMULA_NAME Anderson-PT-04-CTLFireability-01
FORMULA_NAME Anderson-PT-04-CTLFireability-02
FORMULA_NAME Anderson-PT-04-CTLFireability-03
FORMULA_NAME Anderson-PT-04-CTLFireability-04
FORMULA_NAME Anderson-PT-04-CTLFireability-05
FORMULA_NAME Anderson-PT-04-CTLFireability-06
FORMULA_NAME Anderson-PT-04-CTLFireability-07
FORMULA_NAME Anderson-PT-04-CTLFireability-08
FORMULA_NAME Anderson-PT-04-CTLFireability-09
FORMULA_NAME Anderson-PT-04-CTLFireability-10
FORMULA_NAME Anderson-PT-04-CTLFireability-11
FORMULA_NAME Anderson-PT-04-CTLFireability-12
FORMULA_NAME Anderson-PT-04-CTLFireability-13
FORMULA_NAME Anderson-PT-04-CTLFireability-14
FORMULA_NAME Anderson-PT-04-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1680839021824
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-04
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 03:43:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 03:43:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:43:43] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2023-04-07 03:43:43] [INFO ] Transformed 105 places.
[2023-04-07 03:43:43] [INFO ] Transformed 200 transitions.
[2023-04-07 03:43:43] [INFO ] Found NUPN structural information;
[2023-04-07 03:43:43] [INFO ] Parsed PT model containing 105 places and 200 transitions and 752 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 56 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 200/200 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 99 transition count 194
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 99 transition count 194
Applied a total of 12 rules in 16 ms. Remains 99 /105 variables (removed 6) and now considering 194/200 (removed 6) transitions.
// Phase 1: matrix 194 rows 99 cols
[2023-04-07 03:43:43] [INFO ] Computed 11 invariants in 19 ms
[2023-04-07 03:43:43] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-04-07 03:43:43] [INFO ] Invariant cache hit.
[2023-04-07 03:43:43] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 03:43:43] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2023-04-07 03:43:43] [INFO ] Invariant cache hit.
[2023-04-07 03:43:43] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/105 places, 194/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 99/105 places, 194/200 transitions.
Support contains 56 out of 99 places after structural reductions.
[2023-04-07 03:43:44] [INFO ] Flatten gal took : 37 ms
[2023-04-07 03:43:44] [INFO ] Flatten gal took : 22 ms
[2023-04-07 03:43:44] [INFO ] Input system was already deterministic with 194 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 71) seen :52
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 :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) 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 15) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) 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 14) 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 14) 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 11) seen :3
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-04-07 03:43:44] [INFO ] Invariant cache hit.
[2023-04-07 03:43:44] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 03:43:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-04-07 03:43:44] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 5 ms returned sat
[2023-04-07 03:43:44] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-04-07 03:43:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 03:43:44] [INFO ] After 69ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :3 sat :5
[2023-04-07 03:43:45] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-04-07 03:43:45] [INFO ] After 426ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 8 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 194/194 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 99 transition count 182
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 87 transition count 182
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 75 transition count 134
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 75 transition count 134
Applied a total of 48 rules in 17 ms. Remains 75 /99 variables (removed 24) and now considering 134/194 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 75/99 places, 134/194 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Finished Best-First random walk after 4358 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1089 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA Anderson-PT-04-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 13 ms
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 12 ms
[2023-04-07 03:43:45] [INFO ] Input system was already deterministic with 194 transitions.
Support contains 51 out of 99 places (down from 54) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 194/194 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 99 transition count 182
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 87 transition count 182
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 40 place count 71 transition count 106
Iterating global reduction 0 with 16 rules applied. Total rules applied 56 place count 71 transition count 106
Applied a total of 56 rules in 11 ms. Remains 71 /99 variables (removed 28) and now considering 106/194 (removed 88) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 71/99 places, 106/194 transitions.
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:43:45] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 194/194 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 84 transition count 113
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 84 transition count 113
Applied a total of 30 rules in 5 ms. Remains 84 /99 variables (removed 15) and now considering 113/194 (removed 81) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 84/99 places, 113/194 transitions.
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:43:45] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 194/194 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 84 transition count 125
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 84 transition count 125
Applied a total of 30 rules in 5 ms. Remains 84 /99 variables (removed 15) and now considering 125/194 (removed 69) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 84/99 places, 125/194 transitions.
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:43:45] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 194/194 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 85 transition count 132
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 85 transition count 132
Applied a total of 28 rules in 5 ms. Remains 85 /99 variables (removed 14) and now considering 132/194 (removed 62) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 85/99 places, 132/194 transitions.
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:43:45] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 194/194 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 82 transition count 111
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 82 transition count 111
Applied a total of 34 rules in 5 ms. Remains 82 /99 variables (removed 17) and now considering 111/194 (removed 83) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 82/99 places, 111/194 transitions.
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:43:45] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 194/194 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 83 transition count 118
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 83 transition count 118
Applied a total of 32 rules in 4 ms. Remains 83 /99 variables (removed 16) and now considering 118/194 (removed 76) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 83/99 places, 118/194 transitions.
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:43:45] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 194/194 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 84 transition count 125
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 84 transition count 125
Applied a total of 30 rules in 2 ms. Remains 84 /99 variables (removed 15) and now considering 125/194 (removed 69) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 84/99 places, 125/194 transitions.
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:43:45] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 194/194 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 85 transition count 120
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 85 transition count 120
Applied a total of 28 rules in 2 ms. Remains 85 /99 variables (removed 14) and now considering 120/194 (removed 74) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 85/99 places, 120/194 transitions.
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:43:45] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 194/194 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 83 transition count 118
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 83 transition count 118
Applied a total of 32 rules in 3 ms. Remains 83 /99 variables (removed 16) and now considering 118/194 (removed 76) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 83/99 places, 118/194 transitions.
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 5 ms
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:43:45] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 194/194 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 82 transition count 111
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 82 transition count 111
Applied a total of 34 rules in 2 ms. Remains 82 /99 variables (removed 17) and now considering 111/194 (removed 83) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 82/99 places, 111/194 transitions.
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 4 ms
[2023-04-07 03:43:45] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 194/194 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 90 transition count 155
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 90 transition count 155
Applied a total of 18 rules in 1 ms. Remains 90 /99 variables (removed 9) and now considering 155/194 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 90/99 places, 155/194 transitions.
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:43:45] [INFO ] Input system was already deterministic with 155 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 194/194 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 85 transition count 132
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 85 transition count 132
Applied a total of 28 rules in 6 ms. Remains 85 /99 variables (removed 14) and now considering 132/194 (removed 62) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 85/99 places, 132/194 transitions.
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 5 ms
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:43:45] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 194/194 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 99 transition count 182
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 87 transition count 182
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 40 place count 71 transition count 106
Iterating global reduction 0 with 16 rules applied. Total rules applied 56 place count 71 transition count 106
Applied a total of 56 rules in 7 ms. Remains 71 /99 variables (removed 28) and now considering 106/194 (removed 88) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 71/99 places, 106/194 transitions.
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 5 ms
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 4 ms
[2023-04-07 03:43:45] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 194/194 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 85 transition count 132
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 85 transition count 132
Applied a total of 28 rules in 2 ms. Remains 85 /99 variables (removed 14) and now considering 132/194 (removed 62) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 85/99 places, 132/194 transitions.
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 5 ms
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 5 ms
[2023-04-07 03:43:45] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 194/194 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 85 transition count 132
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 85 transition count 132
Applied a total of 28 rules in 2 ms. Remains 85 /99 variables (removed 14) and now considering 132/194 (removed 62) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 85/99 places, 132/194 transitions.
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 5 ms
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 5 ms
[2023-04-07 03:43:45] [INFO ] Input system was already deterministic with 132 transitions.
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:43:45] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:43:45] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-04-07 03:43:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 99 places, 194 transitions and 740 arcs took 1 ms.
Total runtime 2781 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: 99 NrTr: 194 NrArc: 740)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec
net check time: 0m 0.000sec
init dd package: 0m 2.728sec
RS generation: 0m 0.810sec
-> reachability set: #nodes 12253 (1.2e+04) #states 24,568 (4)
starting MCC model checker
--------------------------
checking: E [EF [[[p27<=1 & 1<=p27] & [1<=p5 & p5<=1]]] U [[p7<=1 & 1<=p7] & [p28<=1 & 1<=p28]]]
normalized: E [E [true U [[p27<=1 & 1<=p27] & [1<=p5 & p5<=1]]] U [[p7<=1 & 1<=p7] & [p28<=1 & 1<=p28]]]
abstracting: (1<=p28)
states: 2,387 (3)
abstracting: (p28<=1)
states: 24,568 (4)
abstracting: (1<=p7)
states: 5,243 (3)
abstracting: (p7<=1)
states: 24,568 (4)
abstracting: (p5<=1)
states: 24,568 (4)
abstracting: (1<=p5)
states: 3,422 (3)
abstracting: (1<=p27)
states: 2,224 (3)
abstracting: (p27<=1)
states: 24,568 (4)
-> the formula is TRUE
FORMULA Anderson-PT-04-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.281sec
checking: AX [AF [~ [E [AG [[[p6<=1 & 1<=p6] & [p17<=1 & 1<=p17]]] U ~ [[[p1<=1 & 1<=p1] & [p78<=1 & 1<=p78]]]]]]]
normalized: ~ [EX [EG [E [~ [E [true U ~ [[[p17<=1 & 1<=p17] & [p6<=1 & 1<=p6]]]]] U ~ [[[p78<=1 & 1<=p78] & [p1<=1 & 1<=p1]]]]]]]
abstracting: (1<=p1)
states: 4,495 (3)
abstracting: (p1<=1)
states: 24,568 (4)
abstracting: (1<=p78)
states: 384
abstracting: (p78<=1)
states: 24,568 (4)
abstracting: (1<=p6)
states: 4,164 (3)
abstracting: (p6<=1)
states: 24,568 (4)
abstracting: (1<=p17)
states: 2,314 (3)
abstracting: (p17<=1)
states: 24,568 (4)
.....................
EG iterations: 21
.-> the formula is FALSE
FORMULA Anderson-PT-04-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.828sec
checking: EF [AG [~ [A [~ [AX [[[p10<=1 & 1<=p10] & [p13<=1 & 1<=p13]]]] U AG [[[p11<=1 & 1<=p11] & [p27<=1 & 1<=p27]]]]]]]
normalized: E [true U ~ [E [true U [~ [EG [E [true U ~ [[[p27<=1 & 1<=p27] & [p11<=1 & 1<=p11]]]]]] & ~ [E [E [true U ~ [[[p27<=1 & 1<=p27] & [p11<=1 & 1<=p11]]]] U [~ [EX [~ [[[p13<=1 & 1<=p13] & [p10<=1 & 1<=p10]]]]] & E [true U ~ [[[p27<=1 & 1<=p27] & [p11<=1 & 1<=p11]]]]]]]]]]]
abstracting: (1<=p11)
states: 840
abstracting: (p11<=1)
states: 24,568 (4)
abstracting: (1<=p27)
states: 2,224 (3)
abstracting: (p27<=1)
states: 24,568 (4)
abstracting: (1<=p10)
states: 1,836 (3)
abstracting: (p10<=1)
states: 24,568 (4)
abstracting: (1<=p13)
states: 2,433 (3)
abstracting: (p13<=1)
states: 24,568 (4)
.abstracting: (1<=p11)
states: 840
abstracting: (p11<=1)
states: 24,568 (4)
abstracting: (1<=p27)
states: 2,224 (3)
abstracting: (p27<=1)
states: 24,568 (4)
abstracting: (1<=p11)
states: 840
abstracting: (p11<=1)
states: 24,568 (4)
abstracting: (1<=p27)
states: 2,224 (3)
abstracting: (p27<=1)
states: 24,568 (4)
EG iterations: 0
-> the formula is TRUE
FORMULA Anderson-PT-04-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.047sec
checking: AG [[EX [EF [[[p5<=1 & 1<=p5] & [p19<=1 & 1<=p19]]]] | [[p2<=1 & 1<=p2] & [p69<=1 & 1<=p69]]]]
normalized: ~ [E [true U ~ [[[[p69<=1 & 1<=p69] & [p2<=1 & 1<=p2]] | EX [E [true U [[p19<=1 & 1<=p19] & [p5<=1 & 1<=p5]]]]]]]]
abstracting: (1<=p5)
states: 3,422 (3)
abstracting: (p5<=1)
states: 24,568 (4)
abstracting: (1<=p19)
states: 2,203 (3)
abstracting: (p19<=1)
states: 24,568 (4)
.abstracting: (1<=p2)
states: 4,525 (3)
abstracting: (p2<=1)
states: 24,568 (4)
abstracting: (1<=p69)
states: 324
abstracting: (p69<=1)
states: 24,568 (4)
-> the formula is TRUE
FORMULA Anderson-PT-04-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.443sec
checking: AX [AF [[AG [[[p5<=0 & 0<=p5] | [p13<=0 & 0<=p13]]] & [EG [[[p6<=0 & 0<=p6] | [p27<=0 & 0<=p27]]] | AG [[[p10<=0 & 0<=p10] | [p16<=0 & 0<=p16]]]]]]]
normalized: ~ [EX [EG [~ [[[~ [E [true U ~ [[[p16<=0 & 0<=p16] | [p10<=0 & 0<=p10]]]]] | EG [[[p27<=0 & 0<=p27] | [p6<=0 & 0<=p6]]]] & ~ [E [true U ~ [[[p13<=0 & 0<=p13] | [p5<=0 & 0<=p5]]]]]]]]]]
abstracting: (0<=p5)
states: 24,568 (4)
abstracting: (p5<=0)
states: 21,146 (4)
abstracting: (0<=p13)
states: 24,568 (4)
abstracting: (p13<=0)
states: 22,135 (4)
abstracting: (0<=p6)
states: 24,568 (4)
abstracting: (p6<=0)
states: 20,404 (4)
abstracting: (0<=p27)
states: 24,568 (4)
abstracting: (p27<=0)
states: 22,344 (4)
.
EG iterations: 1
abstracting: (0<=p10)
states: 24,568 (4)
abstracting: (p10<=0)
states: 22,732 (4)
abstracting: (0<=p16)
states: 24,568 (4)
abstracting: (p16<=0)
states: 22,031 (4)
EG iterations: 0
.-> the formula is FALSE
FORMULA Anderson-PT-04-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.111sec
checking: EG [[[EX [[[p9<=1 & 1<=p9] & [p24<=1 & 1<=p24]]] | [p7<=0 & 0<=p7]] | [[p15<=0 & 0<=p15] | [[p4<=1 & 1<=p4] & [p79<=1 & 1<=p79]]]]]
normalized: EG [[[[[p79<=1 & 1<=p79] & [p4<=1 & 1<=p4]] | [p15<=0 & 0<=p15]] | [[p7<=0 & 0<=p7] | EX [[[p24<=1 & 1<=p24] & [p9<=1 & 1<=p9]]]]]]
abstracting: (1<=p9)
states: 2,734 (3)
abstracting: (p9<=1)
states: 24,568 (4)
abstracting: (1<=p24)
states: 2,387 (3)
abstracting: (p24<=1)
states: 24,568 (4)
.abstracting: (0<=p7)
states: 24,568 (4)
abstracting: (p7<=0)
states: 19,325 (4)
abstracting: (0<=p15)
states: 24,568 (4)
abstracting: (p15<=0)
states: 22,290 (4)
abstracting: (1<=p4)
states: 4,983 (3)
abstracting: (p4<=1)
states: 24,568 (4)
abstracting: (1<=p79)
states: 359
abstracting: (p79<=1)
states: 24,568 (4)
.......
EG iterations: 7
-> the formula is TRUE
FORMULA Anderson-PT-04-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.184sec
checking: AF [AG [E [[AG [[[p9<=1 & 1<=p9] & [p48<=1 & 1<=p48]]] | [~ [[[p9<=1 & 1<=p9] & [p22<=1 & 1<=p22]]] | AG [[[p12<=1 & 1<=p12] & [p32<=1 & 1<=p32]]]]] U EG [[[p5<=1 & 1<=p5] & [p18<=1 & 1<=p18]]]]]]
normalized: ~ [EG [E [true U ~ [E [[~ [E [true U ~ [[[p48<=1 & 1<=p48] & [p9<=1 & 1<=p9]]]]] | [~ [E [true U ~ [[[p32<=1 & 1<=p32] & [p12<=1 & 1<=p12]]]]] | ~ [[[p22<=1 & 1<=p22] & [p9<=1 & 1<=p9]]]]] U EG [[[p5<=1 & 1<=p5] & [p18<=1 & 1<=p18]]]]]]]]
abstracting: (1<=p18)
states: 2,239 (3)
abstracting: (p18<=1)
states: 24,568 (4)
abstracting: (1<=p5)
states: 3,422 (3)
abstracting: (p5<=1)
states: 24,568 (4)
.............
EG iterations: 13
abstracting: (1<=p9)
states: 2,734 (3)
abstracting: (p9<=1)
states: 24,568 (4)
abstracting: (1<=p22)
states: 2,261 (3)
abstracting: (p22<=1)
states: 24,568 (4)
abstracting: (1<=p12)
states: 192
abstracting: (p12<=1)
states: 24,568 (4)
abstracting: (1<=p32)
states: 1,478 (3)
abstracting: (p32<=1)
states: 24,568 (4)
abstracting: (1<=p9)
states: 2,734 (3)
abstracting: (p9<=1)
states: 24,568 (4)
abstracting: (1<=p48)
states: 1,364 (3)
abstracting: (p48<=1)
states: 24,568 (4)
EG iterations: 0
-> the formula is FALSE
FORMULA Anderson-PT-04-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.063sec
checking: EX [[AX [AF [E [[[p5<=1 & 1<=p5] & [p16<=1 & 1<=p16]] U [[p2<=1 & 1<=p2] & [p73<=1 & 1<=p73]]]]] & [EF [[[p11<=0 & 0<=p11] | [p20<=0 & 0<=p20]]] & [AX [EG [[[p6<=0 & 0<=p6] | [p13<=0 & 0<=p13]]]] | EF [[[p11<=1 & 1<=p11] & [p18<=1 & 1<=p18]]]]]]]
normalized: EX [[[[E [true U [[p18<=1 & 1<=p18] & [p11<=1 & 1<=p11]]] | ~ [EX [~ [EG [[[p13<=0 & 0<=p13] | [p6<=0 & 0<=p6]]]]]]] & E [true U [[p20<=0 & 0<=p20] | [p11<=0 & 0<=p11]]]] & ~ [EX [EG [~ [E [[[p16<=1 & 1<=p16] & [p5<=1 & 1<=p5]] U [[p73<=1 & 1<=p73] & [p2<=1 & 1<=p2]]]]]]]]]
abstracting: (1<=p2)
states: 4,525 (3)
abstracting: (p2<=1)
states: 24,568 (4)
abstracting: (1<=p73)
states: 312
abstracting: (p73<=1)
states: 24,568 (4)
abstracting: (1<=p5)
states: 3,422 (3)
abstracting: (p5<=1)
states: 24,568 (4)
abstracting: (1<=p16)
states: 2,537 (3)
abstracting: (p16<=1)
states: 24,568 (4)
.....................
EG iterations: 21
.abstracting: (0<=p11)
states: 24,568 (4)
abstracting: (p11<=0)
states: 23,728 (4)
abstracting: (0<=p20)
states: 24,568 (4)
abstracting: (p20<=0)
states: 22,175 (4)
abstracting: (0<=p6)
states: 24,568 (4)
abstracting: (p6<=0)
states: 20,404 (4)
abstracting: (0<=p13)
states: 24,568 (4)
abstracting: (p13<=0)
states: 22,135 (4)
.
EG iterations: 1
.abstracting: (1<=p11)
states: 840
abstracting: (p11<=1)
states: 24,568 (4)
abstracting: (1<=p18)
states: 2,239 (3)
abstracting: (p18<=1)
states: 24,568 (4)
.-> the formula is FALSE
FORMULA Anderson-PT-04-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.988sec
checking: EG [[AF [EG [EF [[[p5<=1 & 1<=p5] & [p17<=1 & 1<=p17]]]]] | [[AF [[[[p9<=1 & 1<=p9] & [p17<=1 & 1<=p17]] | [[[p9<=1 & 1<=p9] & [p48<=1 & 1<=p48]] | [[p7<=1 & 1<=p7] & [p27<=1 & 1<=p27]]]]] & AX [1<=0]] & [[p9<=1 & 1<=p9] & [p20<=1 & 1<=p20]]]]]
normalized: EG [[~ [EG [~ [EG [E [true U [[p17<=1 & 1<=p17] & [p5<=1 & 1<=p5]]]]]]] | [[~ [EX [~ [1<=0]]] & ~ [EG [~ [[[[[p27<=1 & 1<=p27] & [p7<=1 & 1<=p7]] | [[p48<=1 & 1<=p48] & [p9<=1 & 1<=p9]]] | [[p17<=1 & 1<=p17] & [p9<=1 & 1<=p9]]]]]]] & [[p9<=1 & 1<=p9] & [p20<=1 & 1<=p20]]]]]
abstracting: (1<=p20)
states: 2,393 (3)
abstracting: (p20<=1)
states: 24,568 (4)
abstracting: (1<=p9)
states: 2,734 (3)
abstracting: (p9<=1)
states: 24,568 (4)
abstracting: (1<=p9)
states: 2,734 (3)
abstracting: (p9<=1)
states: 24,568 (4)
abstracting: (1<=p17)
states: 2,314 (3)
abstracting: (p17<=1)
states: 24,568 (4)
abstracting: (1<=p9)
states: 2,734 (3)
abstracting: (p9<=1)
states: 24,568 (4)
abstracting: (1<=p48)
states: 1,364 (3)
abstracting: (p48<=1)
states: 24,568 (4)
abstracting: (1<=p7)
states: 5,243 (3)
abstracting: (p7<=1)
states: 24,568 (4)
abstracting: (1<=p27)
states: 2,224 (3)
abstracting: (p27<=1)
states: 24,568 (4)
.......
EG iterations: 7
abstracting: (1<=0)
states: 0
.abstracting: (1<=p5)
states: 3,422 (3)
abstracting: (p5<=1)
states: 24,568 (4)
abstracting: (1<=p17)
states: 2,314 (3)
abstracting: (p17<=1)
states: 24,568 (4)
EG iterations: 0
.
EG iterations: 1
EG iterations: 0
-> the formula is TRUE
FORMULA Anderson-PT-04-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.392sec
checking: [EX [A [~ [AF [E [[[p9<=1 & 1<=p9] & [p36<=1 & 1<=p36]] U [p38<=1 & 1<=p38]]]] U [EG [[[p11<=1 & 1<=p11] & [p13<=1 & 1<=p13]]] | [AX [[[p7<=1 & 1<=p7] & [p13<=1 & 1<=p13]]] & [[p4<=1 & 1<=p4] & [p71<=1 & 1<=p71]]]]]] | EF [[[[p4<=0 & 0<=p4] | [p59<=0 & 0<=p59]] & AG [[p49<=1 & 1<=p49]]]]]
normalized: [E [true U [~ [E [true U ~ [[p49<=1 & 1<=p49]]]] & [[p59<=0 & 0<=p59] | [p4<=0 & 0<=p4]]]] | EX [[~ [EG [~ [[[[[p71<=1 & 1<=p71] & [p4<=1 & 1<=p4]] & ~ [EX [~ [[[p13<=1 & 1<=p13] & [p7<=1 & 1<=p7]]]]]] | EG [[[p13<=1 & 1<=p13] & [p11<=1 & 1<=p11]]]]]]] & ~ [E [~ [[[[[p71<=1 & 1<=p71] & [p4<=1 & 1<=p4]] & ~ [EX [~ [[[p13<=1 & 1<=p13] & [p7<=1 & 1<=p7]]]]]] | EG [[[p13<=1 & 1<=p13] & [p11<=1 & 1<=p11]]]]] U [~ [EG [~ [E [[[p36<=1 & 1<=p36] & [p9<=1 & 1<=p9]] U [p38<=1 & 1<=p38]]]]] & ~ [[[[[p71<=1 & 1<=p71] & [p4<=1 & 1<=p4]] & ~ [EX [~ [[[p13<=1 & 1<=p13] & [p7<=1 & 1<=p7]]]]]] | EG [[[p13<=1 & 1<=p13] & [p11<=1 & 1<=p11]]]]]]]]]]]
abstracting: (1<=p11)
states: 840
abstracting: (p11<=1)
states: 24,568 (4)
abstracting: (1<=p13)
states: 2,433 (3)
abstracting: (p13<=1)
states: 24,568 (4)
....
EG iterations: 4
abstracting: (1<=p7)
states: 5,243 (3)
abstracting: (p7<=1)
states: 24,568 (4)
abstracting: (1<=p13)
states: 2,433 (3)
abstracting: (p13<=1)
states: 24,568 (4)
.abstracting: (1<=p4)
states: 4,983 (3)
abstracting: (p4<=1)
states: 24,568 (4)
abstracting: (1<=p71)
states: 390
abstracting: (p71<=1)
states: 24,568 (4)
abstracting: (1<=p38)
states: 626
abstracting: (p38<=1)
states: 24,568 (4)
abstracting: (1<=p9)
states: 2,734 (3)
abstracting: (p9<=1)
states: 24,568 (4)
abstracting: (1<=p36)
states: 1,396 (3)
abstracting: (p36<=1)
states: 24,568 (4)
.
EG iterations: 1
abstracting: (1<=p11)
states: 840
abstracting: (p11<=1)
states: 24,568 (4)
abstracting: (1<=p13)
states: 2,433 (3)
abstracting: (p13<=1)
states: 24,568 (4)
....
EG iterations: 4
abstracting: (1<=p7)
states: 5,243 (3)
abstracting: (p7<=1)
states: 24,568 (4)
abstracting: (1<=p13)
states: 2,433 (3)
abstracting: (p13<=1)
states: 24,568 (4)
.abstracting: (1<=p4)
states: 4,983 (3)
abstracting: (p4<=1)
states: 24,568 (4)
abstracting: (1<=p71)
states: 390
abstracting: (p71<=1)
states: 24,568 (4)
abstracting: (1<=p11)
states: 840
abstracting: (p11<=1)
states: 24,568 (4)
abstracting: (1<=p13)
states: 2,433 (3)
abstracting: (p13<=1)
states: 24,568 (4)
....
EG iterations: 4
abstracting: (1<=p7)
states: 5,243 (3)
abstracting: (p7<=1)
states: 24,568 (4)
abstracting: (1<=p13)
states: 2,433 (3)
abstracting: (p13<=1)
states: 24,568 (4)
.abstracting: (1<=p4)
states: 4,983 (3)
abstracting: (p4<=1)
states: 24,568 (4)
abstracting: (1<=p71)
states: 390
abstracting: (p71<=1)
states: 24,568 (4)
EG iterations: 0
.abstracting: (0<=p4)
states: 24,568 (4)
abstracting: (p4<=0)
states: 19,585 (4)
abstracting: (0<=p59)
states: 24,568 (4)
abstracting: (p59<=0)
states: 23,196 (4)
abstracting: (1<=p49)
states: 1,119 (3)
abstracting: (p49<=1)
states: 24,568 (4)
-> the formula is FALSE
FORMULA Anderson-PT-04-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.321sec
checking: [AG [~ [A [[AX [[[p10<=1 & 1<=p10] & [p27<=1 & 1<=p27]]] & AG [[[p11<=1 & 1<=p11] & [p13<=1 & 1<=p13]]]] U [[EG [[[p8<=1 & 1<=p8] & [p17<=1 & 1<=p17]]] | AG [[[p5<=1 & 1<=p5] & [p24<=1 & 1<=p24]]]] & [[p2<=1 & 1<=p2] & [p73<=1 & 1<=p73]]]]]] & EG [[[p12<=0 & 0<=p12] | [p32<=0 & 0<=p32]]]]
normalized: [EG [[[p32<=0 & 0<=p32] | [p12<=0 & 0<=p12]]] & ~ [E [true U [~ [EG [~ [[[[p73<=1 & 1<=p73] & [p2<=1 & 1<=p2]] & [~ [E [true U ~ [[[p24<=1 & 1<=p24] & [p5<=1 & 1<=p5]]]]] | EG [[[p17<=1 & 1<=p17] & [p8<=1 & 1<=p8]]]]]]]] & ~ [E [~ [[[[p73<=1 & 1<=p73] & [p2<=1 & 1<=p2]] & [~ [E [true U ~ [[[p24<=1 & 1<=p24] & [p5<=1 & 1<=p5]]]]] | EG [[[p17<=1 & 1<=p17] & [p8<=1 & 1<=p8]]]]]] U [~ [[~ [E [true U ~ [[[p13<=1 & 1<=p13] & [p11<=1 & 1<=p11]]]]] & ~ [EX [~ [[[p27<=1 & 1<=p27] & [p10<=1 & 1<=p10]]]]]]] & ~ [[[[p73<=1 & 1<=p73] & [p2<=1 & 1<=p2]] & [~ [E [true U ~ [[[p24<=1 & 1<=p24] & [p5<=1 & 1<=p5]]]]] | EG [[[p17<=1 & 1<=p17] & [p8<=1 & 1<=p8]]]]]]]]]]]]]
abstracting: (1<=p8)
states: 6,137 (3)
abstracting: (p8<=1)
states: 24,568 (4)
abstracting: (1<=p17)
states: 2,314 (3)
abstracting: (p17<=1)
states: 24,568 (4)
..............
EG iterations: 14
abstracting: (1<=p5)
states: 3,422 (3)
abstracting: (p5<=1)
states: 24,568 (4)
abstracting: (1<=p24)
states: 2,387 (3)
abstracting: (p24<=1)
states: 24,568 (4)
abstracting: (1<=p2)
states: 4,525 (3)
abstracting: (p2<=1)
states: 24,568 (4)
abstracting: (1<=p73)
states: 312
abstracting: (p73<=1)
states: 24,568 (4)
abstracting: (1<=p10)
states: 1,836 (3)
abstracting: (p10<=1)
states: 24,568 (4)
abstracting: (1<=p27)
states: 2,224 (3)
abstracting: (p27<=1)
states: 24,568 (4)
.abstracting: (1<=p11)
states: 840
abstracting: (p11<=1)
states: 24,568 (4)
abstracting: (1<=p13)
states: 2,433 (3)
abstracting: (p13<=1)
states: 24,568 (4)
abstracting: (1<=p8)
states: 6,137 (3)
abstracting: (p8<=1)
states: 24,568 (4)
abstracting: (1<=p17)
states: 2,314 (3)
abstracting: (p17<=1)
states: 24,568 (4)
..............
EG iterations: 14
abstracting: (1<=p5)
states: 3,422 (3)
abstracting: (p5<=1)
states: 24,568 (4)
abstracting: (1<=p24)
states: 2,387 (3)
abstracting: (p24<=1)
states: 24,568 (4)
abstracting: (1<=p2)
states: 4,525 (3)
abstracting: (p2<=1)
states: 24,568 (4)
abstracting: (1<=p73)
states: 312
abstracting: (p73<=1)
states: 24,568 (4)
abstracting: (1<=p8)
states: 6,137 (3)
abstracting: (p8<=1)
states: 24,568 (4)
abstracting: (1<=p17)
states: 2,314 (3)
abstracting: (p17<=1)
states: 24,568 (4)
..............
EG iterations: 14
abstracting: (1<=p5)
states: 3,422 (3)
abstracting: (p5<=1)
states: 24,568 (4)
abstracting: (1<=p24)
states: 2,387 (3)
abstracting: (p24<=1)
states: 24,568 (4)
abstracting: (1<=p2)
states: 4,525 (3)
abstracting: (p2<=1)
states: 24,568 (4)
abstracting: (1<=p73)
states: 312
abstracting: (p73<=1)
states: 24,568 (4)
EG iterations: 0
abstracting: (0<=p12)
states: 24,568 (4)
abstracting: (p12<=0)
states: 24,376 (4)
abstracting: (0<=p32)
states: 24,568 (4)
abstracting: (p32<=0)
states: 23,090 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Anderson-PT-04-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.125sec
checking: E [~ [[[p7<=1 & 1<=p7] & [p20<=1 & 1<=p20]]] U [[~ [AF [[[p10<=1 & 1<=p10] & [p15<=1 & 1<=p15]]]] & [p10<=1 & 1<=p10]] & [[p19<=1 & 1<=p19] & [AG [AX [[[p9<=1 & 1<=p9] & [p13<=1 & 1<=p13]]]] | [~ [[[p8<=1 & 1<=p8] & [p15<=1 & 1<=p15]]] | [[p4<=1 & 1<=p4] & [p59<=1 & 1<=p59]]]]]]]
normalized: E [~ [[[p20<=1 & 1<=p20] & [p7<=1 & 1<=p7]]] U [[[[[[p59<=1 & 1<=p59] & [p4<=1 & 1<=p4]] | ~ [[[p15<=1 & 1<=p15] & [p8<=1 & 1<=p8]]]] | ~ [E [true U EX [~ [[[p13<=1 & 1<=p13] & [p9<=1 & 1<=p9]]]]]]] & [p19<=1 & 1<=p19]] & [[p10<=1 & 1<=p10] & EG [~ [[[p15<=1 & 1<=p15] & [p10<=1 & 1<=p10]]]]]]]
abstracting: (1<=p10)
states: 1,836 (3)
abstracting: (p10<=1)
states: 24,568 (4)
abstracting: (1<=p15)
states: 2,278 (3)
abstracting: (p15<=1)
states: 24,568 (4)
.
EG iterations: 1
abstracting: (1<=p10)
states: 1,836 (3)
abstracting: (p10<=1)
states: 24,568 (4)
abstracting: (1<=p19)
states: 2,203 (3)
abstracting: (p19<=1)
states: 24,568 (4)
abstracting: (1<=p9)
states: 2,734 (3)
abstracting: (p9<=1)
states: 24,568 (4)
abstracting: (1<=p13)
states: 2,433 (3)
abstracting: (p13<=1)
states: 24,568 (4)
.abstracting: (1<=p8)
states: 6,137 (3)
abstracting: (p8<=1)
states: 24,568 (4)
abstracting: (1<=p15)
states: 2,278 (3)
abstracting: (p15<=1)
states: 24,568 (4)
abstracting: (1<=p4)
states: 4,983 (3)
abstracting: (p4<=1)
states: 24,568 (4)
abstracting: (1<=p59)
states: 1,372 (3)
abstracting: (p59<=1)
states: 24,568 (4)
abstracting: (1<=p7)
states: 5,243 (3)
abstracting: (p7<=1)
states: 24,568 (4)
abstracting: (1<=p20)
states: 2,393 (3)
abstracting: (p20<=1)
states: 24,568 (4)
-> the formula is TRUE
FORMULA Anderson-PT-04-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.501sec
checking: E [[[p2<=1 & 1<=p2] & [[p81<=1 & 1<=p81] & [~ [[AF [[[p8<=1 & 1<=p8] & [p28<=1 & 1<=p28]]] & AF [[[p10<=1 & 1<=p10] & [p19<=1 & 1<=p19]]]]] | ~ [[[p11<=1 & 1<=p11] & [p18<=1 & 1<=p18]]]]]] U [AX [AG [[[[p6<=1 & 1<=p6] & [p26<=1 & 1<=p26]] | [[p11<=1 & 1<=p11] & [p18<=1 & 1<=p18]]]]] | [[p1<=1 & 1<=p1] & [p82<=1 & 1<=p82]]]]
normalized: E [[[[~ [[[p18<=1 & 1<=p18] & [p11<=1 & 1<=p11]]] | ~ [[~ [EG [~ [[[p19<=1 & 1<=p19] & [p10<=1 & 1<=p10]]]]] & ~ [EG [~ [[[p28<=1 & 1<=p28] & [p8<=1 & 1<=p8]]]]]]]] & [p81<=1 & 1<=p81]] & [p2<=1 & 1<=p2]] U [[[p82<=1 & 1<=p82] & [p1<=1 & 1<=p1]] | ~ [EX [E [true U ~ [[[[p18<=1 & 1<=p18] & [p11<=1 & 1<=p11]] | [[p26<=1 & 1<=p26] & [p6<=1 & 1<=p6]]]]]]]]]
abstracting: (1<=p6)
states: 4,164 (3)
abstracting: (p6<=1)
states: 24,568 (4)
abstracting: (1<=p26)
states: 2,261 (3)
abstracting: (p26<=1)
states: 24,568 (4)
abstracting: (1<=p11)
states: 840
abstracting: (p11<=1)
states: 24,568 (4)
abstracting: (1<=p18)
states: 2,239 (3)
abstracting: (p18<=1)
states: 24,568 (4)
.abstracting: (1<=p1)
states: 4,495 (3)
abstracting: (p1<=1)
states: 24,568 (4)
abstracting: (1<=p82)
states: 384
abstracting: (p82<=1)
states: 24,568 (4)
abstracting: (1<=p2)
states: 4,525 (3)
abstracting: (p2<=1)
states: 24,568 (4)
abstracting: (1<=p81)
states: 320
abstracting: (p81<=1)
states: 24,568 (4)
abstracting: (1<=p8)
states: 6,137 (3)
abstracting: (p8<=1)
states: 24,568 (4)
abstracting: (1<=p28)
states: 2,387 (3)
abstracting: (p28<=1)
states: 24,568 (4)
........
EG iterations: 8
abstracting: (1<=p10)
states: 1,836 (3)
abstracting: (p10<=1)
states: 24,568 (4)
abstracting: (1<=p19)
states: 2,203 (3)
abstracting: (p19<=1)
states: 24,568 (4)
.
EG iterations: 1
abstracting: (1<=p11)
states: 840
abstracting: (p11<=1)
states: 24,568 (4)
abstracting: (1<=p18)
states: 2,239 (3)
abstracting: (p18<=1)
states: 24,568 (4)
-> the formula is FALSE
FORMULA Anderson-PT-04-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.192sec
checking: [EX [[[p1<=1 & 1<=p1] & [p62<=1 & 1<=p62]]] | EG [[[[EF [[p40<=1 & 1<=p40]] & [A [[[p7<=1 & 1<=p7] & [p26<=1 & 1<=p26]] U [[p2<=1 & 1<=p2] & [p57<=1 & 1<=p57]]] & [p0<=1 & 1<=p0]]] & [[p88<=1 & 1<=p88] & [[p9<=1 & 1<=p9] & [p26<=1 & 1<=p26]]]] | ~ [A [AF [[[p6<=1 & 1<=p6] & [p26<=1 & 1<=p26]]] U [A [[[p0<=1 & 1<=p0] & [p87<=1 & 1<=p87]] U [p47<=1 & 1<=p47]] & [[p7<=1 & 1<=p7] & [p15<=1 & 1<=p15]]]]]]]]
normalized: [EG [[~ [[~ [EG [~ [[[[p15<=1 & 1<=p15] & [p7<=1 & 1<=p7]] & [~ [EG [~ [[p47<=1 & 1<=p47]]]] & ~ [E [~ [[p47<=1 & 1<=p47]] U [~ [[[p87<=1 & 1<=p87] & [p0<=1 & 1<=p0]]] & ~ [[p47<=1 & 1<=p47]]]]]]]]]] & ~ [E [~ [[[[p15<=1 & 1<=p15] & [p7<=1 & 1<=p7]] & [~ [EG [~ [[p47<=1 & 1<=p47]]]] & ~ [E [~ [[p47<=1 & 1<=p47]] U [~ [[[p87<=1 & 1<=p87] & [p0<=1 & 1<=p0]]] & ~ [[p47<=1 & 1<=p47]]]]]]]] U [EG [~ [[[p26<=1 & 1<=p26] & [p6<=1 & 1<=p6]]]] & ~ [[[[p15<=1 & 1<=p15] & [p7<=1 & 1<=p7]] & [~ [EG [~ [[p47<=1 & 1<=p47]]]] & ~ [E [~ [[p47<=1 & 1<=p47]] U [~ [[[p87<=1 & 1<=p87] & [p0<=1 & 1<=p0]]] & ~ [[p47<=1 & 1<=p47]]]]]]]]]]]]] | [[[[p26<=1 & 1<=p26] & [p9<=1 & 1<=p9]] & [p88<=1 & 1<=p88]] & [[[p0<=1 & 1<=p0] & [~ [EG [~ [[[p57<=1 & 1<=p57] & [p2<=1 & 1<=p2]]]]] & ~ [E [~ [[[p57<=1 & 1<=p57] & [p2<=1 & 1<=p2]]] U [~ [[[p26<=1 & 1<=p26] & [p7<=1 & 1<=p7]]] & ~ [[[p57<=1 & 1<=p57] & [p2<=1 & 1<=p2]]]]]]]] & E [true U [p40<=1 & 1<=p40]]]]]] | EX [[[p62<=1 & 1<=p62] & [p1<=1 & 1<=p1]]]]
abstracting: (1<=p1)
states: 4,495 (3)
abstracting: (p1<=1)
states: 24,568 (4)
abstracting: (1<=p62)
states: 1,537 (3)
abstracting: (p62<=1)
states: 24,568 (4)
.abstracting: (1<=p40)
states: 1,145 (3)
abstracting: (p40<=1)
states: 24,568 (4)
abstracting: (1<=p2)
states: 4,525 (3)
abstracting: (p2<=1)
states: 24,568 (4)
abstracting: (1<=p57)
states: 1,368 (3)
abstracting: (p57<=1)
states: 24,568 (4)
abstracting: (1<=p7)
states: 5,243 (3)
abstracting: (p7<=1)
states: 24,568 (4)
abstracting: (1<=p26)
states: 2,261 (3)
abstracting: (p26<=1)
states: 24,568 (4)
abstracting: (1<=p2)
states: 4,525 (3)
abstracting: (p2<=1)
states: 24,568 (4)
abstracting: (1<=p57)
states: 1,368 (3)
abstracting: (p57<=1)
states: 24,568 (4)
abstracting: (1<=p2)
states: 4,525 (3)
abstracting: (p2<=1)
states: 24,568 (4)
abstracting: (1<=p57)
states: 1,368 (3)
abstracting: (p57<=1)
states: 24,568 (4)
....................
EG iterations: 20
abstracting: (1<=p0)
states: 5,732 (3)
abstracting: (p0<=1)
states: 24,568 (4)
abstracting: (1<=p88)
states: 340
abstracting: (p88<=1)
states: 24,568 (4)
abstracting: (1<=p9)
states: 2,734 (3)
abstracting: (p9<=1)
states: 24,568 (4)
abstracting: (1<=p26)
states: 2,261 (3)
abstracting: (p26<=1)
states: 24,568 (4)
abstracting: (1<=p47)
states: 1,301 (3)
abstracting: (p47<=1)
states: 24,568 (4)
abstracting: (1<=p0)
states: 5,732 (3)
abstracting: (p0<=1)
states: 24,568 (4)
abstracting: (1<=p87)
states: 390
abstracting: (p87<=1)
states: 24,568 (4)
abstracting: (1<=p47)
states: 1,301 (3)
abstracting: (p47<=1)
states: 24,568 (4)
abstracting: (1<=p47)
states: 1,301 (3)
abstracting: (p47<=1)
states: 24,568 (4)
.
EG iterations: 1
abstracting: (1<=p7)
states: 5,243 (3)
abstracting: (p7<=1)
states: 24,568 (4)
abstracting: (1<=p15)
states: 2,278 (3)
abstracting: (p15<=1)
states: 24,568 (4)
abstracting: (1<=p6)
states: 4,164 (3)
abstracting: (p6<=1)
states: 24,568 (4)
abstracting: (1<=p26)
states: 2,261 (3)
abstracting: (p26<=1)
states: 24,568 (4)
.......
EG iterations: 7
abstracting: (1<=p47)
states: 1,301 (3)
abstracting: (p47<=1)
states: 24,568 (4)
abstracting: (1<=p0)
states: 5,732 (3)
abstracting: (p0<=1)
states: 24,568 (4)
abstracting: (1<=p87)
states: 390
abstracting: (p87<=1)
states: 24,568 (4)
abstracting: (1<=p47)
states: 1,301 (3)
abstracting: (p47<=1)
states: 24,568 (4)
abstracting: (1<=p47)
states: 1,301 (3)
abstracting: (p47<=1)
states: 24,568 (4)
.
EG iterations: 1
abstracting: (1<=p7)
states: 5,243 (3)
abstracting: (p7<=1)
states: 24,568 (4)
abstracting: (1<=p15)
states: 2,278 (3)
abstracting: (p15<=1)
states: 24,568 (4)
abstracting: (1<=p47)
states: 1,301 (3)
abstracting: (p47<=1)
states: 24,568 (4)
abstracting: (1<=p0)
states: 5,732 (3)
abstracting: (p0<=1)
states: 24,568 (4)
abstracting: (1<=p87)
states: 390
abstracting: (p87<=1)
states: 24,568 (4)
abstracting: (1<=p47)
states: 1,301 (3)
abstracting: (p47<=1)
states: 24,568 (4)
abstracting: (1<=p47)
states: 1,301 (3)
abstracting: (p47<=1)
states: 24,568 (4)
.
EG iterations: 1
abstracting: (1<=p7)
states: 5,243 (3)
abstracting: (p7<=1)
states: 24,568 (4)
abstracting: (1<=p15)
states: 2,278 (3)
abstracting: (p15<=1)
states: 24,568 (4)
EG iterations: 0
EG iterations: 0
-> the formula is TRUE
FORMULA Anderson-PT-04-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.013sec
checking: A [[A [~ [EF [[[[p3<=1 & 1<=p3] & [p52<=1 & 1<=p52]] | [[p6<=1 & 1<=p6] & [p26<=1 & 1<=p26]]]]] U [~ [A [[p37<=1 & 1<=p37] U [[p8<=1 & 1<=p8] & [p25<=1 & 1<=p25]]]] & AF [[[[p9<=1 & 1<=p9] & [p36<=1 & 1<=p36]] | [1<=p41 & p41<=1]]]]] & ~ [EG [[[p37<=1 & 1<=p37] & [[p7<=1 & 1<=p7] & [p14<=1 & 1<=p14]]]]]] U [E [[[EX [[[p2<=1 & 1<=p2] & [p73<=1 & 1<=p73]]] | [[p8<=1 & 1<=p8] & [p28<=1 & 1<=p28]]] & EX [[[p6<=1 & 1<=p6] & [p16<=1 & 1<=p16]]]] U ~ [AF [EG [[[p12<=1 & 1<=p12] & [p32<=1 & 1<=p32]]]]]] & AG [[~ [[AF [[[p2<=1 & 1<=p2] & [p77<=1 & 1<=p77]]] & [[[p10<=1 & 1<=p10] & [p23<=1 & 1<=p23]] | [[p10<=1 & 1<=p10] & [p24<=1 & 1<=p24]]]]] | EG [AG [[[p2<=1 & 1<=p2] & [p57<=1 & 1<=p57]]]]]]]]
normalized: [~ [EG [~ [[~ [E [true U ~ [[EG [~ [E [true U ~ [[[p57<=1 & 1<=p57] & [p2<=1 & 1<=p2]]]]]] | ~ [[[[[p24<=1 & 1<=p24] & [p10<=1 & 1<=p10]] | [[p23<=1 & 1<=p23] & [p10<=1 & 1<=p10]]] & ~ [EG [~ [[[p77<=1 & 1<=p77] & [p2<=1 & 1<=p2]]]]]]]]]]] & E [[EX [[[p16<=1 & 1<=p16] & [p6<=1 & 1<=p6]]] & [[[p28<=1 & 1<=p28] & [p8<=1 & 1<=p8]] | EX [[[p73<=1 & 1<=p73] & [p2<=1 & 1<=p2]]]]] U EG [~ [EG [[[p32<=1 & 1<=p32] & [p12<=1 & 1<=p12]]]]]]]]]] & ~ [E [~ [[~ [E [true U ~ [[EG [~ [E [true U ~ [[[p57<=1 & 1<=p57] & [p2<=1 & 1<=p2]]]]]] | ~ [[[[[p24<=1 & 1<=p24] & [p10<=1 & 1<=p10]] | [[p23<=1 & 1<=p23] & [p10<=1 & 1<=p10]]] & ~ [EG [~ [[[p77<=1 & 1<=p77] & [p2<=1 & 1<=p2]]]]]]]]]]] & E [[EX [[[p16<=1 & 1<=p16] & [p6<=1 & 1<=p6]]] & [[[p28<=1 & 1<=p28] & [p8<=1 & 1<=p8]] | EX [[[p73<=1 & 1<=p73] & [p2<=1 & 1<=p2]]]]] U EG [~ [EG [[[p32<=1 & 1<=p32] & [p12<=1 & 1<=p12]]]]]]]] U [~ [[~ [EG [[[[p14<=1 & 1<=p14] & [p7<=1 & 1<=p7]] & [p37<=1 & 1<=p37]]]] & [~ [EG [~ [[~ [EG [~ [[[1<=p41 & p41<=1] | [[p36<=1 & 1<=p36] & [p9<=1 & 1<=p9]]]]]] & ~ [[~ [EG [~ [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]]]]] & ~ [E [~ [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]]] U [~ [[p37<=1 & 1<=p37]] & ~ [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[1<=p41 & p41<=1] | [[p36<=1 & 1<=p36] & [p9<=1 & 1<=p9]]]]]] & ~ [[~ [EG [~ [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]]]]] & ~ [E [~ [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]]] U [~ [[p37<=1 & 1<=p37]] & ~ [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]]]]]]]]]] U [E [true U [[[p26<=1 & 1<=p26] & [p6<=1 & 1<=p6]] | [[p52<=1 & 1<=p52] & [p3<=1 & 1<=p3]]]] & ~ [[~ [EG [~ [[[1<=p41 & p41<=1] | [[p36<=1 & 1<=p36] & [p9<=1 & 1<=p9]]]]]] & ~ [[~ [EG [~ [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]]]]] & ~ [E [~ [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]]] U [~ [[p37<=1 & 1<=p37]] & ~ [[[p25<=1 & 1<=p25] & [p8<=1 & 1<=p8]]]]]]]]]]]]]]]] & ~ [[~ [E [true U ~ [[EG [~ [E [true U ~ [[[p57<=1 & 1<=p57] & [p2<=1 & 1<=p2]]]]]] | ~ [[[[[p24<=1 & 1<=p24] & [p10<=1 & 1<=p10]] | [[p23<=1 & 1<=p23] & [p10<=1 & 1<=p10]]] & ~ [EG [~ [[[p77<=1 & 1<=p77] & [p2<=1 & 1<=p2]]]]]]]]]]] & E [[EX [[[p16<=1 & 1<=p16] & [p6<=1 & 1<=p6]]] & [[[p28<=1 & 1<=p28] & [p8<=1 & 1<=p8]] | EX [[[p73<=1 & 1<=p73] & [p2<=1 & 1<=p2]]]]] U EG [~ [EG [[[p32<=1 & 1<=p32] & [p12<=1 & 1<=p12]]]]]]]]]]]]
abstracting: (1<=p12)
states: 192
abstracting: (p12<=1)
states: 24,568 (4)
abstracting: (1<=p32)
states: 1,478 (3)
abstracting: (p32<=1)
states: 24,568 (4)
.....
EG iterations: 5
EG iterations: 0
abstracting: (1<=p2)
states: 4,525 (3)
abstracting: (p2<=1)
states: 24,568 (4)
abstracting: (1<=p73)
states: 312
abstracting: (p73<=1)
states: 24,568 (4)
.abstracting: (1<=p8)
states: 6,137 (3)
abstracting: (p8<=1)
states: 24,568 (4)
abstracting: (1<=p28)
states: 2,387 (3)
abstracting: (p28<=1)
states: 24,568 (4)
abstracting: (1<=p6)
states: 4,164 (3)
abstracting: (p6<=1)
states: 24,568 (4)
abstracting: (1<=p16)
states: 2,537 (3)
abstracting: (p16<=1)
states: 24,568 (4)
.abstracting: (1<=p2)
states: 4,525 (3)
abstracting: (p2<=1)
states: 24,568 (4)
abstracting: (1<=p77)
states: 320
abstracting: (p77<=1)
states: 24,568 (4)
.....................
EG iterations: 21
abstracting: (1<=p10)
states: 1,836 (3)
abstracting: (p10<=1)
states: 24,568 (4)
abstracting: (1<=p23)
states: 2,224 (3)
abstracting: (p23<=1)
states: 24,568 (4)
abstracting: (1<=p10)
states: 1,836 (3)
abstracting: (p10<=1)
states: 24,568 (4)
abstracting: (1<=p24)
states: 2,387 (3)
abstracting: (p24<=1)
states: 24,568 (4)
abstracting: (1<=p2)
states: 4,525 (3)
abstracting: (p2<=1)
states: 24,568 (4)
abstracting: (1<=p57)
states: 1,368 (3)
abstracting: (p57<=1)
states: 24,568 (4)
.
EG iterations: 1
abstracting: (1<=p8)
states: 6,137 (3)
abstracting: (p8<=1)
states: 24,568 (4)
abstracting: (1<=p25)
states: 2,323 (3)
abstracting: (p25<=1)
states: 24,568 (4)
abstracting: (1<=p37)
states: 1,429 (3)
abstracting: (p37<=1)
states: 24,568 (4)
abstracting: (1<=p8)
states: 6,137 (3)
abstracting: (p8<=1)
states: 24,568 (4)
abstracting: (1<=p25)
states: 2,323 (3)
abstracting: (p25<=1)
states: 24,568 (4)
abstracting: (1<=p8)
states: 6,137 (3)
abstracting: (p8<=1)
states: 24,568 (4)
abstracting: (1<=p25)
states: 2,323 (3)
abstracting: (p25<=1)
states: 24,568 (4)
.
EG iterations: 1
abstracting: (1<=p9)
states: 2,734 (3)
abstracting: (p9<=1)
states: 24,568 (4)
abstracting: (1<=p36)
states: 1,396 (3)
abstracting: (p36<=1)
states: 24,568 (4)
abstracting: (p41<=1)
states: 24,568 (4)
abstracting: (1<=p41)
states: 1,301 (3)
.
EG iterations: 1
abstracting: (1<=p3)
states: 4,833 (3)
abstracting: (p3<=1)
states: 24,568 (4)
abstracting: (1<=p52)
states: 1,446 (3)
abstracting: (p52<=1)
states: 24,568 (4)
abstracting: (1<=p6)
states: 4,164 (3)
abstracting: (p6<=1)
states: 24,568 (4)
abstracting: (1<=p26)
states: 2,261 (3)
abstracting: (p26<=1)
states: 24,568 (4)
abstracting: (1<=p8)
states: 6,137 (3)
abstracting: (p8<=1)
states: 24,568 (4)
abstracting: (1<=p25)
states: 2,323 (3)
abstracting: (p25<=1)
states: 24,568 (4)
abstracting: (1<=p37)
states: 1,429 (3)
abstracting: (p37<=1)
states: 24,568 (4)
abstracting: (1<=p8)
states: 6,137 (3)
abstracting: (p8<=1)
states: 24,568 (4)
abstracting: (1<=p25)
states: 2,323 (3)
abstracting: (p25<=1)
states: 24,568 (4)
abstracting: (1<=p8)
states: 6,137 (3)
abstracting: (p8<=1)
states: 24,568 (4)
abstracting: (1<=p25)
states: 2,323 (3)
abstracting: (p25<=1)
states: 24,568 (4)
.
EG iterations: 1
abstracting: (1<=p9)
states: 2,734 (3)
abstracting: (p9<=1)
states: 24,568 (4)
abstracting: (1<=p36)
states: 1,396 (3)
abstracting: (p36<=1)
states: 24,568 (4)
abstracting: (p41<=1)
states: 24,568 (4)
abstracting: (1<=p41)
states: 1,301 (3)
.
EG iterations: 1
abstracting: (1<=p8)
states: 6,137 (3)
abstracting: (p8<=1)
states: 24,568 (4)
abstracting: (1<=p25)
states: 2,323 (3)
abstracting: (p25<=1)
states: 24,568 (4)
abstracting: (1<=p37)
states: 1,429 (3)
abstracting: (p37<=1)
states: 24,568 (4)
abstracting: (1<=p8)
states: 6,137 (3)
abstracting: (p8<=1)
states: 24,568 (4)
abstracting: (1<=p25)
states: 2,323 (3)
abstracting: (p25<=1)
states: 24,568 (4)
abstracting: (1<=p8)
states: 6,137 (3)
abstracting: (p8<=1)
states: 24,568 (4)
abstracting: (1<=p25)
states: 2,323 (3)
abstracting: (p25<=1)
states: 24,568 (4)
.
EG iterations: 1
abstracting: (1<=p9)
states: 2,734 (3)
abstracting: (p9<=1)
states: 24,568 (4)
abstracting: (1<=p36)
states: 1,396 (3)
abstracting: (p36<=1)
states: 24,568 (4)
abstracting: (p41<=1)
states: 24,568 (4)
abstracting: (1<=p41)
states: 1,301 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p37)
states: 1,429 (3)
abstracting: (p37<=1)
states: 24,568 (4)
abstracting: (1<=p7)
states: 5,243 (3)
abstracting: (p7<=1)
states: 24,568 (4)
abstracting: (1<=p14)
states: 2,334 (3)
abstracting: (p14<=1)
states: 24,568 (4)
......
EG iterations: 6
abstracting: (1<=p12)
states: 192
abstracting: (p12<=1)
states: 24,568 (4)
abstracting: (1<=p32)
states: 1,478 (3)
abstracting: (p32<=1)
states: 24,568 (4)
.....
EG iterations: 5
EG iterations: 0
abstracting: (1<=p2)
states: 4,525 (3)
abstracting: (p2<=1)
states: 24,568 (4)
abstracting: (1<=p73)
states: 312
abstracting: (p73<=1)
states: 24,568 (4)
.abstracting: (1<=p8)
states: 6,137 (3)
abstracting: (p8<=1)
states: 24,568 (4)
abstracting: (1<=p28)
states: 2,387 (3)
abstracting: (p28<=1)
states: 24,568 (4)
abstracting: (1<=p6)
states: 4,164 (3)
abstracting: (p6<=1)
states: 24,568 (4)
abstracting: (1<=p16)
states: 2,537 (3)
abstracting: (p16<=1)
states: 24,568 (4)
.abstracting: (1<=p2)
states: 4,525 (3)
abstracting: (p2<=1)
states: 24,568 (4)
abstracting: (1<=p77)
states: 320
abstracting: (p77<=1)
states: 24,568 (4)
.....................
EG iterations: 21
abstracting: (1<=p10)
states: 1,836 (3)
abstracting: (p10<=1)
states: 24,568 (4)
abstracting: (1<=p23)
states: 2,224 (3)
abstracting: (p23<=1)
states: 24,568 (4)
abstracting: (1<=p10)
states: 1,836 (3)
abstracting: (p10<=1)
states: 24,568 (4)
abstracting: (1<=p24)
states: 2,387 (3)
abstracting: (p24<=1)
states: 24,568 (4)
abstracting: (1<=p2)
states: 4,525 (3)
abstracting: (p2<=1)
states: 24,568 (4)
abstracting: (1<=p57)
states: 1,368 (3)
abstracting: (p57<=1)
states: 24,568 (4)
.
EG iterations: 1
abstracting: (1<=p12)
states: 192
abstracting: (p12<=1)
states: 24,568 (4)
abstracting: (1<=p32)
states: 1,478 (3)
abstracting: (p32<=1)
states: 24,568 (4)
.....
EG iterations: 5
EG iterations: 0
abstracting: (1<=p2)
states: 4,525 (3)
abstracting: (p2<=1)
states: 24,568 (4)
abstracting: (1<=p73)
states: 312
abstracting: (p73<=1)
states: 24,568 (4)
.abstracting: (1<=p8)
states: 6,137 (3)
abstracting: (p8<=1)
states: 24,568 (4)
abstracting: (1<=p28)
states: 2,387 (3)
abstracting: (p28<=1)
states: 24,568 (4)
abstracting: (1<=p6)
states: 4,164 (3)
abstracting: (p6<=1)
states: 24,568 (4)
abstracting: (1<=p16)
states: 2,537 (3)
abstracting: (p16<=1)
states: 24,568 (4)
.abstracting: (1<=p2)
states: 4,525 (3)
abstracting: (p2<=1)
states: 24,568 (4)
abstracting: (1<=p77)
states: 320
abstracting: (p77<=1)
states: 24,568 (4)
.....................
EG iterations: 21
abstracting: (1<=p10)
states: 1,836 (3)
abstracting: (p10<=1)
states: 24,568 (4)
abstracting: (1<=p23)
states: 2,224 (3)
abstracting: (p23<=1)
states: 24,568 (4)
abstracting: (1<=p10)
states: 1,836 (3)
abstracting: (p10<=1)
states: 24,568 (4)
abstracting: (1<=p24)
states: 2,387 (3)
abstracting: (p24<=1)
states: 24,568 (4)
abstracting: (1<=p2)
states: 4,525 (3)
abstracting: (p2<=1)
states: 24,568 (4)
abstracting: (1<=p57)
states: 1,368 (3)
abstracting: (p57<=1)
states: 24,568 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA Anderson-PT-04-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.168sec
totally nodes used: 4152765 (4.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 9072439 27086490 36158929
used/not used/entry size/cache size: 24970090 42138774 16 1024MB
basic ops cache: hits/miss/sum: 1431350 3470100 4901450
used/not used/entry size/cache size: 5084768 11692448 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 19661 97747 117408
used/not used/entry size/cache size: 97201 8291407 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 63492249
1 3162806
2 381656
3 63007
4 8196
5 861
6 86
7 3
8 0
9 0
>= 10 0
Total processing time: 0m14.336sec
BK_STOP 1680839041315
--------------------
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.000sec
iterations count:60073 (309), effective:1636 (8)
initing FirstDep: 0m 0.000sec
iterations count:20780 (107), effective:666 (3)
iterations count:17157 (88), effective:564 (2)
iterations count:1138 (5), effective:33 (0)
iterations count:194 (1), effective:0 (0)
iterations count:518 (2), effective:3 (0)
iterations count:518 (2), effective:3 (0)
iterations count:518 (2), effective:3 (0)
iterations count:194 (1), effective:0 (0)
iterations count:27621 (142), effective:903 (4)
iterations count:22925 (118), effective:717 (3)
iterations count:19462 (100), effective:610 (3)
iterations count:296 (1), effective:1 (0)
iterations count:265 (1), effective:1 (0)
iterations count:194 (1), effective:0 (0)
iterations count:901 (4), effective:13 (0)
iterations count:520 (2), effective:3 (0)
iterations count:33408 (172), effective:1090 (5)
iterations count:29816 (153), effective:940 (4)
iterations count:194 (1), effective:0 (0)
iterations count:34764 (179), effective:1123 (5)
iterations count:328 (1), effective:1 (0)
iterations count:452 (2), effective:15 (0)
iterations count:521 (2), effective:3 (0)
iterations count:452 (2), effective:15 (0)
iterations count:194 (1), effective:0 (0)
iterations count:452 (2), effective:15 (0)
iterations count:194 (1), effective:0 (0)
iterations count:37937 (195), effective:1268 (6)
iterations count:1135 (5), effective:28 (0)
iterations count:194 (1), effective:0 (0)
iterations count:14638 (75), effective:463 (2)
iterations count:1175 (6), effective:30 (0)
iterations count:299 (1), effective:1 (0)
iterations count:299 (1), effective:1 (0)
iterations count:1197 (6), effective:34 (0)
iterations count:299 (1), effective:1 (0)
iterations count:194 (1), effective:0 (0)
iterations count:222 (1), effective:1 (0)
iterations count:310 (1), effective:1 (0)
iterations count:12821 (66), effective:397 (2)
iterations count:310 (1), effective:1 (0)
iterations count:194 (1), effective:0 (0)
iterations count:310 (1), effective:1 (0)
iterations count:194 (1), effective:0 (0)
iterations count:222 (1), effective:1 (0)
iterations count:194 (1), effective:0 (0)
iterations count:222 (1), effective:1 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-04"
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-04, 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-167987246800002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-04.tgz
mv Anderson-PT-04 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;