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-167813599300618.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-06b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599300618
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 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 228K 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-06b-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678699841304

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=AutonomousCar-PT-06b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:30:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 09:30:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:30:43] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-13 09:30:43] [INFO ] Transformed 289 places.
[2023-03-13 09:30:43] [INFO ] Transformed 644 transitions.
[2023-03-13 09:30:43] [INFO ] Found NUPN structural information;
[2023-03-13 09:30:43] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 90 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 257 transition count 612
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 257 transition count 612
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 208 place count 257 transition count 468
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 212 place count 253 transition count 464
Iterating global reduction 1 with 4 rules applied. Total rules applied 216 place count 253 transition count 464
Applied a total of 216 rules in 55 ms. Remains 253 /289 variables (removed 36) and now considering 464/644 (removed 180) transitions.
// Phase 1: matrix 464 rows 253 cols
[2023-03-13 09:30:44] [INFO ] Computed 11 place invariants in 12 ms
[2023-03-13 09:30:44] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-13 09:30:44] [INFO ] Invariant cache hit.
[2023-03-13 09:30:44] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2023-03-13 09:30:44] [INFO ] Invariant cache hit.
[2023-03-13 09:30:45] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/289 places, 464/644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1056 ms. Remains : 253/289 places, 464/644 transitions.
Support contains 90 out of 253 places after structural reductions.
[2023-03-13 09:30:45] [INFO ] Flatten gal took : 88 ms
[2023-03-13 09:30:45] [INFO ] Flatten gal took : 57 ms
[2023-03-13 09:30:45] [INFO ] Input system was already deterministic with 464 transitions.
Support contains 88 out of 253 places (down from 90) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 75) seen :35
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 39) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 38) seen :0
Running SMT prover for 38 properties.
[2023-03-13 09:30:46] [INFO ] Invariant cache hit.
[2023-03-13 09:30:46] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-13 09:30:47] [INFO ] After 490ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:37
[2023-03-13 09:30:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-13 09:30:49] [INFO ] After 1873ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :28
[2023-03-13 09:30:49] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 5 ms to minimize.
[2023-03-13 09:30:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-13 09:30:51] [INFO ] After 4309ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :28
Attempting to minimize the solution found.
Minimization took 1417 ms.
[2023-03-13 09:30:53] [INFO ] After 6374ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :28
Fused 38 Parikh solutions to 28 different solutions.
Parikh walk visited 0 properties in 287 ms.
Support contains 47 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 464/464 transitions.
Graph (trivial) has 172 edges and 253 vertex of which 4 / 253 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 888 edges and 251 vertex of which 244 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 76 rules applied. Total rules applied 78 place count 244 transition count 379
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 104 rules applied. Total rules applied 182 place count 169 transition count 350
Reduce places removed 16 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 21 rules applied. Total rules applied 203 place count 153 transition count 345
Reduce places removed 5 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 7 rules applied. Total rules applied 210 place count 148 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 211 place count 147 transition count 343
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 211 place count 147 transition count 335
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 227 place count 139 transition count 335
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 230 place count 136 transition count 332
Iterating global reduction 5 with 3 rules applied. Total rules applied 233 place count 136 transition count 332
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 234 place count 135 transition count 331
Iterating global reduction 5 with 1 rules applied. Total rules applied 235 place count 135 transition count 331
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 293 place count 106 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 294 place count 106 transition count 301
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 6 with 2 rules applied. Total rules applied 296 place count 105 transition count 300
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 297 place count 105 transition count 299
Free-agglomeration rule applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 312 place count 105 transition count 284
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 327 place count 90 transition count 284
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 331 place count 90 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 332 place count 89 transition count 283
Applied a total of 332 rules in 98 ms. Remains 89 /253 variables (removed 164) and now considering 283/464 (removed 181) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 89/253 places, 283/464 transitions.
Incomplete random walk after 10000 steps, including 355 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 28) seen :15
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 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 48 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :2
Running SMT prover for 8 properties.
// Phase 1: matrix 283 rows 89 cols
[2023-03-13 09:30:54] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-13 09:30:54] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 09:30:55] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 09:30:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 09:30:55] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 09:30:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:30:55] [INFO ] After 267ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-13 09:30:56] [INFO ] After 710ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 324 ms.
[2023-03-13 09:30:56] [INFO ] After 1523ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 38 ms.
Support contains 25 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 283/283 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 0 with 6 rules applied. Total rules applied 6 place count 89 transition count 277
Reduce places removed 5 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 1 with 7 rules applied. Total rules applied 13 place count 84 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 83 transition count 275
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 83 transition count 274
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 82 transition count 274
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 18 place count 80 transition count 272
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 80 transition count 272
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 34 place count 73 transition count 265
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 72 transition count 258
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 72 transition count 258
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 48 place count 66 transition count 252
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 66 transition count 250
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 64 transition count 250
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 64 transition count 250
Applied a total of 53 rules in 66 ms. Remains 64 /89 variables (removed 25) and now considering 250/283 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 64/89 places, 250/283 transitions.
Incomplete random walk after 10000 steps, including 600 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :1
Running SMT prover for 5 properties.
// Phase 1: matrix 250 rows 64 cols
[2023-03-13 09:30:57] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-13 09:30:57] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 09:30:57] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 09:30:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 09:30:57] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 09:30:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:30:57] [INFO ] After 202ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 09:30:57] [INFO ] After 443ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 194 ms.
[2023-03-13 09:30:58] [INFO ] After 886ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 28 ms.
Support contains 18 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 250/250 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 64 transition count 247
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 61 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 60 transition count 246
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 9 place count 59 transition count 240
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 59 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11 place count 59 transition count 239
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 13 place count 58 transition count 238
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 17 place count 58 transition count 234
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 27 place count 54 transition count 228
Applied a total of 27 rules in 43 ms. Remains 54 /64 variables (removed 10) and now considering 228/250 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 54/64 places, 228/250 transitions.
Incomplete random walk after 10000 steps, including 429 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 228 rows 54 cols
[2023-03-13 09:30:58] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-13 09:30:58] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 09:30:58] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:30:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 09:30:58] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:30:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:30:58] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 09:30:58] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-13 09:30:58] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 228/228 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 51 transition count 208
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 51 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 51 transition count 207
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 1 with 2 rules applied. Total rules applied 9 place count 50 transition count 206
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 50 transition count 200
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 39 place count 44 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 43 transition count 181
Applied a total of 40 rules in 16 ms. Remains 43 /54 variables (removed 11) and now considering 181/228 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 43/54 places, 181/228 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 52832 steps, run visited all 1 properties in 124 ms. (steps per millisecond=426 )
Probabilistic random walk after 52832 steps, saw 10270 distinct states, run finished after 124 ms. (steps per millisecond=426 ) properties seen :1
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
[2023-03-13 09:30:58] [INFO ] Flatten gal took : 30 ms
[2023-03-13 09:30:58] [INFO ] Flatten gal took : 28 ms
[2023-03-13 09:30:59] [INFO ] Input system was already deterministic with 464 transitions.
Computed a total of 44 stabilizing places and 45 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 242 transition count 453
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 242 transition count 453
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 237 transition count 448
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 236 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 236 transition count 447
Applied a total of 34 rules in 15 ms. Remains 236 /253 variables (removed 17) and now considering 447/464 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 236/253 places, 447/464 transitions.
[2023-03-13 09:30:59] [INFO ] Flatten gal took : 23 ms
[2023-03-13 09:30:59] [INFO ] Flatten gal took : 27 ms
[2023-03-13 09:30:59] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 242 transition count 453
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 242 transition count 453
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 238 transition count 449
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 238 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 237 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 237 transition count 448
Applied a total of 32 rules in 9 ms. Remains 237 /253 variables (removed 16) and now considering 448/464 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 237/253 places, 448/464 transitions.
[2023-03-13 09:30:59] [INFO ] Flatten gal took : 17 ms
[2023-03-13 09:30:59] [INFO ] Flatten gal took : 18 ms
[2023-03-13 09:30:59] [INFO ] Input system was already deterministic with 448 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Graph (trivial) has 236 edges and 253 vertex of which 4 / 253 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 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 250 transition count 360
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 136 rules applied. Total rules applied 238 place count 149 transition count 325
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 258 place count 129 transition count 325
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 258 place count 129 transition count 319
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 270 place count 123 transition count 319
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 277 place count 116 transition count 312
Iterating global reduction 3 with 7 rules applied. Total rules applied 284 place count 116 transition count 312
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 287 place count 113 transition count 299
Iterating global reduction 3 with 3 rules applied. Total rules applied 290 place count 113 transition count 299
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 3 with 4 rules applied. Total rules applied 294 place count 113 transition count 295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 296 place count 111 transition count 295
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 378 place count 70 transition count 254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 379 place count 70 transition count 253
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 386 place count 63 transition count 206
Iterating global reduction 6 with 7 rules applied. Total rules applied 393 place count 63 transition count 206
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 6 with 4 rules applied. Total rules applied 397 place count 63 transition count 202
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 399 place count 61 transition count 202
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 8 with 2 rules applied. Total rules applied 401 place count 60 transition count 201
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 402 place count 60 transition count 200
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 403 place count 60 transition count 200
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 405 place count 58 transition count 198
Applied a total of 405 rules in 68 ms. Remains 58 /253 variables (removed 195) and now considering 198/464 (removed 266) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68 ms. Remains : 58/253 places, 198/464 transitions.
[2023-03-13 09:30:59] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:30:59] [INFO ] Flatten gal took : 15 ms
[2023-03-13 09:30:59] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Graph (trivial) has 238 edges and 253 vertex of which 4 / 253 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 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 250 transition count 360
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 137 rules applied. Total rules applied 239 place count 149 transition count 324
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 260 place count 128 transition count 324
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 260 place count 128 transition count 318
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 272 place count 122 transition count 318
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 279 place count 115 transition count 311
Iterating global reduction 3 with 7 rules applied. Total rules applied 286 place count 115 transition count 311
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 289 place count 112 transition count 298
Iterating global reduction 3 with 3 rules applied. Total rules applied 292 place count 112 transition count 298
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 3 with 4 rules applied. Total rules applied 296 place count 112 transition count 294
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 298 place count 110 transition count 294
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 380 place count 69 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 381 place count 69 transition count 252
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 390 place count 60 transition count 193
Iterating global reduction 6 with 9 rules applied. Total rules applied 399 place count 60 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 6 with 8 rules applied. Total rules applied 407 place count 60 transition count 185
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 411 place count 56 transition count 185
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 8 with 2 rules applied. Total rules applied 413 place count 55 transition count 184
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 414 place count 55 transition count 183
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 416 place count 53 transition count 181
Applied a total of 416 rules in 68 ms. Remains 53 /253 variables (removed 200) and now considering 181/464 (removed 283) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68 ms. Remains : 53/253 places, 181/464 transitions.
[2023-03-13 09:30:59] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:30:59] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:30:59] [INFO ] Input system was already deterministic with 181 transitions.
Incomplete random walk after 10000 steps, including 552 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 155995 steps, run visited all 1 properties in 180 ms. (steps per millisecond=866 )
Probabilistic random walk after 155995 steps, saw 27866 distinct states, run finished after 180 ms. (steps per millisecond=866 ) properties seen :1
FORMULA AutonomousCar-PT-06b-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 241 transition count 452
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 241 transition count 452
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 236 transition count 447
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 235 transition count 446
Applied a total of 36 rules in 13 ms. Remains 235 /253 variables (removed 18) and now considering 446/464 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 235/253 places, 446/464 transitions.
[2023-03-13 09:30:59] [INFO ] Flatten gal took : 29 ms
[2023-03-13 09:30:59] [INFO ] Flatten gal took : 31 ms
[2023-03-13 09:30:59] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 241 transition count 452
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 241 transition count 452
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 236 transition count 447
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 235 transition count 446
Applied a total of 36 rules in 14 ms. Remains 235 /253 variables (removed 18) and now considering 446/464 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 235/253 places, 446/464 transitions.
[2023-03-13 09:30:59] [INFO ] Flatten gal took : 18 ms
[2023-03-13 09:30:59] [INFO ] Flatten gal took : 26 ms
[2023-03-13 09:30:59] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 242 transition count 453
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 242 transition count 453
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 238 transition count 449
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 238 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 237 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 237 transition count 448
Applied a total of 32 rules in 12 ms. Remains 237 /253 variables (removed 16) and now considering 448/464 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 237/253 places, 448/464 transitions.
[2023-03-13 09:30:59] [INFO ] Flatten gal took : 17 ms
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 17 ms
[2023-03-13 09:31:00] [INFO ] Input system was already deterministic with 448 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 241 transition count 452
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 241 transition count 452
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 236 transition count 447
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 235 transition count 446
Applied a total of 36 rules in 25 ms. Remains 235 /253 variables (removed 18) and now considering 446/464 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 235/253 places, 446/464 transitions.
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 15 ms
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 16 ms
[2023-03-13 09:31:00] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 241 transition count 452
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 241 transition count 452
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 236 transition count 447
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 235 transition count 446
Applied a total of 36 rules in 15 ms. Remains 235 /253 variables (removed 18) and now considering 446/464 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 235/253 places, 446/464 transitions.
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 16 ms
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 18 ms
[2023-03-13 09:31:00] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 242 transition count 453
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 242 transition count 453
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 237 transition count 448
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 236 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 236 transition count 447
Applied a total of 34 rules in 12 ms. Remains 236 /253 variables (removed 17) and now considering 447/464 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 236/253 places, 447/464 transitions.
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 16 ms
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 16 ms
[2023-03-13 09:31:00] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 241 transition count 452
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 241 transition count 452
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 236 transition count 447
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 235 transition count 446
Applied a total of 36 rules in 12 ms. Remains 235 /253 variables (removed 18) and now considering 446/464 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 235/253 places, 446/464 transitions.
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 16 ms
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 16 ms
[2023-03-13 09:31:00] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Graph (trivial) has 233 edges and 253 vertex of which 4 / 253 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 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 250 transition count 361
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 136 rules applied. Total rules applied 237 place count 150 transition count 325
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 22 rules applied. Total rules applied 259 place count 129 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 260 place count 128 transition count 324
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 260 place count 128 transition count 318
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 272 place count 122 transition count 318
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 279 place count 115 transition count 311
Iterating global reduction 4 with 7 rules applied. Total rules applied 286 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 287 place count 114 transition count 310
Iterating global reduction 4 with 1 rules applied. Total rules applied 288 place count 114 transition count 310
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 370 place count 73 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 371 place count 73 transition count 268
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 379 place count 65 transition count 214
Iterating global reduction 5 with 8 rules applied. Total rules applied 387 place count 65 transition count 214
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 5 with 4 rules applied. Total rules applied 391 place count 65 transition count 210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 393 place count 63 transition count 210
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 7 with 2 rules applied. Total rules applied 395 place count 62 transition count 209
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 396 place count 62 transition count 208
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 399 place count 62 transition count 208
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 401 place count 60 transition count 206
Applied a total of 401 rules in 35 ms. Remains 60 /253 variables (removed 193) and now considering 206/464 (removed 258) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 60/253 places, 206/464 transitions.
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 26 ms
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:31:00] [INFO ] Input system was already deterministic with 206 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 242 transition count 453
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 242 transition count 453
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 237 transition count 448
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 236 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 236 transition count 447
Applied a total of 34 rules in 9 ms. Remains 236 /253 variables (removed 17) and now considering 447/464 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 236/253 places, 447/464 transitions.
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:31:00] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Graph (trivial) has 239 edges and 253 vertex of which 4 / 253 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 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 250 transition count 359
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 138 rules applied. Total rules applied 241 place count 148 transition count 323
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 262 place count 127 transition count 323
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 262 place count 127 transition count 317
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 274 place count 121 transition count 317
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 281 place count 114 transition count 310
Iterating global reduction 3 with 7 rules applied. Total rules applied 288 place count 114 transition count 310
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 291 place count 111 transition count 297
Iterating global reduction 3 with 3 rules applied. Total rules applied 294 place count 111 transition count 297
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 3 with 4 rules applied. Total rules applied 298 place count 111 transition count 293
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 300 place count 109 transition count 293
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 382 place count 68 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 383 place count 68 transition count 251
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 392 place count 59 transition count 191
Iterating global reduction 6 with 9 rules applied. Total rules applied 401 place count 59 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 6 with 6 rules applied. Total rules applied 407 place count 59 transition count 185
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 410 place count 56 transition count 185
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 8 with 2 rules applied. Total rules applied 412 place count 55 transition count 184
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 413 place count 55 transition count 183
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 414 place count 55 transition count 183
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 416 place count 53 transition count 181
Applied a total of 416 rules in 34 ms. Remains 53 /253 variables (removed 200) and now considering 181/464 (removed 283) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 53/253 places, 181/464 transitions.
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:31:00] [INFO ] Input system was already deterministic with 181 transitions.
Finished random walk after 429 steps, including 22 resets, run visited all 1 properties in 2 ms. (steps per millisecond=214 )
FORMULA AutonomousCar-PT-06b-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 242 transition count 453
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 242 transition count 453
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 237 transition count 448
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 236 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 236 transition count 447
Applied a total of 34 rules in 11 ms. Remains 236 /253 variables (removed 17) and now considering 447/464 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 236/253 places, 447/464 transitions.
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 15 ms
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 16 ms
[2023-03-13 09:31:00] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 242 transition count 453
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 242 transition count 453
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 237 transition count 448
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 236 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 236 transition count 447
Applied a total of 34 rules in 8 ms. Remains 236 /253 variables (removed 17) and now considering 447/464 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 236/253 places, 447/464 transitions.
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 15 ms
[2023-03-13 09:31:00] [INFO ] Input system was already deterministic with 447 transitions.
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 16 ms
[2023-03-13 09:31:00] [INFO ] Flatten gal took : 15 ms
[2023-03-13 09:31:00] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-13 09:31:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 253 places, 464 transitions and 2588 arcs took 3 ms.
Total runtime 17287 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: 253 NrTr: 464 NrArc: 2588)

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

net check time: 0m 0.000sec

init dd package: 0m 2.946sec


RS generation: 14m32.772sec


-> reachability set: #nodes 193436 (1.9e+05) #states 1,605,440,653,476 (12)



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

checking: EX [AF [[p8<=1 & 1<=p8]]]
normalized: EX [~ [EG [~ [[p8<=1 & 1<=p8]]]]]

abstracting: (1<=p8)
states: 80,197,741,008 (10)
abstracting: (p8<=1)
states: 1,605,440,653,476 (12)
......
before gc: list nodes free: 92967

after gc: idd nodes used:623942, unused:63376058; list nodes free:290842905
........MC time: 3m15.004sec

checking: EF [EX [[[p51<=1 & 1<=p51] | EG [[1<=p162 & p162<=1]]]]]
normalized: E [true U EX [[EG [[1<=p162 & p162<=1]] | [p51<=1 & 1<=p51]]]]

abstracting: (1<=p51)
states: 83,882,221,920 (10)
abstracting: (p51<=1)
states: 1,605,440,653,476 (12)
abstracting: (p162<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p162)
states: 66,556,878,948 (10)
...
before gc: list nodes free: 1244144

after gc: idd nodes used:335274, unused:63664726; list nodes free:292129798
...................MC time: 3m 1.062sec

checking: AG [A [AX [~ [EF [[[[p50<=1 & 1<=p50] & [[p82<=1 & 1<=p82] & [p109<=1 & 1<=p109]]] & [[[p130<=1 & 1<=p130] & [p158<=1 & 1<=p158]] & [[p185<=1 & 1<=p185] & [p214<=1 & 1<=p214]]]]]]] U ~ [EX [0<=0]]]]
normalized: ~ [E [true U ~ [[~ [EG [EX [0<=0]]] & ~ [E [EX [0<=0] U [EX [E [true U [[[[p214<=1 & 1<=p214] & [p185<=1 & 1<=p185]] & [[p158<=1 & 1<=p158] & [p130<=1 & 1<=p130]]] & [[[p109<=1 & 1<=p109] & [p82<=1 & 1<=p82]] & [p50<=1 & 1<=p50]]]]] & EX [0<=0]]]]]]]]

abstracting: (0<=0)
states: 1,605,440,653,476 (12)

before gc: list nodes free: 8505931

after gc: idd nodes used:408696, unused:63591304; list nodes free:291806818
.abstracting: (1<=p50)
states: 83,882,221,920 (10)
abstracting: (p50<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p82)
states: 83,808,748,320 (10)
abstracting: (p82<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p109)
states: 81,765,078,060 (10)
abstracting: (p109<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p130)
states: 82,248,285,168 (10)
abstracting: (p130<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p158)
states: 81,764,425,260 (10)
abstracting: (p158<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p185)
states: 85,442,070,672 (10)
abstracting: (p185<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p214)
states: 213,852,099,630 (11)
abstracting: (p214<=1)
states: 1,605,440,653,476 (12)
.abstracting: (0<=0)
states: 1,605,440,653,476 (12)
.abstracting: (0<=0)
states: 1,605,440,653,476 (12)
.......MC time: 2m48.006sec

checking: EX [[AG [[~ [E [[[[p4<=1 & 1<=p4] & [p13<=1 & 1<=p13]] & [[p78<=1 & 1<=p78] & [p213<=1 & 1<=p213]]] U [p73<=1 & 1<=p73]]] | [[p148<=0 & 0<=p148] | [p176<=0 & 0<=p176]]]] | AG [[p189<=0 & 0<=p189]]]]
normalized: EX [[~ [E [true U ~ [[p189<=0 & 0<=p189]]]] | ~ [E [true U ~ [[[[p176<=0 & 0<=p176] | [p148<=0 & 0<=p148]] | ~ [E [[[[p213<=1 & 1<=p213] & [p78<=1 & 1<=p78]] & [[p13<=1 & 1<=p13] & [p4<=1 & 1<=p4]]] U [p73<=1 & 1<=p73]]]]]]]]]

abstracting: (1<=p73)
states: 67,753,660,464 (10)
abstracting: (p73<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p4)
states: 799,544,326,591 (11)
abstracting: (p4<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p13)
states: 215,183,733,408 (11)
abstracting: (p13<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p78)
states: 67,753,660,464 (10)
abstracting: (p78<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p213)
states: 161,190,086,400 (11)
abstracting: (p213<=1)
states: 1,605,440,653,476 (12)
abstracting: (0<=p148)
states: 1,605,440,653,476 (12)
abstracting: (p148<=0)
states: 1,538,883,774,528 (12)
abstracting: (0<=p176)
states: 1,605,440,653,476 (12)
abstracting: (p176<=0)
states: 1,536,053,056,260 (12)
abstracting: (0<=p189)
states: 1,605,440,653,476 (12)
abstracting: (p189<=0)
states: 1,536,053,056,260 (12)

before gc: list nodes free: 6580366

after gc: idd nodes used:715069, unused:63284931; list nodes free:290371042
.-> the formula is FALSE

FORMULA AutonomousCar-PT-06b-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m22.969sec

checking: [EF [[EX [AG [A [[[[p56<=1 & 1<=p56] & [[p82<=1 & 1<=p82] & [p109<=1 & 1<=p109]]] & [[[p130<=1 & 1<=p130] & [p163<=1 & 1<=p163]] & [[p185<=1 & 1<=p185] & [p214<=1 & 1<=p214]]]] U [p135<=1 & 1<=p135]]]] & [p20<=1 & 1<=p20]]] | AG [[p149<=0 & 0<=p149]]]
normalized: [~ [E [true U ~ [[p149<=0 & 0<=p149]]]] | E [true U [[p20<=1 & 1<=p20] & EX [~ [E [true U ~ [[~ [EG [~ [[p135<=1 & 1<=p135]]]] & ~ [E [~ [[p135<=1 & 1<=p135]] U [~ [[[[[p214<=1 & 1<=p214] & [p185<=1 & 1<=p185]] & [[p163<=1 & 1<=p163] & [p130<=1 & 1<=p130]]] & [[[p109<=1 & 1<=p109] & [p82<=1 & 1<=p82]] & [p56<=1 & 1<=p56]]]] & ~ [[p135<=1 & 1<=p135]]]]]]]]]]]]]

abstracting: (1<=p135)
states: 66,193,811,712 (10)
abstracting: (p135<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p56)
states: 83,882,836,320 (10)
abstracting: (p56<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p82)
states: 83,808,748,320 (10)
abstracting: (p82<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p109)
states: 81,765,078,060 (10)
abstracting: (p109<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p130)
states: 82,248,285,168 (10)
abstracting: (p130<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p163)
states: 81,765,090,060 (10)
abstracting: (p163<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p185)
states: 85,442,070,672 (10)
abstracting: (p185<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p214)
states: 213,852,099,630 (11)
abstracting: (p214<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p135)
states: 66,193,811,712 (10)
abstracting: (p135<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p135)
states: 66,193,811,712 (10)
abstracting: (p135<=1)
states: 1,605,440,653,476 (12)
...............MC time: 2m42.068sec

checking: [EF [~ [A [[p176<=1 & 1<=p176] U ~ [[EF [[p149<=1 & 1<=p149]] | AF [[[[p50<=1 & 1<=p50] & [[p77<=1 & 1<=p77] & [p104<=1 & 1<=p104]]] & [[[p130<=1 & 1<=p130] & [p163<=1 & 1<=p163]] & [[p185<=1 & 1<=p185] & [p214<=1 & 1<=p214]]]]]]]]]] & AX [[[p194<=0 & 0<=p194] | [p227<=0 & 0<=p227]]]]
normalized: [~ [EX [~ [[[p227<=0 & 0<=p227] | [p194<=0 & 0<=p194]]]]] & E [true U ~ [[~ [EG [[~ [EG [~ [[[[[p214<=1 & 1<=p214] & [p185<=1 & 1<=p185]] & [[p163<=1 & 1<=p163] & [p130<=1 & 1<=p130]]] & [[[p104<=1 & 1<=p104] & [p77<=1 & 1<=p77]] & [p50<=1 & 1<=p50]]]]]] | E [true U [p149<=1 & 1<=p149]]]]] & ~ [E [[~ [EG [~ [[[[[p214<=1 & 1<=p214] & [p185<=1 & 1<=p185]] & [[p163<=1 & 1<=p163] & [p130<=1 & 1<=p130]]] & [[[p104<=1 & 1<=p104] & [p77<=1 & 1<=p77]] & [p50<=1 & 1<=p50]]]]]] | E [true U [p149<=1 & 1<=p149]]] U [~ [[p176<=1 & 1<=p176]] & [~ [EG [~ [[[[[p214<=1 & 1<=p214] & [p185<=1 & 1<=p185]] & [[p163<=1 & 1<=p163] & [p130<=1 & 1<=p130]]] & [[[p104<=1 & 1<=p104] & [p77<=1 & 1<=p77]] & [p50<=1 & 1<=p50]]]]]] | E [true U [p149<=1 & 1<=p149]]]]]]]]]]

abstracting: (1<=p149)
states: 66,556,878,948 (10)
abstracting: (p149<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p50)
states: 83,882,221,920 (10)
abstracting: (p50<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p77)
states: 83,808,133,920 (10)
abstracting: (p77<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p104)
states: 81,764,425,260 (10)
abstracting: (p104<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p130)
states: 82,248,285,168 (10)
abstracting: (p130<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p163)
states: 81,765,090,060 (10)
abstracting: (p163<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p185)
states: 85,442,070,672 (10)
abstracting: (p185<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p214)
states: 213,852,099,630 (11)
abstracting: (p214<=1)
states: 1,605,440,653,476 (12)
......
before gc: list nodes free: 4838748

after gc: idd nodes used:833751, unused:63166249; list nodes free:289901357
........MC time: 2m29.001sec

checking: EF [AG [EX [A [~ [[[[[p214<=1 & 1<=p214] & [1<=p185 & p185<=1]] & [[1<=p158 & p158<=1] & [1<=p136 & p136<=1]]] & [[[1<=p104 & p104<=1] & [1<=p77 & p77<=1]] & [1<=p50 & p50<=1]]]] U [[[[1<=p213 & p213<=1] & [1<=p99 & p99<=1]] & [[p11<=1 & 1<=p11] & [1<=p4 & p4<=1]]] | [1<=p60 & p60<=1]]]]]]
normalized: E [true U ~ [E [true U ~ [EX [[~ [EG [~ [[[1<=p60 & p60<=1] | [[[1<=p4 & p4<=1] & [p11<=1 & 1<=p11]] & [[1<=p99 & p99<=1] & [1<=p213 & p213<=1]]]]]]] & ~ [E [~ [[[1<=p60 & p60<=1] | [[[1<=p4 & p4<=1] & [p11<=1 & 1<=p11]] & [[1<=p99 & p99<=1] & [1<=p213 & p213<=1]]]]] U [[[[1<=p50 & p50<=1] & [[1<=p77 & p77<=1] & [1<=p104 & p104<=1]]] & [[[1<=p136 & p136<=1] & [1<=p158 & p158<=1]] & [[1<=p185 & p185<=1] & [p214<=1 & 1<=p214]]]] & ~ [[[1<=p60 & p60<=1] | [[[1<=p4 & p4<=1] & [p11<=1 & 1<=p11]] & [[1<=p99 & p99<=1] & [1<=p213 & p213<=1]]]]]]]]]]]]]]

abstracting: (p213<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p213)
states: 161,190,086,400 (11)
abstracting: (p99<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p99)
states: 66,556,878,948 (10)
abstracting: (1<=p11)
states: 215,183,733,408 (11)
abstracting: (p11<=1)
states: 1,605,440,653,476 (12)
abstracting: (p4<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p4)
states: 799,544,326,591 (11)
abstracting: (p60<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p60)
states: 34,238,583,792 (10)
abstracting: (1<=p214)
states: 213,852,099,630 (11)
abstracting: (p214<=1)
states: 1,605,440,653,476 (12)
abstracting: (p185<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p185)
states: 85,442,070,672 (10)
abstracting: (p158<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p158)
states: 81,764,425,260 (10)
abstracting: (p136<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p136)
states: 82,248,947,568 (10)
abstracting: (p104<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p104)
states: 81,764,425,260 (10)
abstracting: (p77<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p77)
states: 83,808,133,920 (10)
abstracting: (p50<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p50)
states: 83,882,221,920 (10)
abstracting: (p213<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p213)
states: 161,190,086,400 (11)
abstracting: (p99<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p99)
states: 66,556,878,948 (10)
abstracting: (1<=p11)
states: 215,183,733,408 (11)
abstracting: (p11<=1)
states: 1,605,440,653,476 (12)
abstracting: (p4<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p4)
states: 799,544,326,591 (11)
abstracting: (p60<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p60)
states: 34,238,583,792 (10)
abstracting: (p213<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p213)
states: 161,190,086,400 (11)
abstracting: (p99<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p99)
states: 66,556,878,948 (10)
abstracting: (1<=p11)
states: 215,183,733,408 (11)
abstracting: (p11<=1)
states: 1,605,440,653,476 (12)
abstracting: (p4<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p4)
states: 799,544,326,591 (11)
abstracting: (p60<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p60)
states: 34,238,583,792 (10)
...........
before gc: list nodes free: 2891486

after gc: idd nodes used:1015065, unused:62984935; list nodes free:289028639
MC time: 2m18.125sec

checking: AF [EG [~ [A [A [[[[p4<=1 & 1<=p4] & [p15<=1 & 1<=p15]] & [[p186<=1 & 1<=p186] & [p213<=1 & 1<=p213]]] U [[[p4<=1 & 1<=p4] & [p14<=1 & 1<=p14]] & [[p180<=1 & 1<=p180] & [p213<=1 & 1<=p213]]]] U ~ [AF [[[[p4<=1 & 1<=p4] & [p15<=1 & 1<=p15]] & [[p143<=1 & 1<=p143] & [p213<=1 & 1<=p213]]]]]]]]]
normalized: ~ [EG [~ [EG [~ [[~ [EG [~ [EG [~ [[[[p213<=1 & 1<=p213] & [p143<=1 & 1<=p143]] & [[p15<=1 & 1<=p15] & [p4<=1 & 1<=p4]]]]]]]] & ~ [E [~ [EG [~ [[[[p213<=1 & 1<=p213] & [p143<=1 & 1<=p143]] & [[p15<=1 & 1<=p15] & [p4<=1 & 1<=p4]]]]]] U [~ [[~ [EG [~ [[[[p213<=1 & 1<=p213] & [p180<=1 & 1<=p180]] & [[p14<=1 & 1<=p14] & [p4<=1 & 1<=p4]]]]]] & ~ [E [~ [[[[p213<=1 & 1<=p213] & [p180<=1 & 1<=p180]] & [[p14<=1 & 1<=p14] & [p4<=1 & 1<=p4]]]] U [~ [[[[p213<=1 & 1<=p213] & [p186<=1 & 1<=p186]] & [[p15<=1 & 1<=p15] & [p4<=1 & 1<=p4]]]] & ~ [[[[p213<=1 & 1<=p213] & [p180<=1 & 1<=p180]] & [[p14<=1 & 1<=p14] & [p4<=1 & 1<=p4]]]]]]]]] & ~ [EG [~ [[[[p213<=1 & 1<=p213] & [p143<=1 & 1<=p143]] & [[p15<=1 & 1<=p15] & [p4<=1 & 1<=p4]]]]]]]]]]]]]]]

abstracting: (1<=p4)
states: 799,544,326,591 (11)
abstracting: (p4<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p15)
states: 198,144,355,248 (11)
abstracting: (p15<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p143)
states: 66,556,878,948 (10)
abstracting: (p143<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p213)
states: 161,190,086,400 (11)
abstracting: (p213<=1)
states: 1,605,440,653,476 (12)
...........................................................................
EG iterations: 75
abstracting: (1<=p4)
states: 799,544,326,591 (11)
abstracting: (p4<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p14)
states: 215,183,733,408 (11)
abstracting: (p14<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p180)
states: 69,387,597,216 (10)
abstracting: (p180<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p213)
states: 161,190,086,400 (11)
abstracting: (p213<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p4)
states: 799,544,326,591 (11)
abstracting: (p4<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p15)
states: 198,144,355,248 (11)
abstracting: (p15<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p186)
states: 69,387,597,216 (10)
abstracting: (p186<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p213)
states: 161,190,086,400 (11)
abstracting: (p213<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p4)
states: 799,544,326,591 (11)
abstracting: (p4<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p14)
states: 215,183,733,408 (11)
abstracting: (p14<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p180)
states: 69,387,597,216 (10)
abstracting: (p180<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p213)
states: 161,190,086,400 (11)
abstracting: (p213<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p4)
states: 799,544,326,591 (11)
abstracting: (p4<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p14)
states: 215,183,733,408 (11)
abstracting: (p14<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p180)
states: 69,387,597,216 (10)
abstracting: (p180<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p213)
states: 161,190,086,400 (11)
abstracting: (p213<=1)
states: 1,605,440,653,476 (12)
MC time: 2m 7.014sec

checking: [AX [~ [A [EX [[[[p4<=1 & 1<=p4] & [p14<=1 & 1<=p14]] & [[p78<=1 & 1<=p78] & [p213<=1 & 1<=p213]]]] U [EX [[p176<=1 & 1<=p176]] | [~ [[p19<=1 & 1<=p19]] | [p0<=1 & 1<=p0]]]]]] | [AF [AG [[EG [[[[p4<=0 & 0<=p4] | [p12<=0 & 0<=p12]] | [[p45<=0 & 0<=p45] | [p213<=0 & 0<=p213]]]] & [p221<=0 & 0<=p221]]]] & AF [EG [AG [[[[p4<=1 & 1<=p4] & [p13<=1 & 1<=p13]] & [[p78<=1 & 1<=p78] & [p213<=1 & 1<=p213]]]]]]]]
normalized: [[~ [EG [~ [EG [~ [E [true U ~ [[[[p213<=1 & 1<=p213] & [p78<=1 & 1<=p78]] & [[p13<=1 & 1<=p13] & [p4<=1 & 1<=p4]]]]]]]]]] & ~ [EG [E [true U ~ [[[p221<=0 & 0<=p221] & EG [[[[p213<=0 & 0<=p213] | [p45<=0 & 0<=p45]] | [[p12<=0 & 0<=p12] | [p4<=0 & 0<=p4]]]]]]]]]] | ~ [EX [[~ [EG [~ [[[[p0<=1 & 1<=p0] | ~ [[p19<=1 & 1<=p19]]] | EX [[p176<=1 & 1<=p176]]]]]] & ~ [E [~ [[[[p0<=1 & 1<=p0] | ~ [[p19<=1 & 1<=p19]]] | EX [[p176<=1 & 1<=p176]]]] U [~ [EX [[[[p213<=1 & 1<=p213] & [p78<=1 & 1<=p78]] & [[p14<=1 & 1<=p14] & [p4<=1 & 1<=p4]]]]] & ~ [[[[p0<=1 & 1<=p0] | ~ [[p19<=1 & 1<=p19]]] | EX [[p176<=1 & 1<=p176]]]]]]]]]]]

abstracting: (1<=p176)
states: 69,387,597,216 (10)
abstracting: (p176<=1)
states: 1,605,440,653,476 (12)
.abstracting: (1<=p19)
states: 600
abstracting: (p19<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p4)
states: 799,544,326,591 (11)
abstracting: (p4<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p14)
states: 215,183,733,408 (11)
abstracting: (p14<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p78)
states: 67,753,660,464 (10)
abstracting: (p78<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p213)
states: 161,190,086,400 (11)
abstracting: (p213<=1)
states: 1,605,440,653,476 (12)
.abstracting: (1<=p176)
states: 69,387,597,216 (10)
abstracting: (p176<=1)
states: 1,605,440,653,476 (12)
.abstracting: (1<=p19)
states: 600
abstracting: (p19<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p176)
states: 69,387,597,216 (10)
abstracting: (p176<=1)
states: 1,605,440,653,476 (12)
.abstracting: (1<=p19)
states: 600
abstracting: (p19<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,605,440,653,476 (12)
......................
EG iterations: 22
.abstracting: (0<=p4)
states: 1,605,440,653,476 (12)
abstracting: (p4<=0)
states: 805,896,326,885 (11)
abstracting: (0<=p12)
states: 1,605,440,653,476 (12)
abstracting: (p12<=0)
states: 1,390,256,920,068 (12)
abstracting: (0<=p45)
states: 1,605,440,653,476 (12)
abstracting: (p45<=0)
states: 1,537,612,905,012 (12)
abstracting: (0<=p213)
states: 1,605,440,653,476 (12)
abstracting: (p213<=0)
states: 1,444,250,567,076 (12)
..........
before gc: list nodes free: 1319568

after gc: idd nodes used:971724, unused:63028276; list nodes free:293418960
.................................................................
EG iterations: 75
abstracting: (0<=p221)
states: 1,605,440,653,476 (12)
abstracting: (p221<=0)
states: 1,540,269,401,316 (12)
MC time: 1m58.012sec

checking: EG [[[p135<=0 & 0<=p135] | ~ [A [EF [[[[p4<=1 & 1<=p4] & [p15<=1 & 1<=p15]] & [[p153<=1 & 1<=p153] & [p213<=1 & 1<=p213]]]] U [[[[p4<=1 & 1<=p4] & [p11<=1 & 1<=p11]] & [[p72<=1 & 1<=p72] & [p213<=1 & 1<=p213]]] | [[[[p4<=1 & 1<=p4] & [p11<=1 & 1<=p11]] & [[p115<=1 & 1<=p115] & [p213<=1 & 1<=p213]]] & [[[p4<=1 & 1<=p4] & [p13<=1 & 1<=p13]] & [[p99<=1 & 1<=p99] & [p213<=1 & 1<=p213]]]]]]]]]
normalized: EG [[~ [[~ [EG [~ [[[[[[p213<=1 & 1<=p213] & [p99<=1 & 1<=p99]] & [[p13<=1 & 1<=p13] & [p4<=1 & 1<=p4]]] & [[[p213<=1 & 1<=p213] & [p115<=1 & 1<=p115]] & [[p11<=1 & 1<=p11] & [p4<=1 & 1<=p4]]]] | [[[p213<=1 & 1<=p213] & [p72<=1 & 1<=p72]] & [[p11<=1 & 1<=p11] & [p4<=1 & 1<=p4]]]]]]] & ~ [E [~ [[[[[[p213<=1 & 1<=p213] & [p99<=1 & 1<=p99]] & [[p13<=1 & 1<=p13] & [p4<=1 & 1<=p4]]] & [[[p213<=1 & 1<=p213] & [p115<=1 & 1<=p115]] & [[p11<=1 & 1<=p11] & [p4<=1 & 1<=p4]]]] | [[[p213<=1 & 1<=p213] & [p72<=1 & 1<=p72]] & [[p11<=1 & 1<=p11] & [p4<=1 & 1<=p4]]]]] U [~ [E [true U [[[p213<=1 & 1<=p213] & [p153<=1 & 1<=p153]] & [[p15<=1 & 1<=p15] & [p4<=1 & 1<=p4]]]]] & ~ [[[[[[p213<=1 & 1<=p213] & [p99<=1 & 1<=p99]] & [[p13<=1 & 1<=p13] & [p4<=1 & 1<=p4]]] & [[[p213<=1 & 1<=p213] & [p115<=1 & 1<=p115]] & [[p11<=1 & 1<=p11] & [p4<=1 & 1<=p4]]]] | [[[p213<=1 & 1<=p213] & [p72<=1 & 1<=p72]] & [[p11<=1 & 1<=p11] & [p4<=1 & 1<=p4]]]]]]]]]] | [p135<=0 & 0<=p135]]]

abstracting: (0<=p135)
states: 1,605,440,653,476 (12)
abstracting: (p135<=0)
states: 1,539,246,841,764 (12)
abstracting: (1<=p4)
states: 799,544,326,591 (11)
abstracting: (p4<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p11)
states: 215,183,733,408 (11)
abstracting: (p11<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p72)
states: 67,753,660,464 (10)
abstracting: (p72<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p213)
states: 161,190,086,400 (11)
abstracting: (p213<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p4)
states: 799,544,326,591 (11)
abstracting: (p4<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p11)
states: 215,183,733,408 (11)
abstracting: (p11<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p115)
states: 66,193,811,712 (10)
abstracting: (p115<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p213)
states: 161,190,086,400 (11)
abstracting: (p213<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p4)
states: 799,544,326,591 (11)
abstracting: (p4<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p13)
states: 215,183,733,408 (11)
abstracting: (p13<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p99)
states: 66,556,878,948 (10)
abstracting: (p99<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p213)
states: 161,190,086,400 (11)
abstracting: (p213<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p4)
states: 799,544,326,591 (11)
abstracting: (p4<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p15)
states: 198,144,355,248 (11)
abstracting: (p15<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p153)
states: 66,556,878,948 (10)
abstracting: (p153<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p213)
states: 161,190,086,400 (11)
abstracting: (p213<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p4)
states: 799,544,326,591 (11)
abstracting: (p4<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p11)
states: 215,183,733,408 (11)
abstracting: (p11<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p72)
states: 67,753,660,464 (10)
abstracting: (p72<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p213)
states: 161,190,086,400 (11)
abstracting: (p213<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p4)
states: 799,544,326,591 (11)
abstracting: (p4<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p11)
states: 215,183,733,408 (11)
abstracting: (p11<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p115)
states: 66,193,811,712 (10)
abstracting: (p115<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p213)
states: 161,190,086,400 (11)
abstracting: (p213<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p4)
states: 799,544,326,591 (11)
abstracting: (p4<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p13)
states: 215,183,733,408 (11)
abstracting: (p13<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p99)
states: 66,556,878,948 (10)
abstracting: (p99<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p213)
states: 161,190,086,400 (11)
abstracting: (p213<=1)
states: 1,605,440,653,476 (12)
MC time: 1m48.007sec

checking: AX [E [A [AX [EX [[[[p50<=1 & 1<=p50] & [[p82<=1 & 1<=p82] & [p109<=1 & 1<=p109]]] & [[[p130<=1 & 1<=p130] & [p158<=1 & 1<=p158]] & [[p190<=1 & 1<=p190] & [p214<=1 & 1<=p214]]]]]] U ~ [[A [[p195<=1 & 1<=p195] U [[[p4<=1 & 1<=p4] & [p14<=1 & 1<=p14]] & [[p180<=1 & 1<=p180] & [p213<=1 & 1<=p213]]]] | ~ [[[[p4<=1 & 1<=p4] & [p11<=1 & 1<=p11]] & [[p115<=1 & 1<=p115] & [p213<=1 & 1<=p213]]]]]]] U AF [EG [A [[p244<=1 & 1<=p244] U [p231<=1 & 1<=p231]]]]]]
normalized: ~ [EX [~ [E [[~ [EG [[~ [[[[p213<=1 & 1<=p213] & [p115<=1 & 1<=p115]] & [[p11<=1 & 1<=p11] & [p4<=1 & 1<=p4]]]] | [~ [EG [~ [[[[p213<=1 & 1<=p213] & [p180<=1 & 1<=p180]] & [[p14<=1 & 1<=p14] & [p4<=1 & 1<=p4]]]]]] & ~ [E [~ [[[[p213<=1 & 1<=p213] & [p180<=1 & 1<=p180]] & [[p14<=1 & 1<=p14] & [p4<=1 & 1<=p4]]]] U [~ [[p195<=1 & 1<=p195]] & ~ [[[[p213<=1 & 1<=p213] & [p180<=1 & 1<=p180]] & [[p14<=1 & 1<=p14] & [p4<=1 & 1<=p4]]]]]]]]]]] & ~ [E [[~ [[[[p213<=1 & 1<=p213] & [p115<=1 & 1<=p115]] & [[p11<=1 & 1<=p11] & [p4<=1 & 1<=p4]]]] | [~ [EG [~ [[[[p213<=1 & 1<=p213] & [p180<=1 & 1<=p180]] & [[p14<=1 & 1<=p14] & [p4<=1 & 1<=p4]]]]]] & ~ [E [~ [[[[p213<=1 & 1<=p213] & [p180<=1 & 1<=p180]] & [[p14<=1 & 1<=p14] & [p4<=1 & 1<=p4]]]] U [~ [[p195<=1 & 1<=p195]] & ~ [[[[p213<=1 & 1<=p213] & [p180<=1 & 1<=p180]] & [[p14<=1 & 1<=p14] & [p4<=1 & 1<=p4]]]]]]]]] U [EX [~ [EX [[[[[p214<=1 & 1<=p214] & [p190<=1 & 1<=p190]] & [[p158<=1 & 1<=p158] & [p130<=1 & 1<=p130]]] & [[[p109<=1 & 1<=p109] & [p82<=1 & 1<=p82]] & [p50<=1 & 1<=p50]]]]]] & [~ [[[[p213<=1 & 1<=p213] & [p115<=1 & 1<=p115]] & [[p11<=1 & 1<=p11] & [p4<=1 & 1<=p4]]]] | [~ [EG [~ [[[[p213<=1 & 1<=p213] & [p180<=1 & 1<=p180]] & [[p14<=1 & 1<=p14] & [p4<=1 & 1<=p4]]]]]] & ~ [E [~ [[[[p213<=1 & 1<=p213] & [p180<=1 & 1<=p180]] & [[p14<=1 & 1<=p14] & [p4<=1 & 1<=p4]]]] U [~ [[p195<=1 & 1<=p195]] & ~ [[[[p213<=1 & 1<=p213] & [p180<=1 & 1<=p180]] & [[p14<=1 & 1<=p14] & [p4<=1 & 1<=p4]]]]]]]]]]]]] U ~ [EG [~ [EG [[~ [EG [~ [[p231<=1 & 1<=p231]]]] & ~ [E [~ [[p231<=1 & 1<=p231]] U [~ [[p244<=1 & 1<=p244]] & ~ [[p231<=1 & 1<=p231]]]]]]]]]]]]]]

abstracting: (1<=p231)
states: 48,878,439,120 (10)
abstracting: (p231<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p244)
states: 48,878,439,120 (10)
abstracting: (p244<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p231)
states: 48,878,439,120 (10)
abstracting: (p231<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p231)
states: 48,878,439,120 (10)
abstracting: (p231<=1)
states: 1,605,440,653,476 (12)

before gc: list nodes free: 5916182

after gc: idd nodes used:1255512, unused:62744488; list nodes free:292130896
.
EG iterations: 1
.......MC time: 1m40.024sec

checking: EF [[[[p97<=1 & 1<=p97] & [[[EX [[p31<=1 & 1<=p31]] | EG [[p186<=1 & 1<=p186]]] | [[p176<=1 & 1<=p176] | [[[p4<=1 & 1<=p4] & [p11<=1 & 1<=p11]] & [[p143<=1 & 1<=p143] & [p213<=1 & 1<=p213]]]]] & [[p177<=0 & 0<=p177] | [[p175<=0 & 0<=p175] | [[[[p4<=0 & 0<=p4] | [p11<=0 & 0<=p11]] | [[p171<=0 & 0<=p171] | [p213<=0 & 0<=p213]]] & [[[p4<=0 & 0<=p4] | [p11<=0 & 0<=p11]] | [[p99<=0 & 0<=p99] | [p213<=0 & 0<=p213]]]]]]]] | [[[[p4<=1 & 1<=p4] & [p14<=1 & 1<=p14]] & [[p49<=1 & 1<=p49] & [p213<=1 & 1<=p213]]] | [[[p56<=1 & 1<=p56] & [[p77<=1 & 1<=p77] & [p104<=1 & 1<=p104]]] & [[[p136<=1 & 1<=p136] & [p163<=1 & 1<=p163]] & [[p190<=1 & 1<=p190] & [p214<=1 & 1<=p214]]]]]]]
normalized: E [true U [[[[[[p214<=1 & 1<=p214] & [p190<=1 & 1<=p190]] & [[p163<=1 & 1<=p163] & [p136<=1 & 1<=p136]]] & [[[p104<=1 & 1<=p104] & [p77<=1 & 1<=p77]] & [p56<=1 & 1<=p56]]] | [[[p213<=1 & 1<=p213] & [p49<=1 & 1<=p49]] & [[p14<=1 & 1<=p14] & [p4<=1 & 1<=p4]]]] | [[[[[[[[p213<=0 & 0<=p213] | [p99<=0 & 0<=p99]] | [[p11<=0 & 0<=p11] | [p4<=0 & 0<=p4]]] & [[[p213<=0 & 0<=p213] | [p171<=0 & 0<=p171]] | [[p11<=0 & 0<=p11] | [p4<=0 & 0<=p4]]]] | [p175<=0 & 0<=p175]] | [p177<=0 & 0<=p177]] & [[[[[p213<=1 & 1<=p213] & [p143<=1 & 1<=p143]] & [[p11<=1 & 1<=p11] & [p4<=1 & 1<=p4]]] | [p176<=1 & 1<=p176]] | [EG [[p186<=1 & 1<=p186]] | EX [[p31<=1 & 1<=p31]]]]] & [p97<=1 & 1<=p97]]]]

abstracting: (1<=p97)
states: 66,556,878,948 (10)
abstracting: (p97<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p31)
states: 614,400 (5)
abstracting: (p31<=1)
states: 1,605,440,653,476 (12)
.abstracting: (1<=p186)
states: 69,387,597,216 (10)
abstracting: (p186<=1)
states: 1,605,440,653,476 (12)
..............MC time: 1m32.031sec

checking: [[AG [[[EG [AF [[p73<=0 & 0<=p73]]] | ~ [E [[p164<=1 & 1<=p164] U [[[p4<=1 & 1<=p4] & [p14<=1 & 1<=p14]] & [[p49<=1 & 1<=p49] & [p213<=1 & 1<=p213]]]]]] | [EF [[p39<=0 & 0<=p39]] | [p46<=0 & 0<=p46]]]] & EX [AF [[[[[[p4<=0 & 0<=p4] | [p13<=0 & 0<=p13]] | [[p186<=0 & 0<=p186] | [p213<=0 & 0<=p213]]] & [[[p4<=0 & 0<=p4] | [p12<=0 & 0<=p12]] | [[p72<=0 & 0<=p72] | [p213<=0 & 0<=p213]]]] & [[[[p50<=0 & 0<=p50] | [[p77<=0 & 0<=p77] | [p104<=0 & 0<=p104]]] | [[[p136<=0 & 0<=p136] | [p163<=0 & 0<=p163]] | [[p185<=0 & 0<=p185] | [p214<=0 & 0<=p214]]]] & [[[p4<=0 & 0<=p4] | [p11<=0 & 0<=p11]] | [[p76<=0 & 0<=p76] | [p213<=0 & 0<=p213]]]]]]]] & [EF [[AX [[p65<=1 & 1<=p65]] | AF [[[[p4<=1 & 1<=p4] & [p13<=1 & 1<=p13]] & [[p129<=1 & 1<=p129] & [p213<=1 & 1<=p213]]]]]] & EX [AX [AG [[p211<=0 & 0<=p211]]]]]]
normalized: [[EX [~ [EX [E [true U ~ [[p211<=0 & 0<=p211]]]]]] & E [true U [~ [EG [~ [[[[p213<=1 & 1<=p213] & [p129<=1 & 1<=p129]] & [[p13<=1 & 1<=p13] & [p4<=1 & 1<=p4]]]]]] | ~ [EX [~ [[p65<=1 & 1<=p65]]]]]]] & [EX [~ [EG [~ [[[[[[p213<=0 & 0<=p213] | [p76<=0 & 0<=p76]] | [[p11<=0 & 0<=p11] | [p4<=0 & 0<=p4]]] & [[[[p214<=0 & 0<=p214] | [p185<=0 & 0<=p185]] | [[p163<=0 & 0<=p163] | [p136<=0 & 0<=p136]]] | [[[p104<=0 & 0<=p104] | [p77<=0 & 0<=p77]] | [p50<=0 & 0<=p50]]]] & [[[[p213<=0 & 0<=p213] | [p72<=0 & 0<=p72]] | [[p12<=0 & 0<=p12] | [p4<=0 & 0<=p4]]] & [[[p213<=0 & 0<=p213] | [p186<=0 & 0<=p186]] | [[p13<=0 & 0<=p13] | [p4<=0 & 0<=p4]]]]]]]]] & ~ [E [true U ~ [[[[p46<=0 & 0<=p46] | E [true U [p39<=0 & 0<=p39]]] | [~ [E [[p164<=1 & 1<=p164] U [[[p213<=1 & 1<=p213] & [p49<=1 & 1<=p49]] & [[p14<=1 & 1<=p14] & [p4<=1 & 1<=p4]]]]] | EG [~ [EG [~ [[p73<=0 & 0<=p73]]]]]]]]]]]]

abstracting: (0<=p73)
states: 1,605,440,653,476 (12)
abstracting: (p73<=0)
states: 1,537,686,993,012 (12)
....
before gc: list nodes free: 10034450

after gc: idd nodes used:1223049, unused:62776951; list nodes free:292261936
........MC time: 1m25.004sec

checking: [AF [[EG [[[[p4<=1 & 1<=p4] & [p6<=1 & 1<=p6]] & [[p153<=1 & 1<=p153] & [p213<=1 & 1<=p213]]]] | [[[[[p4<=0 & 0<=p4] | [p11<=0 & 0<=p11]] | [[p52<=0 & 0<=p52] | [p213<=0 & 0<=p213]]] & [[[p4<=0 & 0<=p4] | [p12<=0 & 0<=p12]] | [[p132<=0 & 0<=p132] | [[p213<=0 & 0<=p213] | [p54<=0 & 0<=p54]]]]] & [[p46<=0 & 0<=p46] & [[[[p4<=0 & 0<=p4] | [p14<=0 & 0<=p14]] | [[p157<=0 & 0<=p157] | [p213<=0 & 0<=p213]]] & [[p247<=0 & 0<=p247] | [p121<=0 & 0<=p121]]]]]]] & [EX [[[EX [[[[p4<=0 & 0<=p4] | [p6<=0 & 0<=p6]] | [[p89<=0 & 0<=p89] | [p213<=0 & 0<=p213]]]] & E [~ [[[[p4<=1 & 1<=p4] & [p15<=1 & 1<=p15]] & [[p52<=1 & 1<=p52] & [p213<=1 & 1<=p213]]]] U AF [[[[p4<=1 & 1<=p4] & [p6<=1 & 1<=p6]] & [[p99<=1 & 1<=p99] & [p213<=1 & 1<=p213]]]]]] | [[[p4<=1 & 1<=p4] & [p11<=1 & 1<=p11]] & [[p125<=1 & 1<=p125] & [p213<=1 & 1<=p213]]]]] | E [[[[p4<=1 & 1<=p4] & [p13<=1 & 1<=p13]] & [[p159<=1 & 1<=p159] & [p213<=1 & 1<=p213]]] U [~ [[[p196<=1 & 1<=p196] | ~ [AX [1<=0]]]] & ~ [[[[[[p4<=1 & 1<=p4] & [p6<=1 & 1<=p6]] & [[p157<=1 & 1<=p157] & [p213<=1 & 1<=p213]]] | [p189<=1 & 1<=p189]] & [[[[p4<=1 & 1<=p4] & [p14<=1 & 1<=p14]] & [[p78<=1 & 1<=p78] & [p213<=1 & 1<=p213]]] | [[[p4<=1 & 1<=p4] & [p15<=1 & 1<=p15]] & [[p62<=1 & 1<=p62] & [p213<=1 & 1<=p213]]]]]]]]]]
normalized: [[E [[[[p213<=1 & 1<=p213] & [p159<=1 & 1<=p159]] & [[p13<=1 & 1<=p13] & [p4<=1 & 1<=p4]]] U [~ [[[[[[p213<=1 & 1<=p213] & [p62<=1 & 1<=p62]] & [[p15<=1 & 1<=p15] & [p4<=1 & 1<=p4]]] | [[[p213<=1 & 1<=p213] & [p78<=1 & 1<=p78]] & [[p14<=1 & 1<=p14] & [p4<=1 & 1<=p4]]]] & [[p189<=1 & 1<=p189] | [[[p213<=1 & 1<=p213] & [p157<=1 & 1<=p157]] & [[p6<=1 & 1<=p6] & [p4<=1 & 1<=p4]]]]]] & ~ [[EX [~ [1<=0]] | [p196<=1 & 1<=p196]]]]] | EX [[[[[p213<=1 & 1<=p213] & [p125<=1 & 1<=p125]] & [[p11<=1 & 1<=p11] & [p4<=1 & 1<=p4]]] | [E [~ [[[[p213<=1 & 1<=p213] & [p52<=1 & 1<=p52]] & [[p15<=1 & 1<=p15] & [p4<=1 & 1<=p4]]]] U ~ [EG [~ [[[[p213<=1 & 1<=p213] & [p99<=1 & 1<=p99]] & [[p6<=1 & 1<=p6] & [p4<=1 & 1<=p4]]]]]]] & EX [[[[p213<=0 & 0<=p213] | [p89<=0 & 0<=p89]] | [[p6<=0 & 0<=p6] | [p4<=0 & 0<=p4]]]]]]]] & ~ [EG [~ [[[[[[[p121<=0 & 0<=p121] | [p247<=0 & 0<=p247]] & [[[p213<=0 & 0<=p213] | [p157<=0 & 0<=p157]] | [[p14<=0 & 0<=p14] | [p4<=0 & 0<=p4]]]] & [p46<=0 & 0<=p46]] & [[[[[p54<=0 & 0<=p54] | [p213<=0 & 0<=p213]] | [p132<=0 & 0<=p132]] | [[p12<=0 & 0<=p12] | [p4<=0 & 0<=p4]]] & [[[p213<=0 & 0<=p213] | [p52<=0 & 0<=p52]] | [[p11<=0 & 0<=p11] | [p4<=0 & 0<=p4]]]]] | EG [[[[p213<=1 & 1<=p213] & [p153<=1 & 1<=p153]] & [[p6<=1 & 1<=p6] & [p4<=1 & 1<=p4]]]]]]]]]

abstracting: (1<=p4)
states: 799,544,326,591 (11)
abstracting: (p4<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p6)
states: 88,667,074,732 (10)
abstracting: (p6<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p153)
states: 66,556,878,948 (10)
abstracting: (p153<=1)
states: 1,605,440,653,476 (12)
abstracting: (1<=p213)
states: 161,190,086,400 (11)
abstracting: (p213<=1)
states: 1,605,440,653,476 (12)
...........................................................................
EG iterations: 75
abstracting: (0<=p4)
states: 1,605,440,653,476 (12)
abstracting: (p4<=0)
states: 805,896,326,885 (11)
abstracting: (0<=p11)
states: 1,605,440,653,476 (12)
abstracting: (p11<=0)
states: 1,390,256,920,068 (12)
abstracting: (0<=p52)
states: 1,605,440,653,476 (12)
abstracting: (p52<=0)
states: 1,537,612,905,012 (12)
abstracting: (0<=p213)
states: 1,605,440,653,476 (12)
abstracting: (p213<=0)
states: 1,444,250,567,076 (12)
abstracting: (0<=p4)
states: 1,605,440,653,476 (12)
abstracting: (p4<=0)
states: 805,896,326,885 (11)
abstracting: (0<=p12)
states: 1,605,440,653,476 (12)
abstracting: (p12<=0)
states: 1,390,256,920,068 (12)
abstracting: (0<=p132)
states: 1,605,440,653,476 (12)
abstracting: (p132<=0)
states: 1,539,246,841,764 (12)
abstracting: (0<=p213)
states: 1,605,440,653,476 (12)
abstracting: (p213<=0)
states: 1,444,250,567,076 (12)
abstracting: (0<=p54)
states: 1,605,440,653,476 (12)
abstracting: (p54<=0)
states: 1,537,612,905,012 (12)
abstracting: (0<=p46)
states: 1,605,440,653,476 (12)
abstracting: (p46<=0)
states: 1,537,612,905,012 (12)
abstracting: (0<=p4)
states: 1,605,440,653,476 (12)
abstracting: (p4<=0)
states: 805,896,326,885 (11)
abstracting: (0<=p14)
states: 1,605,440,653,476 (12)
abstracting: (p14<=0)
states: 1,390,256,920,068 (12)
abstracting: (0<=p157)
states: 1,605,440,653,476 (12)
abstracting: (p157<=0)
states: 1,541,356,995,768 (12)
abstracting: (0<=p213)
states: 1,605,440,653,476 (12)
abstracting: (p213<=0)
states: 1,444,250,567,076 (12)
abstracting: (0<=p247)
states: 1,605,440,653,476 (12)
abstracting: (p247<=0)
states: 1,467,499,305,876 (12)
abstracting: (0<=p121)
states: 1,605,440,653,476 (12)
abstracting: (p121<=0)
states: 1,539,246,841,764 (12)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6020748 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098176 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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

141691 143202 152227 148374 155255 165128 166464 156431 163603 169820 186999 203431 185761 185403 194214 174896 169891 184455 194206 200258 188327 188166 199339 213748 224511 225747 220614 216084 214724 212720 220506 228962 227295 215555 204375 208599 201118 199783 210921 233310 220311 218475 220122 214895 215388 216037 218137 249653 244144 268531 258803 283728 278077 291742 279455 264681 267167 266603 271195 262656 252842 246894 279750 256026 276294 264375 282968 257745 245242 245191 240988 243624 229881
iterations count:7344244 (15828), effective:118560 (255)

initing FirstDep: 0m 0.013sec


net_ddint.h:600: Timeout: after 194 sec


net_ddint.h:600: Timeout: after 180 sec

37752 45393 148232
iterations count:332845 (717), effective:9659 (20)

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

net_ddint.h:600: Timeout: after 167 sec


iterations count:464 (1), effective:0 (0)
92802
iterations count:156079 (336), effective:4950 (10)
84384 89613 81358 91190 88648
iterations count:585814 (1262), effective:17714 (38)

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

net_ddint.h:600: Timeout: after 161 sec

123750 125992 120177 231453 236263
iterations count:581557 (1253), effective:16681 (35)

net_ddint.h:600: Timeout: after 148 sec

59366 64042 169349 167868 170430 192738
iterations count:677436 (1459), effective:17527 (37)

net_ddint.h:600: Timeout: after 137 sec


iterations count:921 (1), effective:31 (0)

net_ddint.h:600: Timeout: after 126 sec


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

sat_reach.icc:155: Timeout: after 117 sec

68548 99564 73572 65539 174888 184180
iterations count:678738 (1462), effective:18892 (40)

sat_reach.icc:155: Timeout: after 107 sec


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

net_ddint.h:600: Timeout: after 99 sec


net_ddint.h:600: Timeout: after 91 sec


net_ddint.h:600: Timeout: after 84 sec


net_ddint.h:600: Timeout: after 78 sec

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-06b"
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 AutonomousCar-PT-06b, 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 r010-oct2-167813599300618"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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