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.r009-oct2-167813598200676.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 ltsminxred
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 r009-oct2-167813598200676
=====================================================================

--------------------
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 1678641574308

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:19:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:19:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:19:37] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2023-03-12 17:19:37] [INFO ] Transformed 97 places.
[2023-03-12 17:19:37] [INFO ] Transformed 1921 transitions.
[2023-03-12 17:19:37] [INFO ] Found NUPN structural information;
[2023-03-12 17:19:37] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 311 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 46 ms. Remains 91 /97 variables (removed 6) and now considering 1442/1498 (removed 56) transitions.
// Phase 1: matrix 1442 rows 91 cols
[2023-03-12 17:19:37] [INFO ] Computed 14 place invariants in 40 ms
[2023-03-12 17:19:37] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-12 17:19:37] [INFO ] Invariant cache hit.
[2023-03-12 17:19:38] [INFO ] State equation strengthened by 353 read => feed constraints.
[2023-03-12 17:19:38] [INFO ] Implicit Places using invariants and state equation in 661 ms returned [87, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 985 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 7 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 1039 ms. Remains : 89/97 places, 1442/1498 transitions.
Support contains 47 out of 89 places after structural reductions.
[2023-03-12 17:19:39] [INFO ] Flatten gal took : 394 ms
[2023-03-12 17:19:39] [INFO ] Flatten gal took : 209 ms
[2023-03-12 17:19:39] [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 456 resets, run finished after 687 ms. (steps per millisecond=14 ) properties (out of 37) seen :9
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) 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 28) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) 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 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) 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 26) 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 26) 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 26) 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 26) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 25) 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 25) seen :0
Running SMT prover for 25 properties.
// Phase 1: matrix 1442 rows 89 cols
[2023-03-12 17:19:40] [INFO ] Computed 12 place invariants in 19 ms
[2023-03-12 17:19:41] [INFO ] [Real]Absence check using 12 positive place invariants in 23 ms returned sat
[2023-03-12 17:19:43] [INFO ] After 1490ms SMT Verify possible using state equation in real domain returned unsat :0 sat :21 real:4
[2023-03-12 17:19:43] [INFO ] State equation strengthened by 353 read => feed constraints.
[2023-03-12 17:19:44] [INFO ] After 1078ms SMT Verify possible using 353 Read/Feed constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-12 17:19:44] [INFO ] After 2851ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-12 17:19:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:19:45] [INFO ] After 1320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-12 17:19:46] [INFO ] After 989ms SMT Verify possible using 353 Read/Feed constraints in natural domain returned unsat :0 sat :25
[2023-03-12 17:19:48] [INFO ] After 2728ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 1078 ms.
[2023-03-12 17:19:49] [INFO ] After 5353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Parikh walk visited 0 properties in 1745 ms.
Support contains 36 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.20 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 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 26 place count 75 transition count 1395
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 75 transition count 1395
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 74 transition count 1394
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 39 place count 74 transition count 1387
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 47 rules applied. Total rules applied 86 place count 67 transition count 1347
Applied a total of 86 rules in 417 ms. Remains 67 /89 variables (removed 22) and now considering 1347/1442 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 417 ms. Remains : 67/89 places, 1347/1442 transitions.
Incomplete random walk after 10000 steps, including 52 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 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 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 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 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 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 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) 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 24) 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 24) 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 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 :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 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 :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 457973 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 457973 steps, saw 70813 distinct states, run finished after 3004 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 1347 rows 67 cols
[2023-03-12 17:19:55] [INFO ] Computed 14 place invariants in 12 ms
[2023-03-12 17:19:55] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-12 17:19:57] [INFO ] After 1111ms SMT Verify possible using state equation in real domain returned unsat :0 sat :19 real:5
[2023-03-12 17:19:57] [INFO ] State equation strengthened by 281 read => feed constraints.
[2023-03-12 17:19:58] [INFO ] After 1011ms SMT Verify possible using 281 Read/Feed constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-12 17:19:58] [INFO ] After 2402ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-12 17:19:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-12 17:19:59] [INFO ] After 1486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-12 17:20:00] [INFO ] After 1025ms SMT Verify possible using 281 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-03-12 17:20:02] [INFO ] After 2651ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 1088 ms.
[2023-03-12 17:20:03] [INFO ] After 5438ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 1 properties in 1302 ms.
Support contains 36 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 1347/1347 transitions.
Applied a total of 0 rules in 72 ms. Remains 67 /67 variables (removed 0) and now considering 1347/1347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 67/67 places, 1347/1347 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) 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 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 4 resets, run finished after 4 ms. (steps per millisecond=250 ) 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 :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 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 4 ms. (steps per millisecond=250 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) 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 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) 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 21) seen :0
Interrupted probabilistic random walk after 461186 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :{}
Probabilistic random walk after 461186 steps, saw 71244 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
Running SMT prover for 21 properties.
[2023-03-12 17:20:08] [INFO ] Invariant cache hit.
[2023-03-12 17:20:08] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-12 17:20:10] [INFO ] After 960ms SMT Verify possible using state equation in real domain returned unsat :0 sat :17 real:4
[2023-03-12 17:20:10] [INFO ] State equation strengthened by 281 read => feed constraints.
[2023-03-12 17:20:10] [INFO ] After 464ms SMT Verify possible using 281 Read/Feed constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-12 17:20:10] [INFO ] After 1684ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-12 17:20:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:11] [INFO ] After 965ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-12 17:20:12] [INFO ] After 668ms SMT Verify possible using 281 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2023-03-12 17:20:13] [INFO ] After 1890ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 580 ms.
[2023-03-12 17:20:14] [INFO ] After 3614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Parikh walk visited 0 properties in 934 ms.
Support contains 36 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 1347/1347 transitions.
Applied a total of 0 rules in 66 ms. Remains 67 /67 variables (removed 0) and now considering 1347/1347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 67/67 places, 1347/1347 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 21) 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 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 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 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 4 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 6 ms. (steps per millisecond=166 ) properties (out of 21) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 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 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :2
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 1000 steps, including 3 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 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
Running SMT prover for 16 properties.
[2023-03-12 17:20:15] [INFO ] Invariant cache hit.
[2023-03-12 17:20:16] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:16] [INFO ] After 555ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:10
[2023-03-12 17:20:16] [INFO ] State equation strengthened by 281 read => feed constraints.
[2023-03-12 17:20:17] [INFO ] After 354ms SMT Verify possible using 281 Read/Feed constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-12 17:20:17] [INFO ] After 1074ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-12 17:20:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:18] [INFO ] After 953ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-12 17:20:18] [INFO ] After 403ms SMT Verify possible using 281 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-12 17:20:19] [INFO ] After 1605ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 477 ms.
[2023-03-12 17:20:20] [INFO ] After 3205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 959 ms.
Support contains 34 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 1347/1347 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 66 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 1336
Applied a total of 2 rules in 74 ms. Remains 66 /67 variables (removed 1) and now considering 1336/1347 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 66/67 places, 1336/1347 transitions.
Incomplete random walk after 10000 steps, including 120 resets, run finished after 414 ms. (steps per millisecond=24 ) 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 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 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 :1
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 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 2 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 2 resets, run finished after 3 ms. (steps per millisecond=333 ) 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
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
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
Interrupted probabilistic random walk after 428304 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 428304 steps, saw 66705 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 1336 rows 66 cols
[2023-03-12 17:20:24] [INFO ] Computed 14 place invariants in 8 ms
[2023-03-12 17:20:25] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:25] [INFO ] After 394ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:11
[2023-03-12 17:20:25] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 17:20:25] [INFO ] After 206ms SMT Verify possible using 271 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-12 17:20:25] [INFO ] After 831ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-12 17:20:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:26] [INFO ] After 646ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-12 17:20:27] [INFO ] After 507ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-12 17:20:27] [INFO ] After 1306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 304 ms.
[2023-03-12 17:20:28] [INFO ] After 2344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 683 ms.
Support contains 34 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 1336/1336 transitions.
Applied a total of 0 rules in 65 ms. Remains 66 /66 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 66/66 places, 1336/1336 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 390 ms. (steps per millisecond=25 ) 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
Incomplete Best-First random walk after 1001 steps, including 4 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 2 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 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
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 2 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 :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 :0
Incomplete Best-First random walk after 1000 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
Interrupted probabilistic random walk after 402379 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 402379 steps, saw 63495 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-12 17:20:32] [INFO ] Invariant cache hit.
[2023-03-12 17:20:32] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:33] [INFO ] After 561ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:9
[2023-03-12 17:20:33] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 17:20:33] [INFO ] After 311ms SMT Verify possible using 271 Read/Feed constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-12 17:20:33] [INFO ] After 961ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-12 17:20:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:34] [INFO ] After 849ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-12 17:20:35] [INFO ] After 672ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-12 17:20:36] [INFO ] After 1849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 657 ms.
[2023-03-12 17:20:37] [INFO ] After 3514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 617 ms.
Support contains 33 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 1336/1336 transitions.
Applied a total of 0 rules in 70 ms. Remains 66 /66 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 66/66 places, 1336/1336 transitions.
Incomplete random walk after 10000 steps, including 176 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :2
Running SMT prover for 6 properties.
[2023-03-12 17:20:38] [INFO ] Invariant cache hit.
[2023-03-12 17:20:38] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:39] [INFO ] After 519ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:1
[2023-03-12 17:20:39] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 17:20:39] [INFO ] After 186ms SMT Verify possible using 271 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 17:20:39] [INFO ] After 778ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 17:20:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 24 ms returned sat
[2023-03-12 17:20:40] [INFO ] After 589ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 17:20:40] [INFO ] After 300ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 17:20:40] [INFO ] After 624ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-12 17:20:41] [INFO ] After 1470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 240 ms.
Support contains 20 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 1336/1336 transitions.
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 66 transition count 1333
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 26 place count 63 transition count 1313
Applied a total of 26 rules in 136 ms. Remains 63 /66 variables (removed 3) and now considering 1313/1336 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 63/66 places, 1313/1336 transitions.
Incomplete random walk after 10000 steps, including 25 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1313 rows 63 cols
[2023-03-12 17:20:42] [INFO ] Computed 14 place invariants in 7 ms
[2023-03-12 17:20:42] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:42] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:20:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:42] [INFO ] After 507ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 17:20:42] [INFO ] State equation strengthened by 251 read => feed constraints.
[2023-03-12 17:20:43] [INFO ] After 197ms SMT Verify possible using 251 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 17:20:43] [INFO ] After 390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-12 17:20:43] [INFO ] After 1043ms 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 98 ms.
Support contains 9 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 1313/1313 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 61 transition count 1311
Applied a total of 4 rules in 99 ms. Remains 61 /63 variables (removed 2) and now considering 1311/1313 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 61/63 places, 1311/1313 transitions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 544104 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 544104 steps, saw 84515 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1311 rows 61 cols
[2023-03-12 17:20:47] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-12 17:20:47] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-12 17:20:47] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:20:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:47] [INFO ] After 545ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 17:20:47] [INFO ] State equation strengthened by 251 read => feed constraints.
[2023-03-12 17:20:48] [INFO ] After 306ms SMT Verify possible using 251 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 17:20:48] [INFO ] After 735ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 252 ms.
[2023-03-12 17:20:48] [INFO ] After 1646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 252 ms.
Support contains 9 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1311/1311 transitions.
Applied a total of 0 rules in 118 ms. Remains 61 /61 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 61/61 places, 1311/1311 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1311/1311 transitions.
Applied a total of 0 rules in 105 ms. Remains 61 /61 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
[2023-03-12 17:20:49] [INFO ] Invariant cache hit.
[2023-03-12 17:20:50] [INFO ] Implicit Places using invariants in 1022 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1024 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/61 places, 1311/1311 transitions.
Applied a total of 0 rules in 73 ms. Remains 60 /60 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1202 ms. Remains : 60/61 places, 1311/1311 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 556841 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 556841 steps, saw 86443 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1311 rows 60 cols
[2023-03-12 17:20:53] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-12 17:20:54] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:54] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:20:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-03-12 17:20:54] [INFO ] After 471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 17:20:54] [INFO ] State equation strengthened by 251 read => feed constraints.
[2023-03-12 17:20:54] [INFO ] After 178ms SMT Verify possible using 251 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 17:20:55] [INFO ] After 472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-12 17:20:55] [INFO ] After 1199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 131 ms.
Support contains 9 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1311/1311 transitions.
Applied a total of 0 rules in 90 ms. Remains 60 /60 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 60/60 places, 1311/1311 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1311/1311 transitions.
Applied a total of 0 rules in 103 ms. Remains 60 /60 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
[2023-03-12 17:20:55] [INFO ] Invariant cache hit.
[2023-03-12 17:20:56] [INFO ] Implicit Places using invariants in 888 ms returned []
[2023-03-12 17:20:56] [INFO ] Invariant cache hit.
[2023-03-12 17:20:56] [INFO ] State equation strengthened by 251 read => feed constraints.
[2023-03-12 17:20:57] [INFO ] Implicit Places using invariants and state equation in 1243 ms returned []
Implicit Place search using SMT with State Equation took 2159 ms to find 0 implicit places.
[2023-03-12 17:20:57] [INFO ] Redundant transitions in 86 ms returned []
[2023-03-12 17:20:57] [INFO ] Invariant cache hit.
[2023-03-12 17:20:58] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2776 ms. Remains : 60/60 places, 1311/1311 transitions.
Applied a total of 0 rules in 66 ms. Remains 60 /60 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-12 17:20:58] [INFO ] Invariant cache hit.
[2023-03-12 17:20:58] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-12 17:20:58] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:20:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:59] [INFO ] After 562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 17:20:59] [INFO ] After 785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 174 ms.
[2023-03-12 17:20:59] [INFO ] After 1089ms 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 0 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 1 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 240 ms. Remains 71 /89 variables (removed 18) and now considering 1375/1442 (removed 67) transitions.
// Phase 1: matrix 1375 rows 71 cols
[2023-03-12 17:21:00] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-12 17:21:01] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-12 17:21:01] [INFO ] Invariant cache hit.
[2023-03-12 17:21:01] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-12 17:21:01] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
[2023-03-12 17:21:02] [INFO ] Redundant transitions in 240 ms returned []
[2023-03-12 17:21:02] [INFO ] Invariant cache hit.
[2023-03-12 17:21:02] [INFO ] Dead Transitions using invariants and state equation in 517 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 2306 ms. Remains : 71/89 places, 1375/1442 transitions.
Stuttering acceptance computed with spot in 479 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 17 steps with 0 reset in 18 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-01 finished in 2887 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 15 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2023-03-12 17:21:03] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-12 17:21:03] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-12 17:21:03] [INFO ] Invariant cache hit.
[2023-03-12 17:21:03] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-12 17:21:03] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2023-03-12 17:21:03] [INFO ] Invariant cache hit.
[2023-03-12 17:21:04] [INFO ] Dead Transitions using invariants and state equation in 484 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 1189 ms. Remains : 84/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 282 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 3257 reset in 1178 ms.
Product exploration explored 100000 steps with 2175 reset in 764 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 792 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 318 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 465 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 17:21:08] [INFO ] Invariant cache hit.
[2023-03-12 17:21:08] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:21:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:08] [INFO ] After 35ms 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 1072 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 221 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 248 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-12 17:21:10] [INFO ] Invariant cache hit.
[2023-03-12 17:21:10] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-12 17:21:10] [INFO ] Invariant cache hit.
[2023-03-12 17:21:10] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-12 17:21:11] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
[2023-03-12 17:21:11] [INFO ] Invariant cache hit.
[2023-03-12 17:21:11] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1997 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 418 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 173 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 464 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Finished Best-First random walk after 616 steps, including 1 resets, run visited all 4 properties in 3 ms. (steps per millisecond=205 )
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 439 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 164 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 142 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 196 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 321 reset in 150 ms.
Product exploration explored 100000 steps with 3101 reset in 888 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 5 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
[2023-03-12 17:21:15] [INFO ] Invariant cache hit.
[2023-03-12 17:21:15] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-12 17:21:15] [INFO ] Invariant cache hit.
[2023-03-12 17:21:15] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-12 17:21:15] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2023-03-12 17:21:16] [INFO ] Invariant cache hit.
[2023-03-12 17:21:16] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1369 ms. Remains : 84/84 places, 1387/1387 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-02 finished in 13730 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 13 ms. Remains 85 /89 variables (removed 4) and now considering 1398/1442 (removed 44) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2023-03-12 17:21:16] [INFO ] Computed 12 place invariants in 7 ms
[2023-03-12 17:21:18] [INFO ] Implicit Places using invariants in 1101 ms returned []
[2023-03-12 17:21:18] [INFO ] Invariant cache hit.
[2023-03-12 17:21:18] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-12 17:21:19] [INFO ] Implicit Places using invariants and state equation in 1322 ms returned []
Implicit Place search using SMT with State Equation took 2425 ms to find 0 implicit places.
[2023-03-12 17:21:19] [INFO ] Invariant cache hit.
[2023-03-12 17:21:19] [INFO ] Dead Transitions using invariants and state equation in 532 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 2974 ms. Remains : 85/89 places, 1398/1442 transitions.
Stuttering acceptance computed with spot in 154 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 3170 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 12 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2023-03-12 17:21:20] [INFO ] Computed 12 place invariants in 9 ms
[2023-03-12 17:21:20] [INFO ] Implicit Places using invariants in 390 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 417 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 6 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 435 ms. Remains : 83/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 130 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 23 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 583 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 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: 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 144 ms. Remains 72 /89 variables (removed 17) and now considering 1386/1442 (removed 56) transitions.
// Phase 1: matrix 1386 rows 72 cols
[2023-03-12 17:21:20] [INFO ] Computed 12 place invariants in 14 ms
[2023-03-12 17:21:21] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-12 17:21:21] [INFO ] Invariant cache hit.
[2023-03-12 17:21:21] [INFO ] State equation strengthened by 315 read => feed constraints.
[2023-03-12 17:21:21] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 968 ms to find 0 implicit places.
[2023-03-12 17:21:21] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-12 17:21:21] [INFO ] Invariant cache hit.
[2023-03-12 17:21:22] [INFO ] Dead Transitions using invariants and state equation in 488 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 1677 ms. Remains : 72/89 places, 1386/1442 transitions.
Stuttering acceptance computed with spot in 390 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 18 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-05 finished in 2103 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 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 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 158 ms. Remains 71 /89 variables (removed 18) and now considering 1385/1442 (removed 57) transitions.
// Phase 1: matrix 1385 rows 71 cols
[2023-03-12 17:21:22] [INFO ] Computed 12 place invariants in 7 ms
[2023-03-12 17:21:23] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-12 17:21:23] [INFO ] Invariant cache hit.
[2023-03-12 17:21:23] [INFO ] State equation strengthened by 315 read => feed constraints.
[2023-03-12 17:21:24] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1246 ms to find 0 implicit places.
[2023-03-12 17:21:24] [INFO ] Redundant transitions in 115 ms returned []
[2023-03-12 17:21:24] [INFO ] Invariant cache hit.
[2023-03-12 17:21:24] [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 2016 ms. Remains : 71/89 places, 1385/1442 transitions.
Stuttering acceptance computed with spot in 87 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 19 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-06 finished in 2117 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 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 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-12 17:21:25] [INFO ] Computed 12 place invariants in 25 ms
[2023-03-12 17:21:25] [INFO ] Implicit Places using invariants in 246 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 261 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 87 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 513 ms. Remains : 69/89 places, 1374/1442 transitions.
Stuttering acceptance computed with spot in 63 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 516 reset in 238 ms.
Product exploration explored 100000 steps with 1281 reset in 374 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 174 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 139 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 559 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 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 31 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 1374 rows 69 cols
[2023-03-12 17:21:26] [INFO ] Computed 11 place invariants in 8 ms
[2023-03-12 17:21:26] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:21:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-12 17:21:26] [INFO ] After 37ms 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 143 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 2074 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 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: 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 34 place count 72 transition count 1376
Applied a total of 34 rules in 138 ms. Remains 72 /89 variables (removed 17) and now considering 1376/1442 (removed 66) transitions.
// Phase 1: matrix 1376 rows 72 cols
[2023-03-12 17:21:27] [INFO ] Computed 12 place invariants in 19 ms
[2023-03-12 17:21:27] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-12 17:21:27] [INFO ] Invariant cache hit.
[2023-03-12 17:21:28] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-12 17:21:28] [INFO ] Implicit Places using invariants and state equation in 1131 ms returned []
Implicit Place search using SMT with State Equation took 1644 ms to find 0 implicit places.
[2023-03-12 17:21:28] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-12 17:21:28] [INFO ] Invariant cache hit.
[2023-03-12 17:21:29] [INFO ] Dead Transitions using invariants and state equation in 577 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 2440 ms. Remains : 72/89 places, 1376/1442 transitions.
Stuttering acceptance computed with spot in 104 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 17 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 2558 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 0 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 0 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 0 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 222 ms. Remains 69 /89 variables (removed 20) and now considering 1373/1442 (removed 69) transitions.
// Phase 1: matrix 1373 rows 69 cols
[2023-03-12 17:21:29] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-12 17:21:30] [INFO ] Implicit Places using invariants in 806 ms returned []
[2023-03-12 17:21:30] [INFO ] Invariant cache hit.
[2023-03-12 17:21:30] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-12 17:21:32] [INFO ] Implicit Places using invariants and state equation in 1539 ms returned []
Implicit Place search using SMT with State Equation took 2379 ms to find 0 implicit places.
[2023-03-12 17:21:32] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-12 17:21:32] [INFO ] Invariant cache hit.
[2023-03-12 17:21:32] [INFO ] Dead Transitions using invariants and state equation in 495 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 3145 ms. Remains : 69/89 places, 1373/1442 transitions.
Stuttering acceptance computed with spot in 57 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 0 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-09 finished in 3232 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 7 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2023-03-12 17:21:32] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-12 17:21:33] [INFO ] Implicit Places using invariants in 270 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 274 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 3 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 285 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]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-10 finished in 657 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 24 ms. Remains 85 /89 variables (removed 4) and now considering 1398/1442 (removed 44) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2023-03-12 17:21:33] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-12 17:21:33] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-12 17:21:33] [INFO ] Invariant cache hit.
[2023-03-12 17:21:34] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-12 17:21:34] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
[2023-03-12 17:21:34] [INFO ] Invariant cache hit.
[2023-03-12 17:21:35] [INFO ] Dead Transitions using invariants and state equation in 559 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 1925 ms. Remains : 85/89 places, 1398/1442 transitions.
Stuttering acceptance computed with spot in 406 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 7830 reset in 1812 ms.
Product exploration explored 100000 steps with 5048 reset in 1196 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 333 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 393 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 466 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 24 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 24 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 29 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 17:21:39] [INFO ] Invariant cache hit.
[2023-03-12 17:21:39] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:40] [INFO ] After 502ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2023-03-12 17:21:40] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-12 17:21:40] [INFO ] After 56ms SMT Verify possible using 313 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 17:21:40] [INFO ] After 649ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 17:21:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:40] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 17:21:40] [INFO ] After 54ms SMT Verify possible using 313 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 17:21:41] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-12 17:21:41] [INFO ] After 565ms 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 17 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.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 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 205 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 205 ms. Remains : 57/85 places, 1267/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) 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 729050 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 729050 steps, saw 99643 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1267 rows 57 cols
[2023-03-12 17:21:44] [INFO ] Computed 14 place invariants in 13 ms
[2023-03-12 17:21:44] [INFO ] [Real]Absence check using 14 positive place invariants in 71 ms returned sat
[2023-03-12 17:21:44] [INFO ] After 298ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 17:21:44] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-12 17:21:45] [INFO ] After 58ms SMT Verify possible using 211 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:21:45] [INFO ] After 479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:21:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:45] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:21:45] [INFO ] After 38ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:21:45] [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 30 ms.
[2023-03-12 17:21:45] [INFO ] After 703ms 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 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 69 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 72 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 64 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2023-03-12 17:21:45] [INFO ] Invariant cache hit.
[2023-03-12 17:21:46] [INFO ] Implicit Places using invariants in 819 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 70 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 984 ms. Remains : 56/57 places, 1267/1267 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Finished Best-First random walk after 7047 steps, including 18 resets, run visited all 1 properties in 11 ms. (steps per millisecond=640 )
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 p1), (F (AND (NOT p1) p0)), (F p2)]
Knowledge based reduction with 7 factoid took 603 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 286 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 247 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 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-12 17:21:48] [INFO ] Computed 12 place invariants in 13 ms
[2023-03-12 17:21:48] [INFO ] Implicit Places using invariants in 513 ms returned []
[2023-03-12 17:21:48] [INFO ] Invariant cache hit.
[2023-03-12 17:21:48] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-12 17:21:49] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1423 ms to find 0 implicit places.
[2023-03-12 17:21:49] [INFO ] Invariant cache hit.
[2023-03-12 17:21:50] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1971 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 146 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 290 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 461 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 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 26 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-12 17:21:50] [INFO ] Invariant cache hit.
[2023-03-12 17:21:50] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned sat
[2023-03-12 17:21:51] [INFO ] After 411ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 17:21:51] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-12 17:21:51] [INFO ] After 118ms SMT Verify possible using 313 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:21:51] [INFO ] After 586ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:21:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:51] [INFO ] After 370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:21:51] [INFO ] After 58ms SMT Verify possible using 313 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:21:52] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-12 17:21:52] [INFO ] After 549ms 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 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 1 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 256 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 256 ms. Remains : 57/85 places, 1267/1398 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 30 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 739789 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :{}
Probabilistic random walk after 739789 steps, saw 100622 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1267 rows 57 cols
[2023-03-12 17:21:55] [INFO ] Computed 14 place invariants in 13 ms
[2023-03-12 17:21:55] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:55] [INFO ] After 358ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 17:21:55] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-12 17:21:56] [INFO ] After 70ms SMT Verify possible using 211 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:21:56] [INFO ] After 503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:21:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:56] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:21:56] [INFO ] After 48ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:21:56] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-12 17:21:56] [INFO ] After 613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 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 62 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 62 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 60 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2023-03-12 17:21:56] [INFO ] Invariant cache hit.
[2023-03-12 17:21:57] [INFO ] Implicit Places using invariants in 753 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 769 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 92 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 921 ms. Remains : 56/57 places, 1267/1267 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 25 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 748401 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :{}
Probabilistic random walk after 748401 steps, saw 101323 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-12 17:22:00] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-12 17:22:00] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-12 17:22:01] [INFO ] After 356ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 17:22:01] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-12 17:22:01] [INFO ] After 88ms SMT Verify possible using 211 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:22:01] [INFO ] After 533ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:22:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 17:22:01] [INFO ] After 385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:22:01] [INFO ] After 71ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:22:01] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-12 17:22:02] [INFO ] After 687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 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 61 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 61 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-12 17:22:02] [INFO ] Invariant cache hit.
[2023-03-12 17:22:03] [INFO ] Implicit Places using invariants in 1338 ms returned []
[2023-03-12 17:22:03] [INFO ] Invariant cache hit.
[2023-03-12 17:22:03] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-12 17:22:04] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 2340 ms to find 0 implicit places.
[2023-03-12 17:22:04] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-12 17:22:04] [INFO ] Invariant cache hit.
[2023-03-12 17:22:05] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2969 ms. Remains : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 64 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-12 17:22:05] [INFO ] Invariant cache hit.
[2023-03-12 17:22:05] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 17:22:05] [INFO ] After 298ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 17:22:05] [INFO ] After 365ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-12 17:22:05] [INFO ] After 456ms 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 168 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 182 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 268 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 212 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 1265 reset in 422 ms.
Product exploration explored 100000 steps with 1099 reset in 377 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 217 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 0 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 0 ms
Applied a total of 16 rules in 220 ms. Remains 84 /85 variables (removed 1) and now considering 1392/1398 (removed 6) transitions.
[2023-03-12 17:22:07] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 1392 rows 84 cols
[2023-03-12 17:22:07] [INFO ] Computed 12 place invariants in 7 ms
[2023-03-12 17:22:08] [INFO ] Dead Transitions using invariants and state equation in 575 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 839 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 9 ms. Remains 84 /85 variables (removed 1) and now considering 1387/1398 (removed 11) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2023-03-12 17:22:08] [INFO ] Computed 12 place invariants in 13 ms
[2023-03-12 17:22:08] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-12 17:22:08] [INFO ] Invariant cache hit.
[2023-03-12 17:22:09] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-12 17:22:09] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1340 ms to find 0 implicit places.
[2023-03-12 17:22:09] [INFO ] Invariant cache hit.
[2023-03-12 17:22:10] [INFO ] Dead Transitions using invariants and state equation in 495 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 1860 ms. Remains : 84/85 places, 1387/1398 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-11 finished in 37174 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-12 17:22:10] [INFO ] Invariant cache hit.
[2023-03-12 17:22:11] [INFO ] Implicit Places using invariants in 487 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 510 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 5 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 524 ms. Remains : 83/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 110 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 5962 ms.
Product exploration explored 100000 steps with 50000 reset in 6014 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 110 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 12750 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 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 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 2 with 2 rules applied. Total rules applied 36 place count 71 transition count 1375
Applied a total of 36 rules in 161 ms. Remains 71 /89 variables (removed 18) and now considering 1375/1442 (removed 67) transitions.
// Phase 1: matrix 1375 rows 71 cols
[2023-03-12 17:22:23] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-12 17:22:23] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-12 17:22:23] [INFO ] Invariant cache hit.
[2023-03-12 17:22:23] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-12 17:22:24] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2023-03-12 17:22:24] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-12 17:22:24] [INFO ] Invariant cache hit.
[2023-03-12 17:22:24] [INFO ] Dead Transitions using invariants and state equation in 574 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 1566 ms. Remains : 71/89 places, 1375/1442 transitions.
Stuttering acceptance computed with spot in 250 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 33259 reset in 4836 ms.
Product exploration explored 100000 steps with 33206 reset in 4817 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 1653 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 319 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1), (AND (NOT p0) p1 p2)]
Incomplete random walk after 10000 steps, including 558 resets, run finished after 653 ms. (steps per millisecond=15 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :5
Running SMT prover for 6 properties.
[2023-03-12 17:22:38] [INFO ] Invariant cache hit.
[2023-03-12 17:22:38] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:22:39] [INFO ] After 603ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-12 17:22:39] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-12 17:22:39] [INFO ] After 59ms SMT Verify possible using 305 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 17:22:39] [INFO ] After 796ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 17:22:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:22:40] [INFO ] After 536ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-12 17:22:40] [INFO ] After 207ms SMT Verify possible using 305 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2023-03-12 17:22:40] [INFO ] After 428ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-12 17:22:40] [INFO ] After 1176ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 83 ms.
Support contains 22 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
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 142 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 142 ms. Remains : 59/71 places, 1270/1375 transitions.
Incomplete random walk after 10000 steps, including 59 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 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-12 17:22:41] [INFO ] Computed 13 place invariants in 17 ms
[2023-03-12 17:22:41] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:22:41] [INFO ] [Real]Absence check using 12 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 17:22:41] [INFO ] After 395ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 17:22:41] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-12 17:22:41] [INFO ] After 54ms SMT Verify possible using 212 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:22:41] [INFO ] After 521ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:22:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:22:41] [INFO ] [Nat]Absence check using 12 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 17:22:42] [INFO ] After 379ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:22:42] [INFO ] After 54ms SMT Verify possible using 212 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:22:42] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-12 17:22:42] [INFO ] After 562ms 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 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 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 1268
Applied a total of 4 rules in 92 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 92 ms. Remains : 57/59 places, 1268/1270 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 144 ms. (steps per millisecond=69 ) 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 724004 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :{}
Probabilistic random walk after 724004 steps, saw 99690 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1268 rows 57 cols
[2023-03-12 17:22:45] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-12 17:22:45] [INFO ] [Real]Absence check using 12 positive place invariants in 47 ms returned sat
[2023-03-12 17:22:45] [INFO ] [Real]Absence check using 12 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 17:22:46] [INFO ] After 382ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 17:22:46] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-12 17:22:46] [INFO ] After 53ms SMT Verify possible using 212 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:22:46] [INFO ] After 547ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:22:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:22:46] [INFO ] [Nat]Absence check using 12 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 17:22:46] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:22:46] [INFO ] After 66ms SMT Verify possible using 212 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:22:46] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-12 17:22:46] [INFO ] After 622ms 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 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 69 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 69 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 61 ms. Remains 57 /57 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
[2023-03-12 17:22:47] [INFO ] Invariant cache hit.
[2023-03-12 17:22:47] [INFO ] Implicit Places using invariants in 963 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 980 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 76 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 1117 ms. Remains : 56/57 places, 1268/1268 transitions.
Incomplete random walk after 10000 steps, including 69 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 716754 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :{}
Probabilistic random walk after 716754 steps, saw 98474 distinct states, run finished after 3001 ms. (steps per millisecond=238 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1268 rows 56 cols
[2023-03-12 17:22:51] [INFO ] Computed 12 place invariants in 10 ms
[2023-03-12 17:22:51] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 17:22:51] [INFO ] After 473ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 17:22:51] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-12 17:22:51] [INFO ] After 60ms SMT Verify possible using 212 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:22:51] [INFO ] After 601ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:22:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:22:52] [INFO ] After 445ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:22:52] [INFO ] After 41ms SMT Verify possible using 212 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:22:52] [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 48 ms.
[2023-03-12 17:22:52] [INFO ] After 658ms 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, 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 61 ms. Remains 56 /56 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
[2023-03-12 17:22:52] [INFO ] Invariant cache hit.
[2023-03-12 17:22:53] [INFO ] Implicit Places using invariants in 879 ms returned []
[2023-03-12 17:22:53] [INFO ] Invariant cache hit.
[2023-03-12 17:22:53] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-12 17:22:54] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 2106 ms to find 0 implicit places.
[2023-03-12 17:22:54] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-12 17:22:54] [INFO ] Invariant cache hit.
[2023-03-12 17:22:55] [INFO ] Dead Transitions using invariants and state equation in 459 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2727 ms. Remains : 56/56 places, 1268/1268 transitions.
Applied a total of 0 rules in 58 ms. Remains 56 /56 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-12 17:22:55] [INFO ] Invariant cache hit.
[2023-03-12 17:22:55] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-12 17:22:55] [INFO ] After 336ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 17:22:55] [INFO ] After 386ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-12 17:22:55] [INFO ] After 496ms 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 1758 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 178 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 144 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 88 ms. Remains 71 /71 variables (removed 0) and now considering 1375/1375 (removed 0) transitions.
// Phase 1: matrix 1375 rows 71 cols
[2023-03-12 17:22:58] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-12 17:22:58] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-12 17:22:58] [INFO ] Invariant cache hit.
[2023-03-12 17:22:58] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-12 17:22:58] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
[2023-03-12 17:22:59] [INFO ] Redundant transitions in 122 ms returned []
[2023-03-12 17:22:59] [INFO ] Invariant cache hit.
[2023-03-12 17:22:59] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1663 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 549 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 186 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 553 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 29 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 40 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 28 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-12 17:23:00] [INFO ] Invariant cache hit.
[2023-03-12 17:23:00] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:23:01] [INFO ] After 418ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 17:23:01] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-12 17:23:01] [INFO ] After 71ms SMT Verify possible using 305 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:23:01] [INFO ] After 516ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:23:01] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:23:01] [INFO ] After 449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:23:01] [INFO ] After 69ms SMT Verify possible using 305 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:23:02] [INFO ] After 124ms 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-12 17:23:02] [INFO ] After 628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 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 186 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 186 ms. Remains : 57/71 places, 1268/1375 transitions.
Incomplete random walk after 10000 steps, including 77 resets, run finished after 139 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 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 725614 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :{}
Probabilistic random walk after 725614 steps, saw 99971 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1268 rows 57 cols
[2023-03-12 17:23:05] [INFO ] Computed 13 place invariants in 7 ms
[2023-03-12 17:23:05] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:23:05] [INFO ] [Real]Absence check using 12 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 17:23:05] [INFO ] After 333ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 17:23:05] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-12 17:23:05] [INFO ] After 48ms SMT Verify possible using 212 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:23:05] [INFO ] After 410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:23:05] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:23:05] [INFO ] [Nat]Absence check using 12 positive and 1 generalized place invariants in 22 ms returned sat
[2023-03-12 17:23:06] [INFO ] After 363ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:23:06] [INFO ] After 41ms SMT Verify possible using 212 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:23:06] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-12 17:23:06] [INFO ] After 518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 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 66 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 68 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 93 ms. Remains 57 /57 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
[2023-03-12 17:23:06] [INFO ] Invariant cache hit.
[2023-03-12 17:23:07] [INFO ] Implicit Places using invariants in 1000 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1003 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 60 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 1158 ms. Remains : 56/57 places, 1268/1268 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 142 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 743442 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :{}
Probabilistic random walk after 743442 steps, saw 102290 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1268 rows 56 cols
[2023-03-12 17:23:10] [INFO ] Computed 12 place invariants in 10 ms
[2023-03-12 17:23:10] [INFO ] [Real]Absence check using 12 positive place invariants in 42 ms returned sat
[2023-03-12 17:23:11] [INFO ] After 360ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 17:23:11] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-12 17:23:11] [INFO ] After 65ms SMT Verify possible using 212 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:23:11] [INFO ] After 568ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:23:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 18 ms returned sat
[2023-03-12 17:23:11] [INFO ] After 385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:23:11] [INFO ] After 77ms SMT Verify possible using 212 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:23:12] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-12 17:23:12] [INFO ] After 719ms 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 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 67 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 89 ms. Remains 56 /56 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
[2023-03-12 17:23:12] [INFO ] Invariant cache hit.
[2023-03-12 17:23:12] [INFO ] Implicit Places using invariants in 661 ms returned []
[2023-03-12 17:23:12] [INFO ] Invariant cache hit.
[2023-03-12 17:23:13] [INFO ] State equation strengthened by 212 read => feed constraints.
[2023-03-12 17:23:14] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
[2023-03-12 17:23:14] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-12 17:23:14] [INFO ] Invariant cache hit.
[2023-03-12 17:23:14] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2397 ms. Remains : 56/56 places, 1268/1268 transitions.
Applied a total of 0 rules in 64 ms. Remains 56 /56 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-12 17:23:14] [INFO ] Invariant cache hit.
[2023-03-12 17:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned sat
[2023-03-12 17:23:15] [INFO ] After 476ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 17:23:15] [INFO ] After 526ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-12 17:23:15] [INFO ] After 655ms 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 965 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 157 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 179 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 207 ms :[p2, (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Product exploration explored 100000 steps with 151 reset in 101 ms.
Product exploration explored 100000 steps with 123 reset in 103 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 75 ms. Remains 71 /71 variables (removed 0) and now considering 1375/1375 (removed 0) transitions.
// Phase 1: matrix 1375 rows 71 cols
[2023-03-12 17:23:17] [INFO ] Computed 12 place invariants in 10 ms
[2023-03-12 17:23:17] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-12 17:23:17] [INFO ] Invariant cache hit.
[2023-03-12 17:23:17] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-12 17:23:18] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 983 ms to find 0 implicit places.
[2023-03-12 17:23:18] [INFO ] Redundant transitions in 110 ms returned []
[2023-03-12 17:23:18] [INFO ] Invariant cache hit.
[2023-03-12 17:23:18] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1810 ms. Remains : 71/71 places, 1375/1375 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-13 finished in 55779 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 21 ms. Remains 86 /89 variables (removed 3) and now considering 1409/1442 (removed 33) transitions.
// Phase 1: matrix 1409 rows 86 cols
[2023-03-12 17:23:19] [INFO ] Computed 12 place invariants in 7 ms
[2023-03-12 17:23:19] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-12 17:23:19] [INFO ] Invariant cache hit.
[2023-03-12 17:23:19] [INFO ] State equation strengthened by 323 read => feed constraints.
[2023-03-12 17:23:20] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1301 ms to find 0 implicit places.
[2023-03-12 17:23:20] [INFO ] Invariant cache hit.
[2023-03-12 17:23:21] [INFO ] Dead Transitions using invariants and state equation in 716 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 2049 ms. Remains : 86/89 places, 1409/1442 transitions.
Stuttering acceptance computed with spot in 367 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 6751 ms.
Product exploration explored 100000 steps with 50000 reset in 6750 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 369 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 16361 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 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-12 17:23:35] [INFO ] Computed 12 place invariants in 9 ms
[2023-03-12 17:23:35] [INFO ] Implicit Places using invariants in 496 ms returned []
[2023-03-12 17:23:35] [INFO ] Invariant cache hit.
[2023-03-12 17:23:36] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-12 17:23:36] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1397 ms to find 0 implicit places.
[2023-03-12 17:23:36] [INFO ] Invariant cache hit.
[2023-03-12 17:23:37] [INFO ] Dead Transitions using invariants and state equation in 558 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 1989 ms. Remains : 85/89 places, 1398/1442 transitions.
Stuttering acceptance computed with spot in 352 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 16639 reset in 2793 ms.
Product exploration explored 100000 steps with 16604 reset in 2786 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 378 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 461 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 467 resets, run finished after 563 ms. (steps per millisecond=17 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 223293 steps, run timeout after 3009 ms. (steps per millisecond=74 ) properties seen :{1=1}
Probabilistic random walk after 223293 steps, saw 32078 distinct states, run finished after 3014 ms. (steps per millisecond=74 ) properties seen :1
Running SMT prover for 4 properties.
[2023-03-12 17:23:48] [INFO ] Invariant cache hit.
[2023-03-12 17:23:48] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:23:48] [INFO ] After 310ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-12 17:23:48] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-12 17:23:48] [INFO ] After 56ms SMT Verify possible using 313 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 17:23:48] [INFO ] After 435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 17:23:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:23:49] [INFO ] After 681ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-12 17:23:49] [INFO ] After 152ms SMT Verify possible using 313 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-12 17:23:49] [INFO ] After 304ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-12 17:23:49] [INFO ] After 1197ms 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 74 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 1 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 193 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 194 ms. Remains : 59/85 places, 1279/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1279 rows 59 cols
[2023-03-12 17:23:50] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-12 17:23:50] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:23:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 1 ms returned sat
[2023-03-12 17:23:51] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:23:51] [INFO ] State equation strengthened by 221 read => feed constraints.
[2023-03-12 17:23:51] [INFO ] After 156ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:23:51] [INFO ] After 315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-12 17:23:51] [INFO ] After 1039ms 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 97 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 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 1277
Applied a total of 4 rules in 99 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 112 ms. Remains : 57/59 places, 1277/1279 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
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
Interrupted probabilistic random walk after 416506 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{}
Probabilistic random walk after 416506 steps, saw 50276 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1277 rows 57 cols
[2023-03-12 17:23:55] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-12 17:23:55] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:23:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-12 17:23:55] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:23:55] [INFO ] State equation strengthened by 221 read => feed constraints.
[2023-03-12 17:23:55] [INFO ] After 53ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:23:55] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-12 17:23:55] [INFO ] After 576ms 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 16 ms.
Support contains 6 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1277/1277 transitions.
Applied a total of 0 rules in 62 ms. Remains 57 /57 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 57/57 places, 1277/1277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1277/1277 transitions.
Applied a total of 0 rules in 63 ms. Remains 57 /57 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
[2023-03-12 17:23:56] [INFO ] Invariant cache hit.
[2023-03-12 17:23:56] [INFO ] Implicit Places using invariants in 539 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 541 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 56/57 places, 1277/1277 transitions.
Applied a total of 0 rules in 61 ms. Remains 56 /56 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 665 ms. Remains : 56/57 places, 1277/1277 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 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 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 567495 steps, run timeout after 3004 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 567495 steps, saw 68011 distinct states, run finished after 3004 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1277 rows 56 cols
[2023-03-12 17:23:59] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-12 17:24:00] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:24:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 17:24:00] [INFO ] After 483ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:24:00] [INFO ] State equation strengthened by 221 read => feed constraints.
[2023-03-12 17:24:00] [INFO ] After 48ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:24:00] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-12 17:24:00] [INFO ] After 757ms 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 21 ms.
Support contains 6 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1277/1277 transitions.
Applied a total of 0 rules in 64 ms. Remains 56 /56 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 56/56 places, 1277/1277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1277/1277 transitions.
Applied a total of 0 rules in 66 ms. Remains 56 /56 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
[2023-03-12 17:24:00] [INFO ] Invariant cache hit.
[2023-03-12 17:24:01] [INFO ] Implicit Places using invariants in 884 ms returned []
[2023-03-12 17:24:01] [INFO ] Invariant cache hit.
[2023-03-12 17:24:02] [INFO ] State equation strengthened by 221 read => feed constraints.
[2023-03-12 17:24:03] [INFO ] Implicit Places using invariants and state equation in 1289 ms returned []
Implicit Place search using SMT with State Equation took 2195 ms to find 0 implicit places.
[2023-03-12 17:24:03] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-12 17:24:03] [INFO ] Invariant cache hit.
[2023-03-12 17:24:03] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2804 ms. Remains : 56/56 places, 1277/1277 transitions.
Applied a total of 0 rules in 76 ms. Remains 56 /56 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-12 17:24:03] [INFO ] Invariant cache hit.
[2023-03-12 17:24:03] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:24:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-12 17:24:04] [INFO ] After 383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:24:04] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-12 17:24:04] [INFO ] After 654ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
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 p0), (F p2)]
Knowledge based reduction with 6 factoid took 470 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 220 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 264 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 5 ms. Remains 85 /85 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2023-03-12 17:24:05] [INFO ] Computed 12 place invariants in 7 ms
[2023-03-12 17:24:05] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-12 17:24:05] [INFO ] Invariant cache hit.
[2023-03-12 17:24:06] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-12 17:24:06] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1339 ms to find 0 implicit places.
[2023-03-12 17:24:06] [INFO ] Invariant cache hit.
[2023-03-12 17:24:07] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1961 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 193 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 258 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 464 resets, run finished after 747 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 17:24:08] [INFO ] Invariant cache hit.
[2023-03-12 17:24:08] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:24:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 28 ms returned sat
[2023-03-12 17:24:09] [INFO ] After 483ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:24:09] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-12 17:24:09] [INFO ] After 53ms SMT Verify possible using 313 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:24:09] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-12 17:24:09] [INFO ] After 713ms 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.19 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.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 73 transition count 1383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 73 transition count 1382
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 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 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 2 with 6 rules applied. Total rules applied 38 place count 67 transition count 1367
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 48 place count 67 transition count 1357
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 148 place count 57 transition count 1267
Applied a total of 148 rules in 236 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 236 ms. Remains : 57/85 places, 1267/1398 transitions.
Incomplete random walk after 10000 steps, including 4 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 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 700560 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :{}
Probabilistic random walk after 700560 steps, saw 96715 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1267 rows 57 cols
[2023-03-12 17:24:12] [INFO ] Computed 14 place invariants in 9 ms
[2023-03-12 17:24:13] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:24:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-12 17:24:13] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:24:13] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-12 17:24:13] [INFO ] After 56ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:24:13] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-12 17:24:13] [INFO ] After 566ms 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, 1267/1267 transitions.
Applied a total of 0 rules in 74 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 78 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 60 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2023-03-12 17:24:13] [INFO ] Invariant cache hit.
[2023-03-12 17:24:14] [INFO ] Implicit Places using invariants in 788 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 798 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 103 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 961 ms. Remains : 56/57 places, 1267/1267 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 698863 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :{}
Probabilistic random walk after 698863 steps, saw 96475 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1267 rows 56 cols
[2023-03-12 17:24:17] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-12 17:24:17] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:24:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 17:24:18] [INFO ] After 412ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:24:18] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-12 17:24:18] [INFO ] After 114ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:24:18] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-12 17:24:18] [INFO ] After 734ms 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, 1267/1267 transitions.
Applied a total of 0 rules in 66 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 72 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-12 17:24:18] [INFO ] Invariant cache hit.
[2023-03-12 17:24:19] [INFO ] Implicit Places using invariants in 804 ms returned []
[2023-03-12 17:24:19] [INFO ] Invariant cache hit.
[2023-03-12 17:24:20] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-12 17:24:20] [INFO ] Implicit Places using invariants and state equation in 1359 ms returned []
Implicit Place search using SMT with State Equation took 2170 ms to find 0 implicit places.
[2023-03-12 17:24:20] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-12 17:24:21] [INFO ] Invariant cache hit.
[2023-03-12 17:24:21] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3000 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-12 17:24:21] [INFO ] Invariant cache hit.
[2023-03-12 17:24:21] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:24:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-03-12 17:24:22] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:24:22] [INFO ] After 446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-12 17:24:22] [INFO ] After 565ms 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 348 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 311 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 16632 reset in 2756 ms.
Product exploration explored 100000 steps with 16669 reset in 2757 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 297 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 0 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 0 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 1 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 163 ms. Remains 84 /85 variables (removed 1) and now considering 1392/1398 (removed 6) transitions.
[2023-03-12 17:24:29] [INFO ] Redundant transitions in 100 ms returned []
// Phase 1: matrix 1392 rows 84 cols
[2023-03-12 17:24:29] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-12 17:24:30] [INFO ] Dead Transitions using invariants and state equation in 456 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 742 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 7 ms. Remains 84 /85 variables (removed 1) and now considering 1387/1398 (removed 11) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2023-03-12 17:24:30] [INFO ] Computed 12 place invariants in 18 ms
[2023-03-12 17:24:30] [INFO ] Implicit Places using invariants in 452 ms returned []
[2023-03-12 17:24:30] [INFO ] Invariant cache hit.
[2023-03-12 17:24:31] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-12 17:24:31] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
[2023-03-12 17:24:31] [INFO ] Invariant cache hit.
[2023-03-12 17:24:32] [INFO ] Dead Transitions using invariants and state equation in 493 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 1833 ms. Remains : 84/85 places, 1387/1398 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-15 finished in 56963 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 283 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 0 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 118 ms. Remains 70 /89 variables (removed 19) and now considering 1374/1442 (removed 68) transitions.
// Phase 1: matrix 1374 rows 70 cols
[2023-03-12 17:24:32] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-12 17:24:33] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-12 17:24:33] [INFO ] Invariant cache hit.
[2023-03-12 17:24:33] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-12 17:24:33] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
[2023-03-12 17:24:33] [INFO ] Invariant cache hit.
[2023-03-12 17:24:34] [INFO ] Dead Transitions using invariants and state equation in 507 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 1601 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 1018 reset in 333 ms.
Product exploration explored 100000 steps with 80 reset in 91 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 525 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 227 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 547 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 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 13 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 17:24:36] [INFO ] Invariant cache hit.
[2023-03-12 17:24:36] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:24:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:24:36] [INFO ] After 65ms 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 829 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 197 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 134 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 4 ms. Remains 70 /70 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
[2023-03-12 17:24:37] [INFO ] Invariant cache hit.
[2023-03-12 17:24:37] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-12 17:24:37] [INFO ] Invariant cache hit.
[2023-03-12 17:24:38] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-12 17:24:38] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 993 ms to find 0 implicit places.
[2023-03-12 17:24:38] [INFO ] Invariant cache hit.
[2023-03-12 17:24:38] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1542 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 353 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 174 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 568 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Finished Best-First random walk after 395 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=197 )
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 548 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 202 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 168 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 198 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 3477 reset in 995 ms.
Product exploration explored 100000 steps with 266 reset in 158 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-12 17:24:42] [INFO ] Invariant cache hit.
[2023-03-12 17:24:42] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-12 17:24:42] [INFO ] Invariant cache hit.
[2023-03-12 17:24:42] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-12 17:24:43] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
[2023-03-12 17:24:43] [INFO ] Invariant cache hit.
[2023-03-12 17:24:43] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1560 ms. Remains : 70/70 places, 1374/1374 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-02 finished in 11603 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-12 17:24:44] [INFO ] Flatten gal took : 172 ms
[2023-03-12 17:24:44] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 14 ms.
[2023-03-12 17:24:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 89 places, 1442 transitions and 25487 arcs took 14 ms.
Total runtime 307749 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2857/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2857/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2857/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2857/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-10a-LTLFireability-02
Could not compute solution for formula : AutonomousCar-PT-10a-LTLFireability-11
Could not compute solution for formula : AutonomousCar-PT-10a-LTLFireability-13
Could not compute solution for formula : AutonomousCar-PT-10a-LTLFireability-15

BK_STOP 1678641888372

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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
mcc2023
ltl formula name AutonomousCar-PT-10a-LTLFireability-02
ltl formula formula --ltl=/tmp/2857/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 89 places, 1442 transitions and 25487 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.090 user 0.110 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2857/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2857/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2857/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2857/ltl_0_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name AutonomousCar-PT-10a-LTLFireability-11
ltl formula formula --ltl=/tmp/2857/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 89 places, 1442 transitions and 25487 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.420 real 0.090 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2857/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2857/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2857/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2857/ltl_1_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
ltl formula name AutonomousCar-PT-10a-LTLFireability-13
ltl formula formula --ltl=/tmp/2857/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 89 places, 1442 transitions and 25487 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.350 real 0.120 user 0.180 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2857/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2857/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2857/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2857/ltl_2_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name AutonomousCar-PT-10a-LTLFireability-15
ltl formula formula --ltl=/tmp/2857/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 89 places, 1442 transitions and 25487 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.120 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2857/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2857/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2857/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2857/ltl_3_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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="ltsminxred"
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 ltsminxred"
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 r009-oct2-167813598200676"
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 ;