Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180300208.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r043-smll-171620180300208
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 448K May 18 16:42 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 1716312588453

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 17:29:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 17:29:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 17:29:51] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2024-05-21 17:29:51] [INFO ] Transformed 81 places.
[2024-05-21 17:29:51] [INFO ] Transformed 849 transitions.
[2024-05-21 17:29:51] [INFO ] Found NUPN structural information;
[2024-05-21 17:29:51] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 442 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
FORMULA AutonomousCar-PT-08a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 574/574 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 79 transition count 564
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 79 transition count 564
Applied a total of 4 rules in 39 ms. Remains 79 /81 variables (removed 2) and now considering 564/574 (removed 10) transitions.
// Phase 1: matrix 564 rows 79 cols
[2024-05-21 17:29:52] [INFO ] Computed 12 invariants in 20 ms
[2024-05-21 17:29:52] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-21 17:29:52] [INFO ] Invariant cache hit.
[2024-05-21 17:29:52] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-21 17:29:52] [INFO ] Implicit Places using invariants and state equation in 429 ms returned [75, 77]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 731 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/81 places, 564/574 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 564/564 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 774 ms. Remains : 77/81 places, 564/574 transitions.
Support contains 43 out of 77 places after structural reductions.
[2024-05-21 17:29:53] [INFO ] Flatten gal took : 200 ms
[2024-05-21 17:29:53] [INFO ] Flatten gal took : 116 ms
[2024-05-21 17:29:53] [INFO ] Input system was already deterministic with 564 transitions.
Incomplete random walk after 10000 steps, including 515 resets, run finished after 924 ms. (steps per millisecond=10 ) properties (out of 31) seen :15
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 564 rows 77 cols
[2024-05-21 17:29:54] [INFO ] Computed 10 invariants in 12 ms
[2024-05-21 17:29:55] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 17:29:56] [INFO ] After 767ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:11
[2024-05-21 17:29:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 17:29:57] [INFO ] After 938ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :10
[2024-05-21 17:29:57] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-21 17:29:57] [INFO ] After 720ms SMT Verify possible using 251 Read/Feed constraints in natural domain returned unsat :6 sat :10
[2024-05-21 17:29:58] [INFO ] After 1650ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :10
Attempting to minimize the solution found.
Minimization took 773 ms.
[2024-05-21 17:29:59] [INFO ] After 3513ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :10
Fused 16 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 565 ms.
Support contains 28 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 564/564 transitions.
Graph (complete) has 832 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 76 transition count 554
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 70 transition count 552
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 68 transition count 552
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 68 transition count 549
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 65 transition count 549
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 31 place count 60 transition count 512
Iterating global reduction 3 with 5 rules applied. Total rules applied 36 place count 60 transition count 512
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 59 transition count 511
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 44 place count 59 transition count 505
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 98 place count 53 transition count 457
Applied a total of 98 rules in 177 ms. Remains 53 /77 variables (removed 24) and now considering 457/564 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 53/77 places, 457/564 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 457 rows 53 cols
[2024-05-21 17:30:00] [INFO ] Computed 12 invariants in 5 ms
[2024-05-21 17:30:01] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-21 17:30:01] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 17:30:01] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-21 17:30:01] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 17:30:01] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-05-21 17:30:01] [INFO ] After 184ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 17:30:01] [INFO ] After 386ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 158 ms.
[2024-05-21 17:30:02] [INFO ] After 964ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 28 ms.
Support contains 7 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 457/457 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 51 transition count 455
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 51 transition count 453
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 24 place count 49 transition count 437
Applied a total of 24 rules in 101 ms. Remains 49 /53 variables (removed 4) and now considering 437/457 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 49/53 places, 437/457 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 832454 steps, run timeout after 3001 ms. (steps per millisecond=277 ) properties seen :{2=1}
Probabilistic random walk after 832454 steps, saw 107225 distinct states, run finished after 3002 ms. (steps per millisecond=277 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 437 rows 49 cols
[2024-05-21 17:30:05] [INFO ] Computed 12 invariants in 6 ms
[2024-05-21 17:30:05] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-21 17:30:06] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 17:30:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-21 17:30:06] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 17:30:06] [INFO ] State equation strengthened by 153 read => feed constraints.
[2024-05-21 17:30:06] [INFO ] After 120ms SMT Verify possible using 153 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 17:30:06] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 93 ms.
[2024-05-21 17:30:06] [INFO ] After 702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 437/437 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 48 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 428
Applied a total of 2 rules in 34 ms. Remains 48 /49 variables (removed 1) and now considering 428/437 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 48/49 places, 428/437 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 428 rows 48 cols
[2024-05-21 17:30:07] [INFO ] Computed 12 invariants in 4 ms
[2024-05-21 17:30:07] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-21 17:30:07] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 17:30:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-21 17:30:07] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 17:30:07] [INFO ] State equation strengthened by 145 read => feed constraints.
[2024-05-21 17:30:07] [INFO ] After 61ms SMT Verify possible using 145 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 17:30:07] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2024-05-21 17:30:07] [INFO ] After 397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 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 31 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 32 ms. Remains : 47/48 places, 419/428 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1526333 steps, run timeout after 3001 ms. (steps per millisecond=508 ) properties seen :{}
Probabilistic random walk after 1526333 steps, saw 189832 distinct states, run finished after 3006 ms. (steps per millisecond=507 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 419 rows 47 cols
[2024-05-21 17:30:10] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 17:30:10] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 17:30:11] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 17:30:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 17:30:11] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 17:30:11] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-21 17:30:11] [INFO ] After 73ms SMT Verify possible using 137 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 17:30:11] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-21 17:30:11] [INFO ] After 410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 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 20 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 20 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 20 ms. Remains 47 /47 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2024-05-21 17:30:11] [INFO ] Invariant cache hit.
[2024-05-21 17:30:11] [INFO ] Implicit Places using invariants in 188 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 192 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 19 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 234 ms. Remains : 46/47 places, 419/419 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1653518 steps, run timeout after 3001 ms. (steps per millisecond=550 ) properties seen :{}
Probabilistic random walk after 1653518 steps, saw 204926 distinct states, run finished after 3001 ms. (steps per millisecond=550 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 419 rows 46 cols
[2024-05-21 17:30:14] [INFO ] Computed 11 invariants in 5 ms
[2024-05-21 17:30:14] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 17:30:15] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 17:30:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 17:30:15] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 17:30:15] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-21 17:30:15] [INFO ] After 74ms SMT Verify possible using 137 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 17:30:15] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-21 17:30:15] [INFO ] After 414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 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 20 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 21 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 21 ms. Remains 46 /46 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2024-05-21 17:30:15] [INFO ] Invariant cache hit.
[2024-05-21 17:30:15] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-21 17:30:15] [INFO ] Invariant cache hit.
[2024-05-21 17:30:15] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-21 17:30:15] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2024-05-21 17:30:16] [INFO ] Redundant transitions in 40 ms returned []
[2024-05-21 17:30:16] [INFO ] Invariant cache hit.
[2024-05-21 17:30:16] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 987 ms. Remains : 46/46 places, 419/419 transitions.
Applied a total of 0 rules in 18 ms. Remains 46 /46 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-21 17:30:16] [INFO ] Invariant cache hit.
[2024-05-21 17:30:16] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 17:30:16] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 17:30:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 17:30:16] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 17:30:16] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-21 17:30:17] [INFO ] After 323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
FORMULA AutonomousCar-PT-08a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 2 stable transitions
FORMULA AutonomousCar-PT-08a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(G(p1))))))'
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 72 transition count 519
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 72 transition count 519
Applied a total of 10 rules in 10 ms. Remains 72 /77 variables (removed 5) and now considering 519/564 (removed 45) transitions.
// Phase 1: matrix 519 rows 72 cols
[2024-05-21 17:30:17] [INFO ] Computed 10 invariants in 4 ms
[2024-05-21 17:30:17] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-21 17:30:17] [INFO ] Invariant cache hit.
[2024-05-21 17:30:17] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-21 17:30:18] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2024-05-21 17:30:18] [INFO ] Invariant cache hit.
[2024-05-21 17:30:18] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 72/77 places, 519/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 919 ms. Remains : 72/77 places, 519/564 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 415 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(AND (EQ s1 1) (EQ s9 1) (EQ s53 1) (EQ s67 1)), p0:(OR (EQ s1 0) (EQ s5 0) (EQ s26 0) (EQ s67 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15889 steps with 838 reset in 252 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-00 finished in 1658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||F(!p1)) U X(X(p2))))'
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 72 transition count 519
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 72 transition count 519
Applied a total of 10 rules in 7 ms. Remains 72 /77 variables (removed 5) and now considering 519/564 (removed 45) transitions.
// Phase 1: matrix 519 rows 72 cols
[2024-05-21 17:30:19] [INFO ] Computed 10 invariants in 20 ms
[2024-05-21 17:30:19] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-21 17:30:19] [INFO ] Invariant cache hit.
[2024-05-21 17:30:19] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-21 17:30:19] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2024-05-21 17:30:19] [INFO ] Invariant cache hit.
[2024-05-21 17:30:19] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 72/77 places, 519/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 925 ms. Remains : 72/77 places, 519/564 transitions.
Stuttering acceptance computed with spot in 573 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p0) (NOT p2)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1), acceptance={} source=1 dest: 6}], [{ cond=p1, acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 7}, { cond=(AND p0 p1), acceptance={} source=3 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=8 dest: 9}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=8 dest: 10}], [{ cond=p1, acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 9}, { cond=(AND p0 p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s11 1) (EQ s40 1) (EQ s67 1)), p1:(AND (EQ s1 1) (EQ s9 1) (EQ s40 1) (EQ s67 1)), p2:(AND (EQ s1 1) (EQ s9 1) (EQ s47 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 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 1527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 13 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 70 transition count 501
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 70 transition count 501
Applied a total of 14 rules in 5 ms. Remains 70 /77 variables (removed 7) and now considering 501/564 (removed 63) transitions.
// Phase 1: matrix 501 rows 70 cols
[2024-05-21 17:30:20] [INFO ] Computed 10 invariants in 4 ms
[2024-05-21 17:30:20] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-21 17:30:20] [INFO ] Invariant cache hit.
[2024-05-21 17:30:21] [INFO ] State equation strengthened by 195 read => feed constraints.
[2024-05-21 17:30:21] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
[2024-05-21 17:30:21] [INFO ] Invariant cache hit.
[2024-05-21 17:30:21] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/77 places, 501/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1049 ms. Remains : 70/77 places, 501/564 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s1 1) (EQ s2 1) (EQ s42 1) (EQ s65 1)), p0:(AND (EQ s15 1) (EQ s21 1) (EQ s27 1) (EQ s33 1) (EQ s39 1) (EQ s45 1) (EQ s51 1) (EQ s59 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][false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-02 finished in 1202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(p0)'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 564/564 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 77 transition count 555
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 68 transition count 554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 67 transition count 554
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 67 transition count 553
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 66 transition count 553
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 29 place count 59 transition count 490
Iterating global reduction 3 with 7 rules applied. Total rules applied 36 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 40 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 42 place count 56 transition count 488
Applied a total of 42 rules in 280 ms. Remains 56 /77 variables (removed 21) and now considering 488/564 (removed 76) transitions.
// Phase 1: matrix 488 rows 56 cols
[2024-05-21 17:30:22] [INFO ] Computed 10 invariants in 10 ms
[2024-05-21 17:30:22] [INFO ] Implicit Places using invariants in 586 ms returned []
[2024-05-21 17:30:22] [INFO ] Invariant cache hit.
[2024-05-21 17:30:22] [INFO ] State equation strengthened by 197 read => feed constraints.
[2024-05-21 17:30:23] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 982 ms to find 0 implicit places.
[2024-05-21 17:30:23] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-21 17:30:23] [INFO ] Invariant cache hit.
[2024-05-21 17:30:23] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/77 places, 488/564 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1610 ms. Remains : 56/77 places, 488/564 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(AND (EQ s1 1) (EQ s10 1) (EQ s19 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-03 finished in 1700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 11 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 564/564 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 77 transition count 556
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 69 transition count 556
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 69 transition count 554
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 67 transition count 554
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 60 transition count 491
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 60 transition count 491
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 59 transition count 490
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 58 transition count 490
Applied a total of 38 rules in 131 ms. Remains 58 /77 variables (removed 19) and now considering 490/564 (removed 74) transitions.
// Phase 1: matrix 490 rows 58 cols
[2024-05-21 17:30:23] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 17:30:24] [INFO ] Implicit Places using invariants in 709 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 737 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/77 places, 490/564 transitions.
Applied a total of 0 rules in 43 ms. Remains 57 /57 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 942 ms. Remains : 57/77 places, 490/564 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s19 1) (EQ s22 1) (EQ s27 1) (EQ s34 1) (EQ s37 1) (EQ s42 1) (EQ s47 1) (EQ s54 1)), p1:(AND (EQ s12 1) (EQ s19 1) (EQ s22 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-05 finished in 1283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 71 transition count 510
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 71 transition count 510
Applied a total of 12 rules in 23 ms. Remains 71 /77 variables (removed 6) and now considering 510/564 (removed 54) transitions.
// Phase 1: matrix 510 rows 71 cols
[2024-05-21 17:30:24] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 17:30:25] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-21 17:30:25] [INFO ] Invariant cache hit.
[2024-05-21 17:30:25] [INFO ] State equation strengthened by 203 read => feed constraints.
[2024-05-21 17:30:25] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
[2024-05-21 17:30:25] [INFO ] Invariant cache hit.
[2024-05-21 17:30:26] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 71/77 places, 510/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1332 ms. Remains : 71/77 places, 510/564 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s2 1) (EQ s16 1) (EQ s66 1)), p1:(AND (EQ s1 1) (EQ s7 1) (EQ s26 1) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-09 finished in 1480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G(p1)||G(F(p2))))))'
Support contains 8 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 71 transition count 510
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 71 transition count 510
Applied a total of 12 rules in 5 ms. Remains 71 /77 variables (removed 6) and now considering 510/564 (removed 54) transitions.
// Phase 1: matrix 510 rows 71 cols
[2024-05-21 17:30:26] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 17:30:26] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-21 17:30:26] [INFO ] Invariant cache hit.
[2024-05-21 17:30:26] [INFO ] State equation strengthened by 203 read => feed constraints.
[2024-05-21 17:30:26] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2024-05-21 17:30:26] [INFO ] Invariant cache hit.
[2024-05-21 17:30:27] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 71/77 places, 510/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1021 ms. Remains : 71/77 places, 510/564 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s8 1) (EQ s47 1) (EQ s66 1)), p1:(AND (EQ s1 1) (EQ s6 1) (EQ s23 1) (EQ s66 1)), p2:(AND (EQ s1 1) (EQ s10 1) (EQ s14 1) (EQ s66 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, null][false, 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 1288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 13 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 564/564 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 7 rules applied. Total rules applied 7 place count 77 transition count 557
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 70 transition count 557
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 70 transition count 555
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 18 place count 68 transition count 555
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 25 place count 61 transition count 492
Iterating global reduction 2 with 7 rules applied. Total rules applied 32 place count 61 transition count 492
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 60 transition count 492
Applied a total of 34 rules in 99 ms. Remains 60 /77 variables (removed 17) and now considering 492/564 (removed 72) transitions.
// Phase 1: matrix 492 rows 60 cols
[2024-05-21 17:30:27] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 17:30:28] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-05-21 17:30:28] [INFO ] Invariant cache hit.
[2024-05-21 17:30:28] [INFO ] State equation strengthened by 197 read => feed constraints.
[2024-05-21 17:30:28] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
[2024-05-21 17:30:28] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-21 17:30:28] [INFO ] Invariant cache hit.
[2024-05-21 17:30:29] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/77 places, 492/564 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1561 ms. Remains : 60/77 places, 492/564 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s16 0) (EQ s19 0) (EQ s26 0) (EQ s31 0) (EQ s34 0) (EQ s42 0) (EQ s45 0) (EQ s50 0) (EQ s57 0)), p1:(OR (EQ s1 0) (EQ s2 0) (EQ s37 0) (EQ s56 ...], 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 248 reset in 202 ms.
Product exploration explored 100000 steps with 202 reset in 261 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 134 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 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 577 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 17:30:30] [INFO ] Invariant cache hit.
[2024-05-21 17:30:30] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 17:30:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 17:30:30] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 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-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08a-LTLFireability-11 finished in 2632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 564/564 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 77 transition count 556
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 69 transition count 556
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 69 transition count 554
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 67 transition count 554
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 26 place count 61 transition count 500
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 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 34 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 36 place count 59 transition count 499
Applied a total of 36 rules in 51 ms. Remains 59 /77 variables (removed 18) and now considering 499/564 (removed 65) transitions.
// Phase 1: matrix 499 rows 59 cols
[2024-05-21 17:30:30] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 17:30:30] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-21 17:30:30] [INFO ] Invariant cache hit.
[2024-05-21 17:30:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-21 17:30:30] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2024-05-21 17:30:30] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-21 17:30:30] [INFO ] Invariant cache hit.
[2024-05-21 17:30:30] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/77 places, 499/564 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 843 ms. Remains : 59/77 places, 499/564 transitions.
Stuttering acceptance computed with spot in 169 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 88 reset in 79 ms.
Product exploration explored 100000 steps with 157 reset in 98 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 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 148 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 77 ms :[(AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 629 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 17:30:31] [INFO ] Invariant cache hit.
[2024-05-21 17:30:31] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-21 17:30:31] [INFO ] After 142ms 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 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 31 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 1774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 564/564 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 77 transition count 554
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 67 transition count 554
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 67 transition count 553
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 66 transition count 553
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 61 transition count 508
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 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 38 place count 58 transition count 506
Applied a total of 38 rules in 73 ms. Remains 58 /77 variables (removed 19) and now considering 506/564 (removed 58) transitions.
// Phase 1: matrix 506 rows 58 cols
[2024-05-21 17:30:31] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 17:30:32] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-21 17:30:32] [INFO ] Invariant cache hit.
[2024-05-21 17:30:32] [INFO ] State equation strengthened by 213 read => feed constraints.
[2024-05-21 17:30:32] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2024-05-21 17:30:32] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-21 17:30:32] [INFO ] Invariant cache hit.
[2024-05-21 17:30:33] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/77 places, 506/564 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1211 ms. Remains : 58/77 places, 506/564 transitions.
Stuttering acceptance computed with spot in 81 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 474 reset in 125 ms.
Product exploration explored 100000 steps with 178 reset in 148 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 181 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 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 685 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 694768 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{}
Probabilistic random walk after 694768 steps, saw 86878 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-21 17:30:37] [INFO ] Invariant cache hit.
[2024-05-21 17:30:37] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 17:30:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 17:30:37] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-21 17:30:37] [INFO ] State equation strengthened by 213 read => feed constraints.
[2024-05-21 17:30:37] [INFO ] After 90ms SMT Verify possible using 213 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-21 17:30:37] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-21 17:30:37] [INFO ] After 498ms 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 10 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.2 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 54 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 55 ms. Remains : 48/58 places, 430/506 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 1094949 steps, run visited all 1 properties in 2495 ms. (steps per millisecond=438 )
Probabilistic random walk after 1094949 steps, saw 140432 distinct states, run finished after 2495 ms. (steps per millisecond=438 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
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 (Minato strategy)
Knowledge based reduction with 6 factoid took 17 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 8391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X((F(p1) U p2)))))'
Support contains 11 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 71 transition count 510
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 71 transition count 510
Applied a total of 12 rules in 3 ms. Remains 71 /77 variables (removed 6) and now considering 510/564 (removed 54) transitions.
// Phase 1: matrix 510 rows 71 cols
[2024-05-21 17:30:40] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 17:30:40] [INFO ] Implicit Places using invariants in 245 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 246 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/77 places, 510/564 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 510/510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 252 ms. Remains : 70/77 places, 510/564 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s13 0), p2:(EQ s49 1), p1:(AND (EQ s14 1) (EQ s21 1) (EQ s27 1) (EQ s33 1) (EQ s41 1) (EQ s47 1) (EQ s53 1) (EQ s57 1) (EQ s66 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-15 finished in 544 ms.
All properties solved by simple procedures.
Total runtime 49704 ms.

BK_STOP 1716312642069

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r043-smll-171620180300208"
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 ;