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.r007-oct2-167813595900676.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 lolaxred
Input is AutonomousCar-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595900676
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.7K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 19K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Feb 25 12:58 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 1.5M 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-10a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678353942745

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 09:25:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 09:25:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 09:25:45] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2023-03-09 09:25:45] [INFO ] Transformed 97 places.
[2023-03-09 09:25:45] [INFO ] Transformed 1921 transitions.
[2023-03-09 09:25:45] [INFO ] Found NUPN structural information;
[2023-03-09 09:25:45] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 319 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 423 transitions
Reduce redundant transitions removed 423 transitions.
FORMULA AutonomousCar-PT-10a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 1498/1498 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 91 transition count 1442
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 91 transition count 1442
Applied a total of 12 rules in 43 ms. Remains 91 /97 variables (removed 6) and now considering 1442/1498 (removed 56) transitions.
// Phase 1: matrix 1442 rows 91 cols
[2023-03-09 09:25:45] [INFO ] Computed 14 place invariants in 44 ms
[2023-03-09 09:25:46] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-09 09:25:46] [INFO ] Invariant cache hit.
[2023-03-09 09:25:46] [INFO ] State equation strengthened by 353 read => feed constraints.
[2023-03-09 09:25:46] [INFO ] Implicit Places using invariants and state equation in 646 ms returned [87, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 956 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/97 places, 1442/1498 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1006 ms. Remains : 89/97 places, 1442/1498 transitions.
Support contains 47 out of 89 places after structural reductions.
[2023-03-09 09:25:47] [INFO ] Flatten gal took : 315 ms
[2023-03-09 09:25:47] [INFO ] Flatten gal took : 244 ms
[2023-03-09 09:25:48] [INFO ] Input system was already deterministic with 1442 transitions.
Support contains 46 out of 89 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 462 resets, run finished after 728 ms. (steps per millisecond=13 ) properties (out of 37) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) 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 33) 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 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 33) 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 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 33) 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 33) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) 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 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) 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 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 2 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 :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) 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 31) 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 31) 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 31) 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 31) seen :0
Running SMT prover for 31 properties.
// Phase 1: matrix 1442 rows 89 cols
[2023-03-09 09:25:48] [INFO ] Computed 12 place invariants in 12 ms
[2023-03-09 09:25:49] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-09 09:25:50] [INFO ] After 678ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9 real:22
[2023-03-09 09:25:50] [INFO ] State equation strengthened by 353 read => feed constraints.
[2023-03-09 09:25:51] [INFO ] After 601ms SMT Verify possible using 353 Read/Feed constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-09 09:25:51] [INFO ] After 1548ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-09 09:25:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-09 09:25:53] [INFO ] After 1805ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :31
[2023-03-09 09:25:55] [INFO ] After 1567ms SMT Verify possible using 353 Read/Feed constraints in natural domain returned unsat :0 sat :31
[2023-03-09 09:25:58] [INFO ] After 4824ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :31
Attempting to minimize the solution found.
Minimization took 1538 ms.
[2023-03-09 09:25:59] [INFO ] After 8524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :31
Parikh walk visited 0 properties in 1240 ms.
Support contains 42 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Graph (complete) has 1186 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 88 transition count 1434
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 84 transition count 1432
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 82 transition count 1432
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 16 place count 82 transition count 1429
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 22 place count 79 transition count 1429
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 78 transition count 1428
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 78 transition count 1428
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 33 place count 78 transition count 1419
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 49 rules applied. Total rules applied 82 place count 69 transition count 1379
Applied a total of 82 rules in 379 ms. Remains 69 /89 variables (removed 20) and now considering 1379/1442 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 379 ms. Remains : 69/89 places, 1379/1442 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 31) seen :6
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 :0
Incomplete Best-First random walk after 1001 steps, including 2 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 :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) 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 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) 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 22) 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 22) 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 22) 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 22) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 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 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 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :1
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 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 1379 rows 69 cols
[2023-03-09 09:26:02] [INFO ] Computed 14 place invariants in 10 ms
[2023-03-09 09:26:02] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-09 09:26:03] [INFO ] After 525ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13 real:6
[2023-03-09 09:26:03] [INFO ] State equation strengthened by 311 read => feed constraints.
[2023-03-09 09:26:03] [INFO ] After 575ms SMT Verify possible using 311 Read/Feed constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-09 09:26:03] [INFO ] After 1202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-09 09:26:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-09 09:26:04] [INFO ] After 1090ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-09 09:26:05] [INFO ] After 894ms SMT Verify possible using 311 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-03-09 09:26:07] [INFO ] After 2414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 748 ms.
[2023-03-09 09:26:08] [INFO ] After 4433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 1018 ms.
Support contains 34 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 1379/1379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 67 transition count 1357
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 67 transition count 1357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 66 transition count 1356
Applied a total of 6 rules in 124 ms. Remains 66 /69 variables (removed 3) and now considering 1356/1379 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 66/69 places, 1356/1379 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 457 ms. (steps per millisecond=21 ) 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 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 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 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 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 :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 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 5 ms. (steps per millisecond=200 ) properties (out of 19) 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 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 3 resets, run finished after 6 ms. (steps per millisecond=166 ) 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 5 ms. (steps per millisecond=200 ) 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 :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 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 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 306043 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 306043 steps, saw 48404 distinct states, run finished after 3003 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 1356 rows 66 cols
[2023-03-09 09:26:12] [INFO ] Computed 14 place invariants in 8 ms
[2023-03-09 09:26:13] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-09 09:26:14] [INFO ] After 868ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13 real:6
[2023-03-09 09:26:14] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-03-09 09:26:15] [INFO ] After 751ms SMT Verify possible using 291 Read/Feed constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-09 09:26:15] [INFO ] After 1882ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-09 09:26:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-09 09:26:16] [INFO ] After 959ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-09 09:26:16] [INFO ] After 745ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-03-09 09:26:18] [INFO ] After 2183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 935 ms.
[2023-03-09 09:26:19] [INFO ] After 4311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 937 ms.
Support contains 34 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 1356/1356 transitions.
Applied a total of 0 rules in 79 ms. Remains 66 /66 variables (removed 0) and now considering 1356/1356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 66/66 places, 1356/1356 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 1356/1356 transitions.
Applied a total of 0 rules in 108 ms. Remains 66 /66 variables (removed 0) and now considering 1356/1356 (removed 0) transitions.
[2023-03-09 09:26:20] [INFO ] Invariant cache hit.
[2023-03-09 09:26:20] [INFO ] Implicit Places using invariants in 60 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/66 places, 1356/1356 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 1355
Applied a total of 2 rules in 120 ms. Remains 64 /65 variables (removed 1) and now considering 1355/1356 (removed 1) transitions.
// Phase 1: matrix 1355 rows 64 cols
[2023-03-09 09:26:20] [INFO ] Computed 13 place invariants in 22 ms
[2023-03-09 09:26:20] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-09 09:26:20] [INFO ] Invariant cache hit.
[2023-03-09 09:26:21] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-03-09 09:26:21] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 64/66 places, 1355/1356 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 739 ms. Remains : 64/66 places, 1355/1356 transitions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 19) 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 19) 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 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 :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) 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 6 ms. (steps per millisecond=166 ) 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 6 ms. (steps per millisecond=166 ) properties (out of 19) 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 18) 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 17) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Running SMT prover for 16 properties.
[2023-03-09 09:26:21] [INFO ] Invariant cache hit.
[2023-03-09 09:26:21] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-09 09:26:22] [INFO ] After 738ms SMT Verify possible using state equation in real domain returned unsat :0 sat :12 real:4
[2023-03-09 09:26:22] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-03-09 09:26:23] [INFO ] After 688ms SMT Verify possible using 291 Read/Feed constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-09 09:26:23] [INFO ] After 1531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-09 09:26:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-09 09:26:24] [INFO ] After 898ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-09 09:26:25] [INFO ] After 571ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-09 09:26:26] [INFO ] After 1525ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 437 ms.
[2023-03-09 09:26:26] [INFO ] After 3030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 938 ms.
Support contains 34 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 1355/1355 transitions.
Applied a total of 0 rules in 131 ms. Remains 64 /64 variables (removed 0) and now considering 1355/1355 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 64/64 places, 1355/1355 transitions.
Incomplete random walk after 10000 steps, including 60 resets, run finished after 439 ms. (steps per millisecond=22 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 15) 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 15) 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 15) 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 15) 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 15) seen :0
Interrupted probabilistic random walk after 418369 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 418369 steps, saw 63791 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-09 09:26:31] [INFO ] Invariant cache hit.
[2023-03-09 09:26:31] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-09 09:26:32] [INFO ] After 808ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13 real:2
[2023-03-09 09:26:32] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-03-09 09:26:32] [INFO ] After 596ms SMT Verify possible using 291 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-09 09:26:32] [INFO ] After 1598ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-09 09:26:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-03-09 09:26:33] [INFO ] After 605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-09 09:26:34] [INFO ] After 579ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-09 09:26:34] [INFO ] After 1319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 406 ms.
[2023-03-09 09:26:35] [INFO ] After 2508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 848 ms.
Support contains 34 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 1355/1355 transitions.
Applied a total of 0 rules in 71 ms. Remains 64 /64 variables (removed 0) and now considering 1355/1355 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 64/64 places, 1355/1355 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) 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 14) 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 14) 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 14) 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 14) 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 14) 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 13) 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 13) 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 13) 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 13) 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 13) 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 13) seen :0
Running SMT prover for 13 properties.
[2023-03-09 09:26:36] [INFO ] Invariant cache hit.
[2023-03-09 09:26:37] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 09:26:37] [INFO ] After 612ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11 real:2
[2023-03-09 09:26:37] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-03-09 09:26:38] [INFO ] After 421ms SMT Verify possible using 291 Read/Feed constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-09 09:26:38] [INFO ] After 1147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-09 09:26:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-09 09:26:38] [INFO ] After 630ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-09 09:26:39] [INFO ] After 405ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-09 09:26:40] [INFO ] After 1292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 558 ms.
[2023-03-09 09:26:40] [INFO ] After 2647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 759 ms.
Support contains 33 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 1355/1355 transitions.
Applied a total of 0 rules in 66 ms. Remains 64 /64 variables (removed 0) and now considering 1355/1355 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 64/64 places, 1355/1355 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :1
Running SMT prover for 5 properties.
[2023-03-09 09:26:42] [INFO ] Invariant cache hit.
[2023-03-09 09:26:42] [INFO ] [Real]Absence check using 13 positive place invariants in 29 ms returned sat
[2023-03-09 09:26:42] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 09:26:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-09 09:26:43] [INFO ] After 482ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 09:26:43] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-03-09 09:26:43] [INFO ] After 250ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-09 09:26:43] [INFO ] After 469ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-09 09:26:43] [INFO ] After 1232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 109 ms.
Support contains 9 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 1355/1355 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 1354
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 63 transition count 1351
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 28 place count 60 transition count 1331
Applied a total of 28 rules in 202 ms. Remains 60 /64 variables (removed 4) and now considering 1331/1355 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 60/64 places, 1331/1355 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 372375 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 372375 steps, saw 59132 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1331 rows 60 cols
[2023-03-09 09:26:47] [INFO ] Computed 13 place invariants in 9 ms
[2023-03-09 09:26:47] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-09 09:26:47] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 09:26:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-03-09 09:26:48] [INFO ] After 541ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 09:26:48] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-09 09:26:48] [INFO ] After 128ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-09 09:26:48] [INFO ] After 399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 168 ms.
[2023-03-09 09:26:48] [INFO ] After 1233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 183 ms.
Support contains 9 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1331/1331 transitions.
Applied a total of 0 rules in 95 ms. Remains 60 /60 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 60/60 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1331/1331 transitions.
Applied a total of 0 rules in 78 ms. Remains 60 /60 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-09 09:26:49] [INFO ] Invariant cache hit.
[2023-03-09 09:26:49] [INFO ] Implicit Places using invariants in 700 ms returned []
[2023-03-09 09:26:49] [INFO ] Invariant cache hit.
[2023-03-09 09:26:50] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-09 09:26:51] [INFO ] Implicit Places using invariants and state equation in 1175 ms returned []
Implicit Place search using SMT with State Equation took 1877 ms to find 0 implicit places.
[2023-03-09 09:26:51] [INFO ] Redundant transitions in 123 ms returned []
[2023-03-09 09:26:51] [INFO ] Invariant cache hit.
[2023-03-09 09:26:51] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2624 ms. Remains : 60/60 places, 1331/1331 transitions.
Applied a total of 0 rules in 73 ms. Remains 60 /60 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-09 09:26:51] [INFO ] Invariant cache hit.
[2023-03-09 09:26:52] [INFO ] [Real]Absence check using 13 positive place invariants in 30 ms returned sat
[2023-03-09 09:26:52] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 09:26:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-03-09 09:26:52] [INFO ] After 399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 09:26:52] [INFO ] After 673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 217 ms.
[2023-03-09 09:26:53] [INFO ] After 961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(((!p0&&X(F((!p1&&F(!p2)))))||G((F(!p2)&&F(!p1))))) U p0))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 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 89 transition count 1434
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 81 transition count 1433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 80 transition count 1433
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 80 transition count 1431
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 78 transition count 1431
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 27 place count 73 transition count 1376
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 73 transition count 1376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 72 transition count 1375
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 71 transition count 1375
Applied a total of 36 rules in 352 ms. Remains 71 /89 variables (removed 18) and now considering 1375/1442 (removed 67) transitions.
// Phase 1: matrix 1375 rows 71 cols
[2023-03-09 09:26:53] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-09 09:26:54] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-09 09:26:54] [INFO ] Invariant cache hit.
[2023-03-09 09:26:54] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-09 09:26:54] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
[2023-03-09 09:26:54] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-09 09:26:55] [INFO ] Invariant cache hit.
[2023-03-09 09:26:55] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/89 places, 1375/1442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2165 ms. Remains : 71/89 places, 1375/1442 transitions.
Stuttering acceptance computed with spot in 408 ms :[p2, (NOT p0), (OR p1 p2), (OR (NOT p0) p2 p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(AND (EQ s15 1) (EQ s20 1) (EQ s25 1) (EQ s30 1) (EQ s36 1) (EQ s43 1) (EQ s46 1) (EQ s53 1) (EQ s56 1) (EQ s63 1) (EQ s68 1)), p0:(AND (EQ s1 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-01 finished in 2639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p1 U (p2||X(p3))))||p0))))'
Support contains 22 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 20 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2023-03-09 09:26:56] [INFO ] Computed 12 place invariants in 14 ms
[2023-03-09 09:26:56] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-09 09:26:56] [INFO ] Invariant cache hit.
[2023-03-09 09:26:56] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-09 09:26:56] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2023-03-09 09:26:56] [INFO ] Invariant cache hit.
[2023-03-09 09:26:57] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/89 places, 1387/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1566 ms. Remains : 84/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s25 0) (EQ s31 0) (EQ s37 0) (EQ s43 0) (EQ s47 0) (EQ s55 0) (EQ s59 0) (EQ s67 0) (EQ s71 0) (EQ s80 0)), p2:(AND (EQ s17 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23 reset in 200 ms.
Product exploration explored 100000 steps with 624 reset in 315 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 688 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter sensitive) to 4 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 455 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 09:26:59] [INFO ] Invariant cache hit.
[2023-03-09 09:26:59] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:26:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-09 09:27:00] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X p0)), (G (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (G (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 1017 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Support contains 21 out of 84 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Applied a total of 0 rules in 9 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
[2023-03-09 09:27:01] [INFO ] Invariant cache hit.
[2023-03-09 09:27:01] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-03-09 09:27:01] [INFO ] Invariant cache hit.
[2023-03-09 09:27:02] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-09 09:27:02] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
[2023-03-09 09:27:02] [INFO ] Invariant cache hit.
[2023-03-09 09:27:02] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1492 ms. Remains : 84/84 places, 1387/1387 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 286 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 470 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Finished Best-First random walk after 2459 steps, including 8 resets, run visited all 4 properties in 9 ms. (steps per millisecond=273 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p3))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 384 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 255 reset in 153 ms.
Product exploration explored 100000 steps with 219 reset in 110 ms.
Support contains 21 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
[2023-03-09 09:27:05] [INFO ] Invariant cache hit.
[2023-03-09 09:27:05] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-09 09:27:05] [INFO ] Invariant cache hit.
[2023-03-09 09:27:05] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-09 09:27:05] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2023-03-09 09:27:06] [INFO ] Invariant cache hit.
[2023-03-09 09:27:06] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1324 ms. Remains : 84/84 places, 1387/1387 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-02 finished in 10793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p1 U p2))&&p0)))'
Support contains 7 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 85 transition count 1398
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 85 transition count 1398
Applied a total of 8 rules in 11 ms. Remains 85 /89 variables (removed 4) and now considering 1398/1442 (removed 44) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2023-03-09 09:27:06] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-09 09:27:07] [INFO ] Implicit Places using invariants in 665 ms returned []
[2023-03-09 09:27:07] [INFO ] Invariant cache hit.
[2023-03-09 09:27:07] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-09 09:27:08] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 1898 ms to find 0 implicit places.
[2023-03-09 09:27:08] [INFO ] Invariant cache hit.
[2023-03-09 09:27:09] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/89 places, 1398/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2571 ms. Remains : 85/89 places, 1398/1442 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), true]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(AND (EQ s1 1) (EQ s2 1) (EQ s26 1) (EQ s80 1)), p1:(EQ s36 1), p0:(AND (EQ s1 1) (EQ s13 1) (EQ s54 1) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-03 finished in 2777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 11 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 16 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2023-03-09 09:27:09] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-09 09:27:10] [INFO ] Implicit Places using invariants in 562 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 579 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/89 places, 1387/1442 transitions.
Applied a total of 0 rules in 8 ms. Remains 83 /83 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 604 ms. Remains : 83/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s18 1) (EQ s22 1) (EQ s30 1) (EQ s36 1) (EQ s42 1) (EQ s46 1) (EQ s54 1) (EQ s60 1) (EQ s66 1) (EQ s70 1) (EQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-04 finished in 770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (!p0&&G(F(p1))&&(!p2||F(!p3)))))'
Support contains 21 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 89 transition count 1432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
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 24 place count 77 transition count 1430
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 73 transition count 1386
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 73 transition count 1386
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 34 place count 72 transition count 1386
Applied a total of 34 rules in 149 ms. Remains 72 /89 variables (removed 17) and now considering 1386/1442 (removed 56) transitions.
// Phase 1: matrix 1386 rows 72 cols
[2023-03-09 09:27:10] [INFO ] Computed 12 place invariants in 30 ms
[2023-03-09 09:27:10] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-09 09:27:10] [INFO ] Invariant cache hit.
[2023-03-09 09:27:11] [INFO ] State equation strengthened by 315 read => feed constraints.
[2023-03-09 09:27:11] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
[2023-03-09 09:27:11] [INFO ] Redundant transitions in 177 ms returned []
[2023-03-09 09:27:11] [INFO ] Invariant cache hit.
[2023-03-09 09:27:12] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/89 places, 1386/1442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2018 ms. Remains : 72/89 places, 1386/1442 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p1) p0 (AND p2 p3)), (NOT p1), (NOT p1), (AND (NOT p0) p3), (OR (AND (NOT p1) p3) (AND p2 p3) (AND p0 p3)), (AND (NOT p1) p3), (AND (NOT p1) p3)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2 p3), acceptance={} source=4 dest: 3}, { cond=(OR (AND p0 p3) (AND p2 p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s2 1) (EQ s50 1) (EQ s68 1)), p1:(AND (EQ s1 1) (EQ s6 1) (EQ s52 1) (EQ s68 1)), p2:(AND (EQ s16 1) (EQ s21 1) (EQ s28 1) (EQ s31 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-05 finished in 2324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 15 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 89 transition count 1432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 77 transition count 1430
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 73 transition count 1386
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 73 transition count 1386
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 34 place count 72 transition count 1385
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 71 transition count 1385
Applied a total of 36 rules in 181 ms. Remains 71 /89 variables (removed 18) and now considering 1385/1442 (removed 57) transitions.
// Phase 1: matrix 1385 rows 71 cols
[2023-03-09 09:27:12] [INFO ] Computed 12 place invariants in 12 ms
[2023-03-09 09:27:13] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-09 09:27:13] [INFO ] Invariant cache hit.
[2023-03-09 09:27:13] [INFO ] State equation strengthened by 315 read => feed constraints.
[2023-03-09 09:27:14] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1239 ms to find 0 implicit places.
[2023-03-09 09:27:14] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-09 09:27:14] [INFO ] Invariant cache hit.
[2023-03-09 09:27:14] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/89 places, 1385/1442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2033 ms. Remains : 71/89 places, 1385/1442 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s11 1) (EQ s44 1) (EQ s67 1) (OR (NEQ s17 1) (NEQ s20 1) (NEQ s25 1) (NEQ s32 1) (NEQ s35 1) (NEQ s42 1) (NEQ s45 1) (NEQ s51 1) (NE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-06 finished in 2120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p1)||p0)))'
Support contains 18 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 89 transition count 1432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
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 24 place count 77 transition count 1430
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 72 transition count 1375
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 72 transition count 1375
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 71 transition count 1374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 70 transition count 1374
Applied a total of 38 rules in 165 ms. Remains 70 /89 variables (removed 19) and now considering 1374/1442 (removed 68) transitions.
// Phase 1: matrix 1374 rows 70 cols
[2023-03-09 09:27:15] [INFO ] Computed 12 place invariants in 15 ms
[2023-03-09 09:27:15] [INFO ] Implicit Places using invariants in 307 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 330 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/89 places, 1374/1442 transitions.
Applied a total of 0 rules in 94 ms. Remains 69 /69 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 589 ms. Remains : 69/89 places, 1374/1442 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s16 0) (EQ s19 0) (EQ s24 0) (EQ s31 0) (EQ s36 0) (EQ s39 0) (EQ s44 0) (EQ s49 0) (EQ s56 0) (EQ s59 0) (EQ s66 0)), p1:(OR (EQ s16 0) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2192 reset in 648 ms.
Product exploration explored 100000 steps with 2150 reset in 601 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 567 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 1374 rows 69 cols
[2023-03-09 09:27:17] [INFO ] Computed 11 place invariants in 24 ms
[2023-03-09 09:27:17] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:27:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-09 09:27:17] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-07 finished in 2653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 15 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 89 transition count 1433
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 80 transition count 1433
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 80 transition count 1431
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 78 transition count 1431
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 73 transition count 1376
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 73 transition count 1376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 34 place count 72 transition count 1376
Applied a total of 34 rules in 145 ms. Remains 72 /89 variables (removed 17) and now considering 1376/1442 (removed 66) transitions.
// Phase 1: matrix 1376 rows 72 cols
[2023-03-09 09:27:17] [INFO ] Computed 12 place invariants in 8 ms
[2023-03-09 09:27:18] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-09 09:27:18] [INFO ] Invariant cache hit.
[2023-03-09 09:27:18] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-09 09:27:18] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
[2023-03-09 09:27:18] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-09 09:27:18] [INFO ] Invariant cache hit.
[2023-03-09 09:27:19] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/89 places, 1376/1442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1960 ms. Remains : 72/89 places, 1376/1442 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s2 0) (EQ s44 0) (EQ s68 0)), p1:(AND (EQ s18 1) (EQ s23 1) (EQ s28 1) (EQ s33 1) (EQ s38 1) (EQ s41 1) (EQ s49 1) (EQ s54 1) (EQ s59...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-08 finished in 2111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 89 transition count 1431
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 78 transition count 1431
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 78 transition count 1430
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 24 place count 77 transition count 1430
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 72 transition count 1375
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 72 transition count 1375
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 70 transition count 1373
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 40 place count 69 transition count 1373
Applied a total of 40 rules in 178 ms. Remains 69 /89 variables (removed 20) and now considering 1373/1442 (removed 69) transitions.
// Phase 1: matrix 1373 rows 69 cols
[2023-03-09 09:27:19] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-09 09:27:20] [INFO ] Implicit Places using invariants in 727 ms returned []
[2023-03-09 09:27:20] [INFO ] Invariant cache hit.
[2023-03-09 09:27:20] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-09 09:27:21] [INFO ] Implicit Places using invariants and state equation in 1214 ms returned []
Implicit Place search using SMT with State Equation took 1943 ms to find 0 implicit places.
[2023-03-09 09:27:21] [INFO ] Redundant transitions in 83 ms returned []
[2023-03-09 09:27:21] [INFO ] Invariant cache hit.
[2023-03-09 09:27:22] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/89 places, 1373/1442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2689 ms. Remains : 69/89 places, 1373/1442 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s7 1) (EQ s28 1) (EQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-09 finished in 2740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(G(p0)))&&F(p1)))))'
Support contains 15 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 20 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2023-03-09 09:27:22] [INFO ] Computed 12 place invariants in 9 ms
[2023-03-09 09:27:22] [INFO ] Implicit Places using invariants in 306 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 310 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/89 places, 1387/1442 transitions.
Applied a total of 0 rules in 14 ms. Remains 83 /83 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 344 ms. Remains : 83/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s18 1) (EQ s24 1) (EQ s30 1) (EQ s34 1) (EQ s40 1) (EQ s46 1) (EQ s52 1) (EQ s58 1) (EQ s66 1) (EQ s70 1) (EQ s79 1)), p0:(AND (EQ s16 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-10 finished in 704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&X((G(!p0)||(F(p1)&&X(F(!p2))))))))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 85 transition count 1398
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 85 transition count 1398
Applied a total of 8 rules in 23 ms. Remains 85 /89 variables (removed 4) and now considering 1398/1442 (removed 44) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2023-03-09 09:27:23] [INFO ] Computed 12 place invariants in 13 ms
[2023-03-09 09:27:23] [INFO ] Implicit Places using invariants in 450 ms returned []
[2023-03-09 09:27:23] [INFO ] Invariant cache hit.
[2023-03-09 09:27:23] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-09 09:27:24] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 1212 ms to find 0 implicit places.
[2023-03-09 09:27:24] [INFO ] Invariant cache hit.
[2023-03-09 09:27:24] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/89 places, 1398/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1720 ms. Remains : 85/89 places, 1398/1442 transitions.
Stuttering acceptance computed with spot in 281 ms :[p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 p2)), (NOT p1), p2, (AND (NOT p1) p0), (AND p2 p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(NOT p0), acceptance={} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s17 1) (EQ s23 1) (EQ s29 1) (EQ s37 1) (EQ s43 1) (EQ s49 1) (EQ s55 1) (EQ s62 1) (EQ s66 1) (EQ s74 1) (EQ s81 1)), p1:(AND (EQ s1 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5119 reset in 1248 ms.
Product exploration explored 100000 steps with 246 reset in 141 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 394 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 360 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), (NOT p1), p2, (AND (NOT p1) p0), (AND p2 p0)]
Incomplete random walk after 10000 steps, including 464 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 24 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 18 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 09:27:27] [INFO ] Invariant cache hit.
[2023-03-09 09:27:27] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2023-03-09 09:27:28] [INFO ] After 348ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2023-03-09 09:27:28] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-09 09:27:28] [INFO ] After 109ms SMT Verify possible using 313 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-09 09:27:28] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-09 09:27:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-09 09:27:28] [INFO ] After 314ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-09 09:27:28] [INFO ] After 102ms SMT Verify possible using 313 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-09 09:27:28] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-09 09:27:28] [INFO ] After 667ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Graph (complete) has 1138 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 84 transition count 1383
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 27 place count 73 transition count 1382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 72 transition count 1382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 72 transition count 1381
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 71 transition count 1381
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 69 transition count 1369
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 69 transition count 1369
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 40 place count 66 transition count 1366
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 49 place count 66 transition count 1357
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 3 with 99 rules applied. Total rules applied 148 place count 57 transition count 1267
Applied a total of 148 rules in 269 ms. Remains 57 /85 variables (removed 28) and now considering 1267/1398 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 57/85 places, 1267/1398 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 724031 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :{}
Probabilistic random walk after 724031 steps, saw 99242 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1267 rows 57 cols
[2023-03-09 09:27:32] [INFO ] Computed 14 place invariants in 12 ms
[2023-03-09 09:27:32] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-09 09:27:32] [INFO ] After 336ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 09:27:32] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-09 09:27:32] [INFO ] After 50ms SMT Verify possible using 211 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:27:32] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:27:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-09 09:27:33] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:27:33] [INFO ] After 75ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:27:33] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-09 09:27:33] [INFO ] After 561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 79 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 57/57 places, 1267/1267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 82 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2023-03-09 09:27:33] [INFO ] Invariant cache hit.
[2023-03-09 09:27:34] [INFO ] Implicit Places using invariants in 698 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 723 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 56/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 72 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 878 ms. Remains : 56/57 places, 1267/1267 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 749886 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :{}
Probabilistic random walk after 749886 steps, saw 101454 distinct states, run finished after 3001 ms. (steps per millisecond=249 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1267 rows 56 cols
[2023-03-09 09:27:37] [INFO ] Computed 13 place invariants in 12 ms
[2023-03-09 09:27:37] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-09 09:27:38] [INFO ] After 354ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 09:27:38] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-09 09:27:38] [INFO ] After 110ms SMT Verify possible using 211 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:27:38] [INFO ] After 521ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:27:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 56 ms returned sat
[2023-03-09 09:27:38] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:27:38] [INFO ] After 47ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:27:38] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-09 09:27:38] [INFO ] After 586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 68 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 56/56 places, 1267/1267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 62 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2023-03-09 09:27:38] [INFO ] Invariant cache hit.
[2023-03-09 09:27:39] [INFO ] Implicit Places using invariants in 788 ms returned []
[2023-03-09 09:27:39] [INFO ] Invariant cache hit.
[2023-03-09 09:27:39] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-09 09:27:40] [INFO ] Implicit Places using invariants and state equation in 1082 ms returned []
Implicit Place search using SMT with State Equation took 1879 ms to find 0 implicit places.
[2023-03-09 09:27:40] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-09 09:27:40] [INFO ] Invariant cache hit.
[2023-03-09 09:27:41] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2378 ms. Remains : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 59 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-09 09:27:41] [INFO ] Invariant cache hit.
[2023-03-09 09:27:41] [INFO ] [Real]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-03-09 09:27:41] [INFO ] After 312ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 09:27:41] [INFO ] After 423ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-09 09:27:41] [INFO ] After 492ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (G (NOT (AND p2 p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p2 (NOT p0))), (F (AND (NOT p1) p0)), (F p2)]
Knowledge based reduction with 7 factoid took 598 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 15 out of 85 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Applied a total of 0 rules in 7 ms. Remains 85 /85 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2023-03-09 09:27:42] [INFO ] Computed 12 place invariants in 16 ms
[2023-03-09 09:27:43] [INFO ] Implicit Places using invariants in 529 ms returned []
[2023-03-09 09:27:43] [INFO ] Invariant cache hit.
[2023-03-09 09:27:43] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-09 09:27:44] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1516 ms to find 0 implicit places.
[2023-03-09 09:27:44] [INFO ] Invariant cache hit.
[2023-03-09 09:27:44] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1977 ms. Remains : 85/85 places, 1398/1398 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 447 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-09 09:27:45] [INFO ] Invariant cache hit.
[2023-03-09 09:27:45] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-09 09:27:45] [INFO ] After 334ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 09:27:45] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-09 09:27:45] [INFO ] After 82ms SMT Verify possible using 313 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:27:45] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:27:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-09 09:27:46] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:27:46] [INFO ] After 76ms SMT Verify possible using 313 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:27:46] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-09 09:27:46] [INFO ] After 610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Graph (complete) has 1138 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 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 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 84 transition count 1383
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 27 place count 73 transition count 1382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 72 transition count 1382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 72 transition count 1381
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 71 transition count 1381
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 69 transition count 1369
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 69 transition count 1369
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 40 place count 66 transition count 1366
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 49 place count 66 transition count 1357
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 3 with 99 rules applied. Total rules applied 148 place count 57 transition count 1267
Applied a total of 148 rules in 214 ms. Remains 57 /85 variables (removed 28) and now considering 1267/1398 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 57/85 places, 1267/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 673207 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :{}
Probabilistic random walk after 673207 steps, saw 93108 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1267 rows 57 cols
[2023-03-09 09:27:49] [INFO ] Computed 14 place invariants in 11 ms
[2023-03-09 09:27:50] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-09 09:27:50] [INFO ] After 377ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 09:27:50] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-09 09:27:50] [INFO ] After 45ms SMT Verify possible using 211 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:27:50] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:27:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-09 09:27:50] [INFO ] After 429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:27:51] [INFO ] After 111ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:27:51] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-09 09:27:51] [INFO ] After 765ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 73 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 57/57 places, 1267/1267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 59 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2023-03-09 09:27:51] [INFO ] Invariant cache hit.
[2023-03-09 09:27:52] [INFO ] Implicit Places using invariants in 865 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 869 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 56/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 118 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1047 ms. Remains : 56/57 places, 1267/1267 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 761129 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :{}
Probabilistic random walk after 761129 steps, saw 102842 distinct states, run finished after 3001 ms. (steps per millisecond=253 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1267 rows 56 cols
[2023-03-09 09:27:55] [INFO ] Computed 13 place invariants in 13 ms
[2023-03-09 09:27:55] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-09 09:27:56] [INFO ] After 390ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 09:27:56] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-09 09:27:56] [INFO ] After 58ms SMT Verify possible using 211 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:27:56] [INFO ] After 547ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:27:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-09 09:27:56] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:27:56] [INFO ] After 46ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:27:56] [INFO ] After 115ms 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-09 09:27:56] [INFO ] After 544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 73 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 56/56 places, 1267/1267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 60 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2023-03-09 09:27:56] [INFO ] Invariant cache hit.
[2023-03-09 09:27:57] [INFO ] Implicit Places using invariants in 751 ms returned []
[2023-03-09 09:27:57] [INFO ] Invariant cache hit.
[2023-03-09 09:27:58] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-09 09:27:59] [INFO ] Implicit Places using invariants and state equation in 1467 ms returned []
Implicit Place search using SMT with State Equation took 2233 ms to find 0 implicit places.
[2023-03-09 09:27:59] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-09 09:27:59] [INFO ] Invariant cache hit.
[2023-03-09 09:27:59] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2716 ms. Remains : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 59 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-09 09:27:59] [INFO ] Invariant cache hit.
[2023-03-09 09:27:59] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-09 09:27:59] [INFO ] After 365ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 09:28:00] [INFO ] After 410ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-09 09:28:00] [INFO ] After 468ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 528 reset in 239 ms.
Product exploration explored 100000 steps with 1489 reset in 495 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 15 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 85 transition count 1398
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 10 place count 85 transition count 1400
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 85 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 84 transition count 1389
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 84 transition count 1389
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 84 transition count 1389
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 84 transition count 1392
Deduced a syphon composed of 14 places in 1 ms
Applied a total of 16 rules in 161 ms. Remains 84 /85 variables (removed 1) and now considering 1392/1398 (removed 6) transitions.
[2023-03-09 09:28:02] [INFO ] Redundant transitions in 62 ms returned []
// Phase 1: matrix 1392 rows 84 cols
[2023-03-09 09:28:02] [INFO ] Computed 12 place invariants in 15 ms
[2023-03-09 09:28:02] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/85 places, 1392/1398 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 806 ms. Remains : 84/85 places, 1392/1398 transitions.
Support contains 15 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 1387
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 1387
Applied a total of 2 rules in 21 ms. Remains 84 /85 variables (removed 1) and now considering 1387/1398 (removed 11) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2023-03-09 09:28:02] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-09 09:28:03] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-09 09:28:03] [INFO ] Invariant cache hit.
[2023-03-09 09:28:03] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-09 09:28:03] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
[2023-03-09 09:28:03] [INFO ] Invariant cache hit.
[2023-03-09 09:28:04] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/85 places, 1387/1398 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1792 ms. Remains : 84/85 places, 1387/1398 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-11 finished in 41626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 11 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 8 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
[2023-03-09 09:28:04] [INFO ] Invariant cache hit.
[2023-03-09 09:28:05] [INFO ] Implicit Places using invariants in 428 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 448 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/89 places, 1387/1442 transitions.
Applied a total of 0 rules in 9 ms. Remains 83 /83 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 465 ms. Remains : 83/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s16 0) (EQ s22 0) (EQ s28 0) (EQ s34 0) (EQ s40 0) (EQ s48 0) (EQ s54 0) (EQ s60 0) (EQ s66 0) (EQ s72 0) (EQ s79 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 5945 ms.
Product exploration explored 100000 steps with 50000 reset in 5919 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-12 finished in 12502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0)) U G(p1)) U G(!p2)))'
Support contains 22 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 89 transition count 1433
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 80 transition count 1433
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 80 transition count 1431
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 22 place count 78 transition count 1431
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 73 transition count 1376
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 73 transition count 1376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 72 transition count 1375
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 36 place count 71 transition count 1375
Applied a total of 36 rules in 122 ms. Remains 71 /89 variables (removed 18) and now considering 1375/1442 (removed 67) transitions.
// Phase 1: matrix 1375 rows 71 cols
[2023-03-09 09:28:17] [INFO ] Computed 12 place invariants in 11 ms
[2023-03-09 09:28:17] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-09 09:28:17] [INFO ] Invariant cache hit.
[2023-03-09 09:28:17] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-09 09:28:18] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
[2023-03-09 09:28:18] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-09 09:28:18] [INFO ] Invariant cache hit.
[2023-03-09 09:28:18] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/89 places, 1375/1442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1593 ms. Remains : 71/89 places, 1375/1442 transitions.
Stuttering acceptance computed with spot in 226 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1), (AND (NOT p0) p1 p2)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s17 1) (EQ s20 1) (EQ s27 1) (EQ s30 1) (EQ s35 1) (EQ s41 1) (EQ s46 1) (EQ s53 1) (EQ s56 1) (EQ s63 1) (EQ s68 1)), p1:(AND (EQ s15 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 33197 reset in 4674 ms.
Product exploration explored 100000 steps with 33251 reset in 4709 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1473 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 331 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1), (AND (NOT p0) p1 p2)]
Incomplete random walk after 10000 steps, including 539 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 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 27 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 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 29 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :4
Running SMT prover for 3 properties.
[2023-03-09 09:28:30] [INFO ] Invariant cache hit.
[2023-03-09 09:28:31] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned sat
[2023-03-09 09:28:31] [INFO ] After 307ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 09:28:31] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-09 09:28:31] [INFO ] After 64ms SMT Verify possible using 305 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 09:28:31] [INFO ] After 440ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 09:28:31] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-09 09:28:31] [INFO ] After 336ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-09 09:28:31] [INFO ] After 72ms SMT Verify possible using 305 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-03-09 09:28:31] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-09 09:28:31] [INFO ] After 577ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 1375/1375 transitions.
Graph (complete) has 1116 edges and 71 vertex of which 70 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 70 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 69 transition count 1370
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 69 transition count 1370
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 1 with 4 rules applied. Total rules applied 9 place count 67 transition count 1368
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 19 place count 67 transition count 1358
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 119 place count 57 transition count 1268
Applied a total of 119 rules in 177 ms. Remains 57 /71 variables (removed 14) and now considering 1268/1375 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 57/71 places, 1268/1375 transitions.
Incomplete random walk after 10000 steps, including 61 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 751066 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :{}
Probabilistic random walk after 751066 steps, saw 103002 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1268 rows 57 cols
[2023-03-09 09:28:35] [INFO ] Computed 13 place invariants in 12 ms
[2023-03-09 09:28:35] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned sat
[2023-03-09 09:28:35] [INFO ] [Real]Absence check using 12 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 09:28:35] [INFO ] After 399ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 09:28:35] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-09 09:28:35] [INFO ] After 59ms SMT Verify possible using 212 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:28:35] [INFO ] After 536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:28:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 15 ms returned sat
[2023-03-09 09:28:35] [INFO ] [Nat]Absence check using 12 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 09:28:36] [INFO ] After 352ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:28:36] [INFO ] After 49ms SMT Verify possible using 212 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:28:36] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-09 09:28:36] [INFO ] After 595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1268/1268 transitions.
Applied a total of 0 rules in 73 ms. Remains 57 /57 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 57/57 places, 1268/1268 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1268/1268 transitions.
Applied a total of 0 rules in 67 ms. Remains 57 /57 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
[2023-03-09 09:28:36] [INFO ] Invariant cache hit.
[2023-03-09 09:28:37] [INFO ] Implicit Places using invariants in 693 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 719 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 56/57 places, 1268/1268 transitions.
Applied a total of 0 rules in 73 ms. Remains 56 /56 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 881 ms. Remains : 56/57 places, 1268/1268 transitions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 710604 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :{}
Probabilistic random walk after 710604 steps, saw 97696 distinct states, run finished after 3013 ms. (steps per millisecond=235 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1268 rows 56 cols
[2023-03-09 09:28:40] [INFO ] Computed 12 place invariants in 20 ms
[2023-03-09 09:28:40] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned sat
[2023-03-09 09:28:41] [INFO ] After 383ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 09:28:41] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-09 09:28:41] [INFO ] After 52ms SMT Verify possible using 212 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:28:41] [INFO ] After 579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:28:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-09 09:28:41] [INFO ] After 404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:28:41] [INFO ] After 55ms SMT Verify possible using 212 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:28:41] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-09 09:28:41] [INFO ] After 663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1268/1268 transitions.
Applied a total of 0 rules in 61 ms. Remains 56 /56 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 56/56 places, 1268/1268 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1268/1268 transitions.
Applied a total of 0 rules in 73 ms. Remains 56 /56 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
[2023-03-09 09:28:42] [INFO ] Invariant cache hit.
[2023-03-09 09:28:43] [INFO ] Implicit Places using invariants in 914 ms returned []
[2023-03-09 09:28:43] [INFO ] Invariant cache hit.
[2023-03-09 09:28:43] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-09 09:28:44] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 2216 ms to find 0 implicit places.
[2023-03-09 09:28:44] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-09 09:28:44] [INFO ] Invariant cache hit.
[2023-03-09 09:28:44] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2807 ms. Remains : 56/56 places, 1268/1268 transitions.
Applied a total of 0 rules in 63 ms. Remains 56 /56 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-09 09:28:44] [INFO ] Invariant cache hit.
[2023-03-09 09:28:44] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-09 09:28:45] [INFO ] After 305ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 09:28:45] [INFO ] After 392ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-09 09:28:45] [INFO ] After 500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (G (NOT (AND p2 (NOT p0) p1))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F (AND (NOT p0) p1)), (F p2), (F (AND p2 (NOT p1))), (F (AND p2 (NOT p0) (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 25 factoid took 1580 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 236 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Support contains 22 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 1375/1375 transitions.
Applied a total of 0 rules in 78 ms. Remains 71 /71 variables (removed 0) and now considering 1375/1375 (removed 0) transitions.
// Phase 1: matrix 1375 rows 71 cols
[2023-03-09 09:28:47] [INFO ] Computed 12 place invariants in 29 ms
[2023-03-09 09:28:47] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-09 09:28:47] [INFO ] Invariant cache hit.
[2023-03-09 09:28:48] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-09 09:28:48] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 967 ms to find 0 implicit places.
[2023-03-09 09:28:48] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-09 09:28:48] [INFO ] Invariant cache hit.
[2023-03-09 09:28:49] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1573 ms. Remains : 71/71 places, 1375/1375 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 608 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 559 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :3
Running SMT prover for 3 properties.
[2023-03-09 09:28:50] [INFO ] Invariant cache hit.
[2023-03-09 09:28:50] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-09 09:28:50] [INFO ] After 428ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 09:28:50] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-09 09:28:50] [INFO ] After 47ms SMT Verify possible using 305 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 09:28:50] [INFO ] After 549ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 09:28:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 53 ms returned sat
[2023-03-09 09:28:51] [INFO ] After 421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 09:28:51] [INFO ] After 133ms SMT Verify possible using 305 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 09:28:52] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 152 ms.
[2023-03-09 09:28:52] [INFO ] After 1177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 84 ms.
Support contains 15 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 1375/1375 transitions.
Graph (complete) has 1116 edges and 71 vertex of which 70 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 70 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 69 transition count 1370
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 69 transition count 1370
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 15 place count 69 transition count 1360
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 115 place count 59 transition count 1270
Applied a total of 115 rules in 187 ms. Remains 59 /71 variables (removed 12) and now considering 1270/1375 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 59/71 places, 1270/1375 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1270 rows 59 cols
[2023-03-09 09:28:52] [INFO ] Computed 13 place invariants in 9 ms
[2023-03-09 09:28:52] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-09 09:28:52] [INFO ] [Real]Absence check using 12 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-09 09:28:53] [INFO ] After 317ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 09:28:53] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-09 09:28:53] [INFO ] After 51ms SMT Verify possible using 212 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:28:53] [INFO ] After 409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:28:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-09 09:28:53] [INFO ] [Nat]Absence check using 12 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 09:28:53] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:28:53] [INFO ] After 72ms SMT Verify possible using 212 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:28:53] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-09 09:28:53] [INFO ] After 554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1270/1270 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 57 transition count 1268
Applied a total of 4 rules in 71 ms. Remains 57 /59 variables (removed 2) and now considering 1268/1270 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 57/59 places, 1268/1270 transitions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 729317 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :{}
Probabilistic random walk after 729317 steps, saw 100507 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1268 rows 57 cols
[2023-03-09 09:28:57] [INFO ] Computed 13 place invariants in 12 ms
[2023-03-09 09:28:57] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-09 09:28:57] [INFO ] [Real]Absence check using 12 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 09:28:57] [INFO ] After 341ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 09:28:57] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-09 09:28:57] [INFO ] After 127ms SMT Verify possible using 212 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:28:57] [INFO ] After 537ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:28:57] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-09 09:28:57] [INFO ] [Nat]Absence check using 12 positive and 1 generalized place invariants in 13 ms returned sat
[2023-03-09 09:28:57] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:28:58] [INFO ] After 90ms SMT Verify possible using 212 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:28:58] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 09:28:58] [INFO ] After 635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1268/1268 transitions.
Applied a total of 0 rules in 59 ms. Remains 57 /57 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 57/57 places, 1268/1268 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1268/1268 transitions.
Applied a total of 0 rules in 59 ms. Remains 57 /57 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
[2023-03-09 09:28:58] [INFO ] Invariant cache hit.
[2023-03-09 09:28:59] [INFO ] Implicit Places using invariants in 823 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 860 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 56/57 places, 1268/1268 transitions.
Applied a total of 0 rules in 93 ms. Remains 56 /56 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1013 ms. Remains : 56/57 places, 1268/1268 transitions.
Incomplete random walk after 10000 steps, including 81 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 736629 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :{}
Probabilistic random walk after 736629 steps, saw 101513 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1268 rows 56 cols
[2023-03-09 09:29:02] [INFO ] Computed 12 place invariants in 13 ms
[2023-03-09 09:29:02] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-09 09:29:02] [INFO ] After 318ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 09:29:02] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-09 09:29:02] [INFO ] After 58ms SMT Verify possible using 212 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:29:02] [INFO ] After 428ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:29:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-09 09:29:03] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:29:03] [INFO ] After 46ms SMT Verify possible using 212 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:29:03] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-09 09:29:03] [INFO ] After 486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1268/1268 transitions.
Applied a total of 0 rules in 60 ms. Remains 56 /56 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 56/56 places, 1268/1268 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1268/1268 transitions.
Applied a total of 0 rules in 59 ms. Remains 56 /56 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
[2023-03-09 09:29:03] [INFO ] Invariant cache hit.
[2023-03-09 09:29:04] [INFO ] Implicit Places using invariants in 927 ms returned []
[2023-03-09 09:29:04] [INFO ] Invariant cache hit.
[2023-03-09 09:29:04] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-09 09:29:05] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 2164 ms to find 0 implicit places.
[2023-03-09 09:29:05] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-09 09:29:05] [INFO ] Invariant cache hit.
[2023-03-09 09:29:06] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2845 ms. Remains : 56/56 places, 1268/1268 transitions.
Applied a total of 0 rules in 57 ms. Remains 56 /56 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-09 09:29:06] [INFO ] Invariant cache hit.
[2023-03-09 09:29:06] [INFO ] [Real]Absence check using 12 positive place invariants in 46 ms returned sat
[2023-03-09 09:29:06] [INFO ] After 309ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 09:29:06] [INFO ] After 360ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-09 09:29:06] [INFO ] After 479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 13 factoid took 794 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 218 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 227 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 189 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Product exploration explored 100000 steps with 981 reset in 332 ms.
Product exploration explored 100000 steps with 2012 reset in 574 ms.
Support contains 22 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 1375/1375 transitions.
Applied a total of 0 rules in 76 ms. Remains 71 /71 variables (removed 0) and now considering 1375/1375 (removed 0) transitions.
// Phase 1: matrix 1375 rows 71 cols
[2023-03-09 09:29:09] [INFO ] Computed 12 place invariants in 11 ms
[2023-03-09 09:29:09] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-09 09:29:09] [INFO ] Invariant cache hit.
[2023-03-09 09:29:09] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-09 09:29:10] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
[2023-03-09 09:29:10] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-09 09:29:10] [INFO ] Invariant cache hit.
[2023-03-09 09:29:10] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1527 ms. Remains : 71/71 places, 1375/1375 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-13 finished in 53648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(!p0)||(!p0&&F(!p1))))||((G(!p0)||(!p0&&F(!p1)))&&X(F((!p2||X(!p3)))))))'
Support contains 19 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 86 transition count 1409
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 86 transition count 1409
Applied a total of 6 rules in 8 ms. Remains 86 /89 variables (removed 3) and now considering 1409/1442 (removed 33) transitions.
// Phase 1: matrix 1409 rows 86 cols
[2023-03-09 09:29:10] [INFO ] Computed 12 place invariants in 12 ms
[2023-03-09 09:29:11] [INFO ] Implicit Places using invariants in 513 ms returned []
[2023-03-09 09:29:11] [INFO ] Invariant cache hit.
[2023-03-09 09:29:11] [INFO ] State equation strengthened by 323 read => feed constraints.
[2023-03-09 09:29:12] [INFO ] Implicit Places using invariants and state equation in 1051 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
[2023-03-09 09:29:12] [INFO ] Invariant cache hit.
[2023-03-09 09:29:13] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 86/89 places, 1409/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2302 ms. Remains : 86/89 places, 1409/1442 transitions.
Stuttering acceptance computed with spot in 227 ms :[p0, true, (AND p2 p3 p0), (AND p1 p0), (AND p2 p3 p0), (AND p2 p3), p1]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p2 p3), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 p3), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 p3), acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s33 1) (EQ s81 1)), p1:(AND (EQ s20 1) (EQ s24 1) (EQ s30 1) (EQ s38 1) (EQ s42 1) (EQ s51 1) (EQ s55 1) (EQ s61 1) (EQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 6689 ms.
Product exploration explored 100000 steps with 50000 reset in 6653 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p2)))
Knowledge based reduction with 12 factoid took 371 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-14 finished in 16306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X((X(X(p1))||G(p2)))))))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 85 transition count 1398
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 85 transition count 1398
Applied a total of 8 rules in 10 ms. Remains 85 /89 variables (removed 4) and now considering 1398/1442 (removed 44) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2023-03-09 09:29:27] [INFO ] Computed 12 place invariants in 10 ms
[2023-03-09 09:29:27] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-09 09:29:27] [INFO ] Invariant cache hit.
[2023-03-09 09:29:27] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-09 09:29:28] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1253 ms to find 0 implicit places.
[2023-03-09 09:29:28] [INFO ] Invariant cache hit.
[2023-03-09 09:29:28] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/89 places, 1398/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1773 ms. Remains : 85/89 places, 1398/1442 transitions.
Stuttering acceptance computed with spot in 401 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=p2, acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s19 1) (EQ s23 1) (EQ s32 1) (EQ s36 1) (EQ s42 1) (EQ s48 1) (EQ s54 1) (EQ s60 1) (EQ s68 1) (EQ s74 1) (EQ s81 1)), p2:(AND (EQ s1 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16643 reset in 2811 ms.
Product exploration explored 100000 steps with 16634 reset in 2766 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 265 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 446 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 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 26 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 26 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-09 09:29:36] [INFO ] Invariant cache hit.
[2023-03-09 09:29:36] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-09 09:29:36] [INFO ] After 382ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-09 09:29:36] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-09 09:29:36] [INFO ] After 61ms SMT Verify possible using 313 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 09:29:36] [INFO ] After 525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 09:29:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-09 09:29:37] [INFO ] After 458ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-09 09:29:37] [INFO ] After 176ms SMT Verify possible using 313 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-09 09:29:37] [INFO ] After 355ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-09 09:29:37] [INFO ] After 1056ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 66 ms.
Support contains 17 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Graph (complete) has 1138 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 84 transition count 1385
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 22 place count 75 transition count 1385
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 22 place count 75 transition count 1382
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 72 transition count 1382
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 71 transition count 1381
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 71 transition count 1381
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 70 transition count 1380
Free-agglomeration rule applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 43 place count 70 transition count 1369
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 101 rules applied. Total rules applied 144 place count 59 transition count 1279
Applied a total of 144 rules in 152 ms. Remains 59 /85 variables (removed 26) and now considering 1279/1398 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 59/85 places, 1279/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1279 rows 59 cols
[2023-03-09 09:29:38] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-09 09:29:38] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:29:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-09 09:29:38] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 09:29:38] [INFO ] State equation strengthened by 221 read => feed constraints.
[2023-03-09 09:29:38] [INFO ] After 106ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 09:29:39] [INFO ] After 320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-09 09:29:39] [INFO ] After 823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 6 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1279/1279 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 57 transition count 1277
Applied a total of 4 rules in 87 ms. Remains 57 /59 variables (removed 2) and now considering 1277/1279 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 57/59 places, 1277/1279 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Finished Best-First random walk after 5066 steps, including 3 resets, run visited all 2 properties in 12 ms. (steps per millisecond=422 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT p0))), (G (NOT (AND p2 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F p0), (F (NOT p1)), (F p2)]
Knowledge based reduction with 6 factoid took 459 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 15 out of 85 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2023-03-09 09:29:40] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-09 09:29:40] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-09 09:29:40] [INFO ] Invariant cache hit.
[2023-03-09 09:29:41] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-09 09:29:41] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
[2023-03-09 09:29:41] [INFO ] Invariant cache hit.
[2023-03-09 09:29:42] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1927 ms. Remains : 85/85 places, 1398/1398 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 465 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 607108 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 607108 steps, saw 76465 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 09:29:46] [INFO ] Invariant cache hit.
[2023-03-09 09:29:46] [INFO ] [Real]Absence check using 12 positive place invariants in 46 ms returned sat
[2023-03-09 09:29:46] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:29:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-09 09:29:46] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 09:29:46] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-09 09:29:46] [INFO ] After 143ms SMT Verify possible using 313 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 09:29:46] [INFO ] After 297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-09 09:29:47] [INFO ] After 806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 63 ms.
Support contains 15 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Graph (complete) has 1138 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 84 transition count 1385
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 22 place count 75 transition count 1385
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 22 place count 75 transition count 1382
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 72 transition count 1382
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 70 transition count 1370
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 70 transition count 1370
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 34 place count 69 transition count 1369
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 69 transition count 1359
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 144 place count 59 transition count 1269
Applied a total of 144 rules in 152 ms. Remains 59 /85 variables (removed 26) and now considering 1269/1398 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 59/85 places, 1269/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1269 rows 59 cols
[2023-03-09 09:29:47] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-09 09:29:47] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:29:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-09 09:29:47] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:29:47] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-09 09:29:48] [INFO ] After 73ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:29:48] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-09 09:29:48] [INFO ] After 612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1269/1269 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 57 transition count 1267
Applied a total of 4 rules in 89 ms. Remains 57 /59 variables (removed 2) and now considering 1267/1269 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 57/59 places, 1267/1269 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 758319 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :{}
Probabilistic random walk after 758319 steps, saw 102371 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1267 rows 57 cols
[2023-03-09 09:29:51] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-09 09:29:51] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:29:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-09 09:29:51] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:29:51] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-09 09:29:52] [INFO ] After 79ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:29:52] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 09:29:52] [INFO ] After 547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 61 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 57/57 places, 1267/1267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 59 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2023-03-09 09:29:52] [INFO ] Invariant cache hit.
[2023-03-09 09:29:53] [INFO ] Implicit Places using invariants in 836 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 843 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 56/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 106 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1021 ms. Remains : 56/57 places, 1267/1267 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 752342 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :{}
Probabilistic random walk after 752342 steps, saw 101629 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1267 rows 56 cols
[2023-03-09 09:29:56] [INFO ] Computed 13 place invariants in 27 ms
[2023-03-09 09:29:56] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:29:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-09 09:29:56] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:29:56] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-09 09:29:56] [INFO ] After 46ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:29:56] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-09 09:29:56] [INFO ] After 498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 71 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 56/56 places, 1267/1267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 60 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2023-03-09 09:29:57] [INFO ] Invariant cache hit.
[2023-03-09 09:29:57] [INFO ] Implicit Places using invariants in 736 ms returned []
[2023-03-09 09:29:57] [INFO ] Invariant cache hit.
[2023-03-09 09:29:58] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-09 09:29:59] [INFO ] Implicit Places using invariants and state equation in 1313 ms returned []
Implicit Place search using SMT with State Equation took 2064 ms to find 0 implicit places.
[2023-03-09 09:29:59] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-09 09:29:59] [INFO ] Invariant cache hit.
[2023-03-09 09:29:59] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2719 ms. Remains : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 57 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-09 09:29:59] [INFO ] Invariant cache hit.
[2023-03-09 09:29:59] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:29:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-09 09:30:00] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:30:00] [INFO ] After 415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-09 09:30:00] [INFO ] After 500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 16645 reset in 2713 ms.
Product exploration explored 100000 steps with 16649 reset in 2767 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 15 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 85 transition count 1398
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 9 place count 85 transition count 1400
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 85 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 84 transition count 1389
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 84 transition count 1389
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 84 transition count 1389
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 84 transition count 1392
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 15 rules in 138 ms. Remains 84 /85 variables (removed 1) and now considering 1392/1398 (removed 6) transitions.
[2023-03-09 09:30:07] [INFO ] Redundant transitions in 53 ms returned []
// Phase 1: matrix 1392 rows 84 cols
[2023-03-09 09:30:07] [INFO ] Computed 12 place invariants in 15 ms
[2023-03-09 09:30:07] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/85 places, 1392/1398 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 710 ms. Remains : 84/85 places, 1392/1398 transitions.
Support contains 15 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 1387
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 1387
Applied a total of 2 rules in 8 ms. Remains 84 /85 variables (removed 1) and now considering 1387/1398 (removed 11) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2023-03-09 09:30:07] [INFO ] Computed 12 place invariants in 10 ms
[2023-03-09 09:30:08] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-09 09:30:08] [INFO ] Invariant cache hit.
[2023-03-09 09:30:08] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-09 09:30:08] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
[2023-03-09 09:30:08] [INFO ] Invariant cache hit.
[2023-03-09 09:30:09] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/85 places, 1387/1398 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1564 ms. Remains : 84/85 places, 1387/1398 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-15 finished in 42417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p1 U (p2||X(p3))))||p0))))'
Found a Lengthening insensitive property : AutonomousCar-PT-10a-LTLFireability-02
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Support contains 22 out of 89 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 89 transition count 1433
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 80 transition count 1432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 77 transition count 1430
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 29 place count 72 transition count 1375
Iterating global reduction 3 with 5 rules applied. Total rules applied 34 place count 72 transition count 1375
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 71 transition count 1374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 38 place count 70 transition count 1374
Applied a total of 38 rules in 120 ms. Remains 70 /89 variables (removed 19) and now considering 1374/1442 (removed 68) transitions.
// Phase 1: matrix 1374 rows 70 cols
[2023-03-09 09:30:10] [INFO ] Computed 12 place invariants in 14 ms
[2023-03-09 09:30:10] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-09 09:30:10] [INFO ] Invariant cache hit.
[2023-03-09 09:30:10] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-09 09:30:11] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
[2023-03-09 09:30:11] [INFO ] Invariant cache hit.
[2023-03-09 09:30:11] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 70/89 places, 1374/1442 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1583 ms. Remains : 70/89 places, 1374/1442 transitions.
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s17 0) (EQ s22 0) (EQ s27 0) (EQ s32 0) (EQ s37 0) (EQ s40 0) (EQ s47 0) (EQ s50 0) (EQ s57 0) (EQ s60 0) (EQ s67 0)), p2:(AND (EQ s15 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 963 reset in 305 ms.
Product exploration explored 100000 steps with 139 reset in 96 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 534 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter sensitive) to 4 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 556 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 09:30:13] [INFO ] Invariant cache hit.
[2023-03-09 09:30:13] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:30:13] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-09 09:30:13] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X p0)), (G (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (G (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 841 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Support contains 21 out of 70 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 1374/1374 transitions.
Applied a total of 0 rules in 10 ms. Remains 70 /70 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
[2023-03-09 09:30:14] [INFO ] Invariant cache hit.
[2023-03-09 09:30:14] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-09 09:30:14] [INFO ] Invariant cache hit.
[2023-03-09 09:30:15] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-09 09:30:15] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
[2023-03-09 09:30:15] [INFO ] Invariant cache hit.
[2023-03-09 09:30:15] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1498 ms. Remains : 70/70 places, 1374/1374 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 321 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 558 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Finished Best-First random walk after 3673 steps, including 12 resets, run visited all 4 properties in 10 ms. (steps per millisecond=367 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p3))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 436 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 1341 reset in 437 ms.
Product exploration explored 100000 steps with 565 reset in 198 ms.
Support contains 21 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 1374/1374 transitions.
Applied a total of 0 rules in 3 ms. Remains 70 /70 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
[2023-03-09 09:30:18] [INFO ] Invariant cache hit.
[2023-03-09 09:30:18] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-09 09:30:18] [INFO ] Invariant cache hit.
[2023-03-09 09:30:19] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-09 09:30:19] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
[2023-03-09 09:30:19] [INFO ] Invariant cache hit.
[2023-03-09 09:30:19] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1381 ms. Remains : 70/70 places, 1374/1374 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-02 finished in 10489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&X((G(!p0)||(F(p1)&&X(F(!p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0)) U G(p1)) U G(!p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X((X(X(p1))||G(p2)))))))'
[2023-03-09 09:30:20] [INFO ] Flatten gal took : 201 ms
[2023-03-09 09:30:20] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-09 09:30:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 89 places, 1442 transitions and 25487 arcs took 19 ms.
Total runtime 275386 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutonomousCar-PT-10a
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/380
LTLFireability

BK_STOP 1678355007436

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/380/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/380/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/380/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 1.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 8 (type EXCL) for 3 AutonomousCar-PT-10a-LTLFireability-11
lola: time limit : 719 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 1 0 2 0 0 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 4/719 3/32 AutonomousCar-PT-10a-LTLFireability-11 424088 m, 84817 m/sec, 3125721 t fired, .

Time elapsed: 6 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 1 0 2 0 0 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 9/719 6/32 AutonomousCar-PT-10a-LTLFireability-11 906522 m, 96486 m/sec, 7027721 t fired, .

Time elapsed: 11 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 1 0 2 0 0 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 14/719 10/32 AutonomousCar-PT-10a-LTLFireability-11 1426934 m, 104082 m/sec, 11176666 t fired, .

Time elapsed: 16 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 1 0 2 0 0 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 19/719 13/32 AutonomousCar-PT-10a-LTLFireability-11 1941409 m, 102895 m/sec, 15227310 t fired, .

Time elapsed: 21 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 1 0 2 0 0 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 24/719 16/32 AutonomousCar-PT-10a-LTLFireability-11 2403402 m, 92398 m/sec, 19351552 t fired, .

Time elapsed: 26 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 1 0 2 0 0 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 29/719 19/32 AutonomousCar-PT-10a-LTLFireability-11 2907782 m, 100876 m/sec, 23580621 t fired, .

Time elapsed: 31 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 1 0 2 0 0 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 34/719 23/32 AutonomousCar-PT-10a-LTLFireability-11 3414658 m, 101375 m/sec, 27464080 t fired, .

Time elapsed: 36 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 1 0 2 0 0 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 39/719 26/32 AutonomousCar-PT-10a-LTLFireability-11 3881935 m, 93455 m/sec, 31309336 t fired, .

Time elapsed: 41 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 1 0 2 0 0 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 44/719 29/32 AutonomousCar-PT-10a-LTLFireability-11 4339542 m, 91521 m/sec, 35428770 t fired, .

Time elapsed: 46 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 1 0 2 0 0 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 49/719 32/32 AutonomousCar-PT-10a-LTLFireability-11 4858203 m, 103732 m/sec, 39639547 t fired, .

Time elapsed: 51 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 8 (type EXCL) for AutonomousCar-PT-10a-LTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 0 0 2 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 56 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 14 (type EXCL) for 13 AutonomousCar-PT-10a-LTLFireability-15
lola: time limit : 886 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 0 0 2 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 5/886 4/32 AutonomousCar-PT-10a-LTLFireability-15 474641 m, 94928 m/sec, 3864414 t fired, .

Time elapsed: 61 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 0 0 2 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 10/886 6/32 AutonomousCar-PT-10a-LTLFireability-15 925801 m, 90232 m/sec, 7829189 t fired, .

Time elapsed: 66 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 0 0 2 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 15/886 9/32 AutonomousCar-PT-10a-LTLFireability-15 1384188 m, 91677 m/sec, 12199458 t fired, .

Time elapsed: 71 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 0 0 2 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 20/886 13/32 AutonomousCar-PT-10a-LTLFireability-15 1897193 m, 102601 m/sec, 16807940 t fired, .

Time elapsed: 76 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 0 0 2 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 25/886 16/32 AutonomousCar-PT-10a-LTLFireability-15 2418549 m, 104271 m/sec, 21319330 t fired, .

Time elapsed: 81 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 0 0 2 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 30/886 19/32 AutonomousCar-PT-10a-LTLFireability-15 2892689 m, 94828 m/sec, 26063984 t fired, .

Time elapsed: 86 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 0 0 2 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 35/886 22/32 AutonomousCar-PT-10a-LTLFireability-15 3350238 m, 91509 m/sec, 30812334 t fired, .

Time elapsed: 91 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 0 0 2 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 40/886 25/32 AutonomousCar-PT-10a-LTLFireability-15 3877303 m, 105413 m/sec, 35189196 t fired, .

Time elapsed: 96 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 0 0 2 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 45/886 29/32 AutonomousCar-PT-10a-LTLFireability-15 4389904 m, 102520 m/sec, 39051056 t fired, .

Time elapsed: 101 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 0 0 2 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 50/886 31/32 AutonomousCar-PT-10a-LTLFireability-15 4818273 m, 85673 m/sec, 43015850 t fired, .

Time elapsed: 106 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 14 (type EXCL) for AutonomousCar-PT-10a-LTLFireability-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 1 0 0 2 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 111 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 6 (type EXCL) for 3 AutonomousCar-PT-10a-LTLFireability-11
lola: time limit : 1163 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type EXCL) for AutonomousCar-PT-10a-LTLFireability-11
lola: result : true
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 AutonomousCar-PT-10a-LTLFireability-02
lola: time limit : 1744 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1744 4/32 AutonomousCar-PT-10a-LTLFireability-02 476768 m, 95353 m/sec, 3718088 t fired, .

Time elapsed: 116 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1744 7/32 AutonomousCar-PT-10a-LTLFireability-02 941094 m, 92865 m/sec, 7223364 t fired, .

Time elapsed: 121 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1744 10/32 AutonomousCar-PT-10a-LTLFireability-02 1390524 m, 89886 m/sec, 11032279 t fired, .

Time elapsed: 126 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1744 12/32 AutonomousCar-PT-10a-LTLFireability-02 1839825 m, 89860 m/sec, 15004957 t fired, .

Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1744 16/32 AutonomousCar-PT-10a-LTLFireability-02 2321417 m, 96318 m/sec, 18700402 t fired, .

Time elapsed: 136 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1744 19/32 AutonomousCar-PT-10a-LTLFireability-02 2802520 m, 96220 m/sec, 22799944 t fired, .

Time elapsed: 141 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1744 22/32 AutonomousCar-PT-10a-LTLFireability-02 3294837 m, 98463 m/sec, 27028902 t fired, .

Time elapsed: 146 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/1744 25/32 AutonomousCar-PT-10a-LTLFireability-02 3799168 m, 100866 m/sec, 31013403 t fired, .

Time elapsed: 151 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/1744 28/32 AutonomousCar-PT-10a-LTLFireability-02 4244698 m, 89106 m/sec, 34680617 t fired, .

Time elapsed: 156 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/1744 31/32 AutonomousCar-PT-10a-LTLFireability-02 4652530 m, 81566 m/sec, 38394720 t fired, .

Time elapsed: 161 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for AutonomousCar-PT-10a-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 166 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 11 (type EXCL) for 10 AutonomousCar-PT-10a-LTLFireability-13
lola: time limit : 3434 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 5/3434 1/32 AutonomousCar-PT-10a-LTLFireability-13 23756 m, 4751 m/sec, 168084 t fired, .

Time elapsed: 171 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 10/3434 1/32 AutonomousCar-PT-10a-LTLFireability-13 47552 m, 4759 m/sec, 338329 t fired, .

Time elapsed: 176 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 15/3434 1/32 AutonomousCar-PT-10a-LTLFireability-13 71425 m, 4774 m/sec, 509923 t fired, .

Time elapsed: 181 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 20/3434 1/32 AutonomousCar-PT-10a-LTLFireability-13 122480 m, 10211 m/sec, 828475 t fired, .

Time elapsed: 186 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 25/3434 2/32 AutonomousCar-PT-10a-LTLFireability-13 171285 m, 9761 m/sec, 1154774 t fired, .

Time elapsed: 191 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 30/3434 2/32 AutonomousCar-PT-10a-LTLFireability-13 218817 m, 9506 m/sec, 1454932 t fired, .

Time elapsed: 196 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 35/3434 2/32 AutonomousCar-PT-10a-LTLFireability-13 262914 m, 8819 m/sec, 1769715 t fired, .

Time elapsed: 201 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 40/3434 3/32 AutonomousCar-PT-10a-LTLFireability-13 316077 m, 10632 m/sec, 2100243 t fired, .

Time elapsed: 206 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 45/3434 3/32 AutonomousCar-PT-10a-LTLFireability-13 346548 m, 6094 m/sec, 2301875 t fired, .

Time elapsed: 211 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 50/3434 3/32 AutonomousCar-PT-10a-LTLFireability-13 370319 m, 4754 m/sec, 2490186 t fired, .

Time elapsed: 216 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 55/3434 3/32 AutonomousCar-PT-10a-LTLFireability-13 394073 m, 4750 m/sec, 2679150 t fired, .

Time elapsed: 221 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 60/3434 3/32 AutonomousCar-PT-10a-LTLFireability-13 417883 m, 4762 m/sec, 2868028 t fired, .

Time elapsed: 226 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 65/3434 3/32 AutonomousCar-PT-10a-LTLFireability-13 441766 m, 4776 m/sec, 3058050 t fired, .

Time elapsed: 231 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 70/3434 4/32 AutonomousCar-PT-10a-LTLFireability-13 506809 m, 13008 m/sec, 3475434 t fired, .

Time elapsed: 236 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 75/3434 4/32 AutonomousCar-PT-10a-LTLFireability-13 572831 m, 13204 m/sec, 4014931 t fired, .

Time elapsed: 241 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 80/3434 5/32 AutonomousCar-PT-10a-LTLFireability-13 632655 m, 11964 m/sec, 4438490 t fired, .

Time elapsed: 246 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 85/3434 5/32 AutonomousCar-PT-10a-LTLFireability-13 683727 m, 10214 m/sec, 4847998 t fired, .

Time elapsed: 251 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 90/3434 5/32 AutonomousCar-PT-10a-LTLFireability-13 749586 m, 13171 m/sec, 5392075 t fired, .

Time elapsed: 256 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 95/3434 6/32 AutonomousCar-PT-10a-LTLFireability-13 818778 m, 13838 m/sec, 5895719 t fired, .

Time elapsed: 261 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 100/3434 6/32 AutonomousCar-PT-10a-LTLFireability-13 843559 m, 4956 m/sec, 6078110 t fired, .

Time elapsed: 266 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 105/3434 6/32 AutonomousCar-PT-10a-LTLFireability-13 867510 m, 4790 m/sec, 6273337 t fired, .

Time elapsed: 271 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 110/3434 6/32 AutonomousCar-PT-10a-LTLFireability-13 891439 m, 4785 m/sec, 6459664 t fired, .

Time elapsed: 276 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 115/3434 6/32 AutonomousCar-PT-10a-LTLFireability-13 915372 m, 4786 m/sec, 6651355 t fired, .

Time elapsed: 281 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 120/3434 7/32 AutonomousCar-PT-10a-LTLFireability-13 939345 m, 4794 m/sec, 6839836 t fired, .

Time elapsed: 286 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 125/3434 7/32 AutonomousCar-PT-10a-LTLFireability-13 963241 m, 4779 m/sec, 7029563 t fired, .

Time elapsed: 291 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 130/3434 7/32 AutonomousCar-PT-10a-LTLFireability-13 1009324 m, 9216 m/sec, 7341365 t fired, .

Time elapsed: 296 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 135/3434 7/32 AutonomousCar-PT-10a-LTLFireability-13 1061370 m, 10409 m/sec, 7676706 t fired, .

Time elapsed: 301 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 140/3434 8/32 AutonomousCar-PT-10a-LTLFireability-13 1109793 m, 9684 m/sec, 8009851 t fired, .

Time elapsed: 306 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 145/3434 8/32 AutonomousCar-PT-10a-LTLFireability-13 1151691 m, 8379 m/sec, 8293743 t fired, .

Time elapsed: 311 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 150/3434 8/32 AutonomousCar-PT-10a-LTLFireability-13 1194237 m, 8509 m/sec, 8654269 t fired, .

Time elapsed: 316 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 155/3434 9/32 AutonomousCar-PT-10a-LTLFireability-13 1244637 m, 10080 m/sec, 8939232 t fired, .

Time elapsed: 321 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 160/3434 9/32 AutonomousCar-PT-10a-LTLFireability-13 1281953 m, 7463 m/sec, 9249725 t fired, .

Time elapsed: 326 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 165/3434 9/32 AutonomousCar-PT-10a-LTLFireability-13 1316207 m, 6850 m/sec, 9532340 t fired, .

Time elapsed: 331 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 170/3434 9/32 AutonomousCar-PT-10a-LTLFireability-13 1375212 m, 11801 m/sec, 9934566 t fired, .

Time elapsed: 336 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 175/3434 10/32 AutonomousCar-PT-10a-LTLFireability-13 1425010 m, 9959 m/sec, 10277661 t fired, .

Time elapsed: 341 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 180/3434 10/32 AutonomousCar-PT-10a-LTLFireability-13 1475911 m, 10180 m/sec, 10590918 t fired, .

Time elapsed: 346 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 185/3434 10/32 AutonomousCar-PT-10a-LTLFireability-13 1499907 m, 4799 m/sec, 10796348 t fired, .

Time elapsed: 351 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 190/3434 10/32 AutonomousCar-PT-10a-LTLFireability-13 1523793 m, 4777 m/sec, 11001590 t fired, .

Time elapsed: 356 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 195/3434 11/32 AutonomousCar-PT-10a-LTLFireability-13 1547651 m, 4771 m/sec, 11207259 t fired, .

Time elapsed: 361 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 200/3434 11/32 AutonomousCar-PT-10a-LTLFireability-13 1571526 m, 4775 m/sec, 11412789 t fired, .

Time elapsed: 366 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 205/3434 11/32 AutonomousCar-PT-10a-LTLFireability-13 1595397 m, 4774 m/sec, 11619023 t fired, .

Time elapsed: 371 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 210/3434 11/32 AutonomousCar-PT-10a-LTLFireability-13 1619247 m, 4770 m/sec, 11825975 t fired, .

Time elapsed: 376 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 215/3434 11/32 AutonomousCar-PT-10a-LTLFireability-13 1643102 m, 4771 m/sec, 12030292 t fired, .

Time elapsed: 381 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 220/3434 11/32 AutonomousCar-PT-10a-LTLFireability-13 1666941 m, 4767 m/sec, 12235459 t fired, .

Time elapsed: 386 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 225/3434 11/32 AutonomousCar-PT-10a-LTLFireability-13 1690861 m, 4784 m/sec, 12441539 t fired, .

Time elapsed: 391 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 230/3434 12/32 AutonomousCar-PT-10a-LTLFireability-13 1719430 m, 5713 m/sec, 12642768 t fired, .

Time elapsed: 396 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 235/3434 12/32 AutonomousCar-PT-10a-LTLFireability-13 1802114 m, 16536 m/sec, 13295522 t fired, .

Time elapsed: 401 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 240/3434 13/32 AutonomousCar-PT-10a-LTLFireability-13 1856866 m, 10950 m/sec, 13652554 t fired, .

Time elapsed: 406 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 245/3434 13/32 AutonomousCar-PT-10a-LTLFireability-13 1910176 m, 10662 m/sec, 14194528 t fired, .

Time elapsed: 411 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 250/3434 13/32 AutonomousCar-PT-10a-LTLFireability-13 1976986 m, 13362 m/sec, 14688799 t fired, .

Time elapsed: 416 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 255/3434 14/32 AutonomousCar-PT-10a-LTLFireability-13 2041782 m, 12959 m/sec, 15230236 t fired, .

Time elapsed: 421 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 260/3434 14/32 AutonomousCar-PT-10a-LTLFireability-13 2097569 m, 11157 m/sec, 15594457 t fired, .

Time elapsed: 426 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 265/3434 14/32 AutonomousCar-PT-10a-LTLFireability-13 2151239 m, 10734 m/sec, 16033706 t fired, .

Time elapsed: 431 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 270/3434 15/32 AutonomousCar-PT-10a-LTLFireability-13 2200019 m, 9756 m/sec, 16521704 t fired, .

Time elapsed: 436 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 275/3434 15/32 AutonomousCar-PT-10a-LTLFireability-13 2253043 m, 10604 m/sec, 17020212 t fired, .

Time elapsed: 441 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 280/3434 16/32 AutonomousCar-PT-10a-LTLFireability-13 2335252 m, 16441 m/sec, 17693626 t fired, .

Time elapsed: 446 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 285/3434 16/32 AutonomousCar-PT-10a-LTLFireability-13 2403953 m, 13740 m/sec, 18236871 t fired, .

Time elapsed: 451 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 290/3434 16/32 AutonomousCar-PT-10a-LTLFireability-13 2451958 m, 9601 m/sec, 18625082 t fired, .

Time elapsed: 456 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 295/3434 17/32 AutonomousCar-PT-10a-LTLFireability-13 2476137 m, 4835 m/sec, 18811128 t fired, .

Time elapsed: 461 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 300/3434 17/32 AutonomousCar-PT-10a-LTLFireability-13 2500580 m, 4888 m/sec, 18986360 t fired, .

Time elapsed: 466 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 305/3434 17/32 AutonomousCar-PT-10a-LTLFireability-13 2524565 m, 4797 m/sec, 19170029 t fired, .

Time elapsed: 471 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 310/3434 17/32 AutonomousCar-PT-10a-LTLFireability-13 2548638 m, 4814 m/sec, 19358861 t fired, .

Time elapsed: 476 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 315/3434 17/32 AutonomousCar-PT-10a-LTLFireability-13 2572645 m, 4801 m/sec, 19541319 t fired, .

Time elapsed: 481 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 320/3434 17/32 AutonomousCar-PT-10a-LTLFireability-13 2597085 m, 4888 m/sec, 19730833 t fired, .

Time elapsed: 486 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 325/3434 18/32 AutonomousCar-PT-10a-LTLFireability-13 2655232 m, 11629 m/sec, 20087193 t fired, .

Time elapsed: 491 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 330/3434 18/32 AutonomousCar-PT-10a-LTLFireability-13 2701340 m, 9221 m/sec, 20389612 t fired, .

Time elapsed: 496 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 335/3434 18/32 AutonomousCar-PT-10a-LTLFireability-13 2745422 m, 8816 m/sec, 20670951 t fired, .

Time elapsed: 501 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 340/3434 19/32 AutonomousCar-PT-10a-LTLFireability-13 2785699 m, 8055 m/sec, 20984626 t fired, .

Time elapsed: 506 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 345/3434 19/32 AutonomousCar-PT-10a-LTLFireability-13 2828385 m, 8537 m/sec, 21280311 t fired, .

Time elapsed: 511 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 350/3434 19/32 AutonomousCar-PT-10a-LTLFireability-13 2875501 m, 9423 m/sec, 21571490 t fired, .

Time elapsed: 516 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 355/3434 19/32 AutonomousCar-PT-10a-LTLFireability-13 2911017 m, 7103 m/sec, 21844671 t fired, .

Time elapsed: 521 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 360/3434 20/32 AutonomousCar-PT-10a-LTLFireability-13 2947789 m, 7354 m/sec, 22139162 t fired, .

Time elapsed: 526 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 365/3434 20/32 AutonomousCar-PT-10a-LTLFireability-13 3003692 m, 11180 m/sec, 22478809 t fired, .

Time elapsed: 531 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 370/3434 20/32 AutonomousCar-PT-10a-LTLFireability-13 3049646 m, 9190 m/sec, 22779724 t fired, .

Time elapsed: 536 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 375/3434 21/32 AutonomousCar-PT-10a-LTLFireability-13 3093495 m, 8769 m/sec, 23057084 t fired, .

Time elapsed: 541 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 380/3434 21/32 AutonomousCar-PT-10a-LTLFireability-13 3119981 m, 5297 m/sec, 23259140 t fired, .

Time elapsed: 546 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 385/3434 21/32 AutonomousCar-PT-10a-LTLFireability-13 3143881 m, 4780 m/sec, 23461838 t fired, .

Time elapsed: 551 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 390/3434 21/32 AutonomousCar-PT-10a-LTLFireability-13 3168653 m, 4954 m/sec, 23643131 t fired, .

Time elapsed: 556 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 395/3434 21/32 AutonomousCar-PT-10a-LTLFireability-13 3192589 m, 4787 m/sec, 23843722 t fired, .

Time elapsed: 561 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 400/3434 21/32 AutonomousCar-PT-10a-LTLFireability-13 3216513 m, 4784 m/sec, 24043455 t fired, .

Time elapsed: 566 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 405/3434 22/32 AutonomousCar-PT-10a-LTLFireability-13 3240378 m, 4773 m/sec, 24243920 t fired, .

Time elapsed: 571 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 410/3434 22/32 AutonomousCar-PT-10a-LTLFireability-13 3264352 m, 4794 m/sec, 24445981 t fired, .

Time elapsed: 576 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 415/3434 22/32 AutonomousCar-PT-10a-LTLFireability-13 3288295 m, 4788 m/sec, 24645723 t fired, .

Time elapsed: 581 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 420/3434 22/32 AutonomousCar-PT-10a-LTLFireability-13 3312289 m, 4798 m/sec, 24847039 t fired, .

Time elapsed: 586 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 425/3434 22/32 AutonomousCar-PT-10a-LTLFireability-13 3350371 m, 7616 m/sec, 25111494 t fired, .

Time elapsed: 591 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 430/3434 23/32 AutonomousCar-PT-10a-LTLFireability-13 3420378 m, 14001 m/sec, 25666261 t fired, .

Time elapsed: 596 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 435/3434 23/32 AutonomousCar-PT-10a-LTLFireability-13 3469013 m, 9727 m/sec, 25956111 t fired, .

Time elapsed: 601 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 440/3434 23/32 AutonomousCar-PT-10a-LTLFireability-13 3520171 m, 10231 m/sec, 26445425 t fired, .

Time elapsed: 606 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 445/3434 24/32 AutonomousCar-PT-10a-LTLFireability-13 3585681 m, 13102 m/sec, 26958813 t fired, .

Time elapsed: 611 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 450/3434 24/32 AutonomousCar-PT-10a-LTLFireability-13 3642459 m, 11355 m/sec, 27424034 t fired, .

Time elapsed: 616 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 455/3434 24/32 AutonomousCar-PT-10a-LTLFireability-13 3694032 m, 10314 m/sec, 27795613 t fired, .

Time elapsed: 621 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 460/3434 25/32 AutonomousCar-PT-10a-LTLFireability-13 3737783 m, 8750 m/sec, 28030798 t fired, .

Time elapsed: 626 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 465/3434 25/32 AutonomousCar-PT-10a-LTLFireability-13 3791976 m, 10838 m/sec, 28538433 t fired, .

Time elapsed: 631 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 470/3434 25/32 AutonomousCar-PT-10a-LTLFireability-13 3834527 m, 8510 m/sec, 28953859 t fired, .

Time elapsed: 636 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 475/3434 26/32 AutonomousCar-PT-10a-LTLFireability-13 3896230 m, 12340 m/sec, 29497085 t fired, .

Time elapsed: 641 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 480/3434 26/32 AutonomousCar-PT-10a-LTLFireability-13 3962489 m, 13251 m/sec, 29998754 t fired, .

Time elapsed: 646 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 485/3434 27/32 AutonomousCar-PT-10a-LTLFireability-13 4023167 m, 12135 m/sec, 30481020 t fired, .

Time elapsed: 651 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 490/3434 27/32 AutonomousCar-PT-10a-LTLFireability-13 4077964 m, 10959 m/sec, 30889160 t fired, .

Time elapsed: 656 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 495/3434 27/32 AutonomousCar-PT-10a-LTLFireability-13 4104023 m, 5211 m/sec, 31079329 t fired, .

Time elapsed: 661 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 500/3434 27/32 AutonomousCar-PT-10a-LTLFireability-13 4128096 m, 4814 m/sec, 31279288 t fired, .

Time elapsed: 666 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 505/3434 27/32 AutonomousCar-PT-10a-LTLFireability-13 4152565 m, 4893 m/sec, 31481659 t fired, .

Time elapsed: 671 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 510/3434 28/32 AutonomousCar-PT-10a-LTLFireability-13 4177539 m, 4994 m/sec, 31674405 t fired, .

Time elapsed: 676 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 515/3434 28/32 AutonomousCar-PT-10a-LTLFireability-13 4201719 m, 4836 m/sec, 31878353 t fired, .

Time elapsed: 681 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 520/3434 28/32 AutonomousCar-PT-10a-LTLFireability-13 4225730 m, 4802 m/sec, 32073702 t fired, .

Time elapsed: 686 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 525/3434 28/32 AutonomousCar-PT-10a-LTLFireability-13 4249923 m, 4838 m/sec, 32276784 t fired, .

Time elapsed: 691 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 530/3434 28/32 AutonomousCar-PT-10a-LTLFireability-13 4273894 m, 4794 m/sec, 32484125 t fired, .

Time elapsed: 696 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 535/3434 28/32 AutonomousCar-PT-10a-LTLFireability-13 4298233 m, 4867 m/sec, 32694839 t fired, .

Time elapsed: 701 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 540/3434 29/32 AutonomousCar-PT-10a-LTLFireability-13 4322432 m, 4839 m/sec, 32893541 t fired, .

Time elapsed: 706 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 545/3434 29/32 AutonomousCar-PT-10a-LTLFireability-13 4346535 m, 4820 m/sec, 33094232 t fired, .

Time elapsed: 711 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 550/3434 29/32 AutonomousCar-PT-10a-LTLFireability-13 4370633 m, 4819 m/sec, 33295274 t fired, .

Time elapsed: 716 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 555/3434 29/32 AutonomousCar-PT-10a-LTLFireability-13 4400097 m, 5892 m/sec, 33503376 t fired, .

Time elapsed: 721 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 560/3434 29/32 AutonomousCar-PT-10a-LTLFireability-13 4461090 m, 12198 m/sec, 33937159 t fired, .

Time elapsed: 726 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 565/3434 30/32 AutonomousCar-PT-10a-LTLFireability-13 4510692 m, 9920 m/sec, 34232234 t fired, .

Time elapsed: 731 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 570/3434 30/32 AutonomousCar-PT-10a-LTLFireability-13 4552372 m, 8336 m/sec, 34556803 t fired, .

Time elapsed: 736 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 575/3434 30/32 AutonomousCar-PT-10a-LTLFireability-13 4597992 m, 9124 m/sec, 34854371 t fired, .

Time elapsed: 741 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 581/3434 31/32 AutonomousCar-PT-10a-LTLFireability-13 4636316 m, 7664 m/sec, 35166432 t fired, .

Time elapsed: 747 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 586/3434 31/32 AutonomousCar-PT-10a-LTLFireability-13 4677613 m, 8259 m/sec, 35438726 t fired, .

Time elapsed: 752 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 591/3434 31/32 AutonomousCar-PT-10a-LTLFireability-13 4710941 m, 6665 m/sec, 35669183 t fired, .

Time elapsed: 757 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 596/3434 31/32 AutonomousCar-PT-10a-LTLFireability-13 4753926 m, 8597 m/sec, 35988619 t fired, .

Time elapsed: 762 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 601/3434 32/32 AutonomousCar-PT-10a-LTLFireability-13 4790569 m, 7328 m/sec, 36317781 t fired, .

Time elapsed: 767 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 606/3434 32/32 AutonomousCar-PT-10a-LTLFireability-13 4828377 m, 7561 m/sec, 36645259 t fired, .

Time elapsed: 772 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 611/3434 32/32 AutonomousCar-PT-10a-LTLFireability-13 4874883 m, 9301 m/sec, 36909969 t fired, .

Time elapsed: 777 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 616/3434 32/32 AutonomousCar-PT-10a-LTLFireability-13 4926606 m, 10344 m/sec, 37236186 t fired, .

Time elapsed: 782 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 11 (type EXCL) for AutonomousCar-PT-10a-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-10a-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0
AutonomousCar-PT-10a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 787 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-10a-LTLFireability-02: LTL unknown AGGR
AutonomousCar-PT-10a-LTLFireability-11: CONJ unknown CONJ
AutonomousCar-PT-10a-LTLFireability-13: LTL unknown AGGR
AutonomousCar-PT-10a-LTLFireability-15: LTL unknown AGGR


Time elapsed: 787 secs. Pages in use: 32

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-10a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is AutonomousCar-PT-10a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-oct2-167813595900676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-10a.tgz
mv AutonomousCar-PT-10a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;