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-167813598200660.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-09a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598200660
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 12:53 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 781K 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-09a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678640000280

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-09a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:53:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:53:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:53:23] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2023-03-12 16:53:23] [INFO ] Transformed 89 places.
[2023-03-12 16:53:23] [INFO ] Transformed 1249 transitions.
[2023-03-12 16:53:23] [INFO ] Found NUPN structural information;
[2023-03-12 16:53:23] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 406 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 345 transitions
Reduce redundant transitions removed 345 transitions.
FORMULA AutonomousCar-PT-09a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 904/904 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 85 transition count 873
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 85 transition count 873
Applied a total of 8 rules in 72 ms. Remains 85 /89 variables (removed 4) and now considering 873/904 (removed 31) transitions.
// Phase 1: matrix 873 rows 85 cols
[2023-03-12 16:53:24] [INFO ] Computed 13 place invariants in 51 ms
[2023-03-12 16:53:24] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-12 16:53:24] [INFO ] Invariant cache hit.
[2023-03-12 16:53:25] [INFO ] State equation strengthened by 300 read => feed constraints.
[2023-03-12 16:53:25] [INFO ] Implicit Places using invariants and state equation in 486 ms returned [81, 83]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 956 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/89 places, 873/904 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 873/873 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1034 ms. Remains : 83/89 places, 873/904 transitions.
Support contains 48 out of 83 places after structural reductions.
[2023-03-12 16:53:25] [INFO ] Flatten gal took : 324 ms
[2023-03-12 16:53:25] [INFO ] Flatten gal took : 201 ms
[2023-03-12 16:53:26] [INFO ] Input system was already deterministic with 873 transitions.
Incomplete random walk after 10000 steps, including 498 resets, run finished after 681 ms. (steps per millisecond=14 ) properties (out of 34) seen :7
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 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 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 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 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 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 :1
Incomplete Best-First random walk after 1001 steps, including 3 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 3 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 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) 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 26) 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 26) 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 26) 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 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 3 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 3 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 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :2
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) 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 23) 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 23) seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 873 rows 83 cols
[2023-03-12 16:53:27] [INFO ] Computed 11 place invariants in 8 ms
[2023-03-12 16:53:27] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 16:53:28] [INFO ] After 925ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-12 16:53:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-12 16:53:31] [INFO ] After 2899ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :21
[2023-03-12 16:53:31] [INFO ] State equation strengthened by 300 read => feed constraints.
[2023-03-12 16:53:34] [INFO ] After 2489ms SMT Verify possible using 300 Read/Feed constraints in natural domain returned unsat :2 sat :21
[2023-03-12 16:53:37] [INFO ] After 5898ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :21
Attempting to minimize the solution found.
Minimization took 2536 ms.
[2023-03-12 16:53:40] [INFO ] After 11787ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :21
Fused 23 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 684 ms.
Support contains 40 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 873/873 transitions.
Graph (complete) has 1001 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 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 82 transition count 865
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 78 transition count 863
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 76 transition count 863
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 76 transition count 860
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 73 transition count 860
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 71 transition count 849
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 71 transition count 849
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 34 place count 71 transition count 841
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 78 place count 63 transition count 805
Applied a total of 78 rules in 210 ms. Remains 63 /83 variables (removed 20) and now considering 805/873 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 63/83 places, 805/873 transitions.
Incomplete random walk after 10000 steps, including 149 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 21) seen :5
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 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 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) 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 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 :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 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 2 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 4 resets, run finished after 3 ms. (steps per millisecond=333 ) 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 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 805 rows 63 cols
[2023-03-12 16:53:41] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-12 16:53:42] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-12 16:53:42] [INFO ] After 508ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-12 16:53:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-12 16:53:44] [INFO ] After 1992ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-12 16:53:44] [INFO ] State equation strengthened by 253 read => feed constraints.
[2023-03-12 16:53:46] [INFO ] After 1557ms SMT Verify possible using 253 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-12 16:53:48] [INFO ] After 3477ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1683 ms.
[2023-03-12 16:53:49] [INFO ] After 7348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 1 properties in 253 ms.
Support contains 36 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 805/805 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 804
Applied a total of 2 rules in 45 ms. Remains 62 /63 variables (removed 1) and now considering 804/805 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 62/63 places, 804/805 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :2
Running SMT prover for 6 properties.
// Phase 1: matrix 804 rows 62 cols
[2023-03-12 16:53:51] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-12 16:53:51] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 16:53:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 16:53:52] [INFO ] After 1019ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 16:53:52] [INFO ] State equation strengthened by 253 read => feed constraints.
[2023-03-12 16:53:52] [INFO ] After 582ms SMT Verify possible using 253 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 16:53:53] [INFO ] After 1295ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 692 ms.
[2023-03-12 16:53:54] [INFO ] After 3092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 69 ms.
Support contains 20 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 804/804 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 60 transition count 784
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 60 transition count 784
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 60 transition count 782
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 26 place count 58 transition count 764
Applied a total of 26 rules in 85 ms. Remains 58 /62 variables (removed 4) and now considering 764/804 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 58/62 places, 764/804 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 437039 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 437039 steps, saw 66763 distinct states, run finished after 3003 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 764 rows 58 cols
[2023-03-12 16:53:58] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-12 16:53:58] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 16:53:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-12 16:53:59] [INFO ] After 804ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 16:53:59] [INFO ] State equation strengthened by 217 read => feed constraints.
[2023-03-12 16:53:59] [INFO ] After 676ms SMT Verify possible using 217 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 16:54:00] [INFO ] After 1436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 623 ms.
[2023-03-12 16:54:01] [INFO ] After 2981ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 487 ms.
Support contains 20 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 764/764 transitions.
Applied a total of 0 rules in 35 ms. Remains 58 /58 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 58/58 places, 764/764 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 764/764 transitions.
Applied a total of 0 rules in 31 ms. Remains 58 /58 variables (removed 0) and now considering 764/764 (removed 0) transitions.
[2023-03-12 16:54:01] [INFO ] Invariant cache hit.
[2023-03-12 16:54:01] [INFO ] Implicit Places using invariants in 275 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 281 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 57/58 places, 764/764 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 56 transition count 763
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 56 transition count 763
Applied a total of 2 rules in 78 ms. Remains 56 /57 variables (removed 1) and now considering 763/764 (removed 1) transitions.
// Phase 1: matrix 763 rows 56 cols
[2023-03-12 16:54:02] [INFO ] Computed 12 place invariants in 11 ms
[2023-03-12 16:54:02] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-12 16:54:02] [INFO ] Invariant cache hit.
[2023-03-12 16:54:02] [INFO ] State equation strengthened by 217 read => feed constraints.
[2023-03-12 16:54:03] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 1002 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 56/58 places, 763/764 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1392 ms. Remains : 56/58 places, 763/764 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 436721 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 436721 steps, saw 66707 distinct states, run finished after 3003 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 16:54:06] [INFO ] Invariant cache hit.
[2023-03-12 16:54:06] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 16:54:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 16:54:07] [INFO ] After 771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 16:54:07] [INFO ] State equation strengthened by 217 read => feed constraints.
[2023-03-12 16:54:08] [INFO ] After 624ms SMT Verify possible using 217 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 16:54:09] [INFO ] After 1502ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 611 ms.
[2023-03-12 16:54:09] [INFO ] After 2960ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 81 ms.
Support contains 20 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 763/763 transitions.
Applied a total of 0 rules in 34 ms. Remains 56 /56 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 56/56 places, 763/763 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 763/763 transitions.
Applied a total of 0 rules in 35 ms. Remains 56 /56 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2023-03-12 16:54:09] [INFO ] Invariant cache hit.
[2023-03-12 16:54:10] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-12 16:54:10] [INFO ] Invariant cache hit.
[2023-03-12 16:54:10] [INFO ] State equation strengthened by 217 read => feed constraints.
[2023-03-12 16:54:10] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2023-03-12 16:54:10] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-12 16:54:10] [INFO ] Invariant cache hit.
[2023-03-12 16:54:11] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1346 ms. Remains : 56/56 places, 763/763 transitions.
Applied a total of 0 rules in 30 ms. Remains 56 /56 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-12 16:54:11] [INFO ] Invariant cache hit.
[2023-03-12 16:54:11] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 16:54:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-12 16:54:12] [INFO ] After 706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 16:54:12] [INFO ] After 1427ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 672 ms.
[2023-03-12 16:54:13] [INFO ] After 2161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA AutonomousCar-PT-09a-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA AutonomousCar-PT-09a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 2 stable transitions
FORMULA AutonomousCar-PT-09a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 823
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 823
Applied a total of 10 rules in 12 ms. Remains 78 /83 variables (removed 5) and now considering 823/873 (removed 50) transitions.
// Phase 1: matrix 823 rows 78 cols
[2023-03-12 16:54:14] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-12 16:54:14] [INFO ] Implicit Places using invariants in 641 ms returned []
[2023-03-12 16:54:14] [INFO ] Invariant cache hit.
[2023-03-12 16:54:15] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 16:54:15] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1714 ms to find 0 implicit places.
[2023-03-12 16:54:15] [INFO ] Invariant cache hit.
[2023-03-12 16:54:16] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/83 places, 823/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2515 ms. Remains : 78/83 places, 823/873 transitions.
Stuttering acceptance computed with spot in 384 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-00 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 s1 1) (EQ s10 1) (EQ s47 1) (EQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 18 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-00 finished in 3000 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' '!(((p0 U !p1)&&X((p2||X(X(F(p1)))))))'
Support contains 19 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 823
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 823
Applied a total of 10 rules in 9 ms. Remains 78 /83 variables (removed 5) and now considering 823/873 (removed 50) transitions.
// Phase 1: matrix 823 rows 78 cols
[2023-03-12 16:54:17] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-12 16:54:17] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-12 16:54:17] [INFO ] Invariant cache hit.
[2023-03-12 16:54:17] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 16:54:18] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
[2023-03-12 16:54:18] [INFO ] Invariant cache hit.
[2023-03-12 16:54:18] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/83 places, 823/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1465 ms. Remains : 78/83 places, 823/873 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p2) p1), true, p1, (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s18 1) (EQ s22 1) (EQ s30 1) (EQ s36 1) (EQ s40 1) (EQ s46 1) (EQ s55 1) (EQ s59 1) (EQ s67 1) (EQ s74 1)), p0:(AND (EQ s16 1) (EQ s24 1) (EQ ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-01 finished in 1778 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((X((G(p1)||X(G(p2))))||p0))))'
Support contains 6 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 823
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 823
Applied a total of 10 rules in 8 ms. Remains 78 /83 variables (removed 5) and now considering 823/873 (removed 50) transitions.
// Phase 1: matrix 823 rows 78 cols
[2023-03-12 16:54:18] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-12 16:54:19] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-12 16:54:19] [INFO ] Invariant cache hit.
[2023-03-12 16:54:19] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 16:54:20] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1435 ms to find 0 implicit places.
[2023-03-12 16:54:20] [INFO ] Invariant cache hit.
[2023-03-12 16:54:20] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/83 places, 823/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1947 ms. Remains : 78/83 places, 823/873 transitions.
Stuttering acceptance computed with spot in 394 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(OR (EQ s1 0) (EQ s6 0) (EQ s23 0) (EQ s73 0)), p0:(OR (EQ s1 0) (EQ s6 0) (EQ s23 0) (EQ s73 0)), p2:(OR (EQ s1 0) (EQ s12 0) (EQ s21 0) (EQ s73 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 794 reset in 330 ms.
Product exploration explored 100000 steps with 727 reset in 318 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 p1 p0 p2), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 296 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 406 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 488 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 16:54:23] [INFO ] Invariant cache hit.
[2023-03-12 16:54:23] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 16:54:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 16:54:23] [INFO ] After 614ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-12 16:54:23] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 16:54:24] [INFO ] After 431ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-12 16:54:24] [INFO ] After 814ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 332 ms.
[2023-03-12 16:54:25] [INFO ] After 1892ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 343 ms.
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 823/823 transitions.
Graph (complete) has 946 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 77 transition count 808
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 66 transition count 808
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 66 transition count 807
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 65 transition count 807
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 64 transition count 806
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 64 transition count 806
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 36 place count 61 transition count 803
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 61 transition count 794
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 135 place count 52 transition count 713
Applied a total of 135 rules in 187 ms. Remains 52 /78 variables (removed 26) and now considering 713/823 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 52/78 places, 713/823 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 470313 steps, run timeout after 3004 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 470313 steps, saw 58712 distinct states, run finished after 3004 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 713 rows 52 cols
[2023-03-12 16:54:29] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-12 16:54:29] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 16:54:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 16:54:29] [INFO ] After 458ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 16:54:29] [INFO ] State equation strengthened by 172 read => feed constraints.
[2023-03-12 16:54:30] [INFO ] After 237ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 16:54:30] [INFO ] After 566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 376 ms.
[2023-03-12 16:54:30] [INFO ] After 1489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 94 ms.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 40 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 52/52 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 36 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2023-03-12 16:54:30] [INFO ] Invariant cache hit.
[2023-03-12 16:54:31] [INFO ] Implicit Places using invariants in 525 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 528 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/52 places, 713/713 transitions.
Applied a total of 0 rules in 34 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 600 ms. Remains : 51/52 places, 713/713 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 578935 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :{}
Probabilistic random walk after 578935 steps, saw 71297 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 713 rows 51 cols
[2023-03-12 16:54:34] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-12 16:54:34] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 16:54:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 14 ms returned sat
[2023-03-12 16:54:35] [INFO ] After 482ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 16:54:35] [INFO ] State equation strengthened by 172 read => feed constraints.
[2023-03-12 16:54:35] [INFO ] After 320ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 16:54:36] [INFO ] After 658ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 245 ms.
[2023-03-12 16:54:36] [INFO ] After 1459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 33 ms.
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 45 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 51/51 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 32 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2023-03-12 16:54:36] [INFO ] Invariant cache hit.
[2023-03-12 16:54:36] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-12 16:54:36] [INFO ] Invariant cache hit.
[2023-03-12 16:54:37] [INFO ] State equation strengthened by 172 read => feed constraints.
[2023-03-12 16:54:37] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1231 ms to find 0 implicit places.
[2023-03-12 16:54:37] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-12 16:54:37] [INFO ] Invariant cache hit.
[2023-03-12 16:54:38] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1683 ms. Remains : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 32 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-12 16:54:38] [INFO ] Invariant cache hit.
[2023-03-12 16:54:38] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 16:54:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 16:54:38] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 16:54:39] [INFO ] After 772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 291 ms.
[2023-03-12 16:54:39] [INFO ] After 1157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p1)), (X (X p0)), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT (AND p2 p1))), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 535 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 516 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 407 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 823/823 (removed 0) transitions.
// Phase 1: matrix 823 rows 78 cols
[2023-03-12 16:54:40] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-12 16:54:42] [INFO ] Implicit Places using invariants in 1350 ms returned []
[2023-03-12 16:54:42] [INFO ] Invariant cache hit.
[2023-03-12 16:54:42] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 16:54:43] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 2312 ms to find 0 implicit places.
[2023-03-12 16:54:43] [INFO ] Invariant cache hit.
[2023-03-12 16:54:45] [INFO ] Dead Transitions using invariants and state equation in 2716 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5033 ms. Remains : 78/78 places, 823/823 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 p2 p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 307 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 470 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 483 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 16:54:47] [INFO ] Invariant cache hit.
[2023-03-12 16:54:47] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:54:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 16:54:47] [INFO ] After 643ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:54:47] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 16:54:48] [INFO ] After 312ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:54:48] [INFO ] After 571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 237 ms.
[2023-03-12 16:54:48] [INFO ] After 1520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 95 ms.
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 823/823 transitions.
Graph (complete) has 946 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 77 transition count 808
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 66 transition count 808
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 66 transition count 807
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 28 place count 65 transition count 807
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 64 transition count 806
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 64 transition count 806
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 36 place count 61 transition count 803
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 61 transition count 794
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 135 place count 52 transition count 713
Applied a total of 135 rules in 128 ms. Remains 52 /78 variables (removed 26) and now considering 713/823 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 52/78 places, 713/823 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 715362 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :{}
Probabilistic random walk after 715362 steps, saw 87673 distinct states, run finished after 3001 ms. (steps per millisecond=238 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 713 rows 52 cols
[2023-03-12 16:54:52] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-12 16:54:52] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:54:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 16:54:52] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:54:52] [INFO ] State equation strengthened by 172 read => feed constraints.
[2023-03-12 16:54:52] [INFO ] After 151ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:54:53] [INFO ] After 441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 216 ms.
[2023-03-12 16:54:53] [INFO ] After 1011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 37 ms.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 58 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 52/52 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 29 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2023-03-12 16:54:53] [INFO ] Invariant cache hit.
[2023-03-12 16:54:53] [INFO ] Implicit Places using invariants in 350 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 366 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/52 places, 713/713 transitions.
Applied a total of 0 rules in 35 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 430 ms. Remains : 51/52 places, 713/713 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 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 43 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 795320 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :{}
Probabilistic random walk after 795320 steps, saw 96807 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 713 rows 51 cols
[2023-03-12 16:54:57] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 16:54:57] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:54:57] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 16:54:57] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:54:57] [INFO ] State equation strengthened by 172 read => feed constraints.
[2023-03-12 16:54:57] [INFO ] After 142ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:54:57] [INFO ] After 289ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 142 ms.
[2023-03-12 16:54:58] [INFO ] After 763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 32 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 35 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 51/51 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 31 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2023-03-12 16:54:58] [INFO ] Invariant cache hit.
[2023-03-12 16:54:58] [INFO ] Implicit Places using invariants in 557 ms returned []
[2023-03-12 16:54:58] [INFO ] Invariant cache hit.
[2023-03-12 16:54:59] [INFO ] State equation strengthened by 172 read => feed constraints.
[2023-03-12 16:54:59] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 1577 ms to find 0 implicit places.
[2023-03-12 16:54:59] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-12 16:54:59] [INFO ] Invariant cache hit.
[2023-03-12 16:55:00] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2120 ms. Remains : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 29 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-12 16:55:00] [INFO ] Invariant cache hit.
[2023-03-12 16:55:00] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:55:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 16 ms returned sat
[2023-03-12 16:55:00] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:55:01] [INFO ] After 596ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-12 16:55:01] [INFO ] After 835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 381 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 516 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 480 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 354 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 1558 reset in 326 ms.
Product exploration explored 100000 steps with 880 reset in 222 ms.
Applying partial POR strategy [true, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 435 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 78 transition count 823
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 11 place count 78 transition count 825
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 78 transition count 825
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 78 transition count 825
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 77 transition count 824
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 77 transition count 824
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 17 place count 77 transition count 827
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 17 rules in 193 ms. Remains 77 /78 variables (removed 1) and now considering 827/823 (removed -4) transitions.
[2023-03-12 16:55:04] [INFO ] Redundant transitions in 178 ms returned []
// Phase 1: matrix 827 rows 77 cols
[2023-03-12 16:55:04] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-12 16:55:09] [INFO ] Dead Transitions using invariants and state equation in 4607 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/78 places, 827/823 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5004 ms. Remains : 77/78 places, 827/823 transitions.
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Applied a total of 0 rules in 15 ms. Remains 78 /78 variables (removed 0) and now considering 823/823 (removed 0) transitions.
// Phase 1: matrix 823 rows 78 cols
[2023-03-12 16:55:09] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 16:55:09] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-12 16:55:09] [INFO ] Invariant cache hit.
[2023-03-12 16:55:10] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 16:55:10] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1475 ms to find 0 implicit places.
[2023-03-12 16:55:10] [INFO ] Invariant cache hit.
[2023-03-12 16:55:11] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2286 ms. Remains : 78/78 places, 823/823 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-02 finished in 52933 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)))'
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 823
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 823
Applied a total of 10 rules in 6 ms. Remains 78 /83 variables (removed 5) and now considering 823/873 (removed 50) transitions.
// Phase 1: matrix 823 rows 78 cols
[2023-03-12 16:55:11] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 16:55:12] [INFO ] Implicit Places using invariants in 506 ms returned []
[2023-03-12 16:55:12] [INFO ] Invariant cache hit.
[2023-03-12 16:55:12] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 16:55:13] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1397 ms to find 0 implicit places.
[2023-03-12 16:55:13] [INFO ] Invariant cache hit.
[2023-03-12 16:55:13] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/83 places, 823/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1800 ms. Remains : 78/83 places, 823/873 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s1 1) (NEQ s7 1) (NEQ s65 1) (NEQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 1353 reset in 342 ms.
Product exploration explored 100000 steps with 629 reset in 186 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 290 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 477 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 83176 steps, run visited all 1 properties in 252 ms. (steps per millisecond=330 )
Probabilistic random walk after 83176 steps, saw 13579 distinct states, run finished after 252 ms. (steps per millisecond=330 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 223 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Applied a total of 0 rules in 5 ms. Remains 78 /78 variables (removed 0) and now considering 823/823 (removed 0) transitions.
[2023-03-12 16:55:15] [INFO ] Invariant cache hit.
[2023-03-12 16:55:16] [INFO ] Implicit Places using invariants in 571 ms returned []
[2023-03-12 16:55:16] [INFO ] Invariant cache hit.
[2023-03-12 16:55:16] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 16:55:17] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 1758 ms to find 0 implicit places.
[2023-03-12 16:55:17] [INFO ] Invariant cache hit.
[2023-03-12 16:55:18] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2595 ms. Remains : 78/78 places, 823/823 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 212 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 496 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 83176 steps, run visited all 1 properties in 258 ms. (steps per millisecond=322 )
Probabilistic random walk after 83176 steps, saw 13579 distinct states, run finished after 258 ms. (steps per millisecond=322 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 334 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 445 reset in 149 ms.
Product exploration explored 100000 steps with 320 reset in 155 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 78 transition count 823
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 11 place count 78 transition count 825
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 78 transition count 825
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 78 transition count 825
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 77 transition count 824
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 77 transition count 824
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 77 transition count 827
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 17 rules in 158 ms. Remains 77 /78 variables (removed 1) and now considering 827/823 (removed -4) transitions.
[2023-03-12 16:55:20] [INFO ] Redundant transitions in 43 ms returned []
// Phase 1: matrix 827 rows 77 cols
[2023-03-12 16:55:20] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 16:55:21] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/78 places, 827/823 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 547 ms. Remains : 77/78 places, 827/823 transitions.
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 823/823 (removed 0) transitions.
// Phase 1: matrix 823 rows 78 cols
[2023-03-12 16:55:21] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 16:55:21] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-12 16:55:21] [INFO ] Invariant cache hit.
[2023-03-12 16:55:21] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 16:55:22] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1562 ms to find 0 implicit places.
[2023-03-12 16:55:22] [INFO ] Invariant cache hit.
[2023-03-12 16:55:23] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2292 ms. Remains : 78/78 places, 823/823 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-03 finished in 11740 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||G(p1)))))'
Support contains 6 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 823
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 823
Applied a total of 10 rules in 7 ms. Remains 78 /83 variables (removed 5) and now considering 823/873 (removed 50) transitions.
// Phase 1: matrix 823 rows 78 cols
[2023-03-12 16:55:23] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 16:55:24] [INFO ] Implicit Places using invariants in 528 ms returned []
[2023-03-12 16:55:24] [INFO ] Invariant cache hit.
[2023-03-12 16:55:24] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 16:55:25] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned []
Implicit Place search using SMT with State Equation took 1622 ms to find 0 implicit places.
[2023-03-12 16:55:25] [INFO ] Invariant cache hit.
[2023-03-12 16:55:25] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/83 places, 823/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2174 ms. Remains : 78/83 places, 823/873 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (NEQ s1 1) (NEQ s6 1) (NEQ s43 1) (NEQ s73 1)), p0:(AND (EQ s1 1) (EQ s11 1) (EQ s53 1) (EQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 477 reset in 158 ms.
Product exploration explored 100000 steps with 41 reset in 74 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 p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 649 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 495 resets, run finished after 137 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 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1002416 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :{}
Probabilistic random walk after 1002416 steps, saw 130563 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:55:30] [INFO ] Invariant cache hit.
[2023-03-12 16:55:30] [INFO ] [Real]Absence check using 11 positive place invariants in 22 ms returned sat
[2023-03-12 16:55:30] [INFO ] After 714ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:55:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 16:55:31] [INFO ] After 915ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:55:31] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 16:55:32] [INFO ] After 189ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:55:32] [INFO ] After 298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-12 16:55:32] [INFO ] After 1397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 823/823 transitions.
Graph (complete) has 946 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 77 transition count 809
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 24 place count 67 transition count 809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24 place count 67 transition count 808
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 26 place count 66 transition count 808
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 64 transition count 797
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 64 transition count 797
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 36 place count 61 transition count 794
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 61 transition count 785
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 81 rules applied. Total rules applied 126 place count 52 transition count 713
Applied a total of 126 rules in 150 ms. Remains 52 /78 variables (removed 26) and now considering 713/823 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 52/78 places, 713/823 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1115153 steps, run visited all 1 properties in 2898 ms. (steps per millisecond=384 )
Probabilistic random walk after 1115153 steps, saw 138148 distinct states, run finished after 2898 ms. (steps per millisecond=384 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 767 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p1), (NOT p1)]
Support contains 4 out of 78 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 823/823 (removed 0) transitions.
[2023-03-12 16:55:36] [INFO ] Invariant cache hit.
[2023-03-12 16:55:37] [INFO ] Implicit Places using invariants in 1320 ms returned []
[2023-03-12 16:55:37] [INFO ] Invariant cache hit.
[2023-03-12 16:55:38] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 16:55:39] [INFO ] Implicit Places using invariants and state equation in 1157 ms returned []
Implicit Place search using SMT with State Equation took 2494 ms to find 0 implicit places.
[2023-03-12 16:55:39] [INFO ] Invariant cache hit.
[2023-03-12 16:55:39] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3040 ms. Remains : 78/78 places, 823/823 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 : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 484 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 934931 steps, run timeout after 3001 ms. (steps per millisecond=311 ) properties seen :{}
Probabilistic random walk after 934931 steps, saw 121217 distinct states, run finished after 3011 ms. (steps per millisecond=310 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:55:43] [INFO ] Invariant cache hit.
[2023-03-12 16:55:43] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 16:55:43] [INFO ] After 452ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:55:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2023-03-12 16:55:44] [INFO ] After 685ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:55:44] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 16:55:44] [INFO ] After 158ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:55:44] [INFO ] After 306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-12 16:55:44] [INFO ] After 1237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 823/823 transitions.
Graph (complete) has 946 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 77 transition count 809
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 24 place count 67 transition count 809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24 place count 67 transition count 808
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 26 place count 66 transition count 808
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 64 transition count 797
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 64 transition count 797
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 36 place count 61 transition count 794
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 61 transition count 785
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 81 rules applied. Total rules applied 126 place count 52 transition count 713
Applied a total of 126 rules in 124 ms. Remains 52 /78 variables (removed 26) and now considering 713/823 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 52/78 places, 713/823 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1115153 steps, run visited all 1 properties in 2858 ms. (steps per millisecond=390 )
Probabilistic random walk after 1115153 steps, saw 138148 distinct states, run finished after 2871 ms. (steps per millisecond=388 ) properties seen :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 311 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 790 reset in 219 ms.
Product exploration explored 100000 steps with 496 reset in 138 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p1), (NOT p1)]
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 823/823 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 78 transition count 823
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 78 transition count 825
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 78 transition count 825
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 77 transition count 815
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 77 transition count 815
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 77 transition count 815
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 76 transition count 814
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 76 transition count 814
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 76 transition count 817
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 18 rules in 143 ms. Remains 76 /78 variables (removed 2) and now considering 817/823 (removed 6) transitions.
[2023-03-12 16:55:49] [INFO ] Redundant transitions in 51 ms returned []
// Phase 1: matrix 817 rows 76 cols
[2023-03-12 16:55:49] [INFO ] Computed 11 place invariants in 9 ms
[2023-03-12 16:55:50] [INFO ] Dead Transitions using invariants and state equation in 1074 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/78 places, 817/823 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1290 ms. Remains : 76/78 places, 817/823 transitions.
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 77 transition count 813
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 77 transition count 813
Applied a total of 2 rules in 6 ms. Remains 77 /78 variables (removed 1) and now considering 813/823 (removed 10) transitions.
// Phase 1: matrix 813 rows 77 cols
[2023-03-12 16:55:50] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:55:51] [INFO ] Implicit Places using invariants in 1076 ms returned []
[2023-03-12 16:55:51] [INFO ] Invariant cache hit.
[2023-03-12 16:55:52] [INFO ] State equation strengthened by 246 read => feed constraints.
[2023-03-12 16:55:52] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 2042 ms to find 0 implicit places.
[2023-03-12 16:55:52] [INFO ] Invariant cache hit.
[2023-03-12 16:55:53] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 77/78 places, 813/823 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2454 ms. Remains : 77/78 places, 813/823 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-07 finished in 29789 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((F((X(X(F(p2)))||p1))&&p0)))'
Support contains 19 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 77 transition count 813
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 77 transition count 813
Applied a total of 12 rules in 6 ms. Remains 77 /83 variables (removed 6) and now considering 813/873 (removed 60) transitions.
[2023-03-12 16:55:53] [INFO ] Invariant cache hit.
[2023-03-12 16:55:53] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-12 16:55:53] [INFO ] Invariant cache hit.
[2023-03-12 16:55:54] [INFO ] State equation strengthened by 246 read => feed constraints.
[2023-03-12 16:55:54] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
[2023-03-12 16:55:54] [INFO ] Invariant cache hit.
[2023-03-12 16:55:54] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 77/83 places, 813/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1191 ms. Remains : 77/83 places, 813/873 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1 0) (EQ s5 0) (EQ s61 0) (EQ s72 0) (AND (EQ s16 1) (EQ s24 1) (EQ s28 1) (EQ s34 1) (EQ s42 1) (EQ s48 1) (EQ s52 1) (EQ s60 1) (EQ s64 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][false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-09 finished in 1377 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)&&F(G(p1)))))'
Support contains 14 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 873/873 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 83 transition count 864
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 74 transition count 864
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 74 transition count 862
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 72 transition count 862
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 67 transition count 812
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 67 transition count 812
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 66 transition count 811
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 65 transition count 811
Applied a total of 36 rules in 165 ms. Remains 65 /83 variables (removed 18) and now considering 811/873 (removed 62) transitions.
// Phase 1: matrix 811 rows 65 cols
[2023-03-12 16:55:54] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-12 16:55:55] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-12 16:55:55] [INFO ] Invariant cache hit.
[2023-03-12 16:55:55] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-12 16:55:56] [INFO ] Implicit Places using invariants and state equation in 1074 ms returned []
Implicit Place search using SMT with State Equation took 1494 ms to find 0 implicit places.
[2023-03-12 16:55:56] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-12 16:55:56] [INFO ] Invariant cache hit.
[2023-03-12 16:55:57] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/83 places, 811/873 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2393 ms. Remains : 65/83 places, 811/873 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), 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 (NEQ s1 1) (NEQ s6 1) (NEQ s48 1) (NEQ s61 1)), p1:(OR (NEQ s16 1) (NEQ s21 1) (NEQ s26 1) (NEQ s29 1) (NEQ s34 1) (NEQ s39 1) (NEQ s46 1) (NEQ s52...], 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 1575 steps with 85 reset in 16 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-10 finished in 2578 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((X(p1)&&(p2 U p3)&&p0))))'
Support contains 8 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 823
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 823
Applied a total of 10 rules in 7 ms. Remains 78 /83 variables (removed 5) and now considering 823/873 (removed 50) transitions.
// Phase 1: matrix 823 rows 78 cols
[2023-03-12 16:55:57] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-12 16:55:57] [INFO ] Implicit Places using invariants in 549 ms returned []
[2023-03-12 16:55:57] [INFO ] Invariant cache hit.
[2023-03-12 16:55:58] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 16:55:59] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 1681 ms to find 0 implicit places.
[2023-03-12 16:55:59] [INFO ] Invariant cache hit.
[2023-03-12 16:56:00] [INFO ] Dead Transitions using invariants and state equation in 1550 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/83 places, 823/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3239 ms. Remains : 78/83 places, 823/873 transitions.
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p0) (NOT p3) (NOT p1)), true, (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2)), (NOT p3)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p3) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p0 p3 (NOT p1)) (AND p0 p2 (NOT p1))), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s8 1) (EQ s57 1) (EQ s73 1)), p3:(AND (EQ s1 1) (EQ s11 1) (EQ s17 1) (EQ s73 1)), p2:(AND (EQ s1 1) (EQ s8 1) (EQ s57 1) (EQ s73 1)...], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-11 finished in 3596 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)) U p1))'
Support contains 14 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 873/873 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 83 transition count 864
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 74 transition count 864
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 74 transition count 862
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 72 transition count 862
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 66 transition count 802
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 66 transition count 802
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 65 transition count 801
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 64 transition count 801
Applied a total of 38 rules in 76 ms. Remains 64 /83 variables (removed 19) and now considering 801/873 (removed 72) transitions.
// Phase 1: matrix 801 rows 64 cols
[2023-03-12 16:56:01] [INFO ] Computed 11 place invariants in 11 ms
[2023-03-12 16:56:01] [INFO ] Implicit Places using invariants in 859 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 873 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/83 places, 801/873 transitions.
Applied a total of 0 rules in 48 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 997 ms. Remains : 63/83 places, 801/873 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), p0]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s13 1) (EQ s20 1) (EQ s23 1) (EQ s28 1) (EQ s35 1) (EQ s40 1) (EQ s43 1) (EQ s48 1) (EQ s55 1) (EQ s60 1)), p0:(AND (EQ s15 1) (EQ s18 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 29 reset in 99 ms.
Product exploration explored 100000 steps with 408 reset in 150 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 (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 350 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), p0]
Incomplete random walk after 10000 steps, including 583 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Finished Best-First random walk after 4986 steps, including 21 resets, run visited all 1 properties in 7 ms. (steps per millisecond=712 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 397 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), p0]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), p0]
// Phase 1: matrix 801 rows 63 cols
[2023-03-12 16:56:03] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-12 16:56:05] [INFO ] [Real]Absence check using 10 positive place invariants in 91 ms returned sat
[2023-03-12 16:56:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:56:05] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2023-03-12 16:56:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:56:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-12 16:56:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:56:06] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2023-03-12 16:56:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:56:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 16:56:06] [INFO ] Computed and/alt/rep : 4/7/4 causal constraints (skipped 796 transitions) in 291 ms.
[2023-03-12 16:56:06] [INFO ] Added : 2 causal constraints over 1 iterations in 397 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 14 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 801/801 transitions.
Applied a total of 0 rules in 37 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-12 16:56:06] [INFO ] Invariant cache hit.
[2023-03-12 16:56:07] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-12 16:56:07] [INFO ] Invariant cache hit.
[2023-03-12 16:56:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:56:07] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
[2023-03-12 16:56:07] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-12 16:56:07] [INFO ] Invariant cache hit.
[2023-03-12 16:56:08] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1385 ms. Remains : 63/63 places, 801/801 transitions.
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 (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 242 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), p0]
Incomplete random walk after 10000 steps, including 594 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Finished Best-First random walk after 7347 steps, including 31 resets, run visited all 1 properties in 10 ms. (steps per millisecond=734 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 389 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), p0]
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), p0]
[2023-03-12 16:56:09] [INFO ] Invariant cache hit.
[2023-03-12 16:56:10] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-12 16:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:56:10] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2023-03-12 16:56:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:56:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-12 16:56:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:56:12] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2023-03-12 16:56:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:56:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2023-03-12 16:56:12] [INFO ] Computed and/alt/rep : 4/7/4 causal constraints (skipped 796 transitions) in 413 ms.
[2023-03-12 16:56:12] [INFO ] Added : 2 causal constraints over 1 iterations in 538 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), p0]
Product exploration explored 100000 steps with 235 reset in 119 ms.
Product exploration explored 100000 steps with 93 reset in 65 ms.
Support contains 14 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 801/801 transitions.
Applied a total of 0 rules in 47 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-12 16:56:13] [INFO ] Invariant cache hit.
[2023-03-12 16:56:13] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-12 16:56:13] [INFO ] Invariant cache hit.
[2023-03-12 16:56:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:56:13] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
[2023-03-12 16:56:14] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-12 16:56:14] [INFO ] Invariant cache hit.
[2023-03-12 16:56:14] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1419 ms. Remains : 63/63 places, 801/801 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-12 finished in 13571 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)))'
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 12 rules applied. Total rules applied 12 place count 81 transition count 861
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 70 transition count 861
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 23 place count 70 transition count 860
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 25 place count 69 transition count 860
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 30 place count 64 transition count 810
Iterating global reduction 2 with 5 rules applied. Total rules applied 35 place count 64 transition count 810
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 39 place count 62 transition count 808
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 41 place count 61 transition count 808
Applied a total of 41 rules in 69 ms. Remains 61 /83 variables (removed 22) and now considering 808/873 (removed 65) transitions.
// Phase 1: matrix 808 rows 61 cols
[2023-03-12 16:56:14] [INFO ] Computed 10 place invariants in 7 ms
[2023-03-12 16:56:15] [INFO ] Implicit Places using invariants in 648 ms returned []
[2023-03-12 16:56:15] [INFO ] Invariant cache hit.
[2023-03-12 16:56:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:56:16] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1565 ms to find 0 implicit places.
[2023-03-12 16:56:16] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-12 16:56:16] [INFO ] Invariant cache hit.
[2023-03-12 16:56:17] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/83 places, 808/873 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2591 ms. Remains : 61/83 places, 808/873 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s48 0)], 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 2077 reset in 264 ms.
Product exploration explored 100000 steps with 1773 reset in 207 ms.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 335 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Finished random walk after 25 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 808/808 transitions.
Applied a total of 0 rules in 46 ms. Remains 61 /61 variables (removed 0) and now considering 808/808 (removed 0) transitions.
[2023-03-12 16:56:18] [INFO ] Invariant cache hit.
[2023-03-12 16:56:19] [INFO ] Implicit Places using invariants in 699 ms returned []
[2023-03-12 16:56:19] [INFO ] Invariant cache hit.
[2023-03-12 16:56:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:56:20] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1453 ms to find 0 implicit places.
[2023-03-12 16:56:20] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-12 16:56:20] [INFO ] Invariant cache hit.
[2023-03-12 16:56:20] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2125 ms. Remains : 61/61 places, 808/808 transitions.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 220 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1182 reset in 174 ms.
Product exploration explored 100000 steps with 7363 reset in 566 ms.
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 808/808 transitions.
Applied a total of 0 rules in 42 ms. Remains 61 /61 variables (removed 0) and now considering 808/808 (removed 0) transitions.
[2023-03-12 16:56:22] [INFO ] Invariant cache hit.
[2023-03-12 16:56:23] [INFO ] Implicit Places using invariants in 503 ms returned []
[2023-03-12 16:56:23] [INFO ] Invariant cache hit.
[2023-03-12 16:56:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:56:23] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1279 ms to find 0 implicit places.
[2023-03-12 16:56:23] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-12 16:56:23] [INFO ] Invariant cache hit.
[2023-03-12 16:56:24] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1793 ms. Remains : 61/61 places, 808/808 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-13 finished in 9854 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(p0) U G(!((!p1 U p2)||p1))) U p0))'
Support contains 16 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 873/873 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 83 transition count 865
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 75 transition count 865
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 75 transition count 863
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 20 place count 73 transition count 863
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 68 transition count 813
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 68 transition count 813
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 67 transition count 812
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 66 transition count 812
Applied a total of 34 rules in 64 ms. Remains 66 /83 variables (removed 17) and now considering 812/873 (removed 61) transitions.
// Phase 1: matrix 812 rows 66 cols
[2023-03-12 16:56:24] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-12 16:56:24] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-12 16:56:24] [INFO ] Invariant cache hit.
[2023-03-12 16:56:25] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-12 16:56:25] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 942 ms to find 0 implicit places.
[2023-03-12 16:56:25] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-12 16:56:25] [INFO ] Invariant cache hit.
[2023-03-12 16:56:25] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/83 places, 812/873 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1437 ms. Remains : 66/83 places, 812/873 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), true, (OR p2 p1)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s5 1) (EQ s22 1) (EQ s62 1)), p1:(AND (EQ s14 1) (EQ s19 1) (EQ s27 1) (EQ s32 1) (EQ s37 1) (EQ s42 1) (EQ s47 1) (EQ s50 1) (EQ s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 2974 steps with 180 reset in 33 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-14 finished in 1622 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 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 873/873 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 11 rules applied. Total rules applied 11 place count 81 transition count 862
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 71 transition count 861
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 70 transition count 861
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 23 place count 70 transition count 860
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 25 place count 69 transition count 860
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 31 place count 63 transition count 800
Iterating global reduction 3 with 6 rules applied. Total rules applied 37 place count 63 transition count 800
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 3 with 4 rules applied. Total rules applied 41 place count 61 transition count 798
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 43 place count 60 transition count 798
Applied a total of 43 rules in 89 ms. Remains 60 /83 variables (removed 23) and now considering 798/873 (removed 75) transitions.
// Phase 1: matrix 798 rows 60 cols
[2023-03-12 16:56:26] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-12 16:56:26] [INFO ] Implicit Places using invariants in 608 ms returned []
[2023-03-12 16:56:26] [INFO ] Invariant cache hit.
[2023-03-12 16:56:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:56:27] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1485 ms to find 0 implicit places.
[2023-03-12 16:56:27] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-12 16:56:27] [INFO ] Invariant cache hit.
[2023-03-12 16:56:27] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/83 places, 798/873 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1960 ms. Remains : 60/83 places, 798/873 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1439 reset in 189 ms.
Product exploration explored 100000 steps with 1952 reset in 204 ms.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 274 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 798/798 transitions.
Applied a total of 0 rules in 57 ms. Remains 60 /60 variables (removed 0) and now considering 798/798 (removed 0) transitions.
[2023-03-12 16:56:29] [INFO ] Invariant cache hit.
[2023-03-12 16:56:29] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-12 16:56:29] [INFO ] Invariant cache hit.
[2023-03-12 16:56:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:56:30] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1276 ms to find 0 implicit places.
[2023-03-12 16:56:30] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-12 16:56:30] [INFO ] Invariant cache hit.
[2023-03-12 16:56:31] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1930 ms. Remains : 60/60 places, 798/798 transitions.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 206 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0)]
Product exploration explored 100000 steps with 63 reset in 78 ms.
Product exploration explored 100000 steps with 130 reset in 60 ms.
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 798/798 transitions.
Applied a total of 0 rules in 43 ms. Remains 60 /60 variables (removed 0) and now considering 798/798 (removed 0) transitions.
[2023-03-12 16:56:31] [INFO ] Invariant cache hit.
[2023-03-12 16:56:32] [INFO ] Implicit Places using invariants in 379 ms returned []
[2023-03-12 16:56:32] [INFO ] Invariant cache hit.
[2023-03-12 16:56:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:56:33] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 1859 ms to find 0 implicit places.
[2023-03-12 16:56:33] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-12 16:56:33] [INFO ] Invariant cache hit.
[2023-03-12 16:56:34] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2539 ms. Remains : 60/60 places, 798/798 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-15 finished in 8469 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((X((G(p1)||X(G(p2))))||p0))))'
Found a Lengthening insensitive property : AutonomousCar-PT-09a-LTLFireability-02
Stuttering acceptance computed with spot in 417 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Support contains 6 out of 83 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 83/83 places, 873/873 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 83 transition count 862
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 72 transition count 862
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 72 transition count 861
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 71 transition count 861
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 66 transition count 811
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 66 transition count 811
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 64 transition count 809
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 63 transition count 809
Applied a total of 40 rules in 42 ms. Remains 63 /83 variables (removed 20) and now considering 809/873 (removed 64) transitions.
// Phase 1: matrix 809 rows 63 cols
[2023-03-12 16:56:35] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 16:56:35] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-12 16:56:35] [INFO ] Invariant cache hit.
[2023-03-12 16:56:35] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-12 16:56:36] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1478 ms to find 0 implicit places.
[2023-03-12 16:56:36] [INFO ] Invariant cache hit.
[2023-03-12 16:56:36] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 63/83 places, 809/873 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1903 ms. Remains : 63/83 places, 809/873 transitions.
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(OR (EQ s1 0) (EQ s5 0) (EQ s20 0) (EQ s59 0)), p0:(OR (EQ s1 0) (EQ s5 0) (EQ s20 0) (EQ s59 0)), p2:(OR (EQ s1 0) (EQ s11 0) (EQ s18 0) (EQ s59 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 759 reset in 176 ms.
Product exploration explored 100000 steps with 324 reset in 117 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 262 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 379 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 637 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 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 31 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 16:56:38] [INFO ] Invariant cache hit.
[2023-03-12 16:56:38] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 16:56:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 16:56:39] [INFO ] After 531ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-12 16:56:39] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-12 16:56:39] [INFO ] After 278ms SMT Verify possible using 257 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-12 16:56:39] [INFO ] After 687ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 344 ms.
[2023-03-12 16:56:40] [INFO ] After 1653ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 86 ms.
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 809/809 transitions.
Graph (complete) has 935 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 62 transition count 806
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 12 place count 62 transition count 797
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 102 place count 53 transition count 716
Applied a total of 102 rules in 88 ms. Remains 53 /63 variables (removed 10) and now considering 716/809 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 53/63 places, 716/809 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 415282 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{}
Probabilistic random walk after 415282 steps, saw 54678 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 716 rows 53 cols
[2023-03-12 16:56:43] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 16:56:43] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 16:56:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 16:56:43] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 16:56:44] [INFO ] After 513ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 16:56:44] [INFO ] State equation strengthened by 175 read => feed constraints.
[2023-03-12 16:56:44] [INFO ] After 297ms SMT Verify possible using 175 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 16:56:44] [INFO ] After 517ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 307 ms.
[2023-03-12 16:56:45] [INFO ] After 1440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 64 ms.
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 36 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 53/53 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 35 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2023-03-12 16:56:45] [INFO ] Invariant cache hit.
[2023-03-12 16:56:45] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-12 16:56:45] [INFO ] Invariant cache hit.
[2023-03-12 16:56:45] [INFO ] State equation strengthened by 175 read => feed constraints.
[2023-03-12 16:56:46] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
[2023-03-12 16:56:46] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-12 16:56:46] [INFO ] Invariant cache hit.
[2023-03-12 16:56:47] [INFO ] Dead Transitions using invariants and state equation in 749 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1896 ms. Remains : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 30 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-12 16:56:47] [INFO ] Invariant cache hit.
[2023-03-12 16:56:47] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 16:56:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-12 16:56:47] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 16:56:47] [INFO ] After 481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 16:56:48] [INFO ] After 750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 291 ms.
[2023-03-12 16:56:48] [INFO ] After 1113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p1)), (X (X p0)), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT (AND p2 p1))), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 469 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 437 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 390 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
// Phase 1: matrix 809 rows 63 cols
[2023-03-12 16:56:49] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 16:56:50] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-12 16:56:50] [INFO ] Invariant cache hit.
[2023-03-12 16:56:50] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-12 16:56:50] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
[2023-03-12 16:56:50] [INFO ] Invariant cache hit.
[2023-03-12 16:56:51] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1474 ms. Remains : 63/63 places, 809/809 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 290 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 637 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 16:56:52] [INFO ] Invariant cache hit.
[2023-03-12 16:56:52] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:56:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 16:56:52] [INFO ] After 449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:56:52] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-12 16:56:53] [INFO ] After 179ms SMT Verify possible using 257 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:56:53] [INFO ] After 390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 225 ms.
[2023-03-12 16:56:53] [INFO ] After 1170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 90 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 809/809 transitions.
Graph (complete) has 935 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 62 transition count 806
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 12 place count 62 transition count 797
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 102 place count 53 transition count 716
Applied a total of 102 rules in 113 ms. Remains 53 /63 variables (removed 10) and now considering 716/809 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 53/63 places, 716/809 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 696114 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{}
Probabilistic random walk after 696114 steps, saw 87615 distinct states, run finished after 3002 ms. (steps per millisecond=231 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 716 rows 53 cols
[2023-03-12 16:56:57] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-12 16:56:57] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:56:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 16:56:57] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 16:56:57] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:56:57] [INFO ] State equation strengthened by 175 read => feed constraints.
[2023-03-12 16:56:57] [INFO ] After 145ms SMT Verify possible using 175 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:56:58] [INFO ] After 286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-12 16:56:58] [INFO ] After 830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 55 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 51 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 53/53 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 32 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2023-03-12 16:56:58] [INFO ] Invariant cache hit.
[2023-03-12 16:56:58] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-12 16:56:58] [INFO ] Invariant cache hit.
[2023-03-12 16:56:58] [INFO ] State equation strengthened by 175 read => feed constraints.
[2023-03-12 16:56:59] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
[2023-03-12 16:56:59] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-12 16:56:59] [INFO ] Invariant cache hit.
[2023-03-12 16:57:00] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1717 ms. Remains : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 29 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-12 16:57:00] [INFO ] Invariant cache hit.
[2023-03-12 16:57:00] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:57:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 16:57:00] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 11 ms returned sat
[2023-03-12 16:57:00] [INFO ] After 357ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:57:00] [INFO ] After 561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 231 ms.
[2023-03-12 16:57:00] [INFO ] After 852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 369 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 513 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 530 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 512 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 502 reset in 139 ms.
Product exploration explored 100000 steps with 121 reset in 85 ms.
Applying partial POR strategy [true, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 467 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 78 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2023-03-12 16:57:03] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 809 rows 63 cols
[2023-03-12 16:57:03] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-12 16:57:04] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 502 ms. Remains : 63/63 places, 809/809 transitions.
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2023-03-12 16:57:04] [INFO ] Invariant cache hit.
[2023-03-12 16:57:04] [INFO ] Implicit Places using invariants in 509 ms returned []
[2023-03-12 16:57:04] [INFO ] Invariant cache hit.
[2023-03-12 16:57:04] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-12 16:57:05] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
[2023-03-12 16:57:05] [INFO ] Invariant cache hit.
[2023-03-12 16:57:05] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1714 ms. Remains : 63/63 places, 809/809 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-02 finished in 31521 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)))'
Found a Lengthening insensitive property : AutonomousCar-PT-09a-LTLFireability-03
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 83/83 places, 873/873 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 83 transition count 862
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 72 transition count 862
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 72 transition count 861
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 71 transition count 861
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 66 transition count 811
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 66 transition count 811
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 64 transition count 809
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 63 transition count 809
Applied a total of 40 rules in 35 ms. Remains 63 /83 variables (removed 20) and now considering 809/873 (removed 64) transitions.
// Phase 1: matrix 809 rows 63 cols
[2023-03-12 16:57:06] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-12 16:57:06] [INFO ] Implicit Places using invariants in 538 ms returned []
[2023-03-12 16:57:06] [INFO ] Invariant cache hit.
[2023-03-12 16:57:07] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-12 16:57:07] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1363 ms to find 0 implicit places.
[2023-03-12 16:57:07] [INFO ] Invariant cache hit.
[2023-03-12 16:57:08] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 63/83 places, 809/873 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2006 ms. Remains : 63/83 places, 809/873 transitions.
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s1 1) (NEQ s6 1) (NEQ s55 1) (NEQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 860 reset in 181 ms.
Product exploration explored 100000 steps with 951 reset in 203 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 242 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 600 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17039 steps, run visited all 1 properties in 97 ms. (steps per millisecond=175 )
Probabilistic random walk after 17039 steps, saw 4144 distinct states, run finished after 110 ms. (steps per millisecond=154 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 233 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2023-03-12 16:57:09] [INFO ] Invariant cache hit.
[2023-03-12 16:57:10] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-12 16:57:10] [INFO ] Invariant cache hit.
[2023-03-12 16:57:10] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-12 16:57:11] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2023-03-12 16:57:11] [INFO ] Invariant cache hit.
[2023-03-12 16:57:11] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1657 ms. Remains : 63/63 places, 809/809 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 646 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17039 steps, run visited all 1 properties in 63 ms. (steps per millisecond=270 )
Probabilistic random walk after 17039 steps, saw 4144 distinct states, run finished after 63 ms. (steps per millisecond=270 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 250 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 699 reset in 176 ms.
Product exploration explored 100000 steps with 1091 reset in 228 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 56 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2023-03-12 16:57:13] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-12 16:57:13] [INFO ] Invariant cache hit.
[2023-03-12 16:57:14] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 578 ms. Remains : 63/63 places, 809/809 transitions.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2023-03-12 16:57:14] [INFO ] Invariant cache hit.
[2023-03-12 16:57:14] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-12 16:57:14] [INFO ] Invariant cache hit.
[2023-03-12 16:57:14] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-12 16:57:15] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1174 ms to find 0 implicit places.
[2023-03-12 16:57:15] [INFO ] Invariant cache hit.
[2023-03-12 16:57:16] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1917 ms. Remains : 63/63 places, 809/809 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-03 finished in 10107 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||G(p1)))))'
Found a Lengthening insensitive property : AutonomousCar-PT-09a-LTLFireability-07
Stuttering acceptance computed with spot in 271 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 83 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 83/83 places, 873/873 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 83 transition count 863
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 73 transition count 863
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 73 transition count 862
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 22 place count 72 transition count 862
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 67 transition count 812
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 67 transition count 812
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 65 transition count 810
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 64 transition count 810
Applied a total of 38 rules in 92 ms. Remains 64 /83 variables (removed 19) and now considering 810/873 (removed 63) transitions.
// Phase 1: matrix 810 rows 64 cols
[2023-03-12 16:57:16] [INFO ] Computed 11 place invariants in 10 ms
[2023-03-12 16:57:17] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-12 16:57:17] [INFO ] Invariant cache hit.
[2023-03-12 16:57:17] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-12 16:57:18] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1533 ms to find 0 implicit places.
[2023-03-12 16:57:18] [INFO ] Invariant cache hit.
[2023-03-12 16:57:18] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 64/83 places, 810/873 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2292 ms. Remains : 64/83 places, 810/873 transitions.
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (NEQ s1 1) (NEQ s5 1) (NEQ s37 1) (NEQ s60 1)), p0:(AND (EQ s1 1) (EQ s10 1) (EQ s46 1) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1200 reset in 238 ms.
Product exploration explored 100000 steps with 407 reset in 122 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 641 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 631 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1119719 steps, run timeout after 3001 ms. (steps per millisecond=373 ) properties seen :{}
Probabilistic random walk after 1119719 steps, saw 128981 distinct states, run finished after 3001 ms. (steps per millisecond=373 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:57:23] [INFO ] Invariant cache hit.
[2023-03-12 16:57:23] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 16:57:23] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:57:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-12 16:57:23] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:57:23] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-12 16:57:24] [INFO ] After 103ms SMT Verify possible using 257 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:57:24] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-12 16:57:24] [INFO ] After 668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 810/810 transitions.
Graph (complete) has 936 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 63 transition count 807
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 62 transition count 797
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 62 transition count 797
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 14 place count 62 transition count 788
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 95 place count 53 transition count 716
Applied a total of 95 rules in 108 ms. Remains 53 /64 variables (removed 11) and now considering 716/810 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 53/64 places, 716/810 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1120773 steps, run visited all 1 properties in 2970 ms. (steps per millisecond=377 )
Probabilistic random walk after 1120773 steps, saw 142470 distinct states, run finished after 2970 ms. (steps per millisecond=377 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 689 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p1), (NOT p1)]
Support contains 4 out of 64 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 810/810 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 810/810 (removed 0) transitions.
[2023-03-12 16:57:28] [INFO ] Invariant cache hit.
[2023-03-12 16:57:28] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-12 16:57:28] [INFO ] Invariant cache hit.
[2023-03-12 16:57:29] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-12 16:57:29] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
[2023-03-12 16:57:29] [INFO ] Invariant cache hit.
[2023-03-12 16:57:30] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1668 ms. Remains : 64/64 places, 810/810 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 598 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1126451 steps, run timeout after 3001 ms. (steps per millisecond=375 ) properties seen :{}
Probabilistic random walk after 1126451 steps, saw 129627 distinct states, run finished after 3001 ms. (steps per millisecond=375 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:57:33] [INFO ] Invariant cache hit.
[2023-03-12 16:57:33] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-12 16:57:33] [INFO ] After 393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:57:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 16:57:34] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:57:34] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-12 16:57:34] [INFO ] After 103ms SMT Verify possible using 257 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:57:34] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-12 16:57:34] [INFO ] After 648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 48 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 810/810 transitions.
Graph (complete) has 936 edges and 64 vertex of which 63 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 63 transition count 807
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 62 transition count 797
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 62 transition count 797
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 14 place count 62 transition count 788
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 95 place count 53 transition count 716
Applied a total of 95 rules in 106 ms. Remains 53 /64 variables (removed 11) and now considering 716/810 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 53/64 places, 716/810 transitions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Finished Best-First random walk after 9532 steps, including 9 resets, run visited all 1 properties in 12 ms. (steps per millisecond=794 )
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 330 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1236 reset in 293 ms.
Product exploration explored 100000 steps with 1394 reset in 278 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p1), (NOT p1)]
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 810/810 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 800
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 800
Applied a total of 2 rules in 102 ms. Remains 63 /64 variables (removed 1) and now considering 800/810 (removed 10) transitions.
[2023-03-12 16:57:36] [INFO ] Redundant transitions in 49 ms returned []
// Phase 1: matrix 800 rows 63 cols
[2023-03-12 16:57:36] [INFO ] Computed 11 place invariants in 11 ms
[2023-03-12 16:57:37] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/64 places, 800/810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 634 ms. Remains : 63/64 places, 800/810 transitions.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 810/810 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 800
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 800
Applied a total of 2 rules in 5 ms. Remains 63 /64 variables (removed 1) and now considering 800/810 (removed 10) transitions.
[2023-03-12 16:57:37] [INFO ] Invariant cache hit.
[2023-03-12 16:57:37] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-12 16:57:37] [INFO ] Invariant cache hit.
[2023-03-12 16:57:37] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-12 16:57:38] [INFO ] Implicit Places using invariants and state equation in 1167 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
[2023-03-12 16:57:38] [INFO ] Invariant cache hit.
[2023-03-12 16:57:39] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/64 places, 800/810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1948 ms. Remains : 63/64 places, 800/810 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-07 finished in 23069 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)) U p1))'
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)))'
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)))'
[2023-03-12 16:57:39] [INFO ] Flatten gal took : 121 ms
[2023-03-12 16:57:39] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 16:57:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 83 places, 873 transitions and 12766 arcs took 12 ms.
Total runtime 256360 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2895/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2895/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2895/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2895/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2895/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2895/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-09a-LTLFireability-02
Could not compute solution for formula : AutonomousCar-PT-09a-LTLFireability-03
Could not compute solution for formula : AutonomousCar-PT-09a-LTLFireability-07
Could not compute solution for formula : AutonomousCar-PT-09a-LTLFireability-12
Could not compute solution for formula : AutonomousCar-PT-09a-LTLFireability-13
Could not compute solution for formula : AutonomousCar-PT-09a-LTLFireability-15

BK_STOP 1678640261924

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutonomousCar-PT-09a-LTLFireability-02
ltl formula formula --ltl=/tmp/2895/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 83 places, 873 transitions and 12766 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.220 real 0.080 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2895/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2895/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2895/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2895/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** 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
ltl formula name AutonomousCar-PT-09a-LTLFireability-03
ltl formula formula --ltl=/tmp/2895/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 83 places, 873 transitions and 12766 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.180 real 0.050 user 0.080 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2895/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2895/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2895/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2895/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name AutonomousCar-PT-09a-LTLFireability-07
ltl formula formula --ltl=/tmp/2895/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: =============================================================================
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 83 places, 873 transitions and 12766 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.180 real 0.080 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2895/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2895/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2895/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2895/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** 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:
0: pnml2lts-mc(+0xa23f4) [0x5649c574d3f4]
1: pnml2lts-mc(+0xa2496) [0x5649c574d496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fe5f6ba9140]
3: pnml2lts-mc(+0x405be5) [0x5649c5ab0be5]
4: pnml2lts-mc(+0x16b3f9) [0x5649c58163f9]
5: pnml2lts-mc(+0x164ac4) [0x5649c580fac4]
6: pnml2lts-mc(+0x272e0a) [0x5649c591de0a]
7: pnml2lts-mc(+0xb61f0) [0x5649c57611f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fe5f69fc4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fe5f69fc67a]
10: pnml2lts-mc(+0xa1581) [0x5649c574c581]
11: pnml2lts-mc(+0xa1910) [0x5649c574c910]
12: pnml2lts-mc(+0xa32a2) [0x5649c574e2a2]
13: pnml2lts-mc(+0xa50f4) [0x5649c57500f4]
14: pnml2lts-mc(+0xa516b) [0x5649c575016b]
15: pnml2lts-mc(+0x3f34b3) [0x5649c5a9e4b3]
16: pnml2lts-mc(+0x7c63d) [0x5649c572763d]
17: pnml2lts-mc(+0x67d86) [0x5649c5712d86]
18: pnml2lts-mc(+0x60a8a) [0x5649c570ba8a]
19: pnml2lts-mc(+0x5eb15) [0x5649c5709b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fe5f69e4d0a]
21: pnml2lts-mc(+0x6075e) [0x5649c570b75e]
ltl formula name AutonomousCar-PT-09a-LTLFireability-12
ltl formula formula --ltl=/tmp/2895/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: =============================================================================
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 83 places, 873 transitions and 12766 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.180 real 0.070 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2895/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2895/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2895/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2895/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** 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-09a-LTLFireability-13
ltl formula formula --ltl=/tmp/2895/ltl_4_
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 83 places, 873 transitions and 12766 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.180 real 0.070 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2895/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2895/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2895/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2895/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** 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:
0: pnml2lts-mc(+0xa23f4) [0x562cc27653f4]
1: pnml2lts-mc(+0xa2496) [0x562cc2765496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fb725ee2140]
3: pnml2lts-mc(+0x405be5) [0x562cc2ac8be5]
4: pnml2lts-mc(+0x16b3f9) [0x562cc282e3f9]
5: pnml2lts-mc(+0x164ac4) [0x562cc2827ac4]
6: pnml2lts-mc(+0x272e0a) [0x562cc2935e0a]
7: pnml2lts-mc(+0xb61f0) [0x562cc27791f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fb725d354d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fb725d3567a]
10: pnml2lts-mc(+0xa1581) [0x562cc2764581]
11: pnml2lts-mc(+0xa1910) [0x562cc2764910]
12: pnml2lts-mc(+0xa32a2) [0x562cc27662a2]
13: pnml2lts-mc(+0xa50f4) [0x562cc27680f4]
14: pnml2lts-mc(+0x3f34b3) [0x562cc2ab64b3]
15: pnml2lts-mc(+0x7c63d) [0x562cc273f63d]
16: pnml2lts-mc(+0x67d86) [0x562cc272ad86]
17: pnml2lts-mc(+0x60a8a) [0x562cc2723a8a]
18: pnml2lts-mc(+0x5eb15) [0x562cc2721b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fb725d1dd0a]
20: pnml2lts-mc(+0x6075e) [0x562cc272375e]
ltl formula name AutonomousCar-PT-09a-LTLFireability-15
ltl formula formula --ltl=/tmp/2895/ltl_5_
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 83 places, 873 transitions and 12766 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.180 real 0.090 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2895/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2895/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2895/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2895/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** 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:
0: pnml2lts-mc(+0xa23f4) [0x560c3f0363f4]
1: pnml2lts-mc(+0xa2496) [0x560c3f036496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fcb84e7d140]
3: pnml2lts-mc(+0x405be5) [0x560c3f399be5]
4: pnml2lts-mc(+0x16b3f9) [0x560c3f0ff3f9]
5: pnml2lts-mc(+0x164ac4) [0x560c3f0f8ac4]
6: pnml2lts-mc(+0x272e0a) [0x560c3f206e0a]
7: pnml2lts-mc(+0xb61f0) [0x560c3f04a1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fcb84cd04d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fcb84cd067a]
10: pnml2lts-mc(+0xa1581) [0x560c3f035581]
11: pnml2lts-mc(+0xa1910) [0x560c3f035910]
12: pnml2lts-mc(+0xa32a2) [0x560c3f0372a2]
13: pnml2lts-mc(+0xa50f4) [0x560c3f0390f4]
14: pnml2lts-mc(+0xa516b) [0x560c3f03916b]
15: pnml2lts-mc(+0x3f34b3) [0x560c3f3874b3]
16: pnml2lts-mc(+0x7c63d) [0x560c3f01063d]
17: pnml2lts-mc(+0x67d86) [0x560c3effbd86]
18: pnml2lts-mc(+0x60a8a) [0x560c3eff4a8a]
19: pnml2lts-mc(+0x5eb15) [0x560c3eff2b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fcb84cb8d0a]
21: pnml2lts-mc(+0x6075e) [0x560c3eff475e]

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

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