About the Execution of Marcie+red for Parking-PT-208
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6863.476 | 39159.00 | 52021.00 | 594.30 | TTTTFFFFTFFTTTFT | 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.r266-smll-167863540900418.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 Parking-PT-208, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540900418
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.1K Feb 26 14:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 14:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 15:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 49K Mar 5 18:23 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 Parking-PT-208-CTLFireability-00
FORMULA_NAME Parking-PT-208-CTLFireability-01
FORMULA_NAME Parking-PT-208-CTLFireability-02
FORMULA_NAME Parking-PT-208-CTLFireability-03
FORMULA_NAME Parking-PT-208-CTLFireability-04
FORMULA_NAME Parking-PT-208-CTLFireability-05
FORMULA_NAME Parking-PT-208-CTLFireability-06
FORMULA_NAME Parking-PT-208-CTLFireability-07
FORMULA_NAME Parking-PT-208-CTLFireability-08
FORMULA_NAME Parking-PT-208-CTLFireability-09
FORMULA_NAME Parking-PT-208-CTLFireability-10
FORMULA_NAME Parking-PT-208-CTLFireability-11
FORMULA_NAME Parking-PT-208-CTLFireability-12
FORMULA_NAME Parking-PT-208-CTLFireability-13
FORMULA_NAME Parking-PT-208-CTLFireability-14
FORMULA_NAME Parking-PT-208-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679042569973
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=Parking-PT-208
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 08:42:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 08:42:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 08:42:53] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-17 08:42:53] [INFO ] Transformed 137 places.
[2023-03-17 08:42:53] [INFO ] Transformed 201 transitions.
[2023-03-17 08:42:53] [INFO ] Found NUPN structural information;
[2023-03-17 08:42:53] [INFO ] Parsed PT model containing 137 places and 201 transitions and 593 arcs in 242 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
Support contains 74 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 136 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 136 transition count 116
Applied a total of 2 rules in 28 ms. Remains 136 /137 variables (removed 1) and now considering 116/117 (removed 1) transitions.
// Phase 1: matrix 116 rows 136 cols
[2023-03-17 08:42:53] [INFO ] Computed 34 place invariants in 32 ms
[2023-03-17 08:42:53] [INFO ] Implicit Places using invariants in 359 ms returned [28, 36, 44, 64, 94, 110, 130]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 407 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 129/137 places, 116/117 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 112
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 112
Applied a total of 8 rules in 15 ms. Remains 125 /129 variables (removed 4) and now considering 112/116 (removed 4) transitions.
// Phase 1: matrix 112 rows 125 cols
[2023-03-17 08:42:53] [INFO ] Computed 27 place invariants in 4 ms
[2023-03-17 08:42:54] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-17 08:42:54] [INFO ] Invariant cache hit.
[2023-03-17 08:42:54] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-17 08:42:54] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 125/137 places, 112/117 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 772 ms. Remains : 125/137 places, 112/117 transitions.
Support contains 74 out of 125 places after structural reductions.
[2023-03-17 08:42:54] [INFO ] Flatten gal took : 79 ms
[2023-03-17 08:42:54] [INFO ] Flatten gal took : 29 ms
[2023-03-17 08:42:54] [INFO ] Input system was already deterministic with 112 transitions.
Incomplete random walk after 10000 steps, including 289 resets, run finished after 780 ms. (steps per millisecond=12 ) properties (out of 56) seen :44
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-17 08:42:56] [INFO ] Invariant cache hit.
[2023-03-17 08:42:56] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2023-03-17 08:42:56] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-17 08:42:56] [INFO ] [Nat]Absence check using 27 positive place invariants in 9 ms returned sat
[2023-03-17 08:42:56] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-17 08:42:56] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-17 08:42:56] [INFO ] After 88ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2023-03-17 08:42:56] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-17 08:42:57] [INFO ] After 606ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 4 properties in 49 ms.
Support contains 9 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 112/112 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 125 transition count 109
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 122 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 121 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 121 transition count 105
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 118 transition count 105
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 16 place count 116 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 116 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 30 place count 110 transition count 97
Free-agglomeration rule applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 46 place count 110 transition count 81
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 62 place count 94 transition count 81
Applied a total of 62 rules in 51 ms. Remains 94 /125 variables (removed 31) and now considering 81/112 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 94/125 places, 81/112 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 81 rows 94 cols
[2023-03-17 08:42:57] [INFO ] Computed 27 place invariants in 4 ms
[2023-03-17 08:42:57] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2023-03-17 08:42:57] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 08:42:57] [INFO ] [Nat]Absence check using 27 positive place invariants in 9 ms returned sat
[2023-03-17 08:42:57] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 08:42:57] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-17 08:42:57] [INFO ] After 33ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 08:42:57] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-17 08:42:57] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 40 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=20 )
Parikh walk visited 2 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-17 08:42:57] [INFO ] Flatten gal took : 16 ms
[2023-03-17 08:42:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Parking-PT-208-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 08:42:57] [INFO ] Flatten gal took : 17 ms
[2023-03-17 08:42:57] [INFO ] Input system was already deterministic with 112 transitions.
Support contains 72 out of 125 places (down from 74) after GAL structural reductions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 123 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 110
Applied a total of 4 rules in 20 ms. Remains 123 /125 variables (removed 2) and now considering 110/112 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 123/125 places, 110/112 transitions.
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 14 ms
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 16 ms
[2023-03-17 08:42:58] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 125 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 123 transition count 110
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 123 transition count 108
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 121 transition count 108
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 119 transition count 106
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 119 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 117 transition count 104
Applied a total of 16 rules in 35 ms. Remains 117 /125 variables (removed 8) and now considering 104/112 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 117/125 places, 104/112 transitions.
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 13 ms
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 15 ms
[2023-03-17 08:42:58] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 125 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 124 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 124 transition count 110
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 123 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 121 transition count 108
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 121 transition count 108
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 2 with 2 rules applied. Total rules applied 10 place count 120 transition count 107
Applied a total of 10 rules in 29 ms. Remains 120 /125 variables (removed 5) and now considering 107/112 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 120/125 places, 107/112 transitions.
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 14 ms
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 16 ms
[2023-03-17 08:42:58] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 125 transition count 109
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 122 transition count 109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 122 transition count 106
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 119 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 117 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 117 transition count 104
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 2 with 4 rules applied. Total rules applied 20 place count 115 transition count 102
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 115 transition count 102
Applied a total of 22 rules in 35 ms. Remains 115 /125 variables (removed 10) and now considering 102/112 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 115/125 places, 102/112 transitions.
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 11 ms
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 14 ms
[2023-03-17 08:42:58] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 121 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 121 transition count 105
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 118 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 116 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 116 transition count 103
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 2 with 4 rules applied. Total rules applied 20 place count 114 transition count 101
Applied a total of 20 rules in 26 ms. Remains 114 /125 variables (removed 11) and now considering 101/112 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 114/125 places, 101/112 transitions.
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 11 ms
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 11 ms
[2023-03-17 08:42:58] [INFO ] Input system was already deterministic with 101 transitions.
Finished random walk after 1687 steps, including 50 resets, run visited all 1 properties in 8 ms. (steps per millisecond=210 )
FORMULA Parking-PT-208-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 123 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 110
Applied a total of 4 rules in 5 ms. Remains 123 /125 variables (removed 2) and now considering 110/112 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 123/125 places, 110/112 transitions.
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 14 ms
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:42:58] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 123 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 110
Applied a total of 4 rules in 4 ms. Remains 123 /125 variables (removed 2) and now considering 110/112 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 123/125 places, 110/112 transitions.
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:42:58] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 123 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 110
Applied a total of 4 rules in 4 ms. Remains 123 /125 variables (removed 2) and now considering 110/112 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 123/125 places, 110/112 transitions.
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:42:58] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 111
Applied a total of 2 rules in 4 ms. Remains 124 /125 variables (removed 1) and now considering 111/112 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 124/125 places, 111/112 transitions.
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:42:58] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 125 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 123 transition count 110
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 123 transition count 108
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 121 transition count 108
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 2 with 2 rules applied. Total rules applied 10 place count 120 transition count 107
Applied a total of 10 rules in 11 ms. Remains 120 /125 variables (removed 5) and now considering 107/112 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 120/125 places, 107/112 transitions.
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:42:58] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 125 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 121 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 121 transition count 104
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 117 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 115 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 115 transition count 102
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 2 with 2 rules applied. Total rules applied 22 place count 114 transition count 101
Applied a total of 22 rules in 15 ms. Remains 114 /125 variables (removed 11) and now considering 101/112 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 114/125 places, 101/112 transitions.
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:42:58] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 111
Applied a total of 2 rules in 3 ms. Remains 124 /125 variables (removed 1) and now considering 111/112 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 124/125 places, 111/112 transitions.
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:42:58] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 123 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 110
Applied a total of 4 rules in 3 ms. Remains 123 /125 variables (removed 2) and now considering 110/112 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 123/125 places, 110/112 transitions.
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:42:58] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 123 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 110
Applied a total of 4 rules in 3 ms. Remains 123 /125 variables (removed 2) and now considering 110/112 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 123/125 places, 110/112 transitions.
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 5 ms
[2023-03-17 08:42:58] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 123 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 110
Applied a total of 4 rules in 3 ms. Remains 123 /125 variables (removed 2) and now considering 110/112 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 123/125 places, 110/112 transitions.
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:42:58] [INFO ] Input system was already deterministic with 110 transitions.
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:42:58] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:42:58] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-17 08:42:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 125 places, 112 transitions and 382 arcs took 1 ms.
Total runtime 5846 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: 125 NrTr: 112 NrArc: 382)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec
net check time: 0m 0.000sec
init dd package: 0m 3.495sec
RS generation: 0m 0.044sec
-> reachability set: #nodes 709 (7.1e+02) #states 3,514,564,609 (9)
starting MCC model checker
--------------------------
checking: AG [AX [[p99<=0 & 0<=p99]]]
normalized: ~ [E [true U EX [~ [[p99<=0 & 0<=p99]]]]]
abstracting: (0<=p99)
states: 3,514,564,609 (9)
abstracting: (p99<=0)
states: 3,450,077,185 (9)
.-> the formula is FALSE
FORMULA Parking-PT-208-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.135sec
checking: AG [EF [[p124<=1 & 1<=p124]]]
normalized: ~ [E [true U ~ [E [true U [p124<=1 & 1<=p124]]]]]
abstracting: (1<=p124)
states: 1,257,504,768 (9)
abstracting: (p124<=1)
states: 3,514,564,609 (9)
-> the formula is FALSE
FORMULA Parking-PT-208-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.083sec
checking: EF [AG [[AX [[[0<=p91 & p91<=0] | [p124<=0 & 0<=p124]]] | [p36<=0 & 0<=p36]]]]
normalized: E [true U ~ [E [true U ~ [[[p36<=0 & 0<=p36] | ~ [EX [~ [[[0<=p91 & p91<=0] | [p124<=0 & 0<=p124]]]]]]]]]]
abstracting: (0<=p124)
states: 3,514,564,609 (9)
abstracting: (p124<=0)
states: 2,257,059,841 (9)
abstracting: (p91<=0)
states: 3,450,077,185 (9)
abstracting: (0<=p91)
states: 3,514,564,609 (9)
.abstracting: (0<=p36)
states: 3,514,564,609 (9)
abstracting: (p36<=0)
states: 3,457,417,217 (9)
-> the formula is TRUE
FORMULA Parking-PT-208-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.080sec
checking: [EF [AX [A [[p2<=1 & 1<=p2] U AX [[p105<=1 & 1<=p105]]]]] | EG [EX [[p61<=0 & 0<=p61]]]]
normalized: [EG [EX [[p61<=0 & 0<=p61]]] | E [true U ~ [EX [~ [[~ [EG [EX [~ [[p105<=1 & 1<=p105]]]]] & ~ [E [EX [~ [[p105<=1 & 1<=p105]]] U [EX [~ [[p105<=1 & 1<=p105]]] & ~ [[p2<=1 & 1<=p2]]]]]]]]]]]
abstracting: (1<=p2)
states: 1,757,282,304 (9)
abstracting: (p2<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p105)
states: 64,487,424 (7)
abstracting: (p105<=1)
states: 3,514,564,609 (9)
.abstracting: (1<=p105)
states: 64,487,424 (7)
abstracting: (p105<=1)
states: 3,514,564,609 (9)
.abstracting: (1<=p105)
states: 64,487,424 (7)
abstracting: (p105<=1)
states: 3,514,564,609 (9)
................................................
EG iterations: 47
.abstracting: (0<=p61)
states: 3,514,564,609 (9)
abstracting: (p61<=0)
states: 2,857,369,601 (9)
................................................
EG iterations: 47
-> the formula is TRUE
FORMULA Parking-PT-208-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.283sec
checking: E [AX [AX [~ [AG [[[p107<=1 & 1<=p107] & [p124<=1 & 1<=p124]]]]]] U EF [[p44<=1 & 1<=p44]]]
normalized: E [~ [EX [EX [~ [E [true U ~ [[[p124<=1 & 1<=p124] & [p107<=1 & 1<=p107]]]]]]]] U E [true U [p44<=1 & 1<=p44]]]
abstracting: (1<=p44)
states: 57,147,392 (7)
abstracting: (p44<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p107)
states: 96,731,136 (7)
abstracting: (p107<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p124)
states: 1,257,504,768 (9)
abstracting: (p124<=1)
states: 3,514,564,609 (9)
..-> the formula is TRUE
FORMULA Parking-PT-208-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.244sec
checking: EG [EF [[[p30<=1 & 1<=p30] & [EG [A [[[p12<=1 & 1<=p12] & [p50<=1 & 1<=p50]] U [p98<=1 & 1<=p98]]] | [[p43<=1 & 1<=p43] | EF [[p43<=0 & 0<=p43]]]]]]]
normalized: EG [E [true U [[[E [true U [p43<=0 & 0<=p43]] | [p43<=1 & 1<=p43]] | EG [[~ [EG [~ [[p98<=1 & 1<=p98]]]] & ~ [E [~ [[p98<=1 & 1<=p98]] U [~ [[[p50<=1 & 1<=p50] & [p12<=1 & 1<=p12]]] & ~ [[p98<=1 & 1<=p98]]]]]]]] & [p30<=1 & 1<=p30]]]]
abstracting: (1<=p30)
states: 85,721,088 (7)
abstracting: (p30<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p98)
states: 64,487,424 (7)
abstracting: (p98<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p12)
states: 1,757,282,304 (9)
abstracting: (p12<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p50)
states: 114,294,784 (8)
abstracting: (p50<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p98)
states: 64,487,424 (7)
abstracting: (p98<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p98)
states: 64,487,424 (7)
abstracting: (p98<=1)
states: 3,514,564,609 (9)
....................................
EG iterations: 36
....................................
EG iterations: 36
abstracting: (1<=p43)
states: 57,147,392 (7)
abstracting: (p43<=1)
states: 3,514,564,609 (9)
abstracting: (0<=p43)
states: 3,514,564,609 (9)
abstracting: (p43<=0)
states: 3,457,417,217 (9)
............................................
EG iterations: 44
-> the formula is TRUE
FORMULA Parking-PT-208-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.117sec
checking: E [A [[p105<=1 & 1<=p105] U [[p10<=1 & 1<=p10] & [p28<=1 & 1<=p28]]] U [EF [[[p65<=1 & 1<=p65] & [p82<=1 & 1<=p82]]] | [p4<=1 & 1<=p4]]]
normalized: E [[~ [EG [~ [[[p28<=1 & 1<=p28] & [p10<=1 & 1<=p10]]]]] & ~ [E [~ [[[p28<=1 & 1<=p28] & [p10<=1 & 1<=p10]]] U [~ [[p105<=1 & 1<=p105]] & ~ [[[p28<=1 & 1<=p28] & [p10<=1 & 1<=p10]]]]]]] U [E [true U [[p82<=1 & 1<=p82] & [p65<=1 & 1<=p65]]] | [p4<=1 & 1<=p4]]]
abstracting: (1<=p4)
states: 1,757,282,304 (9)
abstracting: (p4<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p65)
states: 1,757,282,304 (9)
abstracting: (p65<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p82)
states: 96,731,136 (7)
abstracting: (p82<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p10)
states: 1,757,282,304 (9)
abstracting: (p10<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p28)
states: 85,721,088 (7)
abstracting: (p28<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p105)
states: 64,487,424 (7)
abstracting: (p105<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p10)
states: 1,757,282,304 (9)
abstracting: (p10<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p28)
states: 85,721,088 (7)
abstracting: (p28<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p10)
states: 1,757,282,304 (9)
abstracting: (p10<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p28)
states: 85,721,088 (7)
abstracting: (p28<=1)
states: 3,514,564,609 (9)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Parking-PT-208-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.225sec
checking: AX [[AF [AG [AX [[p105<=0 & 0<=p105]]]] & [EG [[[p12<=1 & 1<=p12] | [p105<=1 & 1<=p105]]] | [E [[[p10<=1 & 1<=p10] & [p28<=1 & 1<=p28]] U [[p25<=1 & 1<=p25] & [p63<=1 & 1<=p63]]] & EX [[p63<=1 & 1<=p63]]]]]]
normalized: ~ [EX [~ [[[[EX [[p63<=1 & 1<=p63]] & E [[[p28<=1 & 1<=p28] & [p10<=1 & 1<=p10]] U [[p63<=1 & 1<=p63] & [p25<=1 & 1<=p25]]]] | EG [[[p105<=1 & 1<=p105] | [p12<=1 & 1<=p12]]]] & ~ [EG [E [true U EX [~ [[p105<=0 & 0<=p105]]]]]]]]]]
abstracting: (0<=p105)
states: 3,514,564,609 (9)
abstracting: (p105<=0)
states: 3,450,077,185 (9)
..........................................
EG iterations: 41
abstracting: (1<=p12)
states: 1,757,282,304 (9)
abstracting: (p12<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p105)
states: 64,487,424 (7)
abstracting: (p105<=1)
states: 3,514,564,609 (9)
.....................................................
EG iterations: 53
abstracting: (1<=p25)
states: 57,147,392 (7)
abstracting: (p25<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p63)
states: 1,057,226,752 (9)
abstracting: (p63<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p10)
states: 1,757,282,304 (9)
abstracting: (p10<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p28)
states: 85,721,088 (7)
abstracting: (p28<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p63)
states: 1,057,226,752 (9)
abstracting: (p63<=1)
states: 3,514,564,609 (9)
..-> the formula is FALSE
FORMULA Parking-PT-208-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.757sec
checking: AX [[EG [[[p30<=0 & 0<=p30] & AF [[p75<=0 & 0<=p75]]]] & [EF [[p37<=0 & 0<=p37]] & ~ [A [EX [[p30<=1 & 1<=p30]] U [[[p35<=1 & 1<=p35] & [p63<=1 & 1<=p63]] | EG [[[p1<=1 & 1<=p1] & [p115<=1 & 1<=p115]]]]]]]]]
normalized: ~ [EX [~ [[[~ [[~ [EG [~ [[EG [[[p115<=1 & 1<=p115] & [p1<=1 & 1<=p1]]] | [[p63<=1 & 1<=p63] & [p35<=1 & 1<=p35]]]]]] & ~ [E [~ [[EG [[[p115<=1 & 1<=p115] & [p1<=1 & 1<=p1]]] | [[p63<=1 & 1<=p63] & [p35<=1 & 1<=p35]]]] U [~ [EX [[p30<=1 & 1<=p30]]] & ~ [[EG [[[p115<=1 & 1<=p115] & [p1<=1 & 1<=p1]]] | [[p63<=1 & 1<=p63] & [p35<=1 & 1<=p35]]]]]]]]] & E [true U [p37<=0 & 0<=p37]]] & EG [[~ [EG [~ [[p75<=0 & 0<=p75]]]] & [p30<=0 & 0<=p30]]]]]]]
abstracting: (0<=p30)
states: 3,514,564,609 (9)
abstracting: (p30<=0)
states: 3,428,843,521 (9)
abstracting: (0<=p75)
states: 3,514,564,609 (9)
abstracting: (p75<=0)
states: 1,757,282,305 (9)
....................................................
EG iterations: 52
..
EG iterations: 2
abstracting: (0<=p37)
states: 3,514,564,609 (9)
abstracting: (p37<=0)
states: 3,457,417,217 (9)
abstracting: (1<=p35)
states: 57,147,392 (7)
abstracting: (p35<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p63)
states: 1,057,226,752 (9)
abstracting: (p63<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p1)
states: 1,757,282,304 (9)
abstracting: (p1<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p115)
states: 96,731,136 (7)
abstracting: (p115<=1)
states: 3,514,564,609 (9)
.....................................
EG iterations: 37
abstracting: (1<=p30)
states: 85,721,088 (7)
abstracting: (p30<=1)
states: 3,514,564,609 (9)
.abstracting: (1<=p35)
states: 57,147,392 (7)
abstracting: (p35<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p63)
states: 1,057,226,752 (9)
abstracting: (p63<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p1)
states: 1,757,282,304 (9)
abstracting: (p1<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p115)
states: 96,731,136 (7)
abstracting: (p115<=1)
states: 3,514,564,609 (9)
.....................................
EG iterations: 37
abstracting: (1<=p35)
states: 57,147,392 (7)
abstracting: (p35<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p63)
states: 1,057,226,752 (9)
abstracting: (p63<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p1)
states: 1,757,282,304 (9)
abstracting: (p1<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p115)
states: 96,731,136 (7)
abstracting: (p115<=1)
states: 3,514,564,609 (9)
.....................................
EG iterations: 37
.
EG iterations: 1
.-> the formula is FALSE
FORMULA Parking-PT-208-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.272sec
checking: AG [A [[[p98<=1 & 1<=p98] & [EX [AF [[[p3<=1 & 1<=p3] & [p53<=1 & 1<=p53]]]] | [~ [[[[p9<=1 & 1<=p9] & [p55<=1 & 1<=p55]] | [[p94<=1 & 1<=p94] & [p120<=1 & 1<=p120]]]] & [p43<=1 & 1<=p43]]]] U AF [[p36<=1 & 1<=p36]]]]
normalized: ~ [E [true U ~ [[~ [E [EG [~ [[p36<=1 & 1<=p36]]] U [EG [~ [[p36<=1 & 1<=p36]]] & ~ [[[EX [~ [EG [~ [[[p53<=1 & 1<=p53] & [p3<=1 & 1<=p3]]]]]] | [~ [[[[p55<=1 & 1<=p55] & [p9<=1 & 1<=p9]] | [[p120<=1 & 1<=p120] & [p94<=1 & 1<=p94]]]] & [p43<=1 & 1<=p43]]] & [p98<=1 & 1<=p98]]]]]] & ~ [EG [EG [~ [[p36<=1 & 1<=p36]]]]]]]]]
abstracting: (1<=p36)
states: 57,147,392 (7)
abstracting: (p36<=1)
states: 3,514,564,609 (9)
....................................
EG iterations: 36
.
EG iterations: 1
abstracting: (1<=p98)
states: 64,487,424 (7)
abstracting: (p98<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p43)
states: 57,147,392 (7)
abstracting: (p43<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p94)
states: 2,869,690,368 (9)
abstracting: (p94<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p120)
states: 96,731,136 (7)
abstracting: (p120<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p9)
states: 1,757,282,304 (9)
abstracting: (p9<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p55)
states: 114,294,784 (8)
abstracting: (p55<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p3)
states: 1,757,282,304 (9)
abstracting: (p3<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p53)
states: 114,294,784 (8)
abstracting: (p53<=1)
states: 3,514,564,609 (9)
...........................................
EG iterations: 43
.abstracting: (1<=p36)
states: 57,147,392 (7)
abstracting: (p36<=1)
states: 3,514,564,609 (9)
....................................
EG iterations: 36
abstracting: (1<=p36)
states: 57,147,392 (7)
abstracting: (p36<=1)
states: 3,514,564,609 (9)
....................................
EG iterations: 36
-> the formula is FALSE
FORMULA Parking-PT-208-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.816sec
checking: AX [[EX [EF [[p90<=1 & 1<=p90]]] & [[[p74<=0 & 0<=p74] | [[p101<=0 & 0<=p101] | [[EF [[[p11<=0 & 0<=p11] | [p33<=0 & 0<=p33]]] & [p16<=1 & 1<=p16]] & [[p51<=1 & 1<=p51] & [p99<=1 & 1<=p99]]]]] & [[p36<=0 & 0<=p36] | AX [[p65<=1 & 1<=p65]]]]]]
normalized: ~ [EX [~ [[EX [E [true U [p90<=1 & 1<=p90]]] & [[[[p101<=0 & 0<=p101] | [[[p16<=1 & 1<=p16] & E [true U [[p33<=0 & 0<=p33] | [p11<=0 & 0<=p11]]]] & [[p99<=1 & 1<=p99] & [p51<=1 & 1<=p51]]]] | [p74<=0 & 0<=p74]] & [~ [EX [~ [[p65<=1 & 1<=p65]]]] | [p36<=0 & 0<=p36]]]]]]]
abstracting: (0<=p36)
states: 3,514,564,609 (9)
abstracting: (p36<=0)
states: 3,457,417,217 (9)
abstracting: (1<=p65)
states: 1,757,282,304 (9)
abstracting: (p65<=1)
states: 3,514,564,609 (9)
.abstracting: (0<=p74)
states: 3,514,564,609 (9)
abstracting: (p74<=0)
states: 1,757,282,305 (9)
abstracting: (1<=p51)
states: 114,294,784 (8)
abstracting: (p51<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p99)
states: 64,487,424 (7)
abstracting: (p99<=1)
states: 3,514,564,609 (9)
abstracting: (0<=p11)
states: 3,514,564,609 (9)
abstracting: (p11<=0)
states: 1,757,282,305 (9)
abstracting: (0<=p33)
states: 3,514,564,609 (9)
abstracting: (p33<=0)
states: 3,400,269,825 (9)
abstracting: (1<=p16)
states: 1,757,282,304 (9)
abstracting: (p16<=1)
states: 3,514,564,609 (9)
abstracting: (0<=p101)
states: 3,514,564,609 (9)
abstracting: (p101<=0)
states: 3,417,833,473 (9)
abstracting: (1<=p90)
states: 96,731,136 (7)
abstracting: (p90<=1)
states: 3,514,564,609 (9)
..-> the formula is TRUE
FORMULA Parking-PT-208-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.080sec
checking: E [[A [~ [[AF [[[p18<=1 & 1<=p18] & [p41<=1 & 1<=p41]]] | E [[[p8<=1 & 1<=p8] & [p49<=1 & 1<=p49]] U [[p31<=1 & 1<=p31] & [p63<=1 & 1<=p63]]]]] U [p12<=1 & 1<=p12]] & A [[p83<=1 & 1<=p83] U ~ [E [~ [[[p84<=1 & 1<=p84] & [p124<=1 & 1<=p124]]] U EX [[[p70<=1 & 1<=p70] & [p93<=1 & 1<=p93]]]]]]] U AG [EF [[~ [AF [[p60<=1 & 1<=p60]]] | [~ [[p24<=1 & 1<=p24]] & [[p109<=1 & 1<=p109] & [p120<=1 & 1<=p120]]]]]]]
normalized: E [[[~ [EG [E [~ [[[p124<=1 & 1<=p124] & [p84<=1 & 1<=p84]]] U EX [[[p93<=1 & 1<=p93] & [p70<=1 & 1<=p70]]]]]] & ~ [E [E [~ [[[p124<=1 & 1<=p124] & [p84<=1 & 1<=p84]]] U EX [[[p93<=1 & 1<=p93] & [p70<=1 & 1<=p70]]]] U [~ [[p83<=1 & 1<=p83]] & E [~ [[[p124<=1 & 1<=p124] & [p84<=1 & 1<=p84]]] U EX [[[p93<=1 & 1<=p93] & [p70<=1 & 1<=p70]]]]]]]] & [~ [EG [~ [[p12<=1 & 1<=p12]]]] & ~ [E [~ [[p12<=1 & 1<=p12]] U [[E [[[p49<=1 & 1<=p49] & [p8<=1 & 1<=p8]] U [[p63<=1 & 1<=p63] & [p31<=1 & 1<=p31]]] | ~ [EG [~ [[[p41<=1 & 1<=p41] & [p18<=1 & 1<=p18]]]]]] & ~ [[p12<=1 & 1<=p12]]]]]]] U ~ [E [true U ~ [E [true U [[[[p120<=1 & 1<=p120] & [p109<=1 & 1<=p109]] & ~ [[p24<=1 & 1<=p24]]] | EG [~ [[p60<=1 & 1<=p60]]]]]]]]]
abstracting: (1<=p60)
states: 742,916,096 (8)
abstracting: (p60<=1)
states: 3,514,564,609 (9)
.
EG iterations: 1
abstracting: (1<=p24)
states: 85,721,088 (7)
abstracting: (p24<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p109)
states: 2,934,177,792 (9)
abstracting: (p109<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p120)
states: 96,731,136 (7)
abstracting: (p120<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p12)
states: 1,757,282,304 (9)
abstracting: (p12<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p18)
states: 1,757,282,304 (9)
abstracting: (p18<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p41)
states: 85,721,088 (7)
abstracting: (p41<=1)
states: 3,514,564,609 (9)
.
EG iterations: 1
abstracting: (1<=p31)
states: 57,147,392 (7)
abstracting: (p31<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p63)
states: 1,057,226,752 (9)
abstracting: (p63<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p8)
states: 1,757,282,304 (9)
abstracting: (p8<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p49)
states: 114,294,784 (8)
abstracting: (p49<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p12)
states: 1,757,282,304 (9)
abstracting: (p12<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p12)
states: 1,757,282,304 (9)
abstracting: (p12<=1)
states: 3,514,564,609 (9)
....................................
EG iterations: 36
abstracting: (1<=p70)
states: 1,757,282,304 (9)
abstracting: (p70<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p93)
states: 96,731,136 (7)
abstracting: (p93<=1)
states: 3,514,564,609 (9)
.abstracting: (1<=p84)
states: 64,487,424 (7)
abstracting: (p84<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p124)
states: 1,257,504,768 (9)
abstracting: (p124<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p83)
states: 96,731,136 (7)
abstracting: (p83<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p70)
states: 1,757,282,304 (9)
abstracting: (p70<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p93)
states: 96,731,136 (7)
abstracting: (p93<=1)
states: 3,514,564,609 (9)
.abstracting: (1<=p84)
states: 64,487,424 (7)
abstracting: (p84<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p124)
states: 1,257,504,768 (9)
abstracting: (p124<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p70)
states: 1,757,282,304 (9)
abstracting: (p70<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p93)
states: 96,731,136 (7)
abstracting: (p93<=1)
states: 3,514,564,609 (9)
.abstracting: (1<=p84)
states: 64,487,424 (7)
abstracting: (p84<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p124)
states: 1,257,504,768 (9)
abstracting: (p124<=1)
states: 3,514,564,609 (9)
......................................
EG iterations: 38
-> the formula is TRUE
FORMULA Parking-PT-208-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.721sec
checking: A [EF [EG [A [[[[p32<=1 & 1<=p32] & [p62<=1 & 1<=p62]] | [[p72<=1 & 1<=p72] & [p118<=1 & 1<=p118]]] U ~ [[[p100<=1 & 1<=p100] & [p124<=1 & 1<=p124]]]]]] U [EF [EG [[p105<=1 & 1<=p105]]] & E [~ [EF [~ [[[p95<=1 & 1<=p95] & [p121<=1 & 1<=p121]]]]] U [[A [[p105<=1 & 1<=p105] U [p36<=1 & 1<=p36]] & AF [[[p78<=1 & 1<=p78] & [p108<=1 & 1<=p108]]]] & [[p40<=1 & 1<=p40] & [[p59<=1 & 1<=p59] & [[p83<=1 & 1<=p83] | [[p61<=1 & 1<=p61] & [p8<=1 & 1<=p8]]]]]]]]]
normalized: [~ [EG [~ [[E [~ [E [true U ~ [[[p121<=1 & 1<=p121] & [p95<=1 & 1<=p95]]]]] U [[[[[[p8<=1 & 1<=p8] & [p61<=1 & 1<=p61]] | [p83<=1 & 1<=p83]] & [p59<=1 & 1<=p59]] & [p40<=1 & 1<=p40]] & [~ [EG [~ [[[p108<=1 & 1<=p108] & [p78<=1 & 1<=p78]]]]] & [~ [EG [~ [[p36<=1 & 1<=p36]]]] & ~ [E [~ [[p36<=1 & 1<=p36]] U [~ [[p105<=1 & 1<=p105]] & ~ [[p36<=1 & 1<=p36]]]]]]]]] & E [true U EG [[p105<=1 & 1<=p105]]]]]]] & ~ [E [~ [[E [~ [E [true U ~ [[[p121<=1 & 1<=p121] & [p95<=1 & 1<=p95]]]]] U [[[[[[p8<=1 & 1<=p8] & [p61<=1 & 1<=p61]] | [p83<=1 & 1<=p83]] & [p59<=1 & 1<=p59]] & [p40<=1 & 1<=p40]] & [~ [EG [~ [[[p108<=1 & 1<=p108] & [p78<=1 & 1<=p78]]]]] & [~ [EG [~ [[p36<=1 & 1<=p36]]]] & ~ [E [~ [[p36<=1 & 1<=p36]] U [~ [[p105<=1 & 1<=p105]] & ~ [[p36<=1 & 1<=p36]]]]]]]]] & E [true U EG [[p105<=1 & 1<=p105]]]]] U [~ [E [true U EG [[~ [EG [[[p124<=1 & 1<=p124] & [p100<=1 & 1<=p100]]]] & ~ [E [[[p124<=1 & 1<=p124] & [p100<=1 & 1<=p100]] U [~ [[[[p62<=1 & 1<=p62] & [p32<=1 & 1<=p32]] | [[p72<=1 & 1<=p72] & [p118<=1 & 1<=p118]]]] & [[p124<=1 & 1<=p124] & [p100<=1 & 1<=p100]]]]]]]]] & ~ [[E [~ [E [true U ~ [[[p121<=1 & 1<=p121] & [p95<=1 & 1<=p95]]]]] U [[[[[[p8<=1 & 1<=p8] & [p61<=1 & 1<=p61]] | [p83<=1 & 1<=p83]] & [p59<=1 & 1<=p59]] & [p40<=1 & 1<=p40]] & [~ [EG [~ [[[p108<=1 & 1<=p108] & [p78<=1 & 1<=p78]]]]] & [~ [EG [~ [[p36<=1 & 1<=p36]]]] & ~ [E [~ [[p36<=1 & 1<=p36]] U [~ [[p105<=1 & 1<=p105]] & ~ [[p36<=1 & 1<=p36]]]]]]]]] & E [true U EG [[p105<=1 & 1<=p105]]]]]]]]]
abstracting: (1<=p105)
states: 64,487,424 (7)
abstracting: (p105<=1)
states: 3,514,564,609 (9)
....................................
EG iterations: 36
abstracting: (1<=p36)
states: 57,147,392 (7)
abstracting: (p36<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p105)
states: 64,487,424 (7)
abstracting: (p105<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p36)
states: 57,147,392 (7)
abstracting: (p36<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p36)
states: 57,147,392 (7)
abstracting: (p36<=1)
states: 3,514,564,609 (9)
....................................
EG iterations: 36
abstracting: (1<=p78)
states: 1,757,282,304 (9)
abstracting: (p78<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p108)
states: 96,731,136 (7)
abstracting: (p108<=1)
states: 3,514,564,609 (9)
....................................
EG iterations: 36
abstracting: (1<=p40)
states: 85,721,088 (7)
abstracting: (p40<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p59)
states: 3,400,269,824 (9)
abstracting: (p59<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p83)
states: 96,731,136 (7)
abstracting: (p83<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p61)
states: 657,195,008 (8)
abstracting: (p61<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p8)
states: 1,757,282,304 (9)
abstracting: (p8<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p95)
states: 96,731,136 (7)
abstracting: (p95<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p121)
states: 3,417,833,472 (9)
abstracting: (p121<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p100)
states: 96,731,136 (7)
abstracting: (p100<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p124)
states: 1,257,504,768 (9)
abstracting: (p124<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p118)
states: 96,731,136 (7)
abstracting: (p118<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p72)
states: 1,757,282,304 (9)
abstracting: (p72<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p32)
states: 114,294,784 (8)
abstracting: (p32<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p62)
states: 1,057,226,752 (9)
abstracting: (p62<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p100)
states: 96,731,136 (7)
abstracting: (p100<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p124)
states: 1,257,504,768 (9)
abstracting: (p124<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p100)
states: 96,731,136 (7)
abstracting: (p100<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p124)
states: 1,257,504,768 (9)
abstracting: (p124<=1)
states: 3,514,564,609 (9)
...................................
EG iterations: 35
...................................
EG iterations: 35
abstracting: (1<=p105)
states: 64,487,424 (7)
abstracting: (p105<=1)
states: 3,514,564,609 (9)
....................................
EG iterations: 36
abstracting: (1<=p36)
states: 57,147,392 (7)
abstracting: (p36<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p105)
states: 64,487,424 (7)
abstracting: (p105<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p36)
states: 57,147,392 (7)
abstracting: (p36<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p36)
states: 57,147,392 (7)
abstracting: (p36<=1)
states: 3,514,564,609 (9)
....................................
EG iterations: 36
abstracting: (1<=p78)
states: 1,757,282,304 (9)
abstracting: (p78<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p108)
states: 96,731,136 (7)
abstracting: (p108<=1)
states: 3,514,564,609 (9)
....................................
EG iterations: 36
abstracting: (1<=p40)
states: 85,721,088 (7)
abstracting: (p40<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p59)
states: 3,400,269,824 (9)
abstracting: (p59<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p83)
states: 96,731,136 (7)
abstracting: (p83<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p61)
states: 657,195,008 (8)
abstracting: (p61<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p8)
states: 1,757,282,304 (9)
abstracting: (p8<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p95)
states: 96,731,136 (7)
abstracting: (p95<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p121)
states: 3,417,833,472 (9)
abstracting: (p121<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p105)
states: 64,487,424 (7)
abstracting: (p105<=1)
states: 3,514,564,609 (9)
....................................
EG iterations: 36
abstracting: (1<=p36)
states: 57,147,392 (7)
abstracting: (p36<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p105)
states: 64,487,424 (7)
abstracting: (p105<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p36)
states: 57,147,392 (7)
abstracting: (p36<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p36)
states: 57,147,392 (7)
abstracting: (p36<=1)
states: 3,514,564,609 (9)
....................................
EG iterations: 36
abstracting: (1<=p78)
states: 1,757,282,304 (9)
abstracting: (p78<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p108)
states: 96,731,136 (7)
abstracting: (p108<=1)
states: 3,514,564,609 (9)
....................................
EG iterations: 36
abstracting: (1<=p40)
states: 85,721,088 (7)
abstracting: (p40<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p59)
states: 3,400,269,824 (9)
abstracting: (p59<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p83)
states: 96,731,136 (7)
abstracting: (p83<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p61)
states: 657,195,008 (8)
abstracting: (p61<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p8)
states: 1,757,282,304 (9)
abstracting: (p8<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p95)
states: 96,731,136 (7)
abstracting: (p95<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p121)
states: 3,417,833,472 (9)
abstracting: (p121<=1)
states: 3,514,564,609 (9)
EG iterations: 0
-> the formula is FALSE
FORMULA Parking-PT-208-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.230sec
checking: EF [[[[[p35<=1 & 1<=p35] & [p63<=1 & 1<=p63]] | [EG [A [[p36<=1 & 1<=p36] U [[p77<=1 & 1<=p77] & [p103<=1 & 1<=p103]]]] & A [EG [[p30<=1 & 1<=p30]] U AG [[[p79<=1 & 1<=p79] & [p114<=1 & 1<=p114]]]]]] & [[AG [[p83<=1 & 1<=p83]] | AG [A [[[p65<=1 & 1<=p65] & [p81<=1 & 1<=p81]] U [[p67<=1 & 1<=p67] & [p111<=1 & 1<=p111]]]]] | [A [[~ [[[p109<=1 & 1<=p109] & [p120<=1 & 1<=p120]]] | [[p14<=1 & 1<=p14] & [p98<=1 & 1<=p98]]] U EG [[p43<=1 & 1<=p43]]] | [[p68<=1 & 1<=p68] & [1<=p117 & p117<=1]]]]]]
normalized: E [true U [[[[[1<=p117 & p117<=1] & [p68<=1 & 1<=p68]] | [~ [EG [~ [EG [[p43<=1 & 1<=p43]]]]] & ~ [E [~ [EG [[p43<=1 & 1<=p43]]] U [~ [[[[p98<=1 & 1<=p98] & [p14<=1 & 1<=p14]] | ~ [[[p120<=1 & 1<=p120] & [p109<=1 & 1<=p109]]]]] & ~ [EG [[p43<=1 & 1<=p43]]]]]]]] | [~ [E [true U ~ [[~ [EG [~ [[[p111<=1 & 1<=p111] & [p67<=1 & 1<=p67]]]]] & ~ [E [~ [[[p111<=1 & 1<=p111] & [p67<=1 & 1<=p67]]] U [~ [[[p81<=1 & 1<=p81] & [p65<=1 & 1<=p65]]] & ~ [[[p111<=1 & 1<=p111] & [p67<=1 & 1<=p67]]]]]]]]]] | ~ [E [true U ~ [[p83<=1 & 1<=p83]]]]]] & [[[~ [EG [E [true U ~ [[[p114<=1 & 1<=p114] & [p79<=1 & 1<=p79]]]]]] & ~ [E [E [true U ~ [[[p114<=1 & 1<=p114] & [p79<=1 & 1<=p79]]]] U [~ [EG [[p30<=1 & 1<=p30]]] & E [true U ~ [[[p114<=1 & 1<=p114] & [p79<=1 & 1<=p79]]]]]]]] & EG [[~ [EG [~ [[[p103<=1 & 1<=p103] & [p77<=1 & 1<=p77]]]]] & ~ [E [~ [[[p103<=1 & 1<=p103] & [p77<=1 & 1<=p77]]] U [~ [[p36<=1 & 1<=p36]] & ~ [[[p103<=1 & 1<=p103] & [p77<=1 & 1<=p77]]]]]]]]] | [[p63<=1 & 1<=p63] & [p35<=1 & 1<=p35]]]]]
abstracting: (1<=p35)
states: 57,147,392 (7)
abstracting: (p35<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p63)
states: 1,057,226,752 (9)
abstracting: (p63<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p77)
states: 1,757,282,304 (9)
abstracting: (p77<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p103)
states: 96,731,136 (7)
abstracting: (p103<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p36)
states: 57,147,392 (7)
abstracting: (p36<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p77)
states: 1,757,282,304 (9)
abstracting: (p77<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p103)
states: 96,731,136 (7)
abstracting: (p103<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p77)
states: 1,757,282,304 (9)
abstracting: (p77<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p103)
states: 96,731,136 (7)
abstracting: (p103<=1)
states: 3,514,564,609 (9)
.
EG iterations: 1
....................................
EG iterations: 36
abstracting: (1<=p79)
states: 1,757,282,304 (9)
abstracting: (p79<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p114)
states: 96,731,136 (7)
abstracting: (p114<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p30)
states: 85,721,088 (7)
abstracting: (p30<=1)
states: 3,514,564,609 (9)
.....................................
EG iterations: 37
abstracting: (1<=p79)
states: 1,757,282,304 (9)
abstracting: (p79<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p114)
states: 96,731,136 (7)
abstracting: (p114<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p79)
states: 1,757,282,304 (9)
abstracting: (p79<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p114)
states: 96,731,136 (7)
abstracting: (p114<=1)
states: 3,514,564,609 (9)
EG iterations: 0
abstracting: (1<=p83)
states: 96,731,136 (7)
abstracting: (p83<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p67)
states: 1,757,282,304 (9)
abstracting: (p67<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p111)
states: 96,731,136 (7)
abstracting: (p111<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p65)
states: 1,757,282,304 (9)
abstracting: (p65<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p81)
states: 96,731,136 (7)
abstracting: (p81<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p67)
states: 1,757,282,304 (9)
abstracting: (p67<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p111)
states: 96,731,136 (7)
abstracting: (p111<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p67)
states: 1,757,282,304 (9)
abstracting: (p67<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p111)
states: 96,731,136 (7)
abstracting: (p111<=1)
states: 3,514,564,609 (9)
.
EG iterations: 1
abstracting: (1<=p43)
states: 57,147,392 (7)
abstracting: (p43<=1)
states: 3,514,564,609 (9)
....................................
EG iterations: 36
abstracting: (1<=p109)
states: 2,934,177,792 (9)
abstracting: (p109<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p120)
states: 96,731,136 (7)
abstracting: (p120<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p14)
states: 1,757,282,304 (9)
abstracting: (p14<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p98)
states: 64,487,424 (7)
abstracting: (p98<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p43)
states: 57,147,392 (7)
abstracting: (p43<=1)
states: 3,514,564,609 (9)
....................................
EG iterations: 36
abstracting: (1<=p43)
states: 57,147,392 (7)
abstracting: (p43<=1)
states: 3,514,564,609 (9)
....................................
EG iterations: 36
.
EG iterations: 1
abstracting: (1<=p68)
states: 1,757,282,304 (9)
abstracting: (p68<=1)
states: 3,514,564,609 (9)
abstracting: (p117<=1)
states: 3,514,564,609 (9)
abstracting: (1<=p117)
states: 96,731,136 (7)
-> the formula is TRUE
FORMULA Parking-PT-208-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.829sec
totally nodes used: 19454361 (1.9e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 16605563 36752378 53357941
used/not used/entry size/cache size: 37970213 29138651 16 1024MB
basic ops cache: hits/miss/sum: 2165422 4581840 6747262
used/not used/entry size/cache size: 6638241 10138975 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: 5253 16815 22068
used/not used/entry size/cache size: 16799 8371809 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 50770671
1 13641543
2 2325581
3 327394
4 39300
5 4002
6 350
7 20
8 3
9 0
>= 10 0
Total processing time: 0m29.099sec
BK_STOP 1679042609132
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:1794 (16), effective:209 (1)
initing FirstDep: 0m 0.000sec
iterations count:3247 (28), effective:327 (2)
iterations count:1049 (9), effective:91 (0)
iterations count:654 (5), effective:66 (0)
iterations count:17146 (153), effective:1938 (17)
iterations count:456 (4), effective:40 (0)
iterations count:126 (1), effective:3 (0)
iterations count:1190 (10), effective:135 (1)
iterations count:1813 (16), effective:160 (1)
iterations count:119 (1), effective:1 (0)
iterations count:112 (1), effective:0 (0)
iterations count:114 (1), effective:1 (0)
iterations count:113 (1), effective:1 (0)
iterations count:1314 (11), effective:116 (1)
iterations count:5400 (48), effective:552 (4)
iterations count:114 (1), effective:1 (0)
iterations count:112 (1), effective:0 (0)
iterations count:3262 (29), effective:327 (2)
iterations count:112 (1), effective:0 (0)
iterations count:124 (1), effective:1 (0)
iterations count:173 (1), effective:14 (0)
iterations count:218 (1), effective:12 (0)
iterations count:127 (1), effective:2 (0)
iterations count:138 (1), effective:1 (0)
iterations count:1246 (11), effective:109 (0)
iterations count:116 (1), effective:1 (0)
iterations count:112 (1), effective:0 (0)
iterations count:1074 (9), effective:99 (0)
iterations count:1716 (15), effective:163 (1)
iterations count:1716 (15), effective:163 (1)
iterations count:115 (1), effective:1 (0)
iterations count:1716 (15), effective:163 (1)
iterations count:112 (1), effective:0 (0)
iterations count:18035 (161), effective:2060 (18)
iterations count:114 (1), effective:1 (0)
iterations count:116 (1), effective:1 (0)
iterations count:119 (1), effective:1 (0)
iterations count:123 (1), effective:2 (0)
iterations count:18035 (161), effective:2060 (18)
iterations count:114 (1), effective:1 (0)
iterations count:116 (1), effective:1 (0)
iterations count:18035 (161), effective:2060 (18)
iterations count:114 (1), effective:1 (0)
iterations count:116 (1), effective:1 (0)
iterations count:115 (1), effective:1 (0)
iterations count:113 (1), effective:1 (0)
iterations count:113 (1), effective:1 (0)
iterations count:142 (1), effective:1 (0)
iterations count:113 (1), effective:1 (0)
iterations count:115 (1), effective:1 (0)
iterations count:113 (1), effective:1 (0)
iterations count:113 (1), effective:1 (0)
iterations count:1227 (10), effective:107 (0)
iterations count:17129 (152), effective:1939 (17)
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="Parking-PT-208"
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 Parking-PT-208, 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 r266-smll-167863540900418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-208.tgz
mv Parking-PT-208 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 ;