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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 5.2K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 12:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 12:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 448K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678639151694

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-08a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:39:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:39:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:39:14] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2023-03-12 16:39:14] [INFO ] Transformed 81 places.
[2023-03-12 16:39:14] [INFO ] Transformed 849 transitions.
[2023-03-12 16:39:14] [INFO ] Found NUPN structural information;
[2023-03-12 16:39:14] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 306 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 3 formulas.
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
FORMULA AutonomousCar-PT-08a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 574/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 80 transition count 573
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 573
Applied a total of 2 rules in 50 ms. Remains 80 /81 variables (removed 1) and now considering 573/574 (removed 1) transitions.
// Phase 1: matrix 573 rows 80 cols
[2023-03-12 16:39:15] [INFO ] Computed 12 place invariants in 31 ms
[2023-03-12 16:39:15] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-12 16:39:15] [INFO ] Invariant cache hit.
[2023-03-12 16:39:15] [INFO ] State equation strengthened by 259 read => feed constraints.
[2023-03-12 16:39:15] [INFO ] Implicit Places using invariants and state equation in 395 ms returned [76, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 829 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/81 places, 573/574 transitions.
Applied a total of 0 rules in 5 ms. Remains 78 /78 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 885 ms. Remains : 78/81 places, 573/574 transitions.
Support contains 40 out of 78 places after structural reductions.
[2023-03-12 16:39:16] [INFO ] Flatten gal took : 126 ms
[2023-03-12 16:39:16] [INFO ] Flatten gal took : 89 ms
[2023-03-12 16:39:16] [INFO ] Input system was already deterministic with 573 transitions.
Incomplete random walk after 10000 steps, including 507 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 27) seen :8
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) 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 19) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) 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 17) 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 17) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 573 rows 78 cols
[2023-03-12 16:39:17] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-12 16:39:17] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-12 16:39:18] [INFO ] After 798ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-12 16:39:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 16:39:20] [INFO ] After 1411ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :15
[2023-03-12 16:39:20] [INFO ] State equation strengthened by 259 read => feed constraints.
[2023-03-12 16:39:21] [INFO ] After 1376ms SMT Verify possible using 259 Read/Feed constraints in natural domain returned unsat :1 sat :15
[2023-03-12 16:39:22] [INFO ] After 2780ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :15
Attempting to minimize the solution found.
Minimization took 1372 ms.
[2023-03-12 16:39:24] [INFO ] After 5885ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :15
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 5 properties in 207 ms.
Support contains 27 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 573/573 transitions.
Graph (complete) has 842 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 77 transition count 562
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 70 transition count 561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 69 transition count 561
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 20 place count 69 transition count 558
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 26 place count 66 transition count 558
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 30 place count 62 transition count 530
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 62 transition count 530
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 61 transition count 529
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 43 place count 61 transition count 522
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 106 place count 54 transition count 466
Applied a total of 106 rules in 109 ms. Remains 54 /78 variables (removed 24) and now considering 466/573 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 54/78 places, 466/573 transitions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 466 rows 54 cols
[2023-03-12 16:39:25] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 16:39:25] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 16:39:25] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 16:39:25] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 16:39:25] [INFO ] After 449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 16:39:25] [INFO ] State equation strengthened by 177 read => feed constraints.
[2023-03-12 16:39:26] [INFO ] After 439ms SMT Verify possible using 177 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 16:39:26] [INFO ] After 947ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 350 ms.
[2023-03-12 16:39:27] [INFO ] After 1798ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 65 ms.
Support contains 11 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 466/466 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 52 transition count 464
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 52 transition count 463
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 14 place count 51 transition count 455
Applied a total of 14 rules in 99 ms. Remains 51 /54 variables (removed 3) and now considering 455/466 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 51/54 places, 455/466 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 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 55 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 814585 steps, run timeout after 3001 ms. (steps per millisecond=271 ) properties seen :{2=1, 3=1, 5=1}
Probabilistic random walk after 814585 steps, saw 105506 distinct states, run finished after 3008 ms. (steps per millisecond=270 ) properties seen :3
Running SMT prover for 3 properties.
// Phase 1: matrix 455 rows 51 cols
[2023-03-12 16:39:30] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 16:39:30] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 16:39:30] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 16:39:30] [INFO ] [Nat]Absence check using 12 positive place invariants in 1 ms returned sat
[2023-03-12 16:39:31] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 16:39:31] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-03-12 16:39:31] [INFO ] After 227ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 16:39:31] [INFO ] After 399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 276 ms.
[2023-03-12 16:39:31] [INFO ] After 979ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 455/455 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 48 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 48 transition count 428
Applied a total of 6 rules in 29 ms. Remains 48 /51 variables (removed 3) and now considering 428/455 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 48/51 places, 428/455 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 859683 steps, run timeout after 3001 ms. (steps per millisecond=286 ) properties seen :{0=1}
Probabilistic random walk after 859683 steps, saw 110949 distinct states, run finished after 3001 ms. (steps per millisecond=286 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 428 rows 48 cols
[2023-03-12 16:39:35] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-12 16:39:35] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 16:39:35] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:39:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 16:39:35] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:39:35] [INFO ] State equation strengthened by 145 read => feed constraints.
[2023-03-12 16:39:35] [INFO ] After 128ms SMT Verify possible using 145 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:39:36] [INFO ] After 347ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-12 16:39:36] [INFO ] After 738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 23 ms.
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 428/428 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 47 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 47 transition count 419
Applied a total of 2 rules in 44 ms. Remains 47 /48 variables (removed 1) and now considering 419/428 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 47/48 places, 419/428 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1160078 steps, run timeout after 3001 ms. (steps per millisecond=386 ) properties seen :{}
Probabilistic random walk after 1160078 steps, saw 146897 distinct states, run finished after 3008 ms. (steps per millisecond=385 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 419 rows 47 cols
[2023-03-12 16:39:39] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 16:39:39] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 16:39:39] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:39:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 16:39:40] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:39:40] [INFO ] State equation strengthened by 137 read => feed constraints.
[2023-03-12 16:39:40] [INFO ] After 127ms SMT Verify possible using 137 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:39:40] [INFO ] After 244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-12 16:39:40] [INFO ] After 854ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 419/419 transitions.
Applied a total of 0 rules in 36 ms. Remains 47 /47 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 47/47 places, 419/419 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 419/419 transitions.
Applied a total of 0 rules in 21 ms. Remains 47 /47 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2023-03-12 16:39:40] [INFO ] Invariant cache hit.
[2023-03-12 16:39:40] [INFO ] Implicit Places using invariants in 260 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 263 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 46/47 places, 419/419 transitions.
Applied a total of 0 rules in 21 ms. Remains 46 /46 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 306 ms. Remains : 46/47 places, 419/419 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1150390 steps, run timeout after 3001 ms. (steps per millisecond=383 ) properties seen :{}
Probabilistic random walk after 1150390 steps, saw 145731 distinct states, run finished after 3001 ms. (steps per millisecond=383 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 419 rows 46 cols
[2023-03-12 16:39:44] [INFO ] Computed 11 place invariants in 14 ms
[2023-03-12 16:39:44] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 16:39:44] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:39:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 16:39:44] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:39:44] [INFO ] State equation strengthened by 137 read => feed constraints.
[2023-03-12 16:39:44] [INFO ] After 90ms SMT Verify possible using 137 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:39:45] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-12 16:39:45] [INFO ] After 755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 419/419 transitions.
Applied a total of 0 rules in 46 ms. Remains 46 /46 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 46/46 places, 419/419 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 419/419 transitions.
Applied a total of 0 rules in 17 ms. Remains 46 /46 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2023-03-12 16:39:45] [INFO ] Invariant cache hit.
[2023-03-12 16:39:45] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-12 16:39:45] [INFO ] Invariant cache hit.
[2023-03-12 16:39:45] [INFO ] State equation strengthened by 137 read => feed constraints.
[2023-03-12 16:39:46] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2023-03-12 16:39:46] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-12 16:39:46] [INFO ] Invariant cache hit.
[2023-03-12 16:39:46] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1142 ms. Remains : 46/46 places, 419/419 transitions.
Applied a total of 0 rules in 32 ms. Remains 46 /46 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-12 16:39:46] [INFO ] Invariant cache hit.
[2023-03-12 16:39:46] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2023-03-12 16:39:46] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:39:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 16:39:47] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:39:47] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 158 ms.
[2023-03-12 16:39:47] [INFO ] After 560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 3 stabilizing places and 2 stable transitions
FORMULA AutonomousCar-PT-08a-LTLFireability-07 FALSE 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)||(X(G(p2))&&p1))))'
Support contains 15 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 71 transition count 510
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 71 transition count 510
Applied a total of 14 rules in 4 ms. Remains 71 /78 variables (removed 7) and now considering 510/573 (removed 63) transitions.
// Phase 1: matrix 510 rows 71 cols
[2023-03-12 16:39:48] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 16:39:48] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-12 16:39:48] [INFO ] Invariant cache hit.
[2023-03-12 16:39:48] [INFO ] State equation strengthened by 203 read => feed constraints.
[2023-03-12 16:39:48] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
[2023-03-12 16:39:48] [INFO ] Invariant cache hit.
[2023-03-12 16:39:48] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 71/78 places, 510/573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 849 ms. Remains : 71/78 places, 510/573 transitions.
Stuttering acceptance computed with spot in 568 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s17 1) (EQ s21 1) (EQ s30 1) (EQ s34 1) (EQ s42 1) (EQ s46 1) (EQ s52 1) (EQ s58 1) (EQ s67 1)), p1:(AND (EQ s1 1) (EQ s9 1) (EQ s16 1) (EQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 4 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-00 finished in 1499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 573/573 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 78 transition count 563
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 68 transition count 563
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 68 transition count 562
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 67 transition count 562
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 60 transition count 499
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 60 transition count 499
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 40 place count 58 transition count 497
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 42 place count 57 transition count 497
Applied a total of 42 rules in 147 ms. Remains 57 /78 variables (removed 21) and now considering 497/573 (removed 76) transitions.
// Phase 1: matrix 497 rows 57 cols
[2023-03-12 16:39:49] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-12 16:39:50] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-12 16:39:50] [INFO ] Invariant cache hit.
[2023-03-12 16:39:50] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-12 16:39:50] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1317 ms to find 0 implicit places.
[2023-03-12 16:39:51] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-12 16:39:51] [INFO ] Invariant cache hit.
[2023-03-12 16:39:51] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/78 places, 497/573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1763 ms. Remains : 57/78 places, 497/573 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s8 1) (EQ s27 1) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-01 finished in 1867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(X(X(!p0))))&&F(!p1)) U (G(((X(X(X(X(!p0))))&&F(!p1))||X(X(X(X(G(!p0)))))))||((!p2 U (p3||G(!p2)))&&((X(X(X(X(!p0))))&&F(!p1))||X(X(X(X(G(!p0))))))))))'
Support contains 15 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 70 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 70 transition count 501
Applied a total of 16 rules in 6 ms. Remains 70 /78 variables (removed 8) and now considering 501/573 (removed 72) transitions.
// Phase 1: matrix 501 rows 70 cols
[2023-03-12 16:39:51] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 16:39:51] [INFO ] Implicit Places using invariants in 145 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 156 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/78 places, 501/573 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 69/78 places, 501/573 transitions.
Stuttering acceptance computed with spot in 1439 ms :[p0, p0, (AND p0 p2 (NOT p3)), (AND p1 p0), p0, (AND p0 (NOT p3) p2), (AND p1 p0 (NOT p3) p2), (AND p1 p0), p0, (AND p0 (NOT p3) p2), (AND p1 p0 (NOT p3) p2), (AND p1 p0), p0, (AND p0 (NOT p3) p2), (AND p1 (NOT p3) p2 p0), (AND p1 p0), true, (AND (NOT p3) p2 p0), (AND p1 (NOT p3) p2 p0), p1, (AND (NOT p3) p2 (NOT p0)), (AND p1 (NOT p3) p2 (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=(AND p1 (NOT p3) p2), acceptance={} source=6 dest: 7}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 10}], [{ cond=p1, acceptance={} source=7 dest: 11}], [{ cond=true, acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p3) p2), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 13}], [{ cond=(AND p1 (NOT p3) p2), acceptance={} source=10 dest: 11}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=10 dest: 14}], [{ cond=p1, acceptance={} source=11 dest: 15}], [{ cond=p0, acceptance={} source=12 dest: 16}], [{ cond=(AND (NOT p3) p2), acceptance={} source=13 dest: 12}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=13 dest: 17}], [{ cond=(AND p1 (NOT p3) p2), acceptance={} source=14 dest: 15}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=14 dest: 18}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=15 dest: 15}, { cond=(AND p1 p0), acceptance={} source=15 dest: 19}], [{ cond=true, acceptance={0} source=16 dest: 16}], [{ cond=(AND (NOT p3) p2 p0), acceptance={} source=17 dest: 16}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=17 dest: 20}], [{ cond=(AND p1 (NOT p3) p2 p0), acceptance={} source=18 dest: 19}, { cond=(AND p1 (NOT p3) (NOT p2) p0), acceptance={} source=18 dest: 21}], [{ cond=p1, acceptance={0} source=19 dest: 19}], [{ cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=20 dest: 16}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=20 dest: 20}], [{ cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={} source=21 dest: 19}, { cond=(AND p1 (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=21 dest: 21}]], initial=0, aps=[p3:(AND (NOT (AND (EQ s16 1) (EQ s22 1) (EQ s26 1) (EQ s32 1) (EQ s38 1) (EQ s44 1) (EQ s52 1) (EQ s58 1) (EQ s65 1))) (NOT (AND (EQ s14 1) (EQ s20 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 1023 ms.
Product exploration explored 100000 steps with 20000 reset in 904 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 886 ms. Reduced automaton from 22 states, 41 edges and 4 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[p0, (AND p0 p3), true, p0, (AND p0 p3), (AND p0 p3)]
Incomplete random walk after 10000 steps, including 501 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 2) 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 2) seen :1
Finished Best-First random walk after 3805 steps, including 17 resets, run visited all 1 properties in 5 ms. (steps per millisecond=761 )
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT p3))]
Knowledge based reduction with 12 factoid took 896 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[p0, (AND p0 p3), true, p0, (AND p0 p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 295 ms :[p0, (AND p0 p3), true, p0, (AND p0 p3), (AND p0 p3)]
Support contains 15 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 501/501 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 69 cols
[2023-03-12 16:39:58] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 16:39:58] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-12 16:39:58] [INFO ] Invariant cache hit.
[2023-03-12 16:39:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:39:58] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-12 16:39:58] [INFO ] Invariant cache hit.
[2023-03-12 16:39:58] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 519 ms. Remains : 69/69 places, 501/501 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p3), (X p3), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[p0, p0, p0, p0, true, p0]
Incomplete random walk after 10000 steps, including 507 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Finished Best-First random walk after 5695 steps, including 27 resets, run visited all 1 properties in 7 ms. (steps per millisecond=813 )
Knowledge obtained : [(AND (NOT p0) p3), (X p3), (X (X p3))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 212 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 454 ms :[p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 432 ms :[p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 497 ms :[p0, p0, p0, p0, true, p0]
Product exploration explored 100000 steps with 20000 reset in 824 ms.
Product exploration explored 100000 steps with 20000 reset in 829 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 415 ms :[p0, p0, p0, p0, true, p0]
Support contains 9 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 501/501 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 69 transition count 501
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 8 place count 69 transition count 503
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 69 transition count 503
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 69 transition count 503
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 69 transition count 506
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 12 rules in 111 ms. Remains 69 /69 variables (removed 0) and now considering 506/501 (removed -5) transitions.
[2023-03-12 16:40:03] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 506 rows 69 cols
[2023-03-12 16:40:03] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-12 16:40:03] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/69 places, 506/501 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 419 ms. Remains : 69/69 places, 506/501 transitions.
Support contains 9 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 501/501 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 69 cols
[2023-03-12 16:40:03] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 16:40:03] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-12 16:40:03] [INFO ] Invariant cache hit.
[2023-03-12 16:40:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:40:03] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-12 16:40:03] [INFO ] Invariant cache hit.
[2023-03-12 16:40:04] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 739 ms. Remains : 69/69 places, 501/501 transitions.
Treatment of property AutonomousCar-PT-08a-LTLFireability-02 finished in 13023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 573/573 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 78 transition count 564
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 69 transition count 563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 68 transition count 563
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 68 transition count 562
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 22 place count 67 transition count 562
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 30 place count 59 transition count 490
Iterating global reduction 3 with 8 rules applied. Total rules applied 38 place count 59 transition count 490
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 42 place count 57 transition count 488
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 44 place count 56 transition count 488
Applied a total of 44 rules in 46 ms. Remains 56 /78 variables (removed 22) and now considering 488/573 (removed 85) transitions.
// Phase 1: matrix 488 rows 56 cols
[2023-03-12 16:40:04] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-12 16:40:04] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-12 16:40:04] [INFO ] Invariant cache hit.
[2023-03-12 16:40:04] [INFO ] State equation strengthened by 197 read => feed constraints.
[2023-03-12 16:40:05] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
[2023-03-12 16:40:05] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-12 16:40:05] [INFO ] Invariant cache hit.
[2023-03-12 16:40:05] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/78 places, 488/573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1253 ms. Remains : 56/78 places, 488/573 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s7 1) (EQ s34 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-04 finished in 1315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||G(F(p1))))))'
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 72 transition count 519
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 72 transition count 519
Applied a total of 12 rules in 4 ms. Remains 72 /78 variables (removed 6) and now considering 519/573 (removed 54) transitions.
// Phase 1: matrix 519 rows 72 cols
[2023-03-12 16:40:05] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-12 16:40:05] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-12 16:40:06] [INFO ] Invariant cache hit.
[2023-03-12 16:40:06] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-12 16:40:06] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2023-03-12 16:40:06] [INFO ] Invariant cache hit.
[2023-03-12 16:40:07] [INFO ] Dead Transitions using invariants and state equation in 1006 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 72/78 places, 519/573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1791 ms. Remains : 72/78 places, 519/573 transitions.
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s7 1) (EQ s32 1) (EQ s67 1)), p1:(AND (EQ s1 1) (EQ s9 1) (EQ s45 1) (EQ s67 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]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-05 finished in 2140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 9 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 70 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 70 transition count 501
Applied a total of 16 rules in 21 ms. Remains 70 /78 variables (removed 8) and now considering 501/573 (removed 72) transitions.
// Phase 1: matrix 501 rows 70 cols
[2023-03-12 16:40:07] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-12 16:40:08] [INFO ] Implicit Places using invariants in 344 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 345 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/78 places, 501/573 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 370 ms. Remains : 69/78 places, 501/573 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s14 1) (EQ s20 1) (EQ s28 1) (EQ s34 1) (EQ s40 1) (EQ s46 1) (EQ s50 1) (EQ s56 1) (EQ s65 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-09 finished in 570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(F(p1)))&&F(p2)))'
Support contains 16 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 71 transition count 510
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 71 transition count 510
Applied a total of 14 rules in 6 ms. Remains 71 /78 variables (removed 7) and now considering 510/573 (removed 63) transitions.
// Phase 1: matrix 510 rows 71 cols
[2023-03-12 16:40:08] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-12 16:40:08] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-12 16:40:08] [INFO ] Invariant cache hit.
[2023-03-12 16:40:08] [INFO ] State equation strengthened by 203 read => feed constraints.
[2023-03-12 16:40:08] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2023-03-12 16:40:08] [INFO ] Invariant cache hit.
[2023-03-12 16:40:09] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 71/78 places, 510/573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 918 ms. Remains : 71/78 places, 510/573 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s5 1) (EQ s26 1) (EQ s66 1)), p2:(OR (EQ s17 0) (EQ s23 0) (EQ s30 0) (EQ s36 0) (EQ s40 0) (EQ s48 0) (EQ s52 0) (EQ s60 0) (EQ s67...], 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-10 finished in 1171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 573/573 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 78 transition count 563
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 68 transition count 563
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 68 transition count 562
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 67 transition count 562
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 60 transition count 499
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 60 transition count 499
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 40 place count 58 transition count 497
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 42 place count 57 transition count 497
Applied a total of 42 rules in 52 ms. Remains 57 /78 variables (removed 21) and now considering 497/573 (removed 76) transitions.
// Phase 1: matrix 497 rows 57 cols
[2023-03-12 16:40:09] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-12 16:40:09] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-12 16:40:10] [INFO ] Invariant cache hit.
[2023-03-12 16:40:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-12 16:40:10] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
[2023-03-12 16:40:10] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-12 16:40:10] [INFO ] Invariant cache hit.
[2023-03-12 16:40:10] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/78 places, 497/573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1283 ms. Remains : 57/78 places, 497/573 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s4 1) (EQ s14 1) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-11 finished in 1336 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&&(X(p1) U ((!p2&&X(p1))||X(G(p1))))) U p3))'
Support contains 22 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 72 transition count 519
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 72 transition count 519
Applied a total of 12 rules in 4 ms. Remains 72 /78 variables (removed 6) and now considering 519/573 (removed 54) transitions.
// Phase 1: matrix 519 rows 72 cols
[2023-03-12 16:40:10] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 16:40:11] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-12 16:40:11] [INFO ] Invariant cache hit.
[2023-03-12 16:40:11] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-12 16:40:11] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2023-03-12 16:40:11] [INFO ] Invariant cache hit.
[2023-03-12 16:40:11] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 72/78 places, 519/573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 843 ms. Remains : 72/78 places, 519/573 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p3), true, (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s1 1) (EQ s6 1) (EQ s59 1) (EQ s67 1)), p0:(OR (AND (NOT (AND (EQ s15 1) (EQ s23 1) (EQ s29 1) (EQ s33 1) (EQ s39 1) (EQ s47 1) (EQ s51 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-12 finished in 1151 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(!(!X(G(p0)) U G(((p1 U p0)&&G(p1)))))))'
Support contains 13 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 78 transition count 565
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 70 transition count 565
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 70 transition count 563
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 68 transition count 563
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 61 transition count 500
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 61 transition count 500
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 60 transition count 499
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 59 transition count 499
Applied a total of 38 rules in 74 ms. Remains 59 /78 variables (removed 19) and now considering 499/573 (removed 74) transitions.
// Phase 1: matrix 499 rows 59 cols
[2023-03-12 16:40:12] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 16:40:12] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-12 16:40:12] [INFO ] Invariant cache hit.
[2023-03-12 16:40:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-12 16:40:12] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2023-03-12 16:40:12] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-12 16:40:12] [INFO ] Invariant cache hit.
[2023-03-12 16:40:12] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/78 places, 499/573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 938 ms. Remains : 59/78 places, 499/573 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND p1 p0), (AND p1 p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s9 1) (EQ s47 1) (EQ s55 1)), p0:(AND (EQ s15 1) (EQ s18 1) (EQ s23 1) (EQ s30 1) (EQ s35 1) (EQ s38 1) (EQ s45 1) (EQ s48 1) (EQ s5...], 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 77 reset in 136 ms.
Product exploration explored 100000 steps with 521 reset in 144 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 388 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 123 ms :[(AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 647 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:40:14] [INFO ] Invariant cache hit.
[2023-03-12 16:40:14] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-12 16:40:14] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND p0 p1)))
Knowledge based reduction with 6 factoid took 145 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08a-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08a-LTLFireability-13 finished in 2269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 573/573 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 78 transition count 563
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 68 transition count 563
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 68 transition count 562
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 22 place count 67 transition count 562
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 61 transition count 508
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 61 transition count 508
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 59 transition count 506
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 58 transition count 506
Applied a total of 40 rules in 94 ms. Remains 58 /78 variables (removed 20) and now considering 506/573 (removed 67) transitions.
// Phase 1: matrix 506 rows 58 cols
[2023-03-12 16:40:14] [INFO ] Computed 10 place invariants in 20 ms
[2023-03-12 16:40:14] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-12 16:40:14] [INFO ] Invariant cache hit.
[2023-03-12 16:40:14] [INFO ] State equation strengthened by 213 read => feed constraints.
[2023-03-12 16:40:14] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
[2023-03-12 16:40:15] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-12 16:40:15] [INFO ] Invariant cache hit.
[2023-03-12 16:40:15] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/78 places, 506/573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 929 ms. Remains : 58/78 places, 506/573 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s1 0) (EQ s6 0) (EQ s33 0) (EQ s54 0)), p0:(OR (EQ s1 0) (EQ s4 0) (EQ s14 0) (EQ s54 0))], 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 1289 reset in 204 ms.
Product exploration explored 100000 steps with 298 reset in 158 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), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 236 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 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 679 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 910344 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :{}
Probabilistic random walk after 910344 steps, saw 110813 distinct states, run finished after 3001 ms. (steps per millisecond=303 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 16:40:19] [INFO ] Invariant cache hit.
[2023-03-12 16:40:19] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:40:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-12 16:40:19] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 16:40:19] [INFO ] State equation strengthened by 213 read => feed constraints.
[2023-03-12 16:40:19] [INFO ] After 73ms SMT Verify possible using 213 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 16:40:19] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-12 16:40:19] [INFO ] After 538ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 506/506 transitions.
Graph (complete) has 772 edges and 58 vertex of which 57 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 57 transition count 503
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 12 place count 57 transition count 494
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 85 place count 48 transition count 430
Applied a total of 85 rules in 45 ms. Remains 48 /58 variables (removed 10) and now considering 430/506 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 48/58 places, 430/506 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1094949 steps, run visited all 1 properties in 2063 ms. (steps per millisecond=530 )
Probabilistic random walk after 1094949 steps, saw 140432 distinct states, run finished after 2073 ms. (steps per millisecond=528 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 297 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08a-LTLFireability-14 finished in 8147 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 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 573/573 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 78 transition count 563
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 68 transition count 563
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 68 transition count 562
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 67 transition count 562
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 60 transition count 499
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 60 transition count 499
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 40 place count 58 transition count 497
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 42 place count 57 transition count 497
Applied a total of 42 rules in 82 ms. Remains 57 /78 variables (removed 21) and now considering 497/573 (removed 76) transitions.
// Phase 1: matrix 497 rows 57 cols
[2023-03-12 16:40:22] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-12 16:40:22] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-12 16:40:22] [INFO ] Invariant cache hit.
[2023-03-12 16:40:23] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-12 16:40:23] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2023-03-12 16:40:23] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-12 16:40:23] [INFO ] Invariant cache hit.
[2023-03-12 16:40:23] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/78 places, 497/573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1067 ms. Remains : 57/78 places, 497/573 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-15 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:(OR (EQ s1 0) (EQ s8 0) (EQ s39 0) (EQ s53 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 395 reset in 78 ms.
Product exploration explored 100000 steps with 169 reset in 65 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 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 111 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 692 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 924232 steps, run visited all 1 properties in 1925 ms. (steps per millisecond=480 )
Probabilistic random walk after 924232 steps, saw 112557 distinct states, run finished after 1925 ms. (steps per millisecond=480 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 253 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 122 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 497/497 transitions.
Applied a total of 0 rules in 54 ms. Remains 57 /57 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2023-03-12 16:40:26] [INFO ] Invariant cache hit.
[2023-03-12 16:40:27] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-12 16:40:27] [INFO ] Invariant cache hit.
[2023-03-12 16:40:27] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-12 16:40:27] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
[2023-03-12 16:40:27] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-12 16:40:27] [INFO ] Invariant cache hit.
[2023-03-12 16:40:27] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1250 ms. Remains : 57/57 places, 497/497 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 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 126 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 644 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 924232 steps, run visited all 1 properties in 1830 ms. (steps per millisecond=505 )
Probabilistic random walk after 924232 steps, saw 112557 distinct states, run finished after 1830 ms. (steps per millisecond=505 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 250 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 131 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 107 reset in 62 ms.
Product exploration explored 100000 steps with 267 reset in 72 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 497/497 transitions.
Applied a total of 0 rules in 24 ms. Remains 57 /57 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2023-03-12 16:40:30] [INFO ] Invariant cache hit.
[2023-03-12 16:40:31] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-12 16:40:31] [INFO ] Invariant cache hit.
[2023-03-12 16:40:31] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-12 16:40:31] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
[2023-03-12 16:40:31] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-12 16:40:31] [INFO ] Invariant cache hit.
[2023-03-12 16:40:32] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1111 ms. Remains : 57/57 places, 497/497 transitions.
Treatment of property AutonomousCar-PT-08a-LTLFireability-15 finished in 9658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(X(X(!p0))))&&F(!p1)) U (G(((X(X(X(X(!p0))))&&F(!p1))||X(X(X(X(G(!p0)))))))||((!p2 U (p3||G(!p2)))&&((X(X(X(X(!p0))))&&F(!p1))||X(X(X(X(G(!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' '!(G(F(p0)))'
[2023-03-12 16:40:32] [INFO ] Flatten gal took : 76 ms
[2023-03-12 16:40:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-12 16:40:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 78 places, 573 transitions and 6799 arcs took 5 ms.
Total runtime 78158 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1463/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1785 seconds
MemTotal: 16393220 kB
MemFree: 11609236 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16120380 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1463/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-08a-LTLFireability-02
Could not compute solution for formula : AutonomousCar-PT-08a-LTLFireability-15

BK_STOP 1678641019278

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutonomousCar-PT-08a-LTLFireability-02
ltl formula formula --ltl=/tmp/1463/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 78 places, 573 transitions and 6799 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.130 real 0.040 user 0.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1463/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1463/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1463/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1463/ltl_0_
Killing (15) : 1469 1470 1471 1472 1473
Killing (9) : 1469 1470 1471 1472 1473
ltl formula name AutonomousCar-PT-08a-LTLFireability-15
ltl formula formula --ltl=/tmp/1463/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 78 places, 573 transitions and 6799 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1463/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1463/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1463/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.040 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1463/ltl_1_
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
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-08a"
export BK_EXAMINATION="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-08a, 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-167813598200644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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