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-171620180300188.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-06a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180300188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Apr 12 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 17:58 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 177K 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-06a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716307268490

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-06a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 16:01:10] [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 16:01:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:01:11] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-05-21 16:01:11] [INFO ] Transformed 65 places.
[2024-05-21 16:01:11] [INFO ] Transformed 417 transitions.
[2024-05-21 16:01:11] [INFO ] Found NUPN structural information;
[2024-05-21 16:01:11] [INFO ] Parsed PT model containing 65 places and 417 transitions and 3356 arcs in 242 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 159 transitions
Reduce redundant transitions removed 159 transitions.
FORMULA AutonomousCar-PT-06a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 63 transition count 244
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 63 transition count 244
Applied a total of 4 rules in 42 ms. Remains 63 /65 variables (removed 2) and now considering 244/258 (removed 14) transitions.
[2024-05-21 16:01:11] [INFO ] Flow matrix only has 243 transitions (discarded 1 similar events)
// Phase 1: matrix 243 rows 63 cols
[2024-05-21 16:01:11] [INFO ] Computed 11 invariants in 17 ms
[2024-05-21 16:01:11] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-21 16:01:11] [INFO ] Flow matrix only has 243 transitions (discarded 1 similar events)
[2024-05-21 16:01:11] [INFO ] Invariant cache hit.
[2024-05-21 16:01:12] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-21 16:01:12] [INFO ] Implicit Places using invariants and state equation in 325 ms returned [58, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 709 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/65 places, 244/258 transitions.
Applied a total of 0 rules in 7 ms. Remains 61 /61 variables (removed 0) and now considering 244/244 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 759 ms. Remains : 61/65 places, 244/258 transitions.
Support contains 32 out of 61 places after structural reductions.
[2024-05-21 16:01:12] [INFO ] Flatten gal took : 110 ms
[2024-05-21 16:01:12] [INFO ] Flatten gal took : 54 ms
[2024-05-21 16:01:12] [INFO ] Input system was already deterministic with 244 transitions.
Incomplete random walk after 10000 steps, including 551 resets, run finished after 721 ms. (steps per millisecond=13 ) properties (out of 24) seen :13
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-21 16:01:13] [INFO ] Flow matrix only has 243 transitions (discarded 1 similar events)
// Phase 1: matrix 243 rows 61 cols
[2024-05-21 16:01:13] [INFO ] Computed 9 invariants in 5 ms
[2024-05-21 16:01:13] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-21 16:01:14] [INFO ] After 388ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2024-05-21 16:01:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-05-21 16:01:14] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2024-05-21 16:01:14] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-21 16:01:14] [INFO ] After 158ms SMT Verify possible using 135 Read/Feed constraints in natural domain returned unsat :2 sat :5
[2024-05-21 16:01:14] [INFO ] After 334ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 135 ms.
[2024-05-21 16:01:15] [INFO ] After 815ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 7 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 244/244 transitions.
Graph (complete) has 502 edges and 61 vertex of which 59 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 59 transition count 233
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 17 place count 53 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 52 transition count 232
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 52 transition count 231
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 20 place count 51 transition count 231
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 23 place count 48 transition count 216
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 48 transition count 216
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 45 transition count 213
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 37 place count 45 transition count 208
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 66 place count 40 transition count 184
Applied a total of 66 rules in 97 ms. Remains 40 /61 variables (removed 21) and now considering 184/244 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 40/61 places, 184/244 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 184 rows 40 cols
[2024-05-21 16:01:15] [INFO ] Computed 10 invariants in 10 ms
[2024-05-21 16:01:15] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 16:01:15] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 16:01:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-21 16:01:15] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 16:01:15] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-05-21 16:01:15] [INFO ] After 50ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 16:01:15] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-21 16:01:16] [INFO ] After 317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 184/184 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 40 transition count 182
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 38 transition count 170
Applied a total of 16 rules in 21 ms. Remains 38 /40 variables (removed 2) and now considering 170/184 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 38/40 places, 170/184 transitions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Finished probabilistic random walk after 56259 steps, run visited all 2 properties in 190 ms. (steps per millisecond=296 )
Probabilistic random walk after 56259 steps, saw 9326 distinct states, run finished after 190 ms. (steps per millisecond=296 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-06a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 56 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 56 transition count 215
Applied a total of 10 rules in 5 ms. Remains 56 /61 variables (removed 5) and now considering 215/244 (removed 29) transitions.
// Phase 1: matrix 215 rows 56 cols
[2024-05-21 16:01:16] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 16:01:16] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 16:01:16] [INFO ] Invariant cache hit.
[2024-05-21 16:01:16] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 16:01:17] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2024-05-21 16:01:17] [INFO ] Invariant cache hit.
[2024-05-21 16:01:17] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/61 places, 215/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 399 ms. Remains : 56/61 places, 215/244 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 416 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-00 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s1 1) (NEQ s5 1) (NEQ s44 1) (NEQ s51 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 142 reset in 298 ms.
Product exploration explored 100000 steps with 189 reset in 161 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 547 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10406 steps, run visited all 1 properties in 33 ms. (steps per millisecond=315 )
Probabilistic random walk after 10406 steps, saw 2283 distinct states, run finished after 33 ms. (steps per millisecond=315 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-21 16:01:18] [INFO ] Invariant cache hit.
[2024-05-21 16:01:18] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 16:01:18] [INFO ] Invariant cache hit.
[2024-05-21 16:01:18] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 16:01:19] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-05-21 16:01:19] [INFO ] Invariant cache hit.
[2024-05-21 16:01:19] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 406 ms. Remains : 56/56 places, 215/215 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 558 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10406 steps, run visited all 1 properties in 71 ms. (steps per millisecond=146 )
Probabilistic random walk after 10406 steps, saw 2283 distinct states, run finished after 74 ms. (steps per millisecond=140 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 45 reset in 74 ms.
Product exploration explored 100000 steps with 5 reset in 300 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 215/215 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 56 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 56 transition count 217
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 56 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 56 transition count 217
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 55 transition count 216
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 55 transition count 216
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 55 transition count 219
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 14 rules in 42 ms. Remains 55 /56 variables (removed 1) and now considering 219/215 (removed -4) transitions.
[2024-05-21 16:01:20] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 219 rows 55 cols
[2024-05-21 16:01:20] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 16:01:21] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/56 places, 219/215 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 225 ms. Remains : 55/56 places, 219/215 transitions.
Built C files in :
/tmp/ltsmin3049889476504771676
[2024-05-21 16:01:21] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3049889476504771676
Running compilation step : cd /tmp/ltsmin3049889476504771676;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 800 ms.
Running link step : cd /tmp/ltsmin3049889476504771676;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3049889476504771676;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14327771523727637541.hoa' '--buchi-type=spotba'
LTSmin run took 2647 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-06a-LTLFireability-00 finished in 7978 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(X(X(F(p0))))))'
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 56 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 56 transition count 215
Applied a total of 10 rules in 5 ms. Remains 56 /61 variables (removed 5) and now considering 215/244 (removed 29) transitions.
// Phase 1: matrix 215 rows 56 cols
[2024-05-21 16:01:24] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 16:01:24] [INFO ] Implicit Places using invariants in 152 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 164 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/61 places, 215/244 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 172 ms. Remains : 55/61 places, 215/244 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-03 finished in 373 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(p0)) U (G(!p2)&&p1)))'
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 244/244 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 6 rules applied. Total rules applied 6 place count 61 transition count 238
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 55 transition count 238
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 55 transition count 237
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 14 place count 54 transition count 237
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 49 transition count 208
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 49 transition count 208
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 28 place count 47 transition count 206
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 30 place count 46 transition count 206
Applied a total of 30 rules in 40 ms. Remains 46 /61 variables (removed 15) and now considering 206/244 (removed 38) transitions.
// Phase 1: matrix 206 rows 46 cols
[2024-05-21 16:01:25] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 16:01:25] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 16:01:25] [INFO ] Invariant cache hit.
[2024-05-21 16:01:25] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-05-21 16:01:25] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2024-05-21 16:01:25] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-21 16:01:25] [INFO ] Invariant cache hit.
[2024-05-21 16:01:25] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/61 places, 206/244 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 486 ms. Remains : 46/61 places, 206/244 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p0), p2]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s4 1) (EQ s19 1) (EQ s42 1)), p2:(AND (EQ s1 1) (EQ s8 1) (EQ s35 1) (EQ s42 1)), p0:(AND (EQ s1 1) (EQ s4 1) (EQ s19 1) (EQ s42 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-04 finished in 689 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((X(p1)||(F(p3)&&p2)||p0)))'
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 57 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 57 transition count 222
Applied a total of 8 rules in 5 ms. Remains 57 /61 variables (removed 4) and now considering 222/244 (removed 22) transitions.
// Phase 1: matrix 222 rows 57 cols
[2024-05-21 16:01:25] [INFO ] Computed 8 invariants in 3 ms
[2024-05-21 16:01:25] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 16:01:25] [INFO ] Invariant cache hit.
[2024-05-21 16:01:25] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-21 16:01:26] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2024-05-21 16:01:26] [INFO ] Invariant cache hit.
[2024-05-21 16:01:26] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/61 places, 222/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 418 ms. Remains : 57/61 places, 222/244 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), true, (NOT p3)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s9 0) (EQ s32 0) (EQ s52 0)), p2:(AND (EQ s1 1) (EQ s9 1) (EQ s38 1) (EQ s52 1)), p3:(AND (EQ s1 1) (EQ s7 1) (EQ s32 1) (EQ s52 1)),...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 204 steps with 13 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-05 finished in 614 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((p0&&(p1 U p2)))&&G(p0))))'
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 57 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 57 transition count 222
Applied a total of 8 rules in 4 ms. Remains 57 /61 variables (removed 4) and now considering 222/244 (removed 22) transitions.
// Phase 1: matrix 222 rows 57 cols
[2024-05-21 16:01:26] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 16:01:26] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 16:01:26] [INFO ] Invariant cache hit.
[2024-05-21 16:01:26] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-21 16:01:26] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-05-21 16:01:26] [INFO ] Invariant cache hit.
[2024-05-21 16:01:26] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/61 places, 222/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 396 ms. Remains : 57/61 places, 222/244 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s7 0) (EQ s33 0) (EQ s52 0)), p2:(AND (EQ s1 1) (EQ s9 1) (EQ s21 1) (EQ s52 1)), p1:(AND (EQ s1 1) (EQ s5 1) (EQ s20 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 214 reset in 84 ms.
Product exploration explored 100000 steps with 80 reset in 147 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (AND p0 (NOT p2) (NOT p1))), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 144 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 567 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 16:01:27] [INFO ] Invariant cache hit.
[2024-05-21 16:01:27] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 16:01:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-21 16:01:28] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 16:01:28] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-21 16:01:28] [INFO ] After 72ms SMT Verify possible using 117 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 16:01:28] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 60 ms.
[2024-05-21 16:01:28] [INFO ] After 421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 23 ms.
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 222/222 transitions.
Graph (complete) has 478 edges and 57 vertex of which 56 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 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 56 transition count 212
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 50 transition count 210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 48 transition count 210
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 48 transition count 209
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 47 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 46 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 46 transition count 208
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 43 transition count 205
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 43 transition count 201
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 62 place count 39 transition count 177
Applied a total of 62 rules in 43 ms. Remains 39 /57 variables (removed 18) and now considering 177/222 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 39/57 places, 177/222 transitions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Finished probabilistic random walk after 29885 steps, run visited all 2 properties in 93 ms. (steps per millisecond=321 )
Probabilistic random walk after 29885 steps, saw 5521 distinct states, run finished after 94 ms. (steps per millisecond=317 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (AND p0 (NOT p2) (NOT p1))), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 320 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2024-05-21 16:01:29] [INFO ] Invariant cache hit.
[2024-05-21 16:01:29] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 16:01:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 16:01:29] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-21 16:01:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:01:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 16:01:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 16:01:29] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-21 16:01:29] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-21 16:01:29] [INFO ] [Nat]Added 117 Read/Feed constraints in 17 ms returned sat
[2024-05-21 16:01:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 205 transitions) in 62 ms.
[2024-05-21 16:01:29] [INFO ] Added : 1 causal constraints over 1 iterations in 98 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 222/222 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-21 16:01:29] [INFO ] Invariant cache hit.
[2024-05-21 16:01:29] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 16:01:29] [INFO ] Invariant cache hit.
[2024-05-21 16:01:30] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-21 16:01:30] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2024-05-21 16:01:30] [INFO ] Invariant cache hit.
[2024-05-21 16:01:30] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 57/57 places, 222/222 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 137 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 557 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 16:01:30] [INFO ] Invariant cache hit.
[2024-05-21 16:01:30] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 16:01:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-21 16:01:31] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 16:01:31] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-21 16:01:31] [INFO ] After 74ms SMT Verify possible using 117 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 16:01:31] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-21 16:01:31] [INFO ] After 406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 31 ms.
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 222/222 transitions.
Graph (complete) has 478 edges and 57 vertex of which 56 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 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 56 transition count 212
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 50 transition count 210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 48 transition count 210
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 48 transition count 209
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 47 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 46 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 46 transition count 208
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 43 transition count 205
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 43 transition count 201
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 62 place count 39 transition count 177
Applied a total of 62 rules in 43 ms. Remains 39 /57 variables (removed 18) and now considering 177/222 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 39/57 places, 177/222 transitions.
Incomplete random walk after 10000 steps, including 60 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Finished probabilistic random walk after 29885 steps, run visited all 2 properties in 129 ms. (steps per millisecond=231 )
Probabilistic random walk after 29885 steps, saw 5521 distinct states, run finished after 129 ms. (steps per millisecond=231 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 337 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2024-05-21 16:01:32] [INFO ] Invariant cache hit.
[2024-05-21 16:01:32] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-21 16:01:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 16:01:32] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-21 16:01:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:01:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 16:01:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 16:01:32] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-21 16:01:33] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-21 16:01:33] [INFO ] [Nat]Added 117 Read/Feed constraints in 16 ms returned sat
[2024-05-21 16:01:33] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 205 transitions) in 45 ms.
[2024-05-21 16:01:33] [INFO ] Added : 1 causal constraints over 1 iterations in 77 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 36 reset in 68 ms.
Product exploration explored 100000 steps with 92 reset in 84 ms.
Built C files in :
/tmp/ltsmin17769287629805242738
[2024-05-21 16:01:33] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17769287629805242738
Running compilation step : cd /tmp/ltsmin17769287629805242738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 688 ms.
Running link step : cd /tmp/ltsmin17769287629805242738;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17769287629805242738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10106648686024601825.hoa' '--buchi-type=spotba'
LTSmin run took 1234 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-06a-LTLFireability-06 finished in 9141 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(F(((G(p0) U p1)&&F(p2)))))'
Support contains 11 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 56 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 56 transition count 215
Applied a total of 10 rules in 1 ms. Remains 56 /61 variables (removed 5) and now considering 215/244 (removed 29) transitions.
// Phase 1: matrix 215 rows 56 cols
[2024-05-21 16:01:35] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 16:01:35] [INFO ] Implicit Places using invariants in 112 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/61 places, 215/244 transitions.
Applied a total of 0 rules in 0 ms. Remains 55 /55 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 55/61 places, 215/244 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s14 1) (EQ s20 1) (EQ s24 1) (EQ s30 1) (EQ s36 1) (EQ s44 1) (EQ s51 1)), p2:(AND (EQ s14 1) (EQ s18 1) (EQ s24 1) (EQ s32 1) (EQ s38 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-07 finished in 342 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 U X(X((F(p1)||G((!p0||X(!p2))))))))'
Support contains 13 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 58 transition count 229
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 58 transition count 229
Applied a total of 6 rules in 2 ms. Remains 58 /61 variables (removed 3) and now considering 229/244 (removed 15) transitions.
// Phase 1: matrix 229 rows 58 cols
[2024-05-21 16:01:35] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 16:01:35] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 16:01:35] [INFO ] Invariant cache hit.
[2024-05-21 16:01:36] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-21 16:01:36] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2024-05-21 16:01:36] [INFO ] Invariant cache hit.
[2024-05-21 16:01:36] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/61 places, 229/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 465 ms. Remains : 58/61 places, 229/244 transitions.
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p0 p2), (AND (NOT p1) p2 p0), (NOT p1), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 7}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 7}]], initial=1, aps=[p0:(AND (EQ s1 1) (EQ s7 1) (EQ s25 1) (EQ s53 1)), p1:(AND (EQ s16 1) (EQ s22 1) (EQ s26 1) (EQ s35 1) (EQ s39 1) (EQ s45 1) (EQ s54 1)), p2:(AND (EQ s1 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 87 reset in 145 ms.
Product exploration explored 100000 steps with 42 reset in 153 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Incomplete random walk after 10000 steps, including 557 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 16:01:37] [INFO ] Invariant cache hit.
[2024-05-21 16:01:37] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 16:01:37] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 16:01:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 16:01:37] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 16:01:37] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-21 16:01:37] [INFO ] After 51ms SMT Verify possible using 123 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 16:01:37] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-21 16:01:37] [INFO ] After 278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 11 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 229/229 transitions.
Graph (complete) has 486 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 57 transition count 219
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 51 transition count 219
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 51 transition count 216
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 48 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 46 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 46 transition count 208
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 28 place count 45 transition count 207
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 45 transition count 201
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 76 place count 39 transition count 165
Applied a total of 76 rules in 25 ms. Remains 39 /58 variables (removed 19) and now considering 165/229 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 39/58 places, 165/229 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 63835 steps, run visited all 1 properties in 96 ms. (steps per millisecond=664 )
Probabilistic random walk after 63835 steps, saw 11055 distinct states, run finished after 96 ms. (steps per millisecond=664 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (AND (NOT p1) p0 (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 430 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Support contains 13 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 229/229 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 229/229 (removed 0) transitions.
[2024-05-21 16:01:38] [INFO ] Invariant cache hit.
[2024-05-21 16:01:39] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 16:01:39] [INFO ] Invariant cache hit.
[2024-05-21 16:01:39] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-21 16:01:39] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-21 16:01:39] [INFO ] Invariant cache hit.
[2024-05-21 16:01:39] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 58/58 places, 229/229 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Incomplete random walk after 10000 steps, including 572 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 16:01:39] [INFO ] Invariant cache hit.
[2024-05-21 16:01:39] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 16:01:39] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 16:01:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 16:01:40] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 16:01:40] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-21 16:01:40] [INFO ] After 82ms SMT Verify possible using 123 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 16:01:40] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-21 16:01:40] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 11 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 229/229 transitions.
Graph (complete) has 486 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 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 57 transition count 219
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 51 transition count 219
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 51 transition count 216
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 48 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 46 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 46 transition count 208
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 28 place count 45 transition count 207
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 45 transition count 201
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 76 place count 39 transition count 165
Applied a total of 76 rules in 37 ms. Remains 39 /58 variables (removed 19) and now considering 165/229 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 39/58 places, 165/229 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 63835 steps, run visited all 1 properties in 140 ms. (steps per millisecond=455 )
Probabilistic random walk after 63835 steps, saw 11055 distinct states, run finished after 141 ms. (steps per millisecond=452 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 3 factoid took 230 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Product exploration explored 100000 steps with 19 reset in 128 ms.
Product exploration explored 100000 steps with 31 reset in 143 ms.
Applying partial POR strategy [true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 267 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Support contains 13 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 229/229 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 58 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 58 transition count 231
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 58 transition count 231
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 58 transition count 231
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 58 transition count 234
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 10 rules in 19 ms. Remains 58 /58 variables (removed 0) and now considering 234/229 (removed -5) transitions.
[2024-05-21 16:01:42] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 234 rows 58 cols
[2024-05-21 16:01:42] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 16:01:42] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/58 places, 234/229 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 199 ms. Remains : 58/58 places, 234/229 transitions.
Built C files in :
/tmp/ltsmin4175702448393361832
[2024-05-21 16:01:42] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4175702448393361832
Running compilation step : cd /tmp/ltsmin4175702448393361832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 713 ms.
Running link step : cd /tmp/ltsmin4175702448393361832;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4175702448393361832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15426728247675886054.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 13 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 229/229 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 229/229 (removed 0) transitions.
// Phase 1: matrix 229 rows 58 cols
[2024-05-21 16:01:57] [INFO ] Computed 8 invariants in 5 ms
[2024-05-21 16:01:57] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 16:01:57] [INFO ] Invariant cache hit.
[2024-05-21 16:01:57] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-21 16:01:57] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-21 16:01:57] [INFO ] Invariant cache hit.
[2024-05-21 16:01:58] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 351 ms. Remains : 58/58 places, 229/229 transitions.
Built C files in :
/tmp/ltsmin4560895021980409035
[2024-05-21 16:01:58] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4560895021980409035
Running compilation step : cd /tmp/ltsmin4560895021980409035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 720 ms.
Running link step : cd /tmp/ltsmin4560895021980409035;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4560895021980409035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14518644228171212304.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 16:02:13] [INFO ] Flatten gal took : 49 ms
[2024-05-21 16:02:13] [INFO ] Flatten gal took : 38 ms
[2024-05-21 16:02:13] [INFO ] Time to serialize gal into /tmp/LTL6716976894091903752.gal : 6 ms
[2024-05-21 16:02:13] [INFO ] Time to serialize properties into /tmp/LTL368468525472466295.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6716976894091903752.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2468624435653456211.hoa' '-atoms' '/tmp/LTL368468525472466295.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL368468525472466295.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2468624435653456211.hoa
Detected timeout of ITS tools.
[2024-05-21 16:02:28] [INFO ] Flatten gal took : 32 ms
[2024-05-21 16:02:28] [INFO ] Flatten gal took : 32 ms
[2024-05-21 16:02:28] [INFO ] Time to serialize gal into /tmp/LTL7526962974757599022.gal : 4 ms
[2024-05-21 16:02:28] [INFO ] Time to serialize properties into /tmp/LTL17743994276196193694.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7526962974757599022.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17743994276196193694.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((!("(((p1==1)&&(p7==1))&&((p26==1)&&(p57==1)))"))U(X(X((F("((((p16==1)&&(p23==1))&&((p27==1)&&(p37==1)))&&(((p41==1)&&(p48==1))&&(p...281
Formula 0 simplified : "(((p1==1)&&(p7==1))&&((p26==1)&&(p57==1)))" R XX(G!"((((p16==1)&&(p23==1))&&((p27==1)&&(p37==1)))&&(((p41==1)&&(p48==1))&&(p58==1))...256
Detected timeout of ITS tools.
[2024-05-21 16:02:43] [INFO ] Flatten gal took : 25 ms
[2024-05-21 16:02:43] [INFO ] Applying decomposition
[2024-05-21 16:02:43] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10265697849273300039.txt' '-o' '/tmp/graph10265697849273300039.bin' '-w' '/tmp/graph10265697849273300039.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10265697849273300039.bin' '-l' '-1' '-v' '-w' '/tmp/graph10265697849273300039.weights' '-q' '0' '-e' '0.001'
[2024-05-21 16:02:43] [INFO ] Decomposing Gal with order
[2024-05-21 16:02:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 16:02:43] [INFO ] Removed a total of 756 redundant transitions.
[2024-05-21 16:02:43] [INFO ] Flatten gal took : 123 ms
[2024-05-21 16:02:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 12 ms.
[2024-05-21 16:02:43] [INFO ] Time to serialize gal into /tmp/LTL8827302977871734730.gal : 3 ms
[2024-05-21 16:02:43] [INFO ] Time to serialize properties into /tmp/LTL13545313594409525593.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8827302977871734730.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13545313594409525593.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((!("(((u0.p1==1)&&(u0.p7==1))&&((u8.p26==1)&&(u0.p57==1)))"))U(X(X((F("((((i1.u3.p16==1)&&(i2.u6.p23==1))&&((u8.p27==1)&&(i4.u12.p3...363
Formula 0 simplified : "(((u0.p1==1)&&(u0.p7==1))&&((u8.p26==1)&&(u0.p57==1)))" R XX(G!"((((i1.u3.p16==1)&&(i2.u6.p23==1))&&((u8.p27==1)&&(i4.u12.p37==1)))...338
Reverse transition relation is NOT exact ! Due to transitions t106, t130, t198, u0.t167, u8.t19, u8.t20, i1.u2.t29, i1.u2.t30, i1.u3.t28, i2.u5.t25, i2.u6....391
Computing Next relation with stutter on 10130 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin839024761387146116
[2024-05-21 16:02:59] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin839024761387146116
Running compilation step : cd /tmp/ltsmin839024761387146116;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 689 ms.
Running link step : cd /tmp/ltsmin839024761387146116;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin839024761387146116;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(LTLAPp0==true) U X(X((<>((LTLAPp1==true))||[]((!(LTLAPp0==true)||X(!(LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutonomousCar-PT-06a-LTLFireability-12 finished in 98303 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((p0&&X(G(p1))))&&G(F(p0))))'
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 244/244 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 61 transition count 237
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 54 transition count 237
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 54 transition count 236
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 16 place count 53 transition count 236
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 49 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 49 transition count 208
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 28 place count 47 transition count 206
Applied a total of 28 rules in 23 ms. Remains 47 /61 variables (removed 14) and now considering 206/244 (removed 38) transitions.
[2024-05-21 16:03:14] [INFO ] Flow matrix only has 205 transitions (discarded 1 similar events)
// Phase 1: matrix 205 rows 47 cols
[2024-05-21 16:03:14] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 16:03:14] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 16:03:14] [INFO ] Flow matrix only has 205 transitions (discarded 1 similar events)
[2024-05-21 16:03:14] [INFO ] Invariant cache hit.
[2024-05-21 16:03:14] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 16:03:14] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-05-21 16:03:14] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 16:03:14] [INFO ] Flow matrix only has 205 transitions (discarded 1 similar events)
[2024-05-21 16:03:14] [INFO ] Invariant cache hit.
[2024-05-21 16:03:14] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/61 places, 206/244 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 466 ms. Remains : 47/61 places, 206/244 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s40 1), p1:(AND (EQ s1 1) (EQ s4 1) (EQ s19 1) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-14 finished in 687 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 U X(X((F(p1)||G((!p0||X(!p2))))))))'
[2024-05-21 16:03:14] [INFO ] Flatten gal took : 41 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2282560453108656515
[2024-05-21 16:03:15] [INFO ] Computing symmetric may disable matrix : 244 transitions.
[2024-05-21 16:03:15] [INFO ] Applying decomposition
[2024-05-21 16:03:15] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:03:15] [INFO ] Computing symmetric may enable matrix : 244 transitions.
[2024-05-21 16:03:15] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:03:15] [INFO ] Flatten gal took : 43 ms
[2024-05-21 16:03:15] [INFO ] Computing Do-Not-Accords matrix : 244 transitions.
[2024-05-21 16:03:15] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:03:15] [INFO ] Built C files in 119ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2282560453108656515
Running compilation step : cd /tmp/ltsmin2282560453108656515;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11248167983408550018.txt' '-o' '/tmp/graph11248167983408550018.bin' '-w' '/tmp/graph11248167983408550018.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11248167983408550018.bin' '-l' '-1' '-v' '-w' '/tmp/graph11248167983408550018.weights' '-q' '0' '-e' '0.001'
[2024-05-21 16:03:15] [INFO ] Decomposing Gal with order
[2024-05-21 16:03:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 16:03:15] [INFO ] Removed a total of 778 redundant transitions.
[2024-05-21 16:03:15] [INFO ] Flatten gal took : 107 ms
[2024-05-21 16:03:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 21 ms.
[2024-05-21 16:03:15] [INFO ] Time to serialize gal into /tmp/LTLFireability5978930577357753339.gal : 2 ms
[2024-05-21 16:03:15] [INFO ] Time to serialize properties into /tmp/LTLFireability5329266235325797612.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5978930577357753339.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5329266235325797612.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((!("(((u0.p1==1)&&(u0.p7==1))&&((u8.p26==1)&&(u0.p57==1)))"))U(X(X((F("((((i1.u3.p16==1)&&(i2.u6.p23==1))&&((u8.p27==1)&&(i6.u12.p3...360
Formula 0 simplified : "(((u0.p1==1)&&(u0.p7==1))&&((u8.p26==1)&&(u0.p57==1)))" R XX(G!"((((i1.u3.p16==1)&&(i2.u6.p23==1))&&((u8.p27==1)&&(i6.u12.p37==1)))...335
Reverse transition relation is NOT exact ! Due to transitions t70, t106, t130, t160, t199, u0.t167, u5.t24, u5.t25, u8.t19, u8.t20, u14.t10, u14.t11, i1.u2...391
Computing Next relation with stutter on 10130 deadlock states
Compilation finished in 1133 ms.
Running link step : cd /tmp/ltsmin2282560453108656515;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2282560453108656515;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(LTLAPp0==true) U X(X((<>((LTLAPp1==true))||[]((!(LTLAPp0==true)||X(!(LTLAPp2==true))))))))' '--buchi-type=spotba'
LTSmin run took 111902 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 237397 ms.

BK_STOP 1716307509352

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

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