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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 5.2K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 12:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 8.9K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 12:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:55 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 448K 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-08a-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678700496858

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-08a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:41:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 09:41:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:41:39] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2023-03-13 09:41:39] [INFO ] Transformed 81 places.
[2023-03-13 09:41:39] [INFO ] Transformed 849 transitions.
[2023-03-13 09:41:39] [INFO ] Found NUPN structural information;
[2023-03-13 09:41:39] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 325 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
Support contains 59 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 574/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 80 transition count 573
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 573
Applied a total of 2 rules in 29 ms. Remains 80 /81 variables (removed 1) and now considering 573/574 (removed 1) transitions.
// Phase 1: matrix 573 rows 80 cols
[2023-03-13 09:41:40] [INFO ] Computed 12 place invariants in 14 ms
[2023-03-13 09:41:40] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-13 09:41:40] [INFO ] Invariant cache hit.
[2023-03-13 09:41:40] [INFO ] State equation strengthened by 259 read => feed constraints.
[2023-03-13 09:41:40] [INFO ] Implicit Places using invariants and state equation in 290 ms returned [76, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 643 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/81 places, 573/574 transitions.
Applied a total of 0 rules in 8 ms. Remains 78 /78 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 680 ms. Remains : 78/81 places, 573/574 transitions.
Support contains 59 out of 78 places after structural reductions.
[2023-03-13 09:41:40] [INFO ] Flatten gal took : 149 ms
[2023-03-13 09:41:41] [INFO ] Flatten gal took : 90 ms
[2023-03-13 09:41:41] [INFO ] Input system was already deterministic with 573 transitions.
Incomplete random walk after 10000 steps, including 513 resets, run finished after 557 ms. (steps per millisecond=17 ) properties (out of 89) seen :33
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :2
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) 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 54) seen :1
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 53) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) 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 50) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :3
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 46) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :1
Running SMT prover for 44 properties.
// Phase 1: matrix 573 rows 78 cols
[2023-03-13 09:41:42] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-13 09:41:43] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 09:41:43] [INFO ] After 904ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:42
[2023-03-13 09:41:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2023-03-13 09:41:47] [INFO ] After 2833ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :37
[2023-03-13 09:41:47] [INFO ] State equation strengthened by 259 read => feed constraints.
[2023-03-13 09:41:49] [INFO ] After 2676ms SMT Verify possible using 259 Read/Feed constraints in natural domain returned unsat :7 sat :37
[2023-03-13 09:41:53] [INFO ] After 6519ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :37
Attempting to minimize the solution found.
Minimization took 2650 ms.
[2023-03-13 09:41:56] [INFO ] After 12380ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :37
Fused 44 Parikh solutions to 37 different solutions.
Parikh walk visited 2 properties in 306 ms.
Support contains 44 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 573/573 transitions.
Graph (complete) has 842 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 77 transition count 568
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 76 transition count 566
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 74 transition count 566
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 74 transition count 563
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 71 transition count 563
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 18 place count 69 transition count 553
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 69 transition count 553
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 3 with 2 rules applied. Total rules applied 22 place count 68 transition count 552
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 68 transition count 548
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 38 place count 64 transition count 540
Applied a total of 38 rules in 111 ms. Remains 64 /78 variables (removed 14) and now considering 540/573 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 64/78 places, 540/573 transitions.
Incomplete random walk after 10000 steps, including 234 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 35) seen :3
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :2
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
// Phase 1: matrix 540 rows 64 cols
[2023-03-13 09:41:57] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-13 09:41:57] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-13 09:41:58] [INFO ] After 1217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-13 09:41:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-13 09:42:00] [INFO ] After 1786ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-03-13 09:42:00] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-13 09:42:02] [INFO ] After 1462ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :27
[2023-03-13 09:42:04] [INFO ] After 4148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 1640 ms.
[2023-03-13 09:42:06] [INFO ] After 7861ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Parikh walk visited 0 properties in 477 ms.
Support contains 41 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 540/540 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 538
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 62 transition count 522
Applied a total of 20 rules in 42 ms. Remains 62 /64 variables (removed 2) and now considering 522/540 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 62/64 places, 522/540 transitions.
Incomplete random walk after 10000 steps, including 236 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 27) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) 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 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :3
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 522 rows 62 cols
[2023-03-13 09:42:07] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-13 09:42:07] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-13 09:42:08] [INFO ] After 859ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-13 09:42:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-13 09:42:10] [INFO ] After 1340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-13 09:42:10] [INFO ] State equation strengthened by 225 read => feed constraints.
[2023-03-13 09:42:11] [INFO ] After 1393ms SMT Verify possible using 225 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2023-03-13 09:42:13] [INFO ] After 3031ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 1334 ms.
[2023-03-13 09:42:14] [INFO ] After 5857ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Parikh walk visited 0 properties in 314 ms.
Support contains 31 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 522/522 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 521
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 61 transition count 513
Applied a total of 10 rules in 39 ms. Remains 61 /62 variables (removed 1) and now considering 513/522 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 61/62 places, 513/522 transitions.
Incomplete random walk after 10000 steps, including 109 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) 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 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 513 rows 61 cols
[2023-03-13 09:42:15] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-13 09:42:15] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 09:42:15] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-13 09:42:15] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 09:42:17] [INFO ] After 1179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-13 09:42:17] [INFO ] State equation strengthened by 217 read => feed constraints.
[2023-03-13 09:42:18] [INFO ] After 982ms SMT Verify possible using 217 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-03-13 09:42:19] [INFO ] After 2552ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 1158 ms.
[2023-03-13 09:42:20] [INFO ] After 5045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 342 ms.
Support contains 22 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 513/513 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 59 transition count 511
Applied a total of 4 rules in 30 ms. Remains 59 /61 variables (removed 2) and now considering 511/513 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 59/61 places, 511/513 transitions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 513049 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{0=1, 3=1, 4=1, 8=1, 9=1, 14=1, 15=1}
Probabilistic random walk after 513049 steps, saw 72796 distinct states, run finished after 3011 ms. (steps per millisecond=170 ) properties seen :7
Running SMT prover for 11 properties.
// Phase 1: matrix 511 rows 59 cols
[2023-03-13 09:42:24] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-13 09:42:24] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 09:42:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-13 09:42:25] [INFO ] After 835ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-13 09:42:25] [INFO ] State equation strengthened by 217 read => feed constraints.
[2023-03-13 09:42:26] [INFO ] After 662ms SMT Verify possible using 217 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-13 09:42:27] [INFO ] After 1585ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 742 ms.
[2023-03-13 09:42:28] [INFO ] After 3433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 194 ms.
Support contains 18 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 511/511 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 58 transition count 510
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 56 transition count 492
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 56 transition count 492
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 56 transition count 491
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 16 place count 55 transition count 483
Applied a total of 16 rules in 46 ms. Remains 55 /59 variables (removed 4) and now considering 483/511 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 55/59 places, 483/511 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :2
Running SMT prover for 9 properties.
// Phase 1: matrix 483 rows 55 cols
[2023-03-13 09:42:29] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-13 09:42:29] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 09:42:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 09:42:29] [INFO ] After 528ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-13 09:42:29] [INFO ] State equation strengthened by 193 read => feed constraints.
[2023-03-13 09:42:30] [INFO ] After 419ms SMT Verify possible using 193 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-13 09:42:31] [INFO ] After 1220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 555 ms.
[2023-03-13 09:42:31] [INFO ] After 2400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 267 ms.
Support contains 13 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 483/483 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 53 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 53 transition count 465
Applied a total of 4 rules in 29 ms. Remains 53 /55 variables (removed 2) and now considering 465/483 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 53/55 places, 465/483 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 465 rows 53 cols
[2023-03-13 09:42:32] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-13 09:42:32] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 09:42:32] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 09:42:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-13 09:42:33] [INFO ] After 696ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 09:42:33] [INFO ] State equation strengthened by 177 read => feed constraints.
[2023-03-13 09:42:33] [INFO ] After 375ms SMT Verify possible using 177 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-13 09:42:34] [INFO ] After 1013ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 520 ms.
[2023-03-13 09:42:34] [INFO ] After 2368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 194 ms.
Support contains 12 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 465/465 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 52 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 52 transition count 456
Applied a total of 2 rules in 31 ms. Remains 52 /53 variables (removed 1) and now considering 456/465 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 52/53 places, 456/465 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 456 rows 52 cols
[2023-03-13 09:42:35] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-13 09:42:35] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-13 09:42:35] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 09:42:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-13 09:42:36] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 09:42:36] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-03-13 09:42:36] [INFO ] After 517ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 09:42:37] [INFO ] After 1098ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 304 ms.
[2023-03-13 09:42:37] [INFO ] After 1883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 108 ms.
Support contains 10 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 456/456 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 454
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 50 transition count 438
Applied a total of 20 rules in 30 ms. Remains 50 /52 variables (removed 2) and now considering 438/456 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 50/52 places, 438/456 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 438 rows 50 cols
[2023-03-13 09:42:37] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-13 09:42:38] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 09:42:38] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 09:42:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 1 ms returned sat
[2023-03-13 09:42:38] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 09:42:38] [INFO ] State equation strengthened by 153 read => feed constraints.
[2023-03-13 09:42:38] [INFO ] After 291ms SMT Verify possible using 153 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 09:42:38] [INFO ] After 620ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 266 ms.
[2023-03-13 09:42:39] [INFO ] After 1228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 100 ms.
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 438/438 transitions.
Applied a total of 0 rules in 20 ms. Remains 50 /50 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 50/50 places, 438/438 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1509947 steps, run timeout after 3001 ms. (steps per millisecond=503 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 1509947 steps, saw 191212 distinct states, run finished after 3001 ms. (steps per millisecond=503 ) properties seen :3
Running SMT prover for 1 properties.
[2023-03-13 09:42:42] [INFO ] Invariant cache hit.
[2023-03-13 09:42:42] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:42:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-13 09:42:43] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:42:43] [INFO ] State equation strengthened by 153 read => feed constraints.
[2023-03-13 09:42:43] [INFO ] After 58ms SMT Verify possible using 153 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 09:42:43] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-13 09:42:43] [INFO ] After 453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 438/438 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 50 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 49 transition count 437
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 48 transition count 428
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 48 transition count 428
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 48 transition count 427
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 14 place count 47 transition count 419
Applied a total of 14 rules in 46 ms. Remains 47 /50 variables (removed 3) and now considering 419/438 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 47/50 places, 419/438 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2258915 steps, run timeout after 3001 ms. (steps per millisecond=752 ) properties seen :{}
Probabilistic random walk after 2258915 steps, saw 275136 distinct states, run finished after 3003 ms. (steps per millisecond=752 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 419 rows 47 cols
[2023-03-13 09:42:46] [INFO ] Computed 12 place invariants in 8 ms
[2023-03-13 09:42:46] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:42:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-13 09:42:46] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:42:46] [INFO ] State equation strengthened by 137 read => feed constraints.
[2023-03-13 09:42:46] [INFO ] After 69ms SMT Verify possible using 137 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 09:42:46] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-13 09:42:46] [INFO ] After 477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 419/419 transitions.
Applied a total of 0 rules in 27 ms. Remains 47 /47 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 47/47 places, 419/419 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 419/419 transitions.
Applied a total of 0 rules in 22 ms. Remains 47 /47 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2023-03-13 09:42:47] [INFO ] Invariant cache hit.
[2023-03-13 09:42:47] [INFO ] Implicit Places using invariants in 303 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 306 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 46/47 places, 419/419 transitions.
Applied a total of 0 rules in 43 ms. Remains 46 /46 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 371 ms. Remains : 46/47 places, 419/419 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2343210 steps, run timeout after 3001 ms. (steps per millisecond=780 ) properties seen :{}
Probabilistic random walk after 2343210 steps, saw 284085 distinct states, run finished after 3001 ms. (steps per millisecond=780 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 419 rows 46 cols
[2023-03-13 09:42:50] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-13 09:42:50] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:42:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-13 09:42:50] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:42:50] [INFO ] State equation strengthened by 137 read => feed constraints.
[2023-03-13 09:42:50] [INFO ] After 53ms SMT Verify possible using 137 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 09:42:50] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-13 09:42:50] [INFO ] After 328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 419/419 transitions.
Applied a total of 0 rules in 29 ms. Remains 46 /46 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 46/46 places, 419/419 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 419/419 transitions.
Applied a total of 0 rules in 20 ms. Remains 46 /46 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2023-03-13 09:42:50] [INFO ] Invariant cache hit.
[2023-03-13 09:42:51] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-13 09:42:51] [INFO ] Invariant cache hit.
[2023-03-13 09:42:51] [INFO ] State equation strengthened by 137 read => feed constraints.
[2023-03-13 09:42:51] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
[2023-03-13 09:42:51] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-13 09:42:51] [INFO ] Invariant cache hit.
[2023-03-13 09:42:52] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1271 ms. Remains : 46/46 places, 419/419 transitions.
Applied a total of 0 rules in 11 ms. Remains 46 /46 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-13 09:42:52] [INFO ] Invariant cache hit.
[2023-03-13 09:42:52] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:42:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 09:42:52] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:42:52] [INFO ] After 268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-13 09:42:52] [INFO ] After 393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA AutonomousCar-PT-08a-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:42:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 09:42:52] [INFO ] Flatten gal took : 73 ms
[2023-03-13 09:42:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutonomousCar-PT-08a-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:42:52] [INFO ] Flatten gal took : 63 ms
[2023-03-13 09:42:52] [INFO ] Input system was already deterministic with 573 transitions.
Support contains 54 out of 78 places (down from 58) after GAL structural reductions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 71 transition count 510
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 71 transition count 510
Applied a total of 14 rules in 4 ms. Remains 71 /78 variables (removed 7) and now considering 510/573 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 71/78 places, 510/573 transitions.
[2023-03-13 09:42:53] [INFO ] Flatten gal took : 44 ms
[2023-03-13 09:42:53] [INFO ] Flatten gal took : 45 ms
[2023-03-13 09:42:53] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 78 transition count 565
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 70 transition count 565
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 70 transition count 563
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 68 transition count 563
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 63 transition count 518
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 63 transition count 518
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 2 with 2 rules applied. Total rules applied 32 place count 62 transition count 517
Applied a total of 32 rules in 53 ms. Remains 62 /78 variables (removed 16) and now considering 517/573 (removed 56) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 62/78 places, 517/573 transitions.
[2023-03-13 09:42:53] [INFO ] Flatten gal took : 54 ms
[2023-03-13 09:42:53] [INFO ] Flatten gal took : 54 ms
[2023-03-13 09:42:53] [INFO ] Input system was already deterministic with 517 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 70 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 70 transition count 501
Applied a total of 16 rules in 5 ms. Remains 70 /78 variables (removed 8) and now considering 501/573 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 70/78 places, 501/573 transitions.
[2023-03-13 09:42:53] [INFO ] Flatten gal took : 37 ms
[2023-03-13 09:42:53] [INFO ] Flatten gal took : 39 ms
[2023-03-13 09:42:53] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 73 transition count 528
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 73 transition count 528
Applied a total of 10 rules in 4 ms. Remains 73 /78 variables (removed 5) and now considering 528/573 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 73/78 places, 528/573 transitions.
[2023-03-13 09:42:53] [INFO ] Flatten gal took : 40 ms
[2023-03-13 09:42:53] [INFO ] Flatten gal took : 42 ms
[2023-03-13 09:42:53] [INFO ] Input system was already deterministic with 528 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 73 transition count 528
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 73 transition count 528
Applied a total of 10 rules in 3 ms. Remains 73 /78 variables (removed 5) and now considering 528/573 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 73/78 places, 528/573 transitions.
[2023-03-13 09:42:53] [INFO ] Flatten gal took : 37 ms
[2023-03-13 09:42:53] [INFO ] Flatten gal took : 38 ms
[2023-03-13 09:42:54] [INFO ] Input system was already deterministic with 528 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 71 transition count 510
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 71 transition count 510
Applied a total of 14 rules in 4 ms. Remains 71 /78 variables (removed 7) and now considering 510/573 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 71/78 places, 510/573 transitions.
[2023-03-13 09:42:54] [INFO ] Flatten gal took : 36 ms
[2023-03-13 09:42:54] [INFO ] Flatten gal took : 38 ms
[2023-03-13 09:42:54] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 71 transition count 510
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 71 transition count 510
Applied a total of 14 rules in 5 ms. Remains 71 /78 variables (removed 7) and now considering 510/573 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 71/78 places, 510/573 transitions.
[2023-03-13 09:42:54] [INFO ] Flatten gal took : 35 ms
[2023-03-13 09:42:54] [INFO ] Flatten gal took : 37 ms
[2023-03-13 09:42:54] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 70 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 70 transition count 501
Applied a total of 16 rules in 5 ms. Remains 70 /78 variables (removed 8) and now considering 501/573 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 70/78 places, 501/573 transitions.
[2023-03-13 09:42:54] [INFO ] Flatten gal took : 34 ms
[2023-03-13 09:42:54] [INFO ] Flatten gal took : 38 ms
[2023-03-13 09:42:54] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 71 transition count 510
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 71 transition count 510
Applied a total of 14 rules in 4 ms. Remains 71 /78 variables (removed 7) and now considering 510/573 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 71/78 places, 510/573 transitions.
[2023-03-13 09:42:54] [INFO ] Flatten gal took : 35 ms
[2023-03-13 09:42:54] [INFO ] Flatten gal took : 39 ms
[2023-03-13 09:42:54] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 74 transition count 537
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 74 transition count 537
Applied a total of 8 rules in 3 ms. Remains 74 /78 variables (removed 4) and now considering 537/573 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 74/78 places, 537/573 transitions.
[2023-03-13 09:42:54] [INFO ] Flatten gal took : 35 ms
[2023-03-13 09:42:54] [INFO ] Flatten gal took : 35 ms
[2023-03-13 09:42:54] [INFO ] Input system was already deterministic with 537 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 74 transition count 537
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 74 transition count 537
Applied a total of 8 rules in 3 ms. Remains 74 /78 variables (removed 4) and now considering 537/573 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 74/78 places, 537/573 transitions.
[2023-03-13 09:42:54] [INFO ] Flatten gal took : 34 ms
[2023-03-13 09:42:55] [INFO ] Flatten gal took : 35 ms
[2023-03-13 09:42:55] [INFO ] Input system was already deterministic with 537 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 75 transition count 546
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 75 transition count 546
Applied a total of 6 rules in 8 ms. Remains 75 /78 variables (removed 3) and now considering 546/573 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 75/78 places, 546/573 transitions.
[2023-03-13 09:42:55] [INFO ] Flatten gal took : 51 ms
[2023-03-13 09:42:55] [INFO ] Flatten gal took : 40 ms
[2023-03-13 09:42:55] [INFO ] Input system was already deterministic with 546 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 76 transition count 555
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 76 transition count 555
Applied a total of 4 rules in 3 ms. Remains 76 /78 variables (removed 2) and now considering 555/573 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 76/78 places, 555/573 transitions.
[2023-03-13 09:42:55] [INFO ] Flatten gal took : 38 ms
[2023-03-13 09:42:55] [INFO ] Flatten gal took : 40 ms
[2023-03-13 09:42:55] [INFO ] Input system was already deterministic with 555 transitions.
[2023-03-13 09:42:55] [INFO ] Flatten gal took : 42 ms
[2023-03-13 09:42:55] [INFO ] Flatten gal took : 56 ms
[2023-03-13 09:42:55] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2023-03-13 09:42:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 78 places, 573 transitions and 6799 arcs took 4 ms.
Total runtime 76101 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: 78 NrTr: 573 NrArc: 6799)

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

net check time: 0m 0.000sec

init dd package: 0m 3.085sec


RS generation: 0m55.569sec


-> reachability set: #nodes 95448 (9.5e+04) #states 992,718,112 (8)



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

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA AutonomousCar-PT-08a-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.449sec

checking: AG [AX [AF [[[[p1<=0 & 0<=p1] | [p2<=0 & 0<=p2]] | [[p47<=0 & 0<=p47] | [p73<=0 & 0<=p73]]]]]]
normalized: ~ [E [true U EX [EG [~ [[[[p2<=0 & 0<=p2] | [p1<=0 & 0<=p1]] | [[p47<=0 & 0<=p47] | [p73<=0 & 0<=p73]]]]]]]]

abstracting: (0<=p73)
states: 992,718,112 (8)
abstracting: (p73<=0)
states: 714,328,048 (8)
abstracting: (0<=p47)
states: 992,718,112 (8)
abstracting: (p47<=0)
states: 853,373,948 (8)
abstracting: (0<=p1)
states: 992,718,112 (8)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p2)
states: 992,718,112 (8)
abstracting: (p2<=0)
states: 927,625,684 (8)
................
EG iterations: 16
.-> the formula is FALSE

FORMULA AutonomousCar-PT-08a-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m40.812sec

checking: [EG [A [AF [AX [[[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p35<=1 & 1<=p35] & [p73<=1 & 1<=p73]]]]] U EX [[~ [[[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p23<=1 & 1<=p23] & [p73<=1 & 1<=p73]]]] | EX [[[[p1<=1 & 1<=p1] & [p11<=1 & 1<=p11]] & [[p58<=1 & 1<=p58] & [p73<=1 & 1<=p73]]]]]]]] & EG [[p28<=0 & 0<=p28]]]
normalized: [EG [[p28<=0 & 0<=p28]] & EG [[~ [EG [~ [EX [[EX [[[[p73<=1 & 1<=p73] & [p58<=1 & 1<=p58]] & [[p11<=1 & 1<=p11] & [p1<=1 & 1<=p1]]]] | ~ [[[[p73<=1 & 1<=p73] & [p23<=1 & 1<=p23]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]]]]]]] & ~ [E [~ [EX [[EX [[[[p73<=1 & 1<=p73] & [p58<=1 & 1<=p58]] & [[p11<=1 & 1<=p11] & [p1<=1 & 1<=p1]]]] | ~ [[[[p73<=1 & 1<=p73] & [p23<=1 & 1<=p23]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]]]]] U [EG [EX [~ [[[[p73<=1 & 1<=p73] & [p35<=1 & 1<=p35]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]] & ~ [EX [[EX [[[[p73<=1 & 1<=p73] & [p58<=1 & 1<=p58]] & [[p11<=1 & 1<=p11] & [p1<=1 & 1<=p1]]]] | ~ [[[[p73<=1 & 1<=p73] & [p23<=1 & 1<=p23]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]]]]]]]]]]]

abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p8)
states: 109,436,645 (8)
abstracting: (p8<=1)
states: 992,718,112 (8)
abstracting: (1<=p23)
states: 139,344,164 (8)
abstracting: (p23<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p11)
states: 98,156,357 (7)
abstracting: (p11<=1)
states: 992,718,112 (8)
abstracting: (1<=p58)
states: 139,344,164 (8)
abstracting: (p58<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
..abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p6)
states: 109,436,645 (8)
abstracting: (p6<=1)
states: 992,718,112 (8)
abstracting: (1<=p35)
states: 138,273,572 (8)
abstracting: (p35<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
..................................
before gc: list nodes free: 1181767

after gc: idd nodes used:871639, unused:63128361; list nodes free:306345911
.................MC time: 5m 7.008sec

checking: AG [[EX [EG [[[[[p1<=0 & 0<=p1] | [p7<=0 & 0<=p7]] | [[p37<=0 & 0<=p37] | [p73<=0 & 0<=p73]]] & [[[p1<=0 & 0<=p1] | [p5<=0 & 0<=p5]] | [[p37<=0 & 0<=p37] | [p73<=0 & 0<=p73]]]]]] | A [AF [[[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p12<=1 & 1<=p12] & [p73<=1 & 1<=p73]]]] U EF [[[[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]] & [[p12<=1 & 1<=p12] & [p73<=1 & 1<=p73]]]]]]]
normalized: ~ [E [true U ~ [[[~ [EG [~ [E [true U [[[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]] & [[p73<=1 & 1<=p73] & [p12<=1 & 1<=p12]]]]]]] & ~ [E [~ [E [true U [[[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]] & [[p73<=1 & 1<=p73] & [p12<=1 & 1<=p12]]]]] U [~ [E [true U [[[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]] & [[p73<=1 & 1<=p73] & [p12<=1 & 1<=p12]]]]] & EG [~ [[[[p73<=1 & 1<=p73] & [p12<=1 & 1<=p12]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]]]]]]] | EX [EG [[[[[p73<=0 & 0<=p73] | [p37<=0 & 0<=p37]] | [[p5<=0 & 0<=p5] | [p1<=0 & 0<=p1]]] & [[[p73<=0 & 0<=p73] | [p37<=0 & 0<=p37]] | [[p7<=0 & 0<=p7] | [p1<=0 & 0<=p1]]]]]]]]]]

abstracting: (0<=p1)
states: 992,718,112 (8)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p7)
states: 992,718,112 (8)
abstracting: (p7<=0)
states: 883,281,467 (8)
abstracting: (0<=p37)
states: 992,718,112 (8)
abstracting: (p37<=0)
states: 853,373,948 (8)
abstracting: (0<=p73)
states: 992,718,112 (8)
abstracting: (p73<=0)
states: 714,328,048 (8)
abstracting: (0<=p1)
states: 992,718,112 (8)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p5)
states: 992,718,112 (8)
abstracting: (p5<=0)
states: 883,281,467 (8)
abstracting: (0<=p37)
states: 992,718,112 (8)
abstracting: (p37<=0)
states: 853,373,948 (8)
abstracting: (0<=p73)
states: 992,718,112 (8)
abstracting: (p73<=0)
states: 714,328,048 (8)
.
EG iterations: 1
.abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p8)
states: 109,436,645 (8)
abstracting: (p8<=1)
states: 992,718,112 (8)
abstracting: (1<=p12)
states: 139,344,164 (8)
abstracting: (p12<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
..
EG iterations: 2
abstracting: (1<=p12)
states: 139,344,164 (8)
abstracting: (p12<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p9)
states: 109,436,645 (8)
abstracting: (p9<=1)
states: 992,718,112 (8)
abstracting: (1<=p12)
states: 139,344,164 (8)
abstracting: (p12<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p9)
states: 109,436,645 (8)
abstracting: (p9<=1)
states: 992,718,112 (8)
MC time: 4m39.000sec

checking: EF [EG [E [A [EX [[[[p1<=1 & 1<=p1] & [p11<=1 & 1<=p11]] & [[p54<=1 & 1<=p54] & [p73<=1 & 1<=p73]]]] U [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p19<=1 & 1<=p19] & [p73<=1 & 1<=p73]]]] U AG [[[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p45<=1 & 1<=p45] & [p73<=1 & 1<=p73]]] | [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p58<=1 & 1<=p58] & [p73<=1 & 1<=p73]]]]]]]]
normalized: E [true U EG [E [[~ [EG [~ [[[[p73<=1 & 1<=p73] & [p19<=1 & 1<=p19]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[p73<=1 & 1<=p73] & [p19<=1 & 1<=p19]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]] U [~ [EX [[[[p73<=1 & 1<=p73] & [p54<=1 & 1<=p54]] & [[p11<=1 & 1<=p11] & [p1<=1 & 1<=p1]]]]] & ~ [[[[p73<=1 & 1<=p73] & [p19<=1 & 1<=p19]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]]]] U ~ [E [true U ~ [[[[[p73<=1 & 1<=p73] & [p58<=1 & 1<=p58]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]] | [[[p73<=1 & 1<=p73] & [p45<=1 & 1<=p45]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]]]]]]

abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p7)
states: 109,436,645 (8)
abstracting: (p7<=1)
states: 992,718,112 (8)
abstracting: (1<=p45)
states: 139,344,164 (8)
abstracting: (p45<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p7)
states: 109,436,645 (8)
abstracting: (p7<=1)
states: 992,718,112 (8)
abstracting: (1<=p58)
states: 139,344,164 (8)
abstracting: (p58<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p7)
states: 109,436,645 (8)
abstracting: (p7<=1)
states: 992,718,112 (8)
abstracting: (1<=p19)
states: 139,344,164 (8)
abstracting: (p19<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p11)
states: 98,156,357 (7)
abstracting: (p11<=1)
states: 992,718,112 (8)
abstracting: (1<=p54)
states: 139,344,164 (8)
abstracting: (p54<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
.abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p7)
states: 109,436,645 (8)
abstracting: (p7<=1)
states: 992,718,112 (8)
abstracting: (1<=p19)
states: 139,344,164 (8)
abstracting: (p19<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p7)
states: 109,436,645 (8)
abstracting: (p7<=1)
states: 992,718,112 (8)
abstracting: (1<=p19)
states: 139,344,164 (8)
abstracting: (p19<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
..
EG iterations: 2
.
EG iterations: 1
-> the formula is FALSE

FORMULA AutonomousCar-PT-08a-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.955sec

checking: [AG [~ [E [A [[[[1<=p1 & p1<=1] & [p7<=1 & 1<=p7]] & [[p73<=1 & 1<=p73] & [1<=p56 & p56<=1]]] U [[[1<=p73 & p73<=1] & [1<=p52 & p52<=1]] & [[1<=p2 & p2<=1] & [1<=p1 & p1<=1]]]] U EX [[[[[[p67<=1 & 1<=p67] & [p74<=1 & 1<=p74]] & [1<=p60 & p60<=1]] & [[1<=p50 & p50<=1] & [1<=p43 & p43<=1]]] & [[[1<=p36 & p36<=1] & [1<=p29 & p29<=1]] & [[1<=p25 & p25<=1] & [1<=p18 & p18<=1]]]]]]]] | EG [[p24<=0 & 0<=p24]]]
normalized: [EG [[p24<=0 & 0<=p24]] | ~ [E [true U E [[~ [EG [~ [[[[1<=p1 & p1<=1] & [1<=p2 & p2<=1]] & [[1<=p52 & p52<=1] & [1<=p73 & p73<=1]]]]]] & ~ [E [~ [[[[1<=p1 & p1<=1] & [1<=p2 & p2<=1]] & [[1<=p52 & p52<=1] & [1<=p73 & p73<=1]]]] U [~ [[[[1<=p56 & p56<=1] & [p73<=1 & 1<=p73]] & [[p7<=1 & 1<=p7] & [1<=p1 & p1<=1]]]] & ~ [[[[1<=p1 & p1<=1] & [1<=p2 & p2<=1]] & [[1<=p52 & p52<=1] & [1<=p73 & p73<=1]]]]]]]] U EX [[[[[1<=p18 & p18<=1] & [1<=p25 & p25<=1]] & [[1<=p29 & p29<=1] & [1<=p36 & p36<=1]]] & [[[1<=p43 & p43<=1] & [1<=p50 & p50<=1]] & [[1<=p60 & p60<=1] & [[p74<=1 & 1<=p74] & [p67<=1 & 1<=p67]]]]]]]]]]

abstracting: (1<=p67)
states: 148,533,942 (8)
abstracting: (p67<=1)
states: 992,718,112 (8)
abstracting: (1<=p74)
states: 257,325,353 (8)
abstracting: (p74<=1)
states: 992,718,112 (8)
abstracting: (p60<=1)
states: 992,718,112 (8)
abstracting: (1<=p60)
states: 148,533,942 (8)
abstracting: (p50<=1)
states: 992,718,112 (8)
abstracting: (1<=p50)
states: 148,533,941 (8)
abstracting: (p43<=1)
states: 992,718,112 (8)
abstracting: (1<=p43)
states: 148,533,941 (8)
abstracting: (p36<=1)
states: 992,718,112 (8)
abstracting: (1<=p36)
states: 148,533,941 (8)
abstracting: (p29<=1)
states: 992,718,112 (8)
abstracting: (1<=p29)
states: 148,533,941 (8)
abstracting: (p25<=1)
states: 992,718,112 (8)
abstracting: (1<=p25)
states: 148,533,942 (8)
abstracting: (p18<=1)
states: 992,718,112 (8)
abstracting: (1<=p18)
states: 148,533,942 (8)
.abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p52<=1)
states: 992,718,112 (8)
abstracting: (1<=p52)
states: 139,344,164 (8)
abstracting: (p2<=1)
states: 992,718,112 (8)
abstracting: (1<=p2)
states: 65,092,428 (7)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (1<=p7)
states: 109,436,645 (8)
abstracting: (p7<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (p56<=1)
states: 992,718,112 (8)
abstracting: (1<=p56)
states: 138,273,572 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p52<=1)
states: 992,718,112 (8)
abstracting: (1<=p52)
states: 139,344,164 (8)
abstracting: (p2<=1)
states: 992,718,112 (8)
abstracting: (1<=p2)
states: 65,092,428 (7)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p52<=1)
states: 992,718,112 (8)
abstracting: (1<=p52)
states: 139,344,164 (8)
abstracting: (p2<=1)
states: 992,718,112 (8)
abstracting: (1<=p2)
states: 65,092,428 (7)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
.........
EG iterations: 9
abstracting: (0<=p24)
states: 992,718,112 (8)
abstracting: (p24<=0)
states: 853,373,948 (8)
...........
EG iterations: 11
-> the formula is FALSE

FORMULA AutonomousCar-PT-08a-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30.818sec

checking: EF [AG [A [A [[[[[p15<=1 & 1<=p15] & [p22<=1 & 1<=p22]] & [[p32<=1 & 1<=p32] & [p36<=1 & 1<=p36]]] & [[[p46<=1 & 1<=p46] & [p53<=1 & 1<=p53]] & [[p57<=1 & 1<=p57] & [[p67<=1 & 1<=p67] & [p74<=1 & 1<=p74]]]]] U [[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p37<=1 & 1<=p37] & [p73<=1 & 1<=p73]]]] U [[[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p23<=1 & 1<=p23] & [p73<=1 & 1<=p73]]] | [[[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]] & [[p65<=1 & 1<=p65] & [p73<=1 & 1<=p73]]]]]]]
normalized: E [true U ~ [E [true U ~ [[~ [EG [~ [[[[[p73<=1 & 1<=p73] & [p65<=1 & 1<=p65]] & [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]] | [[[p73<=1 & 1<=p73] & [p23<=1 & 1<=p23]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]]] & ~ [E [~ [[[[[p73<=1 & 1<=p73] & [p65<=1 & 1<=p65]] & [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]] | [[[p73<=1 & 1<=p73] & [p23<=1 & 1<=p23]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]] U [~ [[~ [EG [~ [[[[p73<=1 & 1<=p73] & [p37<=1 & 1<=p37]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[p73<=1 & 1<=p73] & [p37<=1 & 1<=p37]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]] U [~ [[[[[[p74<=1 & 1<=p74] & [p67<=1 & 1<=p67]] & [p57<=1 & 1<=p57]] & [[p53<=1 & 1<=p53] & [p46<=1 & 1<=p46]]] & [[[p36<=1 & 1<=p36] & [p32<=1 & 1<=p32]] & [[p22<=1 & 1<=p22] & [p15<=1 & 1<=p15]]]]] & ~ [[[[p73<=1 & 1<=p73] & [p37<=1 & 1<=p37]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]]]]] & ~ [[[[[p73<=1 & 1<=p73] & [p65<=1 & 1<=p65]] & [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]] | [[[p73<=1 & 1<=p73] & [p23<=1 & 1<=p23]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]]]]]]]]]

abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p6)
states: 109,436,645 (8)
abstracting: (p6<=1)
states: 992,718,112 (8)
abstracting: (1<=p23)
states: 139,344,164 (8)
abstracting: (p23<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p9)
states: 109,436,645 (8)
abstracting: (p9<=1)
states: 992,718,112 (8)
abstracting: (1<=p65)
states: 139,344,164 (8)
abstracting: (p65<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p5)
states: 109,436,645 (8)
abstracting: (p5<=1)
states: 992,718,112 (8)
abstracting: (1<=p37)
states: 139,344,164 (8)
abstracting: (p37<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p15)
states: 148,533,941 (8)
abstracting: (p15<=1)
states: 992,718,112 (8)
abstracting: (1<=p22)
states: 148,533,941 (8)
abstracting: (p22<=1)
states: 992,718,112 (8)
abstracting: (1<=p32)
states: 148,533,942 (8)
abstracting: (p32<=1)
states: 992,718,112 (8)
abstracting: (1<=p36)
states: 148,533,941 (8)
abstracting: (p36<=1)
states: 992,718,112 (8)
abstracting: (1<=p46)
states: 148,533,942 (8)
abstracting: (p46<=1)
states: 992,718,112 (8)
abstracting: (1<=p53)
states: 148,533,942 (8)
abstracting: (p53<=1)
states: 992,718,112 (8)
abstracting: (1<=p57)
states: 148,533,941 (8)
abstracting: (p57<=1)
states: 992,718,112 (8)
abstracting: (1<=p67)
states: 148,533,942 (8)
abstracting: (p67<=1)
states: 992,718,112 (8)
abstracting: (1<=p74)
states: 257,325,353 (8)
abstracting: (p74<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p5)
states: 109,436,645 (8)
abstracting: (p5<=1)
states: 992,718,112 (8)
abstracting: (1<=p37)
states: 139,344,164 (8)
abstracting: (p37<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p5)
states: 109,436,645 (8)
abstracting: (p5<=1)
states: 992,718,112 (8)
abstracting: (1<=p37)
states: 139,344,164 (8)
abstracting: (p37<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
.
EG iterations: 1
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p6)
states: 109,436,645 (8)
abstracting: (p6<=1)
states: 992,718,112 (8)
abstracting: (1<=p23)
states: 139,344,164 (8)
abstracting: (p23<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p9)
states: 109,436,645 (8)
abstracting: (p9<=1)
states: 992,718,112 (8)
abstracting: (1<=p65)
states: 139,344,164 (8)
abstracting: (p65<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p6)
states: 109,436,645 (8)
abstracting: (p6<=1)
states: 992,718,112 (8)
abstracting: (1<=p23)
states: 139,344,164 (8)
abstracting: (p23<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p9)
states: 109,436,645 (8)
abstracting: (p9<=1)
states: 992,718,112 (8)
abstracting: (1<=p65)
states: 139,344,164 (8)
abstracting: (p65<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA AutonomousCar-PT-08a-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.940sec

checking: E [AX [[[[~ [[[[AF [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p37<=1 & 1<=p37] & [p73<=1 & 1<=p73]]]] & [p1<=1 & 1<=p1]] & [[p9<=1 & 1<=p9] & [[p52<=1 & 1<=p52] & [p73<=1 & 1<=p73]]]] | [[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p47<=1 & 1<=p47] & [p73<=1 & 1<=p73]]]]] & [p18<=1 & 1<=p18]] & [[p25<=1 & 1<=p25] & [[p32<=1 & 1<=p32] & [p36<=1 & 1<=p36]]]] & [[[p43<=1 & 1<=p43] & [p50<=1 & 1<=p50]] & [[p60<=1 & 1<=p60] & [[p67<=1 & 1<=p67] & [p74<=1 & 1<=p74]]]]]] U EX [[AX [EG [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p19<=1 & 1<=p19] & [p73<=1 & 1<=p73]]]]] | [~ [EF [AX [[[[p1<=1 & 1<=p1] & [p10<=1 & 1<=p10]] & [[p17<=1 & 1<=p17] & [p73<=1 & 1<=p73]]]]]] | [[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p17<=1 & 1<=p17] & [p73<=1 & 1<=p73]]]]]]]
normalized: E [~ [EX [~ [[[[[[p74<=1 & 1<=p74] & [p67<=1 & 1<=p67]] & [p60<=1 & 1<=p60]] & [[p50<=1 & 1<=p50] & [p43<=1 & 1<=p43]]] & [[[[p36<=1 & 1<=p36] & [p32<=1 & 1<=p32]] & [p25<=1 & 1<=p25]] & [[p18<=1 & 1<=p18] & ~ [[[[[p73<=1 & 1<=p73] & [p47<=1 & 1<=p47]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]] | [[[[p73<=1 & 1<=p73] & [p52<=1 & 1<=p52]] & [p9<=1 & 1<=p9]] & [[p1<=1 & 1<=p1] & ~ [EG [~ [[[[p73<=1 & 1<=p73] & [p37<=1 & 1<=p37]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]]]]]]]]]]]] U EX [[[[[[p73<=1 & 1<=p73] & [p17<=1 & 1<=p17]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]] | ~ [E [true U ~ [EX [~ [[[[p73<=1 & 1<=p73] & [p17<=1 & 1<=p17]] & [[p10<=1 & 1<=p10] & [p1<=1 & 1<=p1]]]]]]]]] | ~ [EX [~ [EG [[[[p73<=1 & 1<=p73] & [p19<=1 & 1<=p19]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]]]]]]

abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p5)
states: 109,436,645 (8)
abstracting: (p5<=1)
states: 992,718,112 (8)
abstracting: (1<=p19)
states: 139,344,164 (8)
abstracting: (p19<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
................
EG iterations: 16
.abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p10)
states: 109,436,645 (8)
abstracting: (p10<=1)
states: 992,718,112 (8)
abstracting: (1<=p17)
states: 139,344,164 (8)
abstracting: (p17<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
.
before gc: list nodes free: 2507462

after gc: idd nodes used:1037071, unused:62962929; list nodes free:305499628
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p8)
states: 109,436,645 (8)
abstracting: (p8<=1)
states: 992,718,112 (8)
abstracting: (1<=p17)
states: 139,344,164 (8)
abstracting: (p17<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
.abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p7)
states: 109,436,645 (8)
abstracting: (p7<=1)
states: 992,718,112 (8)
abstracting: (1<=p37)
states: 139,344,164 (8)
abstracting: (p37<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
.
EG iterations: 1
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p9)
states: 109,436,645 (8)
abstracting: (p9<=1)
states: 992,718,112 (8)
abstracting: (1<=p52)
states: 139,344,164 (8)
abstracting: (p52<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p6)
states: 109,436,645 (8)
abstracting: (p6<=1)
states: 992,718,112 (8)
abstracting: (1<=p47)
states: 139,344,164 (8)
abstracting: (p47<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p18)
states: 148,533,942 (8)
abstracting: (p18<=1)
states: 992,718,112 (8)
abstracting: (1<=p25)
states: 148,533,942 (8)
abstracting: (p25<=1)
states: 992,718,112 (8)
abstracting: (1<=p32)
states: 148,533,942 (8)
abstracting: (p32<=1)
states: 992,718,112 (8)
abstracting: (1<=p36)
states: 148,533,941 (8)
abstracting: (p36<=1)
states: 992,718,112 (8)
abstracting: (1<=p43)
states: 148,533,941 (8)
abstracting: (p43<=1)
states: 992,718,112 (8)
abstracting: (1<=p50)
states: 148,533,941 (8)
abstracting: (p50<=1)
states: 992,718,112 (8)
abstracting: (1<=p60)
states: 148,533,942 (8)
abstracting: (p60<=1)
states: 992,718,112 (8)
abstracting: (1<=p67)
states: 148,533,942 (8)
abstracting: (p67<=1)
states: 992,718,112 (8)
abstracting: (1<=p74)
states: 257,325,353 (8)
abstracting: (p74<=1)
states: 992,718,112 (8)
.-> the formula is FALSE

FORMULA AutonomousCar-PT-08a-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m 6.322sec

checking: A [[~ [[[[[[[p15<=1 & 1<=p15] & [p22<=1 & 1<=p22]] & [[p29<=1 & 1<=p29] & [p39<=1 & 1<=p39]]] & [[[p46<=1 & 1<=p46] & [p53<=1 & 1<=p53]] & [[p60<=1 & 1<=p60] & [[p64<=1 & 1<=p64] & [p74<=1 & 1<=p74]]]]] | [[[p1<=1 & 1<=p1] & [p10<=1 & 1<=p10]] & [[p63<=1 & 1<=p63] & [p73<=1 & 1<=p73]]]] & E [~ [EG [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p16<=1 & 1<=p16] & [p73<=1 & 1<=p73]]]]] U ~ [EX [[[[p1<=1 & 1<=p1] & [p10<=1 & 1<=p10]] & [[p65<=1 & 1<=p65] & [p73<=1 & 1<=p73]]]]]]]] | [~ [AG [~ [[[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p63<=1 & 1<=p63] & [p73<=1 & 1<=p73]]]]]] & AG [[~ [[p66<=1 & 1<=p66]] | ~ [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p56<=1 & 1<=p56] & [p73<=1 & 1<=p73]]]]]]]] U [[[[p15<=1 & 1<=p15] & [p22<=1 & 1<=p22]] & [[p32<=1 & 1<=p32] & [p39<=1 & 1<=p39]]] & [[[p43<=1 & 1<=p43] & [p53<=1 & 1<=p53]] & [[p60<=1 & 1<=p60] & [[p67<=1 & 1<=p67] & [p74<=1 & 1<=p74]]]]]]
normalized: [~ [EG [~ [[[[[[p74<=1 & 1<=p74] & [p67<=1 & 1<=p67]] & [p60<=1 & 1<=p60]] & [[p53<=1 & 1<=p53] & [p43<=1 & 1<=p43]]] & [[[p39<=1 & 1<=p39] & [p32<=1 & 1<=p32]] & [[p22<=1 & 1<=p22] & [p15<=1 & 1<=p15]]]]]]] & ~ [E [~ [[[[[[p74<=1 & 1<=p74] & [p67<=1 & 1<=p67]] & [p60<=1 & 1<=p60]] & [[p53<=1 & 1<=p53] & [p43<=1 & 1<=p43]]] & [[[p39<=1 & 1<=p39] & [p32<=1 & 1<=p32]] & [[p22<=1 & 1<=p22] & [p15<=1 & 1<=p15]]]]] U [~ [[[~ [E [true U ~ [[~ [[[[p73<=1 & 1<=p73] & [p56<=1 & 1<=p56]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]] | ~ [[p66<=1 & 1<=p66]]]]]] & E [true U [[[p73<=1 & 1<=p73] & [p63<=1 & 1<=p63]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]]] | ~ [[E [~ [EG [[[[p73<=1 & 1<=p73] & [p16<=1 & 1<=p16]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]] U ~ [EX [[[[p73<=1 & 1<=p73] & [p65<=1 & 1<=p65]] & [[p10<=1 & 1<=p10] & [p1<=1 & 1<=p1]]]]]] & [[[[p73<=1 & 1<=p73] & [p63<=1 & 1<=p63]] & [[p10<=1 & 1<=p10] & [p1<=1 & 1<=p1]]] | [[[[[p74<=1 & 1<=p74] & [p64<=1 & 1<=p64]] & [p60<=1 & 1<=p60]] & [[p53<=1 & 1<=p53] & [p46<=1 & 1<=p46]]] & [[[p39<=1 & 1<=p39] & [p29<=1 & 1<=p29]] & [[p22<=1 & 1<=p22] & [p15<=1 & 1<=p15]]]]]]]]] & ~ [[[[[[p74<=1 & 1<=p74] & [p67<=1 & 1<=p67]] & [p60<=1 & 1<=p60]] & [[p53<=1 & 1<=p53] & [p43<=1 & 1<=p43]]] & [[[p39<=1 & 1<=p39] & [p32<=1 & 1<=p32]] & [[p22<=1 & 1<=p22] & [p15<=1 & 1<=p15]]]]]]]]]

abstracting: (1<=p15)
states: 148,533,941 (8)
abstracting: (p15<=1)
states: 992,718,112 (8)
abstracting: (1<=p22)
states: 148,533,941 (8)
abstracting: (p22<=1)
states: 992,718,112 (8)
abstracting: (1<=p32)
states: 148,533,942 (8)
abstracting: (p32<=1)
states: 992,718,112 (8)
abstracting: (1<=p39)
states: 148,533,942 (8)
abstracting: (p39<=1)
states: 992,718,112 (8)
abstracting: (1<=p43)
states: 148,533,941 (8)
abstracting: (p43<=1)
states: 992,718,112 (8)
abstracting: (1<=p53)
states: 148,533,942 (8)
abstracting: (p53<=1)
states: 992,718,112 (8)
abstracting: (1<=p60)
states: 148,533,942 (8)
abstracting: (p60<=1)
states: 992,718,112 (8)
abstracting: (1<=p67)
states: 148,533,942 (8)
abstracting: (p67<=1)
states: 992,718,112 (8)
abstracting: (1<=p74)
states: 257,325,353 (8)
abstracting: (p74<=1)
states: 992,718,112 (8)
abstracting: (1<=p15)
states: 148,533,941 (8)
abstracting: (p15<=1)
states: 992,718,112 (8)
abstracting: (1<=p22)
states: 148,533,941 (8)
abstracting: (p22<=1)
states: 992,718,112 (8)
abstracting: (1<=p29)
states: 148,533,941 (8)
abstracting: (p29<=1)
states: 992,718,112 (8)
abstracting: (1<=p39)
states: 148,533,942 (8)
abstracting: (p39<=1)
states: 992,718,112 (8)
abstracting: (1<=p46)
states: 148,533,942 (8)
abstracting: (p46<=1)
states: 992,718,112 (8)
abstracting: (1<=p53)
states: 148,533,942 (8)
abstracting: (p53<=1)
states: 992,718,112 (8)
abstracting: (1<=p60)
states: 148,533,942 (8)
abstracting: (p60<=1)
states: 992,718,112 (8)
abstracting: (1<=p64)
states: 148,533,941 (8)
abstracting: (p64<=1)
states: 992,718,112 (8)
abstracting: (1<=p74)
states: 257,325,353 (8)
abstracting: (p74<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p10)
states: 109,436,645 (8)
abstracting: (p10<=1)
states: 992,718,112 (8)
abstracting: (1<=p63)
states: 138,273,572 (8)
abstracting: (p63<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p10)
states: 109,436,645 (8)
abstracting: (p10<=1)
states: 992,718,112 (8)
abstracting: (1<=p65)
states: 139,344,164 (8)
abstracting: (p65<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
.abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p7)
states: 109,436,645 (8)
abstracting: (p7<=1)
states: 992,718,112 (8)
abstracting: (1<=p16)
states: 139,344,164 (8)
abstracting: (p16<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
................
EG iterations: 16
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p8)
states: 109,436,645 (8)
abstracting: (p8<=1)
states: 992,718,112 (8)
abstracting: (1<=p63)
states: 138,273,572 (8)
abstracting: (p63<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
MC time: 5m53.001sec

checking: [EG [AF [E [[[[[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]] & [[p65<=1 & 1<=p65] & [[p73<=1 & 1<=p73] & [p45<=1 & 1<=p45]]]] | [[[[p1<=1 & 1<=p1] & [p10<=1 & 1<=p10]] & [[p30<=1 & 1<=p30] & [p73<=1 & 1<=p73]]] & [[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p63<=1 & 1<=p63] & [p73<=1 & 1<=p73]]]]] U [EF [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p35<=1 & 1<=p35] & [p73<=1 & 1<=p73]]]] & ~ [[p66<=1 & 1<=p66]]]]]] | [AG [AX [AG [E [[[[p1<=1 & 1<=p1] & [p10<=1 & 1<=p10]] & [[p21<=1 & 1<=p21] & [p73<=1 & 1<=p73]]] U [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p16<=1 & 1<=p16] & [p73<=1 & 1<=p73]]]]]]] & [EG [[AX [EX [[[[[p18<=1 & 1<=p18] & [p25<=1 & 1<=p25]] & [[p29<=1 & 1<=p29] & [p36<=1 & 1<=p36]]] & [[[p46<=1 & 1<=p46] & [p53<=1 & 1<=p53]] & [[p60<=1 & 1<=p60] & [[p64<=1 & 1<=p64] & [p74<=1 & 1<=p74]]]]]]] | [[[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]] & [[p59<=1 & 1<=p59] & [p73<=1 & 1<=p73]]]]] & A [~ [[[[[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]] & [[p35<=1 & 1<=p35] & [p73<=1 & 1<=p73]]] | A [[[[p1<=1 & 1<=p1] & [p11<=1 & 1<=p11]] & [[p14<=1 & 1<=p14] & [p73<=1 & 1<=p73]]] U [p38<=1 & 1<=p38]]]] U EG [[[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p28<=1 & 1<=p28] & [p73<=1 & 1<=p73]]]]]]]]
normalized: [[[[~ [EG [~ [EG [[[[p73<=1 & 1<=p73] & [p28<=1 & 1<=p28]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]]] & ~ [E [~ [EG [[[[p73<=1 & 1<=p73] & [p28<=1 & 1<=p28]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]] U [[[~ [EG [~ [[p38<=1 & 1<=p38]]]] & ~ [E [~ [[p38<=1 & 1<=p38]] U [~ [[[[p73<=1 & 1<=p73] & [p14<=1 & 1<=p14]] & [[p11<=1 & 1<=p11] & [p1<=1 & 1<=p1]]]] & ~ [[p38<=1 & 1<=p38]]]]]] | [[[p73<=1 & 1<=p73] & [p35<=1 & 1<=p35]] & [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]] & ~ [EG [[[[p73<=1 & 1<=p73] & [p28<=1 & 1<=p28]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]]]]] & EG [[[[[p73<=1 & 1<=p73] & [p59<=1 & 1<=p59]] & [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]] | ~ [EX [~ [EX [[[[[[p74<=1 & 1<=p74] & [p64<=1 & 1<=p64]] & [p60<=1 & 1<=p60]] & [[p53<=1 & 1<=p53] & [p46<=1 & 1<=p46]]] & [[[p36<=1 & 1<=p36] & [p29<=1 & 1<=p29]] & [[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]]]]]]]]]] & ~ [E [true U EX [E [true U ~ [E [[[[p73<=1 & 1<=p73] & [p21<=1 & 1<=p21]] & [[p10<=1 & 1<=p10] & [p1<=1 & 1<=p1]]] U [[[p73<=1 & 1<=p73] & [p16<=1 & 1<=p16]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]]]]]] | EG [~ [EG [~ [E [[[[[[p73<=1 & 1<=p73] & [p63<=1 & 1<=p63]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]] & [[[p73<=1 & 1<=p73] & [p30<=1 & 1<=p30]] & [[p10<=1 & 1<=p10] & [p1<=1 & 1<=p1]]]] | [[[[p45<=1 & 1<=p45] & [p73<=1 & 1<=p73]] & [p65<=1 & 1<=p65]] & [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]] U [~ [[p66<=1 & 1<=p66]] & E [true U [[[p73<=1 & 1<=p73] & [p35<=1 & 1<=p35]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]]]]]]]

abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p5)
states: 109,436,645 (8)
abstracting: (p5<=1)
states: 992,718,112 (8)
abstracting: (1<=p35)
states: 138,273,572 (8)
abstracting: (p35<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
MC time: 5m 3.000sec

checking: E [[EF [[[[[p15<=1 & 1<=p15] & [p25<=1 & 1<=p25]] & [[p29<=1 & 1<=p29] & [p36<=1 & 1<=p36]]] & [[[p43<=1 & 1<=p43] & [p53<=1 & 1<=p53]] & [[p60<=1 & 1<=p60] & [[p67<=1 & 1<=p67] & [p74<=1 & 1<=p74]]]]]] | [[[[p1<=1 & 1<=p1] & [p10<=1 & 1<=p10]] & [[p61<=1 & 1<=p61] & [p73<=1 & 1<=p73]]] | [[AF [[[[[p15<=1 & 1<=p15] & [p22<=1 & 1<=p22]] & [[p29<=1 & 1<=p29] & [p39<=1 & 1<=p39]]] & [[[p43<=1 & 1<=p43] & [p53<=1 & 1<=p53]] & [[p60<=1 & 1<=p60] & [[p67<=1 & 1<=p67] & [p74<=1 & 1<=p74]]]]]] & [[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]]] & [[[p21<=1 & 1<=p21] & [p73<=1 & 1<=p73]] & [[~ [[[[[p15<=1 & 1<=p15] & [p25<=1 & 1<=p25]] & [[p32<=1 & 1<=p32] & [p36<=1 & 1<=p36]]] & [[[p46<=1 & 1<=p46] & [p50<=1 & 1<=p50]] & [[p57<=1 & 1<=p57] & [[p64<=1 & 1<=p64] & [p74<=1 & 1<=p74]]]]]] | EX [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p14<=1 & 1<=p14] & [p73<=1 & 1<=p73]]]]] & [AX [[[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p24<=1 & 1<=p24] & [p73<=1 & 1<=p73]]]] | EX [[[[[p18<=1 & 1<=p18] & [p25<=1 & 1<=p25]] & [[p32<=1 & 1<=p32] & [p39<=1 & 1<=p39]]] & [[[p43<=1 & 1<=p43] & [p53<=1 & 1<=p53]] & [[p60<=1 & 1<=p60] & [[p64<=1 & 1<=p64] & [p74<=1 & 1<=p74]]]]]]]]]]]] U [[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p51<=1 & 1<=p51] & [p73<=1 & 1<=p73]]]]
normalized: E [[[[[[[~ [[[[[[p74<=1 & 1<=p74] & [p64<=1 & 1<=p64]] & [p57<=1 & 1<=p57]] & [[p50<=1 & 1<=p50] & [p46<=1 & 1<=p46]]] & [[[p36<=1 & 1<=p36] & [p32<=1 & 1<=p32]] & [[p25<=1 & 1<=p25] & [p15<=1 & 1<=p15]]]]] | EX [[[[p73<=1 & 1<=p73] & [p14<=1 & 1<=p14]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]] & [EX [[[[[[p74<=1 & 1<=p74] & [p64<=1 & 1<=p64]] & [p60<=1 & 1<=p60]] & [[p53<=1 & 1<=p53] & [p43<=1 & 1<=p43]]] & [[[p39<=1 & 1<=p39] & [p32<=1 & 1<=p32]] & [[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]]]] | ~ [EX [~ [[[[p73<=1 & 1<=p73] & [p24<=1 & 1<=p24]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]]]]]] & [[p73<=1 & 1<=p73] & [p21<=1 & 1<=p21]]] & [[[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]] & ~ [EG [~ [[[[[[p74<=1 & 1<=p74] & [p67<=1 & 1<=p67]] & [p60<=1 & 1<=p60]] & [[p53<=1 & 1<=p53] & [p43<=1 & 1<=p43]]] & [[[p39<=1 & 1<=p39] & [p29<=1 & 1<=p29]] & [[p22<=1 & 1<=p22] & [p15<=1 & 1<=p15]]]]]]]]] | [[[p73<=1 & 1<=p73] & [p61<=1 & 1<=p61]] & [[p10<=1 & 1<=p10] & [p1<=1 & 1<=p1]]]] | E [true U [[[[[p74<=1 & 1<=p74] & [p67<=1 & 1<=p67]] & [p60<=1 & 1<=p60]] & [[p53<=1 & 1<=p53] & [p43<=1 & 1<=p43]]] & [[[p36<=1 & 1<=p36] & [p29<=1 & 1<=p29]] & [[p25<=1 & 1<=p25] & [p15<=1 & 1<=p15]]]]]] U [[[p73<=1 & 1<=p73] & [p51<=1 & 1<=p51]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]

abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p5)
states: 109,436,645 (8)
abstracting: (p5<=1)
states: 992,718,112 (8)
abstracting: (1<=p51)
states: 139,344,164 (8)
abstracting: (p51<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p15)
states: 148,533,941 (8)
abstracting: (p15<=1)
states: 992,718,112 (8)
abstracting: (1<=p25)
states: 148,533,942 (8)
abstracting: (p25<=1)
states: 992,718,112 (8)
abstracting: (1<=p29)
states: 148,533,941 (8)
abstracting: (p29<=1)
states: 992,718,112 (8)
abstracting: (1<=p36)
states: 148,533,941 (8)
abstracting: (p36<=1)
states: 992,718,112 (8)
abstracting: (1<=p43)
states: 148,533,941 (8)
abstracting: (p43<=1)
states: 992,718,112 (8)
abstracting: (1<=p53)
states: 148,533,942 (8)
abstracting: (p53<=1)
states: 992,718,112 (8)
abstracting: (1<=p60)
states: 148,533,942 (8)
abstracting: (p60<=1)
states: 992,718,112 (8)
abstracting: (1<=p67)
states: 148,533,942 (8)
abstracting: (p67<=1)
states: 992,718,112 (8)
abstracting: (1<=p74)
states: 257,325,353 (8)
abstracting: (p74<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p10)
states: 109,436,645 (8)
abstracting: (p10<=1)
states: 992,718,112 (8)
abstracting: (1<=p61)
states: 139,344,164 (8)
abstracting: (p61<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p15)
states: 148,533,941 (8)
abstracting: (p15<=1)
states: 992,718,112 (8)
abstracting: (1<=p22)
states: 148,533,941 (8)
abstracting: (p22<=1)
states: 992,718,112 (8)
abstracting: (1<=p29)
states: 148,533,941 (8)
abstracting: (p29<=1)
states: 992,718,112 (8)
abstracting: (1<=p39)
states: 148,533,942 (8)
abstracting: (p39<=1)
states: 992,718,112 (8)
abstracting: (1<=p43)
states: 148,533,941 (8)
abstracting: (p43<=1)
states: 992,718,112 (8)
abstracting: (1<=p53)
states: 148,533,942 (8)
abstracting: (p53<=1)
states: 992,718,112 (8)
abstracting: (1<=p60)
states: 148,533,942 (8)
abstracting: (p60<=1)
states: 992,718,112 (8)
abstracting: (1<=p67)
states: 148,533,942 (8)
abstracting: (p67<=1)
states: 992,718,112 (8)
abstracting: (1<=p74)
states: 257,325,353 (8)
abstracting: (p74<=1)
states: 992,718,112 (8)
.......
EG iterations: 7
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p6)
states: 109,436,645 (8)
abstracting: (p6<=1)
states: 992,718,112 (8)
abstracting: (1<=p21)
states: 138,273,572 (8)
abstracting: (p21<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p8)
states: 109,436,645 (8)
abstracting: (p8<=1)
states: 992,718,112 (8)
abstracting: (1<=p24)
states: 139,344,164 (8)
abstracting: (p24<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
.abstracting: (1<=p18)
states: 148,533,942 (8)
abstracting: (p18<=1)
states: 992,718,112 (8)
abstracting: (1<=p25)
states: 148,533,942 (8)
abstracting: (p25<=1)
states: 992,718,112 (8)
abstracting: (1<=p32)
states: 148,533,942 (8)
abstracting: (p32<=1)
states: 992,718,112 (8)
abstracting: (1<=p39)
states: 148,533,942 (8)
abstracting: (p39<=1)
states: 992,718,112 (8)
abstracting: (1<=p43)
states: 148,533,941 (8)
abstracting: (p43<=1)
states: 992,718,112 (8)
abstracting: (1<=p53)
states: 148,533,942 (8)
abstracting: (p53<=1)
states: 992,718,112 (8)
abstracting: (1<=p60)
states: 148,533,942 (8)
abstracting: (p60<=1)
states: 992,718,112 (8)
abstracting: (1<=p64)
states: 148,533,941 (8)
abstracting: (p64<=1)
states: 992,718,112 (8)
abstracting: (1<=p74)
states: 257,325,353 (8)
abstracting: (p74<=1)
states: 992,718,112 (8)
.abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p2)
states: 65,092,428 (7)
abstracting: (p2<=1)
states: 992,718,112 (8)
abstracting: (1<=p14)
states: 138,273,572 (8)
abstracting: (p14<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
.abstracting: (1<=p15)
states: 148,533,941 (8)
abstracting: (p15<=1)
states: 992,718,112 (8)
abstracting: (1<=p25)
states: 148,533,942 (8)
abstracting: (p25<=1)
states: 992,718,112 (8)
abstracting: (1<=p32)
states: 148,533,942 (8)
abstracting: (p32<=1)
states: 992,718,112 (8)
abstracting: (1<=p36)
states: 148,533,941 (8)
abstracting: (p36<=1)
states: 992,718,112 (8)
abstracting: (1<=p46)
states: 148,533,942 (8)
abstracting: (p46<=1)
states: 992,718,112 (8)
abstracting: (1<=p50)
states: 148,533,941 (8)
abstracting: (p50<=1)
states: 992,718,112 (8)
abstracting: (1<=p57)
states: 148,533,941 (8)
abstracting: (p57<=1)
states: 992,718,112 (8)
abstracting: (1<=p64)
states: 148,533,941 (8)
abstracting: (p64<=1)
states: 992,718,112 (8)
abstracting: (1<=p74)
states: 257,325,353 (8)
abstracting: (p74<=1)
states: 992,718,112 (8)
-> the formula is TRUE

FORMULA AutonomousCar-PT-08a-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m40.242sec

checking: EG [[AF [[EF [[[[[p18<=1 & 1<=p18] & [p25<=1 & 1<=p25]] & [[p32<=1 & 1<=p32] & [p36<=1 & 1<=p36]]] & [[[p43<=1 & 1<=p43] & [p53<=1 & 1<=p53]] & [[p60<=1 & 1<=p60] & [[p64<=1 & 1<=p64] & [p74<=1 & 1<=p74]]]]]] & A [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p14<=1 & 1<=p14] & [p73<=1 & 1<=p73]]] U [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p21<=1 & 1<=p21] & [p73<=1 & 1<=p73]]]]]] | [EX [[[[[p18<=1 & 1<=p18] & [p25<=1 & 1<=p25]] & [[p32<=1 & 1<=p32] & [p36<=1 & 1<=p36]]] & [[[p46<=1 & 1<=p46] & [p50<=1 & 1<=p50]] & [[p57<=1 & 1<=p57] & [[p64<=1 & 1<=p64] & [p74<=1 & 1<=p74]]]]]] | [[EG [[[[[p15<=0 & 0<=p15] | [p22<=0 & 0<=p22]] | [[p29<=0 & 0<=p29] | [p36<=0 & 0<=p36]]] | [[[p46<=0 & 0<=p46] | [p50<=0 & 0<=p50]] | [[p60<=0 & 0<=p60] | [[p64<=0 & 0<=p64] | [p74<=0 & 0<=p74]]]]]] & [[p1<=1 & 1<=p1] & [p10<=1 & 1<=p10]]] & [[p51<=1 & 1<=p51] & [[p73<=1 & 1<=p73] & [~ [A [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p45<=1 & 1<=p45] & [p73<=1 & 1<=p73]]] U [[[[p18<=1 & 1<=p18] & [p25<=1 & 1<=p25]] & [[p29<=1 & 1<=p29] & [p36<=1 & 1<=p36]]] & [[[p43<=1 & 1<=p43] & [p50<=1 & 1<=p50]] & [[p57<=1 & 1<=p57] & [[p67<=1 & 1<=p67] & [p74<=1 & 1<=p74]]]]]]] | EF [[[[p1<=0 & 0<=p1] | [p6<=0 & 0<=p6]] | [[p58<=0 & 0<=p58] | [p73<=0 & 0<=p73]]]]]]]]]]]
normalized: EG [[[[[[[E [true U [[[p73<=0 & 0<=p73] | [p58<=0 & 0<=p58]] | [[p6<=0 & 0<=p6] | [p1<=0 & 0<=p1]]]] | ~ [[~ [EG [~ [[[[[[p74<=1 & 1<=p74] & [p67<=1 & 1<=p67]] & [p57<=1 & 1<=p57]] & [[p50<=1 & 1<=p50] & [p43<=1 & 1<=p43]]] & [[[p36<=1 & 1<=p36] & [p29<=1 & 1<=p29]] & [[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]]]]]] & ~ [E [~ [[[[[[p74<=1 & 1<=p74] & [p67<=1 & 1<=p67]] & [p57<=1 & 1<=p57]] & [[p50<=1 & 1<=p50] & [p43<=1 & 1<=p43]]] & [[[p36<=1 & 1<=p36] & [p29<=1 & 1<=p29]] & [[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]]]] U [~ [[[[p73<=1 & 1<=p73] & [p45<=1 & 1<=p45]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] & ~ [[[[[[p74<=1 & 1<=p74] & [p67<=1 & 1<=p67]] & [p57<=1 & 1<=p57]] & [[p50<=1 & 1<=p50] & [p43<=1 & 1<=p43]]] & [[[p36<=1 & 1<=p36] & [p29<=1 & 1<=p29]] & [[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]]]]]]]]]] & [p73<=1 & 1<=p73]] & [p51<=1 & 1<=p51]] & [[[p10<=1 & 1<=p10] & [p1<=1 & 1<=p1]] & EG [[[[[[p74<=0 & 0<=p74] | [p64<=0 & 0<=p64]] | [p60<=0 & 0<=p60]] | [[p50<=0 & 0<=p50] | [p46<=0 & 0<=p46]]] | [[[p36<=0 & 0<=p36] | [p29<=0 & 0<=p29]] | [[p22<=0 & 0<=p22] | [p15<=0 & 0<=p15]]]]]]] | EX [[[[[[p74<=1 & 1<=p74] & [p64<=1 & 1<=p64]] & [p57<=1 & 1<=p57]] & [[p50<=1 & 1<=p50] & [p46<=1 & 1<=p46]]] & [[[p36<=1 & 1<=p36] & [p32<=1 & 1<=p32]] & [[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]]]]] | ~ [EG [~ [[[~ [EG [~ [[[[p73<=1 & 1<=p73] & [p21<=1 & 1<=p21]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[p73<=1 & 1<=p73] & [p21<=1 & 1<=p21]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]] U [~ [[[[p73<=1 & 1<=p73] & [p14<=1 & 1<=p14]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] & ~ [[[[p73<=1 & 1<=p73] & [p21<=1 & 1<=p21]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]]]] & E [true U [[[[[p74<=1 & 1<=p74] & [p64<=1 & 1<=p64]] & [p60<=1 & 1<=p60]] & [[p53<=1 & 1<=p53] & [p43<=1 & 1<=p43]]] & [[[p36<=1 & 1<=p36] & [p32<=1 & 1<=p32]] & [[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]]]]]]]]]]

abstracting: (1<=p18)
states: 148,533,942 (8)
abstracting: (p18<=1)
states: 992,718,112 (8)
abstracting: (1<=p25)
states: 148,533,942 (8)
abstracting: (p25<=1)
states: 992,718,112 (8)
abstracting: (1<=p32)
states: 148,533,942 (8)
abstracting: (p32<=1)
states: 992,718,112 (8)
abstracting: (1<=p36)
states: 148,533,941 (8)
abstracting: (p36<=1)
states: 992,718,112 (8)
abstracting: (1<=p43)
states: 148,533,941 (8)
abstracting: (p43<=1)
states: 992,718,112 (8)
abstracting: (1<=p53)
states: 148,533,942 (8)
abstracting: (p53<=1)
states: 992,718,112 (8)
abstracting: (1<=p60)
states: 148,533,942 (8)
abstracting: (p60<=1)
states: 992,718,112 (8)
abstracting: (1<=p64)
states: 148,533,941 (8)
abstracting: (p64<=1)
states: 992,718,112 (8)
abstracting: (1<=p74)
states: 257,325,353 (8)
abstracting: (p74<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p7)
states: 109,436,645 (8)
abstracting: (p7<=1)
states: 992,718,112 (8)
abstracting: (1<=p21)
states: 138,273,572 (8)
abstracting: (p21<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p2)
states: 65,092,428 (7)
abstracting: (p2<=1)
states: 992,718,112 (8)
abstracting: (1<=p14)
states: 138,273,572 (8)
abstracting: (p14<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p7)
states: 109,436,645 (8)
abstracting: (p7<=1)
states: 992,718,112 (8)
abstracting: (1<=p21)
states: 138,273,572 (8)
abstracting: (p21<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p7)
states: 109,436,645 (8)
abstracting: (p7<=1)
states: 992,718,112 (8)
abstracting: (1<=p21)
states: 138,273,572 (8)
abstracting: (p21<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
...........
EG iterations: 11

EG iterations: 0
abstracting: (1<=p18)
states: 148,533,942 (8)
abstracting: (p18<=1)
states: 992,718,112 (8)
abstracting: (1<=p25)
states: 148,533,942 (8)
abstracting: (p25<=1)
states: 992,718,112 (8)
abstracting: (1<=p32)
states: 148,533,942 (8)
abstracting: (p32<=1)
states: 992,718,112 (8)
abstracting: (1<=p36)
states: 148,533,941 (8)
abstracting: (p36<=1)
states: 992,718,112 (8)
abstracting: (1<=p46)
states: 148,533,942 (8)
abstracting: (p46<=1)
states: 992,718,112 (8)
abstracting: (1<=p50)
states: 148,533,941 (8)
abstracting: (p50<=1)
states: 992,718,112 (8)
abstracting: (1<=p57)
states: 148,533,941 (8)
abstracting: (p57<=1)
states: 992,718,112 (8)
abstracting: (1<=p64)
states: 148,533,941 (8)
abstracting: (p64<=1)
states: 992,718,112 (8)
abstracting: (1<=p74)
states: 257,325,353 (8)
abstracting: (p74<=1)
states: 992,718,112 (8)
.abstracting: (0<=p15)
states: 992,718,112 (8)
abstracting: (p15<=0)
states: 844,184,171 (8)
abstracting: (0<=p22)
states: 992,718,112 (8)
abstracting: (p22<=0)
states: 844,184,171 (8)
abstracting: (0<=p29)
states: 992,718,112 (8)
abstracting: (p29<=0)
states: 844,184,171 (8)
abstracting: (0<=p36)
states: 992,718,112 (8)
abstracting: (p36<=0)
states: 844,184,171 (8)
abstracting: (0<=p46)
states: 992,718,112 (8)
abstracting: (p46<=0)
states: 844,184,170 (8)
abstracting: (0<=p50)
states: 992,718,112 (8)
abstracting: (p50<=0)
states: 844,184,171 (8)
abstracting: (0<=p60)
states: 992,718,112 (8)
abstracting: (p60<=0)
states: 844,184,170 (8)
abstracting: (0<=p64)
states: 992,718,112 (8)
abstracting: (p64<=0)
states: 844,184,171 (8)
abstracting: (0<=p74)
states: 992,718,112 (8)
abstracting: (p74<=0)
states: 735,392,759 (8)
.........
EG iterations: 9
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p10)
states: 109,436,645 (8)
abstracting: (p10<=1)
states: 992,718,112 (8)
abstracting: (1<=p51)
states: 139,344,164 (8)
abstracting: (p51<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p18)
states: 148,533,942 (8)
abstracting: (p18<=1)
states: 992,718,112 (8)
abstracting: (1<=p25)
states: 148,533,942 (8)
abstracting: (p25<=1)
states: 992,718,112 (8)
abstracting: (1<=p29)
states: 148,533,941 (8)
abstracting: (p29<=1)
states: 992,718,112 (8)
abstracting: (1<=p36)
states: 148,533,941 (8)
abstracting: (p36<=1)
states: 992,718,112 (8)
abstracting: (1<=p43)
states: 148,533,941 (8)
abstracting: (p43<=1)
states: 992,718,112 (8)
abstracting: (1<=p50)
states: 148,533,941 (8)
abstracting: (p50<=1)
states: 992,718,112 (8)
abstracting: (1<=p57)
states: 148,533,941 (8)
abstracting: (p57<=1)
states: 992,718,112 (8)
abstracting: (1<=p67)
states: 148,533,942 (8)
abstracting: (p67<=1)
states: 992,718,112 (8)
abstracting: (1<=p74)
states: 257,325,353 (8)
abstracting: (p74<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p2)
states: 65,092,428 (7)
abstracting: (p2<=1)
states: 992,718,112 (8)
abstracting: (1<=p45)
states: 139,344,164 (8)
abstracting: (p45<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p18)
states: 148,533,942 (8)
abstracting: (p18<=1)
states: 992,718,112 (8)
abstracting: (1<=p25)
states: 148,533,942 (8)
abstracting: (p25<=1)
states: 992,718,112 (8)
abstracting: (1<=p29)
states: 148,533,941 (8)
abstracting: (p29<=1)
states: 992,718,112 (8)
abstracting: (1<=p36)
states: 148,533,941 (8)
abstracting: (p36<=1)
states: 992,718,112 (8)
abstracting: (1<=p43)
states: 148,533,941 (8)
abstracting: (p43<=1)
states: 992,718,112 (8)
abstracting: (1<=p50)
states: 148,533,941 (8)
abstracting: (p50<=1)
states: 992,718,112 (8)
abstracting: (1<=p57)
states: 148,533,941 (8)
abstracting: (p57<=1)
states: 992,718,112 (8)
abstracting: (1<=p67)
states: 148,533,942 (8)
abstracting: (p67<=1)
states: 992,718,112 (8)
abstracting: (1<=p74)
states: 257,325,353 (8)
abstracting: (p74<=1)
states: 992,718,112 (8)
abstracting: (1<=p18)
states: 148,533,942 (8)
abstracting: (p18<=1)
states: 992,718,112 (8)
abstracting: (1<=p25)
states: 148,533,942 (8)
abstracting: (p25<=1)
states: 992,718,112 (8)
abstracting: (1<=p29)
states: 148,533,941 (8)
abstracting: (p29<=1)
states: 992,718,112 (8)
abstracting: (1<=p36)
states: 148,533,941 (8)
abstracting: (p36<=1)
states: 992,718,112 (8)
abstracting: (1<=p43)
states: 148,533,941 (8)
abstracting: (p43<=1)
states: 992,718,112 (8)
abstracting: (1<=p50)
states: 148,533,941 (8)
abstracting: (p50<=1)
states: 992,718,112 (8)
abstracting: (1<=p57)
states: 148,533,941 (8)
abstracting: (p57<=1)
states: 992,718,112 (8)
abstracting: (1<=p67)
states: 148,533,942 (8)
abstracting: (p67<=1)
states: 992,718,112 (8)
abstracting: (1<=p74)
states: 257,325,353 (8)
abstracting: (p74<=1)
states: 992,718,112 (8)
........
EG iterations: 8
abstracting: (0<=p1)
states: 992,718,112 (8)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p6)
states: 992,718,112 (8)
abstracting: (p6<=0)
states: 883,281,467 (8)
abstracting: (0<=p58)
states: 992,718,112 (8)
abstracting: (p58<=0)
states: 853,373,948 (8)
abstracting: (0<=p73)
states: 992,718,112 (8)
abstracting: (p73<=0)
states: 714,328,048 (8)
................
EG iterations: 16
-> the formula is FALSE

FORMULA AutonomousCar-PT-08a-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m52.935sec

checking: [AX [[AF [[[[p1<=0 & 0<=p1] | [p5<=0 & 0<=p5]] | [[p65<=0 & 0<=p65] | [p73<=0 & 0<=p73]]]] & [AG [EX [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p21<=1 & 1<=p21] & [p73<=1 & 1<=p73]]]]] & EG [[[[[p1<=0 & 0<=p1] | [p9<=0 & 0<=p9]] | [[p40<=0 & 0<=p40] | [p73<=0 & 0<=p73]]] & [[[p1<=0 & 0<=p1] | [p6<=0 & 0<=p6]] | [[p37<=0 & 0<=p37] | [p73<=0 & 0<=p73]]]]]]]] | [EF [[[EX [EX [[[[[p18<=1 & 1<=p18] & [p22<=1 & 1<=p22]] & [[p32<=1 & 1<=p32] & [p39<=1 & 1<=p39]]] & [[[p46<=1 & 1<=p46] & [p53<=1 & 1<=p53]] & [[p60<=1 & 1<=p60] & [[p64<=1 & 1<=p64] & [p74<=1 & 1<=p74]]]]]]] & [p1<=1 & 1<=p1]] & [[p9<=1 & 1<=p9] & [[p38<=1 & 1<=p38] & [p73<=1 & 1<=p73]]]]] | [EF [[[[[p1<=1 & 1<=p1] & [p10<=1 & 1<=p10]] & [[p45<=1 & 1<=p45] & [p73<=1 & 1<=p73]]] | [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p52<=1 & 1<=p52] & [p73<=1 & 1<=p73]]] | [[[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]] & [[p16<=1 & 1<=p16] & [p73<=1 & 1<=p73]]]]]] & [~ [E [[[[[[p18<=1 & 1<=p18] & [p25<=1 & 1<=p25]] & [[p29<=1 & 1<=p29] & [p36<=1 & 1<=p36]]] & [[[p46<=1 & 1<=p46] & [p50<=1 & 1<=p50]] & [[p60<=1 & 1<=p60] & [[p64<=1 & 1<=p64] & [p74<=1 & 1<=p74]]]]] | [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p56<=1 & 1<=p56] & [p73<=1 & 1<=p73]]] | [p41<=1 & 1<=p41]]] U [EF [[[[[p15<=1 & 1<=p15] & [p25<=1 & 1<=p25]] & [[p32<=1 & 1<=p32] & [p36<=1 & 1<=p36]]] & [[[p46<=1 & 1<=p46] & [p53<=1 & 1<=p53]] & [[p60<=1 & 1<=p60] & [[p64<=1 & 1<=p64] & [p74<=1 & 1<=p74]]]]]] | AF [[[[[p15<=1 & 1<=p15] & [p25<=1 & 1<=p25]] & [[p29<=1 & 1<=p29] & [p36<=1 & 1<=p36]]] & [[[p46<=1 & 1<=p46] & [p50<=1 & 1<=p50]] & [[p57<=1 & 1<=p57] & [[p67<=1 & 1<=p67] & [p74<=1 & 1<=p74]]]]]]]]] | AG [[EG [[[[p1<=0 & 0<=p1] | [p2<=0 & 0<=p2]] | [[p30<=0 & 0<=p30] | [p73<=0 & 0<=p73]]]] & AX [[[[[p15<=0 & 0<=p15] | [p25<=0 & 0<=p25]] | [[p32<=0 & 0<=p32] | [p39<=0 & 0<=p39]]] | [[[p43<=0 & 0<=p43] | [p50<=0 & 0<=p50]] | [[p57<=0 & 0<=p57] | [[p67<=0 & 0<=p67] | [p74<=0 & 0<=p74]]]]]]]]]]]]
normalized: [[[[~ [E [true U ~ [[~ [EX [~ [[[[[[p74<=0 & 0<=p74] | [p67<=0 & 0<=p67]] | [p57<=0 & 0<=p57]] | [[p50<=0 & 0<=p50] | [p43<=0 & 0<=p43]]] | [[[p39<=0 & 0<=p39] | [p32<=0 & 0<=p32]] | [[p25<=0 & 0<=p25] | [p15<=0 & 0<=p15]]]]]]] & EG [[[[p73<=0 & 0<=p73] | [p30<=0 & 0<=p30]] | [[p2<=0 & 0<=p2] | [p1<=0 & 0<=p1]]]]]]]] | ~ [E [[[[p41<=1 & 1<=p41] | [[[p73<=1 & 1<=p73] & [p56<=1 & 1<=p56]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] | [[[[[p74<=1 & 1<=p74] & [p64<=1 & 1<=p64]] & [p60<=1 & 1<=p60]] & [[p50<=1 & 1<=p50] & [p46<=1 & 1<=p46]]] & [[[p36<=1 & 1<=p36] & [p29<=1 & 1<=p29]] & [[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]]]]] U [~ [EG [~ [[[[[[p74<=1 & 1<=p74] & [p67<=1 & 1<=p67]] & [p57<=1 & 1<=p57]] & [[p50<=1 & 1<=p50] & [p46<=1 & 1<=p46]]] & [[[p36<=1 & 1<=p36] & [p29<=1 & 1<=p29]] & [[p25<=1 & 1<=p25] & [p15<=1 & 1<=p15]]]]]]] | E [true U [[[[[p74<=1 & 1<=p74] & [p64<=1 & 1<=p64]] & [p60<=1 & 1<=p60]] & [[p53<=1 & 1<=p53] & [p46<=1 & 1<=p46]]] & [[[p36<=1 & 1<=p36] & [p32<=1 & 1<=p32]] & [[p25<=1 & 1<=p25] & [p15<=1 & 1<=p15]]]]]]]]] & E [true U [[[[[p73<=1 & 1<=p73] & [p16<=1 & 1<=p16]] & [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]] | [[[p73<=1 & 1<=p73] & [p52<=1 & 1<=p52]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] | [[[p73<=1 & 1<=p73] & [p45<=1 & 1<=p45]] & [[p10<=1 & 1<=p10] & [p1<=1 & 1<=p1]]]]]] | E [true U [[[[p73<=1 & 1<=p73] & [p38<=1 & 1<=p38]] & [p9<=1 & 1<=p9]] & [[p1<=1 & 1<=p1] & EX [EX [[[[[[p74<=1 & 1<=p74] & [p64<=1 & 1<=p64]] & [p60<=1 & 1<=p60]] & [[p53<=1 & 1<=p53] & [p46<=1 & 1<=p46]]] & [[[p39<=1 & 1<=p39] & [p32<=1 & 1<=p32]] & [[p22<=1 & 1<=p22] & [p18<=1 & 1<=p18]]]]]]]]]] | ~ [EX [~ [[[EG [[[[[p73<=0 & 0<=p73] | [p37<=0 & 0<=p37]] | [[p6<=0 & 0<=p6] | [p1<=0 & 0<=p1]]] & [[[p73<=0 & 0<=p73] | [p40<=0 & 0<=p40]] | [[p9<=0 & 0<=p9] | [p1<=0 & 0<=p1]]]]] & ~ [E [true U ~ [EX [[[[p73<=1 & 1<=p73] & [p21<=1 & 1<=p21]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]]] & ~ [EG [~ [[[[p73<=0 & 0<=p73] | [p65<=0 & 0<=p65]] | [[p5<=0 & 0<=p5] | [p1<=0 & 0<=p1]]]]]]]]]]]

abstracting: (0<=p1)
states: 992,718,112 (8)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p5)
states: 992,718,112 (8)
abstracting: (p5<=0)
states: 883,281,467 (8)
abstracting: (0<=p65)
states: 992,718,112 (8)
abstracting: (p65<=0)
states: 853,373,948 (8)
abstracting: (0<=p73)
states: 992,718,112 (8)
abstracting: (p73<=0)
states: 714,328,048 (8)
................
EG iterations: 16
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p2)
states: 65,092,428 (7)
abstracting: (p2<=1)
states: 992,718,112 (8)
abstracting: (1<=p21)
states: 138,273,572 (8)
abstracting: (p21<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
.abstracting: (0<=p1)
states: 992,718,112 (8)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p9)
states: 992,718,112 (8)
abstracting: (p9<=0)
states: 883,281,467 (8)
abstracting: (0<=p40)
states: 992,718,112 (8)
abstracting: (p40<=0)
states: 853,373,948 (8)
abstracting: (0<=p73)
states: 992,718,112 (8)
abstracting: (p73<=0)
states: 714,328,048 (8)
abstracting: (0<=p1)
states: 992,718,112 (8)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p6)
states: 992,718,112 (8)
abstracting: (p6<=0)
states: 883,281,467 (8)
abstracting: (0<=p37)
states: 992,718,112 (8)
abstracting: (p37<=0)
states: 853,373,948 (8)
abstracting: (0<=p73)
states: 992,718,112 (8)
abstracting: (p73<=0)
states: 714,328,048 (8)
..
EG iterations: 2
.abstracting: (1<=p18)
states: 148,533,942 (8)
abstracting: (p18<=1)
states: 992,718,112 (8)
abstracting: (1<=p22)
states: 148,533,941 (8)
abstracting: (p22<=1)
states: 992,718,112 (8)
abstracting: (1<=p32)
states: 148,533,942 (8)
abstracting: (p32<=1)
states: 992,718,112 (8)
abstracting: (1<=p39)
states: 148,533,942 (8)
abstracting: (p39<=1)
states: 992,718,112 (8)
abstracting: (1<=p46)
states: 148,533,942 (8)
abstracting: (p46<=1)
states: 992,718,112 (8)
abstracting: (1<=p53)
states: 148,533,942 (8)
abstracting: (p53<=1)
states: 992,718,112 (8)
abstracting: (1<=p60)
states: 148,533,942 (8)
abstracting: (p60<=1)
states: 992,718,112 (8)
abstracting: (1<=p64)
states: 148,533,941 (8)
abstracting: (p64<=1)
states: 992,718,112 (8)
abstracting: (1<=p74)
states: 257,325,353 (8)
abstracting: (p74<=1)
states: 992,718,112 (8)
..abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p9)
states: 109,436,645 (8)
abstracting: (p9<=1)
states: 992,718,112 (8)
abstracting: (1<=p38)
states: 139,344,164 (8)
abstracting: (p38<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p10)
states: 109,436,645 (8)
abstracting: (p10<=1)
states: 992,718,112 (8)
abstracting: (1<=p45)
states: 139,344,164 (8)
abstracting: (p45<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p2)
states: 65,092,428 (7)
abstracting: (p2<=1)
states: 992,718,112 (8)
abstracting: (1<=p52)
states: 139,344,164 (8)
abstracting: (p52<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p9)
states: 109,436,645 (8)
abstracting: (p9<=1)
states: 992,718,112 (8)
abstracting: (1<=p16)
states: 139,344,164 (8)
abstracting: (p16<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)

before gc: list nodes free: 6752434

after gc: idd nodes used:1312241, unused:62687759; list nodes free:304222879
MC time: 5m44.000sec

checking: [EG [A [AF [AX [[[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p35<=1 & 1<=p35] & [p73<=1 & 1<=p73]]]]] U EX [[~ [[[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p23<=1 & 1<=p23] & [p73<=1 & 1<=p73]]]] | EX [[[[p1<=1 & 1<=p1] & [p11<=1 & 1<=p11]] & [[p58<=1 & 1<=p58] & [p73<=1 & 1<=p73]]]]]]]] & EG [[p28<=0 & 0<=p28]]]
normalized: [EG [[~ [EG [~ [EX [[EX [[[[p11<=1 & 1<=p11] & [p1<=1 & 1<=p1]] & [[p73<=1 & 1<=p73] & [p58<=1 & 1<=p58]]]] | ~ [[[[p73<=1 & 1<=p73] & [p23<=1 & 1<=p23]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]]]]]]] & ~ [E [~ [EX [[EX [[[[p11<=1 & 1<=p11] & [p1<=1 & 1<=p1]] & [[p73<=1 & 1<=p73] & [p58<=1 & 1<=p58]]]] | ~ [[[[p73<=1 & 1<=p73] & [p23<=1 & 1<=p23]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]]]]] U [~ [EX [[EX [[[[p11<=1 & 1<=p11] & [p1<=1 & 1<=p1]] & [[p73<=1 & 1<=p73] & [p58<=1 & 1<=p58]]]] | ~ [[[[p73<=1 & 1<=p73] & [p23<=1 & 1<=p23]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]]]]] & EG [EX [~ [[[[p73<=1 & 1<=p73] & [p35<=1 & 1<=p35]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]]]]]]] & EG [[p28<=0 & 0<=p28]]]

abstracting: (0<=p28)
states: 992,718,112 (8)
abstracting: (p28<=0)
states: 854,444,540 (8)
...........
EG iterations: 11
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p6)
states: 109,436,645 (8)
abstracting: (p6<=1)
states: 992,718,112 (8)
abstracting: (1<=p35)
states: 138,273,572 (8)
abstracting: (p35<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
............................
before gc: list nodes free: 1394858

after gc: idd nodes used:1585071, unused:62414929; list nodes free:302981276
..............................................................
before gc: list nodes free: 1073775

after gc: idd nodes used:1526368, unused:62473632; list nodes free:305339082
..........................................
EG iterations: 131
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p8)
states: 109,436,645 (8)
abstracting: (p8<=1)
states: 992,718,112 (8)
abstracting: (1<=p23)
states: 139,344,164 (8)
abstracting: (p23<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p58)
states: 139,344,164 (8)
abstracting: (p58<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p11)
states: 98,156,357 (7)
abstracting: (p11<=1)
states: 992,718,112 (8)
..abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p8)
states: 109,436,645 (8)
abstracting: (p8<=1)
states: 992,718,112 (8)
abstracting: (1<=p23)
states: 139,344,164 (8)
abstracting: (p23<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p58)
states: 139,344,164 (8)
abstracting: (p58<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p11)
states: 98,156,357 (7)
abstracting: (p11<=1)
states: 992,718,112 (8)
..abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p8)
states: 109,436,645 (8)
abstracting: (p8<=1)
states: 992,718,112 (8)
abstracting: (1<=p23)
states: 139,344,164 (8)
abstracting: (p23<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p58)
states: 139,344,164 (8)
abstracting: (p58<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p11)
states: 98,156,357 (7)
abstracting: (p11<=1)
states: 992,718,112 (8)
...
EG iterations: 1
...................................................
before gc: list nodes free: 1251086

after gc: idd nodes used:1538106, unused:62461894; list nodes free:307382466
................................................................................
EG iterations: 131
-> the formula is TRUE

FORMULA AutonomousCar-PT-08a-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 20m 6.348sec

checking: AG [[EX [EG [[[[[p1<=0 & 0<=p1] | [p7<=0 & 0<=p7]] | [[p37<=0 & 0<=p37] | [p73<=0 & 0<=p73]]] & [[[p1<=0 & 0<=p1] | [p5<=0 & 0<=p5]] | [[p37<=0 & 0<=p37] | [p73<=0 & 0<=p73]]]]]] | A [AF [[[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] & [[p12<=1 & 1<=p12] & [p73<=1 & 1<=p73]]]] U EF [[[[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]] & [[p12<=1 & 1<=p12] & [p73<=1 & 1<=p73]]]]]]]
normalized: ~ [E [true U ~ [[[~ [EG [~ [E [true U [[[p73<=1 & 1<=p73] & [p12<=1 & 1<=p12]] & [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]]]] & ~ [E [~ [E [true U [[[p73<=1 & 1<=p73] & [p12<=1 & 1<=p12]] & [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]] U [~ [E [true U [[[p73<=1 & 1<=p73] & [p12<=1 & 1<=p12]] & [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]] & EG [~ [[[[p12<=1 & 1<=p12] & [p73<=1 & 1<=p73]] & [[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]]]]]]]]] | EX [EG [[[[[p73<=0 & 0<=p73] | [p37<=0 & 0<=p37]] | [[p5<=0 & 0<=p5] | [p1<=0 & 0<=p1]]] & [[[p73<=0 & 0<=p73] | [p37<=0 & 0<=p37]] | [[p7<=0 & 0<=p7] | [p1<=0 & 0<=p1]]]]]]]]]]

abstracting: (0<=p1)
states: 992,718,112 (8)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p7)
states: 992,718,112 (8)
abstracting: (p7<=0)
states: 883,281,467 (8)
abstracting: (0<=p37)
states: 992,718,112 (8)
abstracting: (p37<=0)
states: 853,373,948 (8)
abstracting: (0<=p73)
states: 992,718,112 (8)
abstracting: (p73<=0)
states: 714,328,048 (8)
abstracting: (0<=p1)
states: 992,718,112 (8)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p5)
states: 992,718,112 (8)
abstracting: (p5<=0)
states: 883,281,467 (8)
abstracting: (0<=p37)
states: 992,718,112 (8)
abstracting: (p37<=0)
states: 853,373,948 (8)
abstracting: (0<=p73)
states: 992,718,112 (8)
abstracting: (p73<=0)
states: 714,328,048 (8)
.
EG iterations: 1
.abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p8)
states: 109,436,645 (8)
abstracting: (p8<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p12)
states: 139,344,164 (8)
abstracting: (p12<=1)
states: 992,718,112 (8)
..
EG iterations: 2
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p9)
states: 109,436,645 (8)
abstracting: (p9<=1)
states: 992,718,112 (8)
abstracting: (1<=p12)
states: 139,344,164 (8)
abstracting: (p12<=1)
states: 992,718,112 (8)
abstracting: (1<=p73)
states: 278,390,064 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)

before gc: list nodes free: 1983593

after gc: idd nodes used:1320328, unused:62679672; list nodes free:308378613
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5760368 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096272 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.001sec

83832 73749 80308 81471 83339 83187 84018 87834 88688 88769 89069 89134 89450 89704 90318 94282 94585 94623 95183 95177 95937 95536 95207 96071 95388 95040 95734 95356 95800 95726 96068 95651 95958
iterations count:3386225 (5909), effective:42923 (74)

initing FirstDep: 0m 0.000sec

21220 25089 29323 32850 29678 33440 38357 39840 40494 48591 40245 38736 43421 46502 53722 54377 53510 56685 52918 51575 59397 62955 61668 58637 59647 56360 51073
iterations count:2770945 (4835), effective:27045 (47)

net_ddint.h:600: Timeout: after 306 sec

16295 24138 23278 29909 31281 30963 31185 36828 38721 38962 47242 37694 31758 42444 44252 42558 59749 50547 47529 53213 55044 55362 54174 52335 61107 57369 55617 51216 46416
iterations count:2995360 (5227), effective:26964 (47)
16295 24138 23278 29909 31281 30963 31185 36828 38721 38962 47242 37694 31758 42444 44252 42558 59749 50547 47529 53213 55044 55362 54174 52335 61107
sat_reach.icc:155: Timeout: after 278 sec


iterations count:1794 (3), effective:22 (0)

iterations count:1456 (2), effective:30 (0)

iterations count:1799 (3), effective:22 (0)

iterations count:573 (1), effective:0 (0)
9262 11386 11450
iterations count:378588 (660), effective:4375 (7)

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

iterations count:4800 (8), effective:34 (0)

iterations count:5582 (9), effective:53 (0)
96850 100851 105980 106520 114653 115759 119878 116921 115492 128060 133880 134596 134282 137057 144870 143763 140669 137822 138490 130158
iterations count:2012043 (3511), effective:24351 (42)

iterations count:1691 (2), effective:7 (0)

iterations count:3334 (5), effective:40 (0)
17973 19350 30705 30960 29067 36858 48320 41698 46899 45355 48895 43428 44980 56595 66387 74262 68695 69936 64768 75843 70586 68418 66942 69095 72534 68053 64079 55975 71822 81788 91888 81544 98066 111745 119497 121188
sat_reach.icc:155: Timeout: after 352 sec

13958 22986 23424 31220 32356 36517 36178 35660 36028 37868 34630 34123 41640 49506 53482 55207 59696 64415 66622 61051 53692 52047 52009 50967 45387 53588 53361 50661 65374 73586 80537 74768 74844 76250 74638 73953 74484 76739 73564 73328 71551 82540
sat_reach.icc:155: Timeout: after 302 sec

8944 10617 9122 11901
iterations count:453784 (791), effective:5561 (9)
16891 20192 19451
iterations count:329509 (575), effective:3812 (6)
5750
iterations count:181547 (316), effective:2739 (4)

iterations count:2655 (4), effective:26 (0)

iterations count:1013 (1), effective:13 (0)

iterations count:1802 (3), effective:22 (0)

iterations count:56880 (99), effective:186 (0)
46418 56470 64298 70322 68866 78372 82322 93324 92663 97801 92764 80104 89329 100482 109258 108980 108623 116025 116879 119315 115162 110332 130851 123082 116798 115531 99396 80862 95020 111392 113670 113096 117842 125933
sat_reach.icc:155: Timeout: after 343 sec

16295 24138 23278 29909 31281 30963 31185 36828 38721 38962 47242 37694 31758 42444 44252

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-08a"
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-08a, 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-167813599300642"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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