About the Execution of Marcie+red for AutonomousCar-PT-02b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7883.691 | 56642.00 | 68054.00 | 21.90 | FTFFTFFTFFTTTFTT | 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.r010-oct2-167813599200553.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutonomousCar-PT-02b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599200553
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 49K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-00
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-01
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-02
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-03
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-04
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-05
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-06
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-07
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-08
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-09
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-10
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-11
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-12
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-13
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-14
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678698773095
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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-02b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:12:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:12:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:12:55] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-13 09:12:55] [INFO ] Transformed 155 places.
[2023-03-13 09:12:55] [INFO ] Transformed 194 transitions.
[2023-03-13 09:12:55] [INFO ] Found NUPN structural information;
[2023-03-13 09:12:55] [INFO ] Parsed PT model containing 155 places and 194 transitions and 620 arcs in 103 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Support contains 96 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 194/194 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 149 transition count 188
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 149 transition count 188
Applied a total of 12 rules in 17 ms. Remains 149 /155 variables (removed 6) and now considering 188/194 (removed 6) transitions.
// Phase 1: matrix 188 rows 149 cols
[2023-03-13 09:12:55] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-13 09:12:55] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-13 09:12:55] [INFO ] Invariant cache hit.
[2023-03-13 09:12:56] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
[2023-03-13 09:12:56] [INFO ] Invariant cache hit.
[2023-03-13 09:12:56] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 149/155 places, 188/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 924 ms. Remains : 149/155 places, 188/194 transitions.
Support contains 96 out of 149 places after structural reductions.
[2023-03-13 09:12:56] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-13 09:12:56] [INFO ] Flatten gal took : 34 ms
FORMULA AutonomousCar-PT-02b-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:12:56] [INFO ] Flatten gal took : 23 ms
[2023-03-13 09:12:56] [INFO ] Input system was already deterministic with 188 transitions.
Support contains 82 out of 149 places (down from 96) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 60) seen :49
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-13 09:12:57] [INFO ] Invariant cache hit.
[2023-03-13 09:12:57] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 09:12:57] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 09:12:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 09:12:58] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-13 09:12:58] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 18 ms to minimize.
[2023-03-13 09:12:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-13 09:12:58] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 0 ms to minimize.
[2023-03-13 09:12:58] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2023-03-13 09:12:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 149 ms
[2023-03-13 09:12:58] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 2 ms to minimize.
[2023-03-13 09:12:58] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2023-03-13 09:12:58] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2023-03-13 09:12:58] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 1 ms to minimize.
[2023-03-13 09:12:58] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2023-03-13 09:12:58] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2023-03-13 09:12:58] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-13 09:12:59] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2023-03-13 09:12:59] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2023-03-13 09:12:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 805 ms
[2023-03-13 09:12:59] [INFO ] After 1267ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-13 09:12:59] [INFO ] After 1387ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 188/188 transitions.
Graph (trivial) has 136 edges and 149 vertex of which 4 / 149 are part of one of the 2 SCC in 16 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 302 edges and 147 vertex of which 140 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 140 transition count 117
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 77 rules applied. Total rules applied 141 place count 80 transition count 100
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 150 place count 71 transition count 100
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 150 place count 71 transition count 95
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 160 place count 66 transition count 95
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 171 place count 55 transition count 84
Iterating global reduction 3 with 11 rules applied. Total rules applied 182 place count 55 transition count 84
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 198 place count 55 transition count 68
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 198 place count 55 transition count 66
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 202 place count 53 transition count 66
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 204 place count 51 transition count 62
Iterating global reduction 4 with 2 rules applied. Total rules applied 206 place count 51 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 2 rules applied. Total rules applied 208 place count 51 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 209 place count 50 transition count 60
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 243 place count 33 transition count 43
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 246 place count 30 transition count 36
Iterating global reduction 6 with 3 rules applied. Total rules applied 249 place count 30 transition count 36
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 255 place count 27 transition count 51
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 256 place count 27 transition count 51
Applied a total of 256 rules in 54 ms. Remains 27 /149 variables (removed 122) and now considering 51/188 (removed 137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 27/149 places, 51/188 transitions.
Finished random walk after 107 steps, including 6 resets, run visited all 1 properties in 1 ms. (steps per millisecond=107 )
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2023-03-13 09:12:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 22 ms
FORMULA AutonomousCar-PT-02b-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:12:59] [INFO ] Input system was already deterministic with 188 transitions.
Support contains 76 out of 149 places (down from 77) after GAL structural reductions.
Computed a total of 36 stabilizing places and 37 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 134 transition count 173
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 134 transition count 173
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 46 place count 134 transition count 157
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 133 transition count 156
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 133 transition count 156
Applied a total of 48 rules in 15 ms. Remains 133 /149 variables (removed 16) and now considering 156/188 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 133/149 places, 156/188 transitions.
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:12:59] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Graph (trivial) has 139 edges and 149 vertex of which 4 / 149 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 146 transition count 121
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 79 rules applied. Total rules applied 144 place count 82 transition count 106
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 153 place count 74 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 73 transition count 105
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 154 place count 73 transition count 98
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 168 place count 66 transition count 98
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 181 place count 53 transition count 85
Iterating global reduction 4 with 13 rules applied. Total rules applied 194 place count 53 transition count 85
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 210 place count 53 transition count 69
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 210 place count 53 transition count 67
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 214 place count 51 transition count 67
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 216 place count 49 transition count 63
Iterating global reduction 5 with 2 rules applied. Total rules applied 218 place count 49 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 5 with 2 rules applied. Total rules applied 220 place count 49 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 221 place count 48 transition count 61
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 247 place count 35 transition count 48
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 250 place count 32 transition count 41
Iterating global reduction 7 with 3 rules applied. Total rules applied 253 place count 32 transition count 41
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 255 place count 32 transition count 39
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 256 place count 32 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 257 place count 31 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 259 place count 29 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 260 place count 28 transition count 36
Applied a total of 260 rules in 25 ms. Remains 28 /149 variables (removed 121) and now considering 36/188 (removed 152) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 28/149 places, 36/188 transitions.
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:12:59] [INFO ] Input system was already deterministic with 36 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 131 transition count 170
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 131 transition count 170
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 127 transition count 166
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 127 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 126 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 126 transition count 165
Applied a total of 46 rules in 22 ms. Remains 126 /149 variables (removed 23) and now considering 165/188 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 126/149 places, 165/188 transitions.
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:12:59] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 132 transition count 171
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 132 transition count 171
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 50 place count 132 transition count 155
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 129 transition count 152
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 129 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 128 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 128 transition count 151
Applied a total of 58 rules in 15 ms. Remains 128 /149 variables (removed 21) and now considering 151/188 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 128/149 places, 151/188 transitions.
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:12:59] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 134 transition count 173
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 134 transition count 173
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 46 place count 134 transition count 157
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 131 transition count 154
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 131 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 130 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 130 transition count 153
Applied a total of 54 rules in 20 ms. Remains 130 /149 variables (removed 19) and now considering 153/188 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 130/149 places, 153/188 transitions.
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:12:59] [INFO ] Input system was already deterministic with 153 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 131 transition count 170
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 131 transition count 170
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 52 place count 131 transition count 154
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 127 transition count 150
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 127 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 126 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 126 transition count 149
Applied a total of 62 rules in 16 ms. Remains 126 /149 variables (removed 23) and now considering 149/188 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 126/149 places, 149/188 transitions.
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:12:59] [INFO ] Input system was already deterministic with 149 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 131 transition count 170
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 131 transition count 170
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 127 transition count 166
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 127 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 126 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 126 transition count 165
Applied a total of 46 rules in 6 ms. Remains 126 /149 variables (removed 23) and now considering 165/188 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 126/149 places, 165/188 transitions.
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 16 ms
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:12:59] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Graph (trivial) has 127 edges and 149 vertex of which 4 / 149 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 146 transition count 130
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 65 rules applied. Total rules applied 121 place count 91 transition count 120
Reduce places removed 5 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 11 rules applied. Total rules applied 132 place count 86 transition count 114
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 140 place count 80 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 141 place count 79 transition count 112
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 141 place count 79 transition count 106
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 153 place count 73 transition count 106
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 164 place count 62 transition count 95
Iterating global reduction 5 with 11 rules applied. Total rules applied 175 place count 62 transition count 95
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 191 place count 62 transition count 79
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 191 place count 62 transition count 77
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 195 place count 60 transition count 77
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 196 place count 59 transition count 75
Iterating global reduction 6 with 1 rules applied. Total rules applied 197 place count 59 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 6 with 2 rules applied. Total rules applied 199 place count 59 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 200 place count 58 transition count 73
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 226 place count 45 transition count 60
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 228 place count 43 transition count 56
Iterating global reduction 8 with 2 rules applied. Total rules applied 230 place count 43 transition count 56
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 231 place count 43 transition count 55
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 232 place count 43 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 234 place count 41 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 235 place count 40 transition count 53
Applied a total of 235 rules in 32 ms. Remains 40 /149 variables (removed 109) and now considering 53/188 (removed 135) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 40/149 places, 53/188 transitions.
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:12:59] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 131 transition count 170
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 131 transition count 170
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 52 place count 131 transition count 154
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 128 transition count 151
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 128 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 127 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 127 transition count 150
Applied a total of 60 rules in 6 ms. Remains 127 /149 variables (removed 22) and now considering 150/188 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 127/149 places, 150/188 transitions.
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 23 ms
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:12:59] [INFO ] Input system was already deterministic with 150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 131 transition count 170
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 131 transition count 170
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 52 place count 131 transition count 154
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 128 transition count 151
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 128 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 127 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 127 transition count 150
Applied a total of 60 rules in 6 ms. Remains 127 /149 variables (removed 22) and now considering 150/188 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 127/149 places, 150/188 transitions.
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:12:59] [INFO ] Input system was already deterministic with 150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 132 transition count 171
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 132 transition count 171
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 50 place count 132 transition count 155
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 129 transition count 152
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 129 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 128 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 128 transition count 151
Applied a total of 58 rules in 7 ms. Remains 128 /149 variables (removed 21) and now considering 151/188 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 128/149 places, 151/188 transitions.
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:12:59] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Graph (trivial) has 138 edges and 149 vertex of which 4 / 149 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 146 transition count 118
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 85 rules applied. Total rules applied 153 place count 79 transition count 100
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 163 place count 69 transition count 100
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 163 place count 69 transition count 94
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 175 place count 63 transition count 94
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 188 place count 50 transition count 81
Iterating global reduction 3 with 13 rules applied. Total rules applied 201 place count 50 transition count 81
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 217 place count 50 transition count 65
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 217 place count 50 transition count 63
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 221 place count 48 transition count 63
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 223 place count 46 transition count 59
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 46 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 with 4 rules applied. Total rules applied 229 place count 46 transition count 55
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 231 place count 44 transition count 55
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 255 place count 32 transition count 43
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 257 place count 30 transition count 39
Iterating global reduction 6 with 2 rules applied. Total rules applied 259 place count 30 transition count 39
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 260 place count 30 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 262 place count 28 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 263 place count 27 transition count 36
Applied a total of 263 rules in 12 ms. Remains 27 /149 variables (removed 122) and now considering 36/188 (removed 152) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 27/149 places, 36/188 transitions.
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:12:59] [INFO ] Input system was already deterministic with 36 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 130 transition count 169
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 130 transition count 169
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 54 place count 130 transition count 153
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 127 transition count 150
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 127 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 126 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 126 transition count 149
Applied a total of 62 rules in 6 ms. Remains 126 /149 variables (removed 23) and now considering 149/188 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 126/149 places, 149/188 transitions.
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:12:59] [INFO ] Input system was already deterministic with 149 transitions.
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:12:59] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:12:59] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2023-03-13 09:12:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 149 places, 188 transitions and 608 arcs took 2 ms.
Total runtime 4499 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=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 149 NrTr: 188 NrArc: 608)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.003sec
net check time: 0m 0.000sec
init dd package: 0m 2.953sec
RS generation: 0m 0.287sec
-> reachability set: #nodes 6786 (6.8e+03) #states 3,277,608 (6)
starting MCC model checker
--------------------------
checking: AF [[p32<=1 & 1<=p32]]
normalized: ~ [EG [~ [[p32<=1 & 1<=p32]]]]
abstracting: (1<=p32)
states: 117,636 (5)
abstracting: (p32<=1)
states: 3,277,608 (6)
.........................................
EG iterations: 41
-> the formula is FALSE
FORMULA AutonomousCar-PT-02b-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.349sec
checking: EF [AG [EF [EG [[p45<=1 & 1<=p45]]]]]
normalized: E [true U ~ [E [true U ~ [E [true U EG [[p45<=1 & 1<=p45]]]]]]]
abstracting: (1<=p45)
states: 197,556 (5)
abstracting: (p45<=1)
states: 3,277,608 (6)
........................................
EG iterations: 40
-> the formula is TRUE
FORMULA AutonomousCar-PT-02b-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.462sec
checking: AG [[EX [[p3<=0 & 0<=p3]] & [[p63<=0 & 0<=p63] | [p82<=1 & 1<=p82]]]]
normalized: ~ [E [true U ~ [[[[p82<=1 & 1<=p82] | [p63<=0 & 0<=p63]] & EX [[p3<=0 & 0<=p3]]]]]]
abstracting: (0<=p3)
states: 3,277,608 (6)
abstracting: (p3<=0)
states: 2,735,016 (6)
.abstracting: (0<=p63)
states: 3,277,608 (6)
abstracting: (p63<=0)
states: 3,163,722 (6)
abstracting: (1<=p82)
states: 192,174 (5)
abstracting: (p82<=1)
states: 3,277,608 (6)
-> the formula is FALSE
FORMULA AutonomousCar-PT-02b-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.576sec
checking: AX [[EX [[p137<=0 & 0<=p137]] & [AF [[[p44<=1 & 1<=p44] & [p4<=1 & 1<=p4]]] & AF [[[p142<=0 & 0<=p142] | [p0<=1 & 1<=p0]]]]]]
normalized: ~ [EX [~ [[[~ [EG [~ [[[p142<=0 & 0<=p142] | [p0<=1 & 1<=p0]]]]] & ~ [EG [~ [[[p4<=1 & 1<=p4] & [p44<=1 & 1<=p44]]]]]] & EX [[p137<=0 & 0<=p137]]]]]]
abstracting: (0<=p137)
states: 3,277,608 (6)
abstracting: (p137<=0)
states: 3,181,524 (6)
.abstracting: (1<=p44)
states: 109,296 (5)
abstracting: (p44<=1)
states: 3,277,608 (6)
abstracting: (1<=p4)
states: 542,592 (5)
abstracting: (p4<=1)
states: 3,277,608 (6)
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 3,277,608 (6)
abstracting: (0<=p142)
states: 3,277,608 (6)
abstracting: (p142<=0)
states: 3,181,524 (6)
....................................................................................
EG iterations: 84
.-> the formula is FALSE
FORMULA AutonomousCar-PT-02b-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.550sec
checking: EG [[EF [[[p5<=1 & 1<=p5] & EF [[p105<=1 & 1<=p105]]]] | EX [[[p67<=0 & 0<=p67] | [[p30<=1 & 1<=p30] | [p12<=1 & 1<=p12]]]]]]
normalized: EG [[EX [[[[p12<=1 & 1<=p12] | [p30<=1 & 1<=p30]] | [p67<=0 & 0<=p67]]] | E [true U [E [true U [p105<=1 & 1<=p105]] & [p5<=1 & 1<=p5]]]]]
abstracting: (1<=p5)
states: 783,288 (5)
abstracting: (p5<=1)
states: 3,277,608 (6)
abstracting: (1<=p105)
states: 171,594 (5)
abstracting: (p105<=1)
states: 3,277,608 (6)
abstracting: (0<=p67)
states: 3,277,608 (6)
abstracting: (p67<=0)
states: 3,163,722 (6)
abstracting: (1<=p30)
states: 117,636 (5)
abstracting: (p30<=1)
states: 3,277,608 (6)
abstracting: (1<=p12)
states: 391,644 (5)
abstracting: (p12<=1)
states: 3,277,608 (6)
....................................................................................
EG iterations: 83
-> the formula is TRUE
FORMULA AutonomousCar-PT-02b-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.854sec
checking: AF [[EF [AX [1<=0]] & [AX [[[p41<=0 & 0<=p41] & [p13<=1 & 1<=p13]]] | A [[AG [[p101<=1 & 1<=p101]] | EG [[p44<=0 & 0<=p44]]] U ~ [AX [[p97<=1 & 1<=p97]]]]]]]
normalized: ~ [EG [~ [[[[~ [EG [~ [EX [~ [[p97<=1 & 1<=p97]]]]]] & ~ [E [~ [EX [~ [[p97<=1 & 1<=p97]]]] U [~ [[EG [[p44<=0 & 0<=p44]] | ~ [E [true U ~ [[p101<=1 & 1<=p101]]]]]] & ~ [EX [~ [[p97<=1 & 1<=p97]]]]]]]] | ~ [EX [~ [[[p13<=1 & 1<=p13] & [p41<=0 & 0<=p41]]]]]] & E [true U ~ [EX [~ [1<=0]]]]]]]]
abstracting: (1<=0)
states: 0
.abstracting: (0<=p41)
states: 3,277,608 (6)
abstracting: (p41<=0)
states: 3,159,972 (6)
abstracting: (1<=p13)
states: 835,128 (5)
abstracting: (p13<=1)
states: 3,277,608 (6)
.abstracting: (1<=p97)
states: 60,720 (4)
abstracting: (p97<=1)
states: 3,277,608 (6)
.abstracting: (1<=p101)
states: 60,720 (4)
abstracting: (p101<=1)
states: 3,277,608 (6)
abstracting: (0<=p44)
states: 3,277,608 (6)
abstracting: (p44<=0)
states: 3,168,312 (6)
.........................................
EG iterations: 41
abstracting: (1<=p97)
states: 60,720 (4)
abstracting: (p97<=1)
states: 3,277,608 (6)
.abstracting: (1<=p97)
states: 60,720 (4)
abstracting: (p97<=1)
states: 3,277,608 (6)
...
EG iterations: 2
.
EG iterations: 1
-> the formula is TRUE
FORMULA AutonomousCar-PT-02b-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.573sec
checking: ~ [A [[EX [0<=0] | EF [[[[p96<=1 & 1<=p96] & [[p56<=0 & 0<=p56] | [p23<=1 & 1<=p23]]] | [[p21<=0 & 0<=p21] | [p141<=1 & 1<=p141]]]]] U EF [EG [[p83<=1 & 1<=p83]]]]]
normalized: ~ [[~ [EG [~ [E [true U EG [[p83<=1 & 1<=p83]]]]]] & ~ [E [~ [E [true U EG [[p83<=1 & 1<=p83]]]] U [~ [[E [true U [[[[p23<=1 & 1<=p23] | [p56<=0 & 0<=p56]] & [p96<=1 & 1<=p96]] | [[p141<=1 & 1<=p141] | [p21<=0 & 0<=p21]]]] | EX [0<=0]]] & ~ [E [true U EG [[p83<=1 & 1<=p83]]]]]]]]]
abstracting: (1<=p83)
states: 2,400 (3)
abstracting: (p83<=1)
states: 3,277,608 (6)
.........................
EG iterations: 25
abstracting: (0<=0)
states: 3,277,608 (6)
.abstracting: (0<=p21)
states: 3,277,608 (6)
abstracting: (p21<=0)
states: 3,277,008 (6)
abstracting: (1<=p141)
states: 96,084 (4)
abstracting: (p141<=1)
states: 3,277,608 (6)
abstracting: (1<=p96)
states: 60,720 (4)
abstracting: (p96<=1)
states: 3,277,608 (6)
abstracting: (0<=p56)
states: 3,277,608 (6)
abstracting: (p56<=0)
states: 3,163,722 (6)
abstracting: (1<=p23)
states: 600
abstracting: (p23<=1)
states: 3,277,608 (6)
abstracting: (1<=p83)
states: 2,400 (3)
abstracting: (p83<=1)
states: 3,277,608 (6)
.........................
EG iterations: 25
abstracting: (1<=p83)
states: 2,400 (3)
abstracting: (p83<=1)
states: 3,277,608 (6)
.........................
EG iterations: 25
EG iterations: 0
-> the formula is TRUE
FORMULA AutonomousCar-PT-02b-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.375sec
checking: AF [[A [AF [EG [[p5<=1 & 1<=p5]]] U ~ [EF [[[p99<=0 & 0<=p99] | [p111<=1 & 1<=p111]]]]] & EG [EX [[[p106<=1 & 1<=p106] & EG [[[p122<=0 & 0<=p122] | [p14<=1 & 1<=p14]]]]]]]]
normalized: ~ [EG [~ [[EG [EX [[EG [[[p14<=1 & 1<=p14] | [p122<=0 & 0<=p122]]] & [p106<=1 & 1<=p106]]]] & [~ [EG [E [true U [[p111<=1 & 1<=p111] | [p99<=0 & 0<=p99]]]]] & ~ [E [E [true U [[p111<=1 & 1<=p111] | [p99<=0 & 0<=p99]]] U [EG [~ [EG [[p5<=1 & 1<=p5]]]] & E [true U [[p111<=1 & 1<=p111] | [p99<=0 & 0<=p99]]]]]]]]]]]
abstracting: (0<=p99)
states: 3,277,608 (6)
abstracting: (p99<=0)
states: 3,216,888 (6)
abstracting: (1<=p111)
states: 3,450 (3)
abstracting: (p111<=1)
states: 3,277,608 (6)
abstracting: (1<=p5)
states: 783,288 (5)
abstracting: (p5<=1)
states: 3,277,608 (6)
.......................................
EG iterations: 39
..............................................................
EG iterations: 62
abstracting: (0<=p99)
states: 3,277,608 (6)
abstracting: (p99<=0)
states: 3,216,888 (6)
abstracting: (1<=p111)
states: 3,450 (3)
abstracting: (p111<=1)
states: 3,277,608 (6)
abstracting: (0<=p99)
states: 3,277,608 (6)
abstracting: (p99<=0)
states: 3,216,888 (6)
abstracting: (1<=p111)
states: 3,450 (3)
abstracting: (p111<=1)
states: 3,277,608 (6)
EG iterations: 0
abstracting: (1<=p106)
states: 171,594 (5)
abstracting: (p106<=1)
states: 3,277,608 (6)
abstracting: (0<=p122)
states: 3,277,608 (6)
abstracting: (p122<=0)
states: 3,181,524 (6)
abstracting: (1<=p14)
states: 792,648 (5)
abstracting: (p14<=1)
states: 3,277,608 (6)
............................................
EG iterations: 44
...............................
EG iterations: 30
EG iterations: 0
-> the formula is FALSE
FORMULA AutonomousCar-PT-02b-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.041sec
checking: AG [AF [[AX [[[p20<=0 & 0<=p20] | [p36<=1 & 1<=p36]]] | [E [[p60<=1 & 1<=p60] U [p100<=1 & 1<=p100]] | [[p122<=0 & 0<=p122] & AG [~ [[p48<=0 & 0<=p48]]]]]]]]
normalized: ~ [E [true U EG [~ [[[[~ [E [true U [p48<=0 & 0<=p48]]] & [p122<=0 & 0<=p122]] | E [[p60<=1 & 1<=p60] U [p100<=1 & 1<=p100]]] | ~ [EX [~ [[[p36<=1 & 1<=p36] | [p20<=0 & 0<=p20]]]]]]]]]]
abstracting: (0<=p20)
states: 3,277,608 (6)
abstracting: (p20<=0)
states: 3,277,008 (6)
abstracting: (1<=p36)
states: 117,636 (5)
abstracting: (p36<=1)
states: 3,277,608 (6)
.abstracting: (1<=p100)
states: 60,720 (4)
abstracting: (p100<=1)
states: 3,277,608 (6)
abstracting: (1<=p60)
states: 113,886 (5)
abstracting: (p60<=1)
states: 3,277,608 (6)
abstracting: (0<=p122)
states: 3,277,608 (6)
abstracting: (p122<=0)
states: 3,181,524 (6)
abstracting: (0<=p48)
states: 3,277,608 (6)
abstracting: (p48<=0)
states: 3,159,972 (6)
......................
EG iterations: 22
-> the formula is TRUE
FORMULA AutonomousCar-PT-02b-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.323sec
checking: AG [[AF [~ [A [[[p108<=0 & 0<=p108] | [p42<=1 & 1<=p42]] U [p32<=1 & 1<=p32]]]] & [EF [AG [[p147<=1 & 1<=p147]]] | [[p29<=0 & 0<=p29] | A [AF [[p39<=0 & 0<=p39]] U [EG [[p94<=1 & 1<=p94]] | EG [[[p148<=0 & 0<=p148] | [p101<=1 & 1<=p101]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [EG [~ [[EG [[[p101<=1 & 1<=p101] | [p148<=0 & 0<=p148]]] | EG [[p94<=1 & 1<=p94]]]]]] & ~ [E [~ [[EG [[[p101<=1 & 1<=p101] | [p148<=0 & 0<=p148]]] | EG [[p94<=1 & 1<=p94]]]] U [EG [~ [[p39<=0 & 0<=p39]]] & ~ [[EG [[[p101<=1 & 1<=p101] | [p148<=0 & 0<=p148]]] | EG [[p94<=1 & 1<=p94]]]]]]]] | [p29<=0 & 0<=p29]] | E [true U ~ [E [true U ~ [[p147<=1 & 1<=p147]]]]]] & ~ [EG [[~ [EG [~ [[p32<=1 & 1<=p32]]]] & ~ [E [~ [[p32<=1 & 1<=p32]] U [~ [[[p42<=1 & 1<=p42] | [p108<=0 & 0<=p108]]] & ~ [[p32<=1 & 1<=p32]]]]]]]]]]]]
abstracting: (1<=p32)
states: 117,636 (5)
abstracting: (p32<=1)
states: 3,277,608 (6)
abstracting: (0<=p108)
states: 3,277,608 (6)
abstracting: (p108<=0)
states: 3,106,014 (6)
abstracting: (1<=p42)
states: 92,016 (4)
abstracting: (p42<=1)
states: 3,277,608 (6)
abstracting: (1<=p32)
states: 117,636 (5)
abstracting: (p32<=1)
states: 3,277,608 (6)
abstracting: (1<=p32)
states: 117,636 (5)
abstracting: (p32<=1)
states: 3,277,608 (6)
.........................................
EG iterations: 41
.........................................
EG iterations: 41
abstracting: (1<=p147)
states: 106,215 (5)
abstracting: (p147<=1)
states: 3,277,608 (6)
abstracting: (0<=p29)
states: 3,277,608 (6)
abstracting: (p29<=0)
states: 3,159,972 (6)
abstracting: (1<=p94)
states: 60,720 (4)
abstracting: (p94<=1)
states: 3,277,608 (6)
...................................
EG iterations: 35
abstracting: (0<=p148)
states: 3,277,608 (6)
abstracting: (p148<=0)
states: 3,171,393 (6)
abstracting: (1<=p101)
states: 60,720 (4)
abstracting: (p101<=1)
states: 3,277,608 (6)
...........................................................................................................
EG iterations: 107
abstracting: (0<=p39)
states: 3,277,608 (6)
abstracting: (p39<=0)
states: 3,185,592 (6)
..................................
EG iterations: 34
abstracting: (1<=p94)
states: 60,720 (4)
abstracting: (p94<=1)
states: 3,277,608 (6)
...................................
EG iterations: 35
abstracting: (0<=p148)
states: 3,277,608 (6)
abstracting: (p148<=0)
states: 3,171,393 (6)
abstracting: (1<=p101)
states: 60,720 (4)
abstracting: (p101<=1)
states: 3,277,608 (6)
...........................................................................................................
EG iterations: 107
abstracting: (1<=p94)
states: 60,720 (4)
abstracting: (p94<=1)
states: 3,277,608 (6)
...................................
EG iterations: 35
abstracting: (0<=p148)
states: 3,277,608 (6)
abstracting: (p148<=0)
states: 3,171,393 (6)
abstracting: (1<=p101)
states: 60,720 (4)
abstracting: (p101<=1)
states: 3,277,608 (6)
...........................................................................................................
EG iterations: 107
............................................................................................................
EG iterations: 108
-> the formula is FALSE
FORMULA AutonomousCar-PT-02b-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m11.240sec
checking: ~ [E [AX [A [[[p61<=1 & 1<=p61] | [p60<=1 & 1<=p60]] U ~ [[p43<=1 & 1<=p43]]]] U [[[[[p8<=0 & 0<=p8] | [p60<=1 & 1<=p60]] & AX [[p141<=1 & 1<=p141]]] | [~ [AX [[p38<=0 & 0<=p38]]] & [p100<=1 & 1<=p100]]] & AF [[AF [[p108<=1 & 1<=p108]] & EG [[[p98<=0 & 0<=p98] | [p75<=1 & 1<=p75]]]]]]]]
normalized: ~ [E [~ [EX [~ [[~ [EG [[p43<=1 & 1<=p43]]] & ~ [E [[p43<=1 & 1<=p43] U [~ [[[p60<=1 & 1<=p60] | [p61<=1 & 1<=p61]]] & [p43<=1 & 1<=p43]]]]]]]] U [[[[p100<=1 & 1<=p100] & EX [~ [[p38<=0 & 0<=p38]]]] | [~ [EX [~ [[p141<=1 & 1<=p141]]]] & [[p60<=1 & 1<=p60] | [p8<=0 & 0<=p8]]]] & ~ [EG [~ [[EG [[[p75<=1 & 1<=p75] | [p98<=0 & 0<=p98]]] & ~ [EG [~ [[p108<=1 & 1<=p108]]]]]]]]]]]
abstracting: (1<=p108)
states: 171,594 (5)
abstracting: (p108<=1)
states: 3,277,608 (6)
..........................................
EG iterations: 42
abstracting: (0<=p98)
states: 3,277,608 (6)
abstracting: (p98<=0)
states: 3,216,888 (6)
abstracting: (1<=p75)
states: 105,696 (5)
abstracting: (p75<=1)
states: 3,277,608 (6)
....................................
EG iterations: 36
.
EG iterations: 1
abstracting: (0<=p8)
states: 3,277,608 (6)
abstracting: (p8<=0)
states: 3,260,957 (6)
abstracting: (1<=p60)
states: 113,886 (5)
abstracting: (p60<=1)
states: 3,277,608 (6)
abstracting: (1<=p141)
states: 96,084 (4)
abstracting: (p141<=1)
states: 3,277,608 (6)
.abstracting: (0<=p38)
states: 3,277,608 (6)
abstracting: (p38<=0)
states: 3,159,972 (6)
.abstracting: (1<=p100)
states: 60,720 (4)
abstracting: (p100<=1)
states: 3,277,608 (6)
abstracting: (1<=p43)
states: 76,176 (4)
abstracting: (p43<=1)
states: 3,277,608 (6)
abstracting: (1<=p61)
states: 113,886 (5)
abstracting: (p61<=1)
states: 3,277,608 (6)
abstracting: (1<=p60)
states: 113,886 (5)
abstracting: (p60<=1)
states: 3,277,608 (6)
abstracting: (1<=p43)
states: 76,176 (4)
abstracting: (p43<=1)
states: 3,277,608 (6)
abstracting: (1<=p43)
states: 76,176 (4)
abstracting: (p43<=1)
states: 3,277,608 (6)
..................................
EG iterations: 34
.-> the formula is TRUE
FORMULA AutonomousCar-PT-02b-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.695sec
checking: E [~ [[A [EG [[[p113<=0 & 0<=p113] | [p64<=1 & 1<=p64]]] U [[p35<=0 & 0<=p35] | [p110<=1 & 1<=p110]]] & AG [[[p62<=0 & 0<=p62] | [p25<=1 & 1<=p25]]]]] U [A [[[p91<=0 & 0<=p91] | [p22<=1 & 1<=p22]] U [[~ [[p95<=1 & 1<=p95]] & [[p98<=0 & 0<=p98] | AF [[[p126<=0 & 0<=p126] | [p90<=1 & 1<=p90]]]]] | EX [0<=0]]] & [p124<=1 & 1<=p124]]]
normalized: E [~ [[~ [E [true U ~ [[[p25<=1 & 1<=p25] | [p62<=0 & 0<=p62]]]]] & [~ [EG [~ [[[p110<=1 & 1<=p110] | [p35<=0 & 0<=p35]]]]] & ~ [E [~ [[[p110<=1 & 1<=p110] | [p35<=0 & 0<=p35]]] U [~ [EG [[[p64<=1 & 1<=p64] | [p113<=0 & 0<=p113]]]] & ~ [[[p110<=1 & 1<=p110] | [p35<=0 & 0<=p35]]]]]]]]] U [[p124<=1 & 1<=p124] & [~ [EG [~ [[EX [0<=0] | [[~ [EG [~ [[[p90<=1 & 1<=p90] | [p126<=0 & 0<=p126]]]]] | [p98<=0 & 0<=p98]] & ~ [[p95<=1 & 1<=p95]]]]]]] & ~ [E [~ [[EX [0<=0] | [[~ [EG [~ [[[p90<=1 & 1<=p90] | [p126<=0 & 0<=p126]]]]] | [p98<=0 & 0<=p98]] & ~ [[p95<=1 & 1<=p95]]]]] U [~ [[[p22<=1 & 1<=p22] | [p91<=0 & 0<=p91]]] & ~ [[EX [0<=0] | [[~ [EG [~ [[[p90<=1 & 1<=p90] | [p126<=0 & 0<=p126]]]]] | [p98<=0 & 0<=p98]] & ~ [[p95<=1 & 1<=p95]]]]]]]]]]]
abstracting: (1<=p95)
states: 60,720 (4)
abstracting: (p95<=1)
states: 3,277,608 (6)
abstracting: (0<=p98)
states: 3,277,608 (6)
abstracting: (p98<=0)
states: 3,216,888 (6)
abstracting: (0<=p126)
states: 3,277,608 (6)
abstracting: (p126<=0)
states: 3,049,953 (6)
abstracting: (1<=p90)
states: 60,720 (4)
abstracting: (p90<=1)
states: 3,277,608 (6)
..........................................
EG iterations: 42
abstracting: (0<=0)
states: 3,277,608 (6)
.abstracting: (0<=p91)
states: 3,277,608 (6)
abstracting: (p91<=0)
states: 3,216,888 (6)
abstracting: (1<=p22)
states: 600
abstracting: (p22<=1)
states: 3,277,608 (6)
abstracting: (1<=p95)
states: 60,720 (4)
abstracting: (p95<=1)
states: 3,277,608 (6)
abstracting: (0<=p98)
states: 3,277,608 (6)
abstracting: (p98<=0)
states: 3,216,888 (6)
abstracting: (0<=p126)
states: 3,277,608 (6)
abstracting: (p126<=0)
states: 3,049,953 (6)
abstracting: (1<=p90)
states: 60,720 (4)
abstracting: (p90<=1)
states: 3,277,608 (6)
..........................................
EG iterations: 42
abstracting: (0<=0)
states: 3,277,608 (6)
.abstracting: (1<=p95)
states: 60,720 (4)
abstracting: (p95<=1)
states: 3,277,608 (6)
abstracting: (0<=p98)
states: 3,277,608 (6)
abstracting: (p98<=0)
states: 3,216,888 (6)
abstracting: (0<=p126)
states: 3,277,608 (6)
abstracting: (p126<=0)
states: 3,049,953 (6)
abstracting: (1<=p90)
states: 60,720 (4)
abstracting: (p90<=1)
states: 3,277,608 (6)
..........................................
EG iterations: 42
abstracting: (0<=0)
states: 3,277,608 (6)
..
EG iterations: 1
abstracting: (1<=p124)
states: 736,767 (5)
abstracting: (p124<=1)
states: 3,277,608 (6)
abstracting: (0<=p35)
states: 3,277,608 (6)
abstracting: (p35<=0)
states: 3,159,972 (6)
abstracting: (1<=p110)
states: 393,636 (5)
abstracting: (p110<=1)
states: 3,277,608 (6)
abstracting: (0<=p113)
states: 3,277,608 (6)
abstracting: (p113<=0)
states: 3,256,365 (6)
abstracting: (1<=p64)
states: 113,886 (5)
abstracting: (p64<=1)
states: 3,277,608 (6)
.........................................................................
EG iterations: 73
abstracting: (0<=p35)
states: 3,277,608 (6)
abstracting: (p35<=0)
states: 3,159,972 (6)
abstracting: (1<=p110)
states: 393,636 (5)
abstracting: (p110<=1)
states: 3,277,608 (6)
abstracting: (0<=p35)
states: 3,277,608 (6)
abstracting: (p35<=0)
states: 3,159,972 (6)
abstracting: (1<=p110)
states: 393,636 (5)
abstracting: (p110<=1)
states: 3,277,608 (6)
........................................
EG iterations: 40
abstracting: (0<=p62)
states: 3,277,608 (6)
abstracting: (p62<=0)
states: 3,163,722 (6)
abstracting: (1<=p25)
states: 117,636 (5)
abstracting: (p25<=1)
states: 3,277,608 (6)
-> the formula is TRUE
FORMULA AutonomousCar-PT-02b-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.571sec
checking: [EF [[EX [[[[p106<=0 & 0<=p106] & [p119<=1 & 1<=p119]] & [[p1<=0 & 0<=p1] & [p30<=1 & 1<=p30]]]] & EF [[[p133<=0 & 0<=p133] & [p111<=1 & 1<=p111]]]]] | [EF [[EF [[[p58<=0 & 0<=p58] & [p71<=1 & 1<=p71]]] | [AX [[[[p9<=0 & 0<=p9] | [p6<=1 & 1<=p6]] | [[p121<=0 & 0<=p121] | [p30<=1 & 1<=p30]]]] | [AF [[[[p76<=0 & 0<=p76] | [p60<=1 & 1<=p60]] & [p45<=0 & 0<=p45]]] & AF [[p51<=1 & 1<=p51]]]]]] & A [~ [[p144<=1 & 1<=p144]] U AG [E [[[[p40<=0 & 0<=p40] | [p52<=1 & 1<=p52]] & [p110<=1 & 1<=p110]] U [[p19<=1 & 1<=p19] | [[p2<=0 & 0<=p2] | [p130<=1 & 1<=p130]]]]]]]]
normalized: [[E [true U [[[~ [EG [~ [[[p45<=0 & 0<=p45] & [[p60<=1 & 1<=p60] | [p76<=0 & 0<=p76]]]]]] & ~ [EG [~ [[p51<=1 & 1<=p51]]]]] | ~ [EX [~ [[[[p30<=1 & 1<=p30] | [p121<=0 & 0<=p121]] | [[p6<=1 & 1<=p6] | [p9<=0 & 0<=p9]]]]]]] | E [true U [[p71<=1 & 1<=p71] & [p58<=0 & 0<=p58]]]]] & [~ [EG [E [true U ~ [E [[[p110<=1 & 1<=p110] & [[p52<=1 & 1<=p52] | [p40<=0 & 0<=p40]]] U [[[p130<=1 & 1<=p130] | [p2<=0 & 0<=p2]] | [p19<=1 & 1<=p19]]]]]]] & ~ [E [E [true U ~ [E [[[p110<=1 & 1<=p110] & [[p52<=1 & 1<=p52] | [p40<=0 & 0<=p40]]] U [[[p130<=1 & 1<=p130] | [p2<=0 & 0<=p2]] | [p19<=1 & 1<=p19]]]]] U [[p144<=1 & 1<=p144] & E [true U ~ [E [[[p110<=1 & 1<=p110] & [[p52<=1 & 1<=p52] | [p40<=0 & 0<=p40]]] U [[[p130<=1 & 1<=p130] | [p2<=0 & 0<=p2]] | [p19<=1 & 1<=p19]]]]]]]]]] | E [true U [E [true U [[p111<=1 & 1<=p111] & [p133<=0 & 0<=p133]]] & EX [[[[p30<=1 & 1<=p30] & [p1<=0 & 0<=p1]] & [[p119<=1 & 1<=p119] & [p106<=0 & 0<=p106]]]]]]]
abstracting: (0<=p106)
states: 3,277,608 (6)
abstracting: (p106<=0)
states: 3,106,014 (6)
abstracting: (1<=p119)
states: 630,552 (5)
abstracting: (p119<=1)
states: 3,277,608 (6)
abstracting: (0<=p1)
states: 3,277,608 (6)
abstracting: (p1<=0)
states: 3,260,957 (6)
abstracting: (1<=p30)
states: 117,636 (5)
abstracting: (p30<=1)
states: 3,277,608 (6)
.abstracting: (0<=p133)
states: 3,277,608 (6)
abstracting: (p133<=0)
states: 3,181,524 (6)
abstracting: (1<=p111)
states: 3,450 (3)
abstracting: (p111<=1)
states: 3,277,608 (6)
abstracting: (1<=p19)
states: 600
abstracting: (p19<=1)
states: 3,277,608 (6)
abstracting: (0<=p2)
states: 3,277,608 (6)
abstracting: (p2<=0)
states: 3,260,957 (6)
abstracting: (1<=p130)
states: 96,084 (4)
abstracting: (p130<=1)
states: 3,277,608 (6)
abstracting: (0<=p40)
states: 3,277,608 (6)
abstracting: (p40<=0)
states: 3,159,972 (6)
abstracting: (1<=p52)
states: 2,400 (3)
abstracting: (p52<=1)
states: 3,277,608 (6)
abstracting: (1<=p110)
states: 393,636 (5)
abstracting: (p110<=1)
states: 3,277,608 (6)
abstracting: (1<=p144)
states: 106,215 (5)
abstracting: (p144<=1)
states: 3,277,608 (6)
abstracting: (1<=p19)
states: 600
abstracting: (p19<=1)
states: 3,277,608 (6)
abstracting: (0<=p2)
states: 3,277,608 (6)
abstracting: (p2<=0)
states: 3,260,957 (6)
abstracting: (1<=p130)
states: 96,084 (4)
abstracting: (p130<=1)
states: 3,277,608 (6)
abstracting: (0<=p40)
states: 3,277,608 (6)
abstracting: (p40<=0)
states: 3,159,972 (6)
abstracting: (1<=p52)
states: 2,400 (3)
abstracting: (p52<=1)
states: 3,277,608 (6)
abstracting: (1<=p110)
states: 393,636 (5)
abstracting: (p110<=1)
states: 3,277,608 (6)
abstracting: (1<=p19)
states: 600
abstracting: (p19<=1)
states: 3,277,608 (6)
abstracting: (0<=p2)
states: 3,277,608 (6)
abstracting: (p2<=0)
states: 3,260,957 (6)
abstracting: (1<=p130)
states: 96,084 (4)
abstracting: (p130<=1)
states: 3,277,608 (6)
abstracting: (0<=p40)
states: 3,277,608 (6)
abstracting: (p40<=0)
states: 3,159,972 (6)
abstracting: (1<=p52)
states: 2,400 (3)
abstracting: (p52<=1)
states: 3,277,608 (6)
abstracting: (1<=p110)
states: 393,636 (5)
abstracting: (p110<=1)
states: 3,277,608 (6)
............................................................
EG iterations: 60
abstracting: (0<=p58)
states: 3,277,608 (6)
abstracting: (p58<=0)
states: 3,189,624 (6)
abstracting: (1<=p71)
states: 113,886 (5)
abstracting: (p71<=1)
states: 3,277,608 (6)
abstracting: (0<=p9)
states: 3,277,608 (6)
abstracting: (p9<=0)
states: 2,819,360 (6)
abstracting: (1<=p6)
states: 1,342,531 (6)
abstracting: (p6<=1)
states: 3,277,608 (6)
abstracting: (0<=p121)
states: 3,277,608 (6)
abstracting: (p121<=0)
states: 3,181,524 (6)
abstracting: (1<=p30)
states: 117,636 (5)
abstracting: (p30<=1)
states: 3,277,608 (6)
.abstracting: (1<=p51)
states: 199,956 (5)
abstracting: (p51<=1)
states: 3,277,608 (6)
........................................
EG iterations: 40
abstracting: (0<=p76)
states: 3,277,608 (6)
abstracting: (p76<=0)
states: 3,087,834 (6)
abstracting: (1<=p60)
states: 113,886 (5)
abstracting: (p60<=1)
states: 3,277,608 (6)
abstracting: (0<=p45)
states: 3,277,608 (6)
abstracting: (p45<=0)
states: 3,080,052 (6)
........................................
EG iterations: 40
-> the formula is FALSE
FORMULA AutonomousCar-PT-02b-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.812sec
totally nodes used: 33790474 (3.4e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 44248772 114284803 158533575
used/not used/entry size/cache size: 59437892 7670972 16 1024MB
basic ops cache: hits/miss/sum: 2443993 6017696 8461689
used/not used/entry size/cache size: 8724199 8053017 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: 29600 90419 120019
used/not used/entry size/cache size: 89949 8298659 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 41734418
1 18660577
2 5296185
3 1173394
4 208997
5 30939
6 3872
7 430
8 48
9 4
>= 10 0
Total processing time: 0m49.552sec
BK_STOP 1678698829737
--------------------
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 CTLCardinality -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:21112 (112), effective:1556 (8)
initing FirstDep: 0m 0.000sec
iterations count:10428 (55), effective:575 (3)
iterations count:5564 (29), effective:284 (1)
iterations count:5558 (29), effective:298 (1)
iterations count:10590 (56), effective:585 (3)
iterations count:7936 (42), effective:441 (2)
iterations count:10603 (56), effective:519 (2)
iterations count:11446 (60), effective:669 (3)
iterations count:194 (1), effective:1 (0)
iterations count:190 (1), effective:1 (0)
iterations count:193 (1), effective:1 (0)
iterations count:193 (1), effective:1 (0)
iterations count:2535 (13), effective:185 (0)
iterations count:193 (1), effective:1 (0)
iterations count:512 (2), effective:27 (0)
iterations count:262 (1), effective:1 (0)
iterations count:7994 (42), effective:470 (2)
iterations count:190 (1), effective:1 (0)
iterations count:6826 (36), effective:367 (1)
iterations count:199 (1), effective:2 (0)
iterations count:211 (1), effective:5 (0)
iterations count:5446 (28), effective:270 (1)
iterations count:6128 (32), effective:316 (1)
iterations count:205 (1), effective:4 (0)
iterations count:189 (1), effective:1 (0)
iterations count:566 (3), effective:17 (0)
iterations count:189 (1), effective:1 (0)
iterations count:566 (3), effective:17 (0)
iterations count:250 (1), effective:11 (0)
iterations count:189 (1), effective:1 (0)
iterations count:566 (3), effective:17 (0)
iterations count:4695 (24), effective:277 (1)
iterations count:193 (1), effective:2 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-02b"
export BK_EXAMINATION="CTLCardinality"
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 AutonomousCar-PT-02b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-oct2-167813599200553"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-02b.tgz
mv AutonomousCar-PT-02b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;