Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593500668.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is AutonomousCar-PT-09b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593500668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 865K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678522475153

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 08:14:37] [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]
[2023-03-11 08:14:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 08:14:37] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2023-03-11 08:14:37] [INFO ] Transformed 391 places.
[2023-03-11 08:14:37] [INFO ] Transformed 1554 transitions.
[2023-03-11 08:14:37] [INFO ] Found NUPN structural information;
[2023-03-11 08:14:37] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 273 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 2 formulas.
FORMULA AutonomousCar-PT-09b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 335 transition count 1498
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 335 transition count 1498
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 436 place count 335 transition count 1174
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 448 place count 323 transition count 1162
Iterating global reduction 1 with 12 rules applied. Total rules applied 460 place count 323 transition count 1162
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 461 place count 322 transition count 1161
Iterating global reduction 1 with 1 rules applied. Total rules applied 462 place count 322 transition count 1161
Applied a total of 462 rules in 109 ms. Remains 322 /391 variables (removed 69) and now considering 1161/1554 (removed 393) transitions.
// Phase 1: matrix 1161 rows 322 cols
[2023-03-11 08:14:38] [INFO ] Computed 14 place invariants in 18 ms
[2023-03-11 08:14:38] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-11 08:14:38] [INFO ] Invariant cache hit.
[2023-03-11 08:14:39] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
[2023-03-11 08:14:39] [INFO ] Invariant cache hit.
[2023-03-11 08:14:40] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 322/391 places, 1161/1554 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2164 ms. Remains : 322/391 places, 1161/1554 transitions.
Support contains 44 out of 322 places after structural reductions.
[2023-03-11 08:14:40] [INFO ] Flatten gal took : 209 ms
[2023-03-11 08:14:40] [INFO ] Flatten gal took : 130 ms
[2023-03-11 08:14:41] [INFO ] Input system was already deterministic with 1161 transitions.
Support contains 43 out of 322 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 82 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 31) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2023-03-11 08:14:41] [INFO ] Invariant cache hit.
[2023-03-11 08:14:42] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-11 08:14:44] [INFO ] After 2246ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:24
[2023-03-11 08:14:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-11 08:14:48] [INFO ] After 3303ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :24
[2023-03-11 08:14:49] [INFO ] Deduced a trap composed of 5 places in 445 ms of which 7 ms to minimize.
[2023-03-11 08:14:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 545 ms
[2023-03-11 08:14:53] [INFO ] Deduced a trap composed of 14 places in 615 ms of which 1 ms to minimize.
[2023-03-11 08:14:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 706 ms
[2023-03-11 08:14:53] [INFO ] Deduced a trap composed of 22 places in 309 ms of which 4 ms to minimize.
[2023-03-11 08:14:53] [INFO ] Deduced a trap composed of 24 places in 389 ms of which 13 ms to minimize.
[2023-03-11 08:14:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 821 ms
[2023-03-11 08:14:54] [INFO ] After 9388ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :24
Attempting to minimize the solution found.
Minimization took 2545 ms.
[2023-03-11 08:14:57] [INFO ] After 12552ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :24
Fused 25 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 269 ms.
Support contains 35 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Graph (trivial) has 256 edges and 322 vertex of which 4 / 322 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1581 edges and 320 vertex of which 318 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 113 rules applied. Total rules applied 115 place count 318 transition count 1044
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 162 rules applied. Total rules applied 277 place count 207 transition count 993
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 307 place count 177 transition count 993
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 307 place count 177 transition count 987
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 319 place count 171 transition count 987
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 321 place count 169 transition count 985
Iterating global reduction 3 with 2 rules applied. Total rules applied 323 place count 169 transition count 985
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 435 place count 113 transition count 929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 436 place count 113 transition count 928
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 445 place count 104 transition count 855
Iterating global reduction 4 with 9 rules applied. Total rules applied 454 place count 104 transition count 855
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 462 place count 104 transition count 847
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 5 with 4 rules applied. Total rules applied 466 place count 102 transition count 845
Free-agglomeration rule applied 19 times.
Iterating global reduction 5 with 19 rules applied. Total rules applied 485 place count 102 transition count 826
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 504 place count 83 transition count 826
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 510 place count 83 transition count 826
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 511 place count 82 transition count 825
Applied a total of 511 rules in 296 ms. Remains 82 /322 variables (removed 240) and now considering 825/1161 (removed 336) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 82/322 places, 825/1161 transitions.
Incomplete random walk after 10000 steps, including 52 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 24) seen :9
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 825 rows 82 cols
[2023-03-11 08:14:58] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-11 08:14:58] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-11 08:14:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-11 08:14:59] [INFO ] After 1233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-11 08:14:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:15:00] [INFO ] After 959ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-11 08:15:02] [INFO ] After 2601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1085 ms.
[2023-03-11 08:15:03] [INFO ] After 5071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 104 ms.
Support contains 28 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 825/825 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 824
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 81 transition count 824
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 4 place count 80 transition count 823
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 80 transition count 822
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 80 transition count 821
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7 place count 79 transition count 821
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 8 place count 79 transition count 821
Applied a total of 8 rules in 160 ms. Remains 79 /82 variables (removed 3) and now considering 821/825 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 79/82 places, 821/825 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :1
Running SMT prover for 6 properties.
// Phase 1: matrix 821 rows 79 cols
[2023-03-11 08:15:04] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-11 08:15:04] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-11 08:15:04] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 08:15:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-11 08:15:05] [INFO ] After 729ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 08:15:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:15:06] [INFO ] After 508ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 08:15:07] [INFO ] After 1353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 560 ms.
[2023-03-11 08:15:07] [INFO ] After 2737ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 64 ms.
Support contains 23 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 821/821 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 77 transition count 819
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 76 transition count 818
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 76 transition count 817
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 17 place count 75 transition count 808
Applied a total of 17 rules in 96 ms. Remains 75 /79 variables (removed 4) and now considering 808/821 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 75/79 places, 808/821 transitions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 808 rows 75 cols
[2023-03-11 08:15:08] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-11 08:15:08] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-11 08:15:08] [INFO ] After 491ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 08:15:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-11 08:15:09] [INFO ] After 498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 08:15:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:15:09] [INFO ] After 364ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 08:15:10] [INFO ] After 874ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 404 ms.
[2023-03-11 08:15:10] [INFO ] After 1908ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 39 ms.
Support contains 23 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 808/808 transitions.
Applied a total of 0 rules in 30 ms. Remains 75 /75 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 75/75 places, 808/808 transitions.
Incomplete random walk after 10000 steps, including 30 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 596122 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 596122 steps, saw 89589 distinct states, run finished after 3004 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 08:15:14] [INFO ] Invariant cache hit.
[2023-03-11 08:15:14] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-11 08:15:14] [INFO ] After 481ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 08:15:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-11 08:15:15] [INFO ] After 670ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 08:15:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:15:15] [INFO ] After 387ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 08:15:16] [INFO ] After 828ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 465 ms.
[2023-03-11 08:15:16] [INFO ] After 2060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 40 ms.
Support contains 23 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 808/808 transitions.
Applied a total of 0 rules in 34 ms. Remains 75 /75 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 75/75 places, 808/808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 808/808 transitions.
Applied a total of 0 rules in 31 ms. Remains 75 /75 variables (removed 0) and now considering 808/808 (removed 0) transitions.
[2023-03-11 08:15:16] [INFO ] Invariant cache hit.
[2023-03-11 08:15:17] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-11 08:15:17] [INFO ] Invariant cache hit.
[2023-03-11 08:15:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:15:17] [INFO ] Implicit Places using invariants and state equation in 375 ms returned [69, 73]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 612 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 73/75 places, 807/808 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 806
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 72 transition count 806
Applied a total of 3 rules in 110 ms. Remains 72 /73 variables (removed 1) and now considering 806/807 (removed 1) transitions.
// Phase 1: matrix 806 rows 72 cols
[2023-03-11 08:15:17] [INFO ] Computed 12 place invariants in 18 ms
[2023-03-11 08:15:17] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-11 08:15:17] [INFO ] Invariant cache hit.
[2023-03-11 08:15:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:15:18] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 72/75 places, 806/808 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1332 ms. Remains : 72/75 places, 806/808 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 604585 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 604585 steps, saw 88626 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 08:15:21] [INFO ] Invariant cache hit.
[2023-03-11 08:15:21] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-11 08:15:22] [INFO ] After 913ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 08:15:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-11 08:15:23] [INFO ] After 618ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 08:15:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:15:23] [INFO ] After 323ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 08:15:24] [INFO ] After 725ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 345 ms.
[2023-03-11 08:15:24] [INFO ] After 1771ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 44 ms.
Support contains 23 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 806/806 transitions.
Applied a total of 0 rules in 41 ms. Remains 72 /72 variables (removed 0) and now considering 806/806 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 72/72 places, 806/806 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 806/806 transitions.
Applied a total of 0 rules in 26 ms. Remains 72 /72 variables (removed 0) and now considering 806/806 (removed 0) transitions.
[2023-03-11 08:15:24] [INFO ] Invariant cache hit.
[2023-03-11 08:15:24] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-11 08:15:24] [INFO ] Invariant cache hit.
[2023-03-11 08:15:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:15:24] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2023-03-11 08:15:25] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-11 08:15:25] [INFO ] Invariant cache hit.
[2023-03-11 08:15:25] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1038 ms. Remains : 72/72 places, 806/806 transitions.
Applied a total of 0 rules in 23 ms. Remains 72 /72 variables (removed 0) and now considering 806/806 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-11 08:15:25] [INFO ] Invariant cache hit.
[2023-03-11 08:15:25] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-11 08:15:26] [INFO ] After 712ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 08:15:26] [INFO ] [Nat]Absence check using 12 positive place invariants in 15 ms returned sat
[2023-03-11 08:15:26] [INFO ] After 563ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 08:15:27] [INFO ] After 973ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 465 ms.
[2023-03-11 08:15:27] [INFO ] After 1560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA AutonomousCar-PT-09b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 48 stabilizing places and 49 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 11 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Graph (trivial) has 285 edges and 322 vertex of which 4 / 322 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 319 transition count 1043
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 167 rules applied. Total rules applied 283 place count 204 transition count 991
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 32 rules applied. Total rules applied 315 place count 173 transition count 990
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 316 place count 172 transition count 990
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 316 place count 172 transition count 984
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 328 place count 166 transition count 984
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 331 place count 163 transition count 981
Iterating global reduction 4 with 3 rules applied. Total rules applied 334 place count 163 transition count 981
Performed 65 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 464 place count 98 transition count 915
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 465 place count 98 transition count 914
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 479 place count 84 transition count 792
Iterating global reduction 5 with 14 rules applied. Total rules applied 493 place count 84 transition count 792
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 502 place count 84 transition count 783
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 6 with 4 rules applied. Total rules applied 506 place count 82 transition count 781
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 508 place count 80 transition count 779
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 509 place count 79 transition count 779
Applied a total of 509 rules in 209 ms. Remains 79 /322 variables (removed 243) and now considering 779/1161 (removed 382) transitions.
// Phase 1: matrix 779 rows 79 cols
[2023-03-11 08:15:28] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-11 08:15:28] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-11 08:15:28] [INFO ] Invariant cache hit.
[2023-03-11 08:15:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:15:29] [INFO ] Implicit Places using invariants and state equation in 413 ms returned [74, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 694 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/322 places, 779/1161 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 778
Applied a total of 2 rules in 77 ms. Remains 76 /77 variables (removed 1) and now considering 778/779 (removed 1) transitions.
// Phase 1: matrix 778 rows 76 cols
[2023-03-11 08:15:29] [INFO ] Computed 10 place invariants in 10 ms
[2023-03-11 08:15:29] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-11 08:15:29] [INFO ] Invariant cache hit.
[2023-03-11 08:15:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:15:30] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/322 places, 778/1161 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1815 ms. Remains : 76/322 places, 778/1161 transitions.
Stuttering acceptance computed with spot in 348 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s15 1), p1:(OR (EQ s13 0) (EQ s20 0) (EQ s29 0) (EQ s33 0) (EQ s42 0) (EQ s46 0) (EQ s55 0) (EQ s61 0) (EQ s65 0) (EQ s72 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12626 reset in 717 ms.
Product exploration explored 100000 steps with 12633 reset in 698 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 433 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 408 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :2
Finished Best-First random walk after 3727 steps, including 16 resets, run visited all 1 properties in 7 ms. (steps per millisecond=532 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 586 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 11 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 778/778 transitions.
Applied a total of 0 rules in 71 ms. Remains 76 /76 variables (removed 0) and now considering 778/778 (removed 0) transitions.
[2023-03-11 08:15:33] [INFO ] Invariant cache hit.
[2023-03-11 08:15:33] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-11 08:15:33] [INFO ] Invariant cache hit.
[2023-03-11 08:15:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:15:34] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2023-03-11 08:15:34] [INFO ] Redundant transitions in 86 ms returned [568]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 777 rows 76 cols
[2023-03-11 08:15:34] [INFO ] Computed 10 place invariants in 10 ms
[2023-03-11 08:15:34] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/76 places, 777/778 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 74 transition count 775
Applied a total of 2 rules in 33 ms. Remains 74 /76 variables (removed 2) and now considering 775/777 (removed 2) transitions.
// Phase 1: matrix 775 rows 74 cols
[2023-03-11 08:15:34] [INFO ] Computed 10 place invariants in 7 ms
[2023-03-11 08:15:35] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-11 08:15:35] [INFO ] Invariant cache hit.
[2023-03-11 08:15:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:15:35] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/76 places, 775/778 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1971 ms. Remains : 74/76 places, 775/778 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 416 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 393 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :2
Finished Best-First random walk after 2138 steps, including 7 resets, run visited all 1 properties in 4 ms. (steps per millisecond=534 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 536 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14285 reset in 666 ms.
Product exploration explored 100000 steps with 14285 reset in 600 ms.
Built C files in :
/tmp/ltsmin1900269962519787448
[2023-03-11 08:15:38] [INFO ] Computing symmetric may disable matrix : 775 transitions.
[2023-03-11 08:15:38] [INFO ] Computation of Complete disable matrix. took 102 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:15:38] [INFO ] Computing symmetric may enable matrix : 775 transitions.
[2023-03-11 08:15:38] [INFO ] Computation of Complete enable matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:15:38] [INFO ] Computing Do-Not-Accords matrix : 775 transitions.
[2023-03-11 08:15:38] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:15:38] [INFO ] Built C files in 426ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1900269962519787448
Running compilation step : cd /tmp/ltsmin1900269962519787448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1900269962519787448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1900269962519787448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 11 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 775/775 transitions.
Applied a total of 0 rules in 60 ms. Remains 74 /74 variables (removed 0) and now considering 775/775 (removed 0) transitions.
[2023-03-11 08:15:41] [INFO ] Invariant cache hit.
[2023-03-11 08:15:42] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-11 08:15:42] [INFO ] Invariant cache hit.
[2023-03-11 08:15:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:15:42] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
[2023-03-11 08:15:42] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-11 08:15:42] [INFO ] Invariant cache hit.
[2023-03-11 08:15:43] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1388 ms. Remains : 74/74 places, 775/775 transitions.
Built C files in :
/tmp/ltsmin14093345171046230452
[2023-03-11 08:15:43] [INFO ] Computing symmetric may disable matrix : 775 transitions.
[2023-03-11 08:15:43] [INFO ] Computation of Complete disable matrix. took 72 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:15:43] [INFO ] Computing symmetric may enable matrix : 775 transitions.
[2023-03-11 08:15:43] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:15:43] [INFO ] Computing Do-Not-Accords matrix : 775 transitions.
[2023-03-11 08:15:43] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:15:43] [INFO ] Built C files in 275ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14093345171046230452
Running compilation step : cd /tmp/ltsmin14093345171046230452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14093345171046230452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14093345171046230452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 08:15:46] [INFO ] Flatten gal took : 146 ms
[2023-03-11 08:15:47] [INFO ] Flatten gal took : 146 ms
[2023-03-11 08:15:47] [INFO ] Time to serialize gal into /tmp/LTL10792785629604452942.gal : 18 ms
[2023-03-11 08:15:47] [INFO ] Time to serialize properties into /tmp/LTL5552925635508161067.prop : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10792785629604452942.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8326499921457173658.hoa' '-atoms' '/tmp/LTL5552925635508161067.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5552925635508161067.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8326499921457173658.hoa
Detected timeout of ITS tools.
[2023-03-11 08:16:02] [INFO ] Flatten gal took : 122 ms
[2023-03-11 08:16:02] [INFO ] Flatten gal took : 96 ms
[2023-03-11 08:16:02] [INFO ] Time to serialize gal into /tmp/LTL8626017637109641152.gal : 13 ms
[2023-03-11 08:16:02] [INFO ] Time to serialize properties into /tmp/LTL17584619980419874304.ltl : 5 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8626017637109641152.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17584619980419874304.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(p70==1)"))||(G("(((((p65==0)||(p96==0))||((p133==0)||(p158==0)))||(((p195==0)||(p220==0))||((p257==0)||(p288==0))))||((p313==0...174
Formula 0 simplified : G!"(p70==1)" & F!"(((((p65==0)||(p96==0))||((p133==0)||(p158==0)))||(((p195==0)||(p220==0))||((p257==0)||(p288==0))))||((p313==0)||(...166
Detected timeout of ITS tools.
[2023-03-11 08:16:17] [INFO ] Flatten gal took : 90 ms
[2023-03-11 08:16:17] [INFO ] Applying decomposition
[2023-03-11 08:16:18] [INFO ] Flatten gal took : 111 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17934584212894511927.txt' '-o' '/tmp/graph17934584212894511927.bin' '-w' '/tmp/graph17934584212894511927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17934584212894511927.bin' '-l' '-1' '-v' '-w' '/tmp/graph17934584212894511927.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:16:18] [INFO ] Decomposing Gal with order
[2023-03-11 08:16:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:16:18] [INFO ] Removed a total of 5578 redundant transitions.
[2023-03-11 08:16:18] [INFO ] Flatten gal took : 224 ms
[2023-03-11 08:16:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 38 ms.
[2023-03-11 08:16:18] [INFO ] Time to serialize gal into /tmp/LTL14044785911558207794.gal : 4 ms
[2023-03-11 08:16:18] [INFO ] Time to serialize properties into /tmp/LTL3802026189934342495.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14044785911558207794.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3802026189934342495.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("(i0.u1.p70==1)"))||(G("(((((i0.u0.p65==0)||(i0.u2.p96==0))||((i0.u6.p133==0)||(i0.u7.p158==0)))||(((i0.u10.p195==0)||(i0.u11.p2...245
Formula 0 simplified : G!"(i0.u1.p70==1)" & F!"(((((i0.u0.p65==0)||(i0.u2.p96==0))||((i0.u6.p133==0)||(i0.u7.p158==0)))||(((i0.u10.p195==0)||(i0.u11.p220==...237
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13886454297275173255
[2023-03-11 08:16:33] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13886454297275173255
Running compilation step : cd /tmp/ltsmin13886454297275173255;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2405 ms.
Running link step : cd /tmp/ltsmin13886454297275173255;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 88 ms.
Running LTSmin : cd /tmp/ltsmin13886454297275173255;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
LTSmin run took 297 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-09b-LTLFireability-01 finished in 68316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 4 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 319 transition count 1158
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 319 transition count 1158
Applied a total of 6 rules in 11 ms. Remains 319 /322 variables (removed 3) and now considering 1158/1161 (removed 3) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2023-03-11 08:16:36] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-11 08:16:37] [INFO ] Implicit Places using invariants in 955 ms returned []
[2023-03-11 08:16:37] [INFO ] Invariant cache hit.
[2023-03-11 08:16:38] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1889 ms to find 0 implicit places.
[2023-03-11 08:16:38] [INFO ] Invariant cache hit.
[2023-03-11 08:16:39] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/322 places, 1158/1161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2550 ms. Remains : 319/322 places, 1158/1161 transitions.
Stuttering acceptance computed with spot in 248 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-02 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 s4 1) (NEQ s18 1) (NEQ s260 1) (NEQ s285 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 411 reset in 263 ms.
Product exploration explored 100000 steps with 92 reset in 219 ms.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 211 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 307 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 662355 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 662355 steps, saw 114765 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 08:16:43] [INFO ] Invariant cache hit.
[2023-03-11 08:16:43] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-11 08:16:44] [INFO ] After 625ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:16:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-11 08:16:44] [INFO ] After 428ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:16:44] [INFO ] After 635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-11 08:16:45] [INFO ] After 902ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Graph (trivial) has 301 edges and 319 vertex of which 4 / 319 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1578 edges and 317 vertex of which 315 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 315 transition count 1037
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 169 rules applied. Total rules applied 288 place count 200 transition count 983
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 320 place count 168 transition count 983
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 320 place count 168 transition count 977
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 332 place count 162 transition count 977
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 482 place count 87 transition count 902
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 483 place count 87 transition count 901
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 501 place count 69 transition count 739
Iterating global reduction 4 with 18 rules applied. Total rules applied 519 place count 69 transition count 739
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 528 place count 69 transition count 730
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 5 with 2 rules applied. Total rules applied 530 place count 68 transition count 729
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 540 place count 68 transition count 719
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 550 place count 58 transition count 719
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 551 place count 58 transition count 719
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 552 place count 57 transition count 718
Applied a total of 552 rules in 203 ms. Remains 57 /319 variables (removed 262) and now considering 718/1158 (removed 440) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 57/319 places, 718/1158 transitions.
Finished random walk after 7036 steps, including 31 resets, run visited all 1 properties in 57 ms. (steps per millisecond=123 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 179 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 203 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 330 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Applied a total of 0 rules in 21 ms. Remains 319 /319 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
[2023-03-11 08:16:46] [INFO ] Invariant cache hit.
[2023-03-11 08:16:46] [INFO ] Implicit Places using invariants in 670 ms returned []
[2023-03-11 08:16:46] [INFO ] Invariant cache hit.
[2023-03-11 08:16:47] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 1810 ms to find 0 implicit places.
[2023-03-11 08:16:47] [INFO ] Invariant cache hit.
[2023-03-11 08:16:48] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2514 ms. Remains : 319/319 places, 1158/1158 transitions.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 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 173 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 82 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 665708 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{}
Probabilistic random walk after 665708 steps, saw 115255 distinct states, run finished after 3001 ms. (steps per millisecond=221 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 08:16:51] [INFO ] Invariant cache hit.
[2023-03-11 08:16:52] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-11 08:16:52] [INFO ] After 513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:16:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-11 08:16:53] [INFO ] After 513ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:16:53] [INFO ] After 676ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-11 08:16:53] [INFO ] After 873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Graph (trivial) has 301 edges and 319 vertex of which 4 / 319 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1578 edges and 317 vertex of which 315 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 315 transition count 1037
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 169 rules applied. Total rules applied 288 place count 200 transition count 983
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 320 place count 168 transition count 983
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 320 place count 168 transition count 977
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 332 place count 162 transition count 977
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 482 place count 87 transition count 902
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 483 place count 87 transition count 901
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 501 place count 69 transition count 739
Iterating global reduction 4 with 18 rules applied. Total rules applied 519 place count 69 transition count 739
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 528 place count 69 transition count 730
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 5 with 2 rules applied. Total rules applied 530 place count 68 transition count 729
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 540 place count 68 transition count 719
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 550 place count 58 transition count 719
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 551 place count 58 transition count 719
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 552 place count 57 transition count 718
Applied a total of 552 rules in 188 ms. Remains 57 /319 variables (removed 262) and now considering 718/1158 (removed 440) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 57/319 places, 718/1158 transitions.
Finished random walk after 3158 steps, including 13 resets, run visited all 1 properties in 27 ms. (steps per millisecond=116 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 165 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 206 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 345 steps with 2 reset in 1 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-02 finished in 17750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1))) U p1))'
Support contains 11 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Graph (trivial) has 282 edges and 322 vertex of which 4 / 322 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 319 transition count 1043
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 165 rules applied. Total rules applied 281 place count 204 transition count 993
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 31 rules applied. Total rules applied 312 place count 174 transition count 992
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 315 place count 173 transition count 990
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 316 place count 172 transition count 990
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 316 place count 172 transition count 984
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 328 place count 166 transition count 984
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 331 place count 163 transition count 981
Iterating global reduction 5 with 3 rules applied. Total rules applied 334 place count 163 transition count 981
Performed 64 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 462 place count 99 transition count 916
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 463 place count 99 transition count 915
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 474 place count 88 transition count 823
Iterating global reduction 6 with 11 rules applied. Total rules applied 485 place count 88 transition count 823
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 494 place count 88 transition count 814
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 7 with 4 rules applied. Total rules applied 498 place count 86 transition count 812
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 500 place count 84 transition count 810
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 501 place count 83 transition count 810
Applied a total of 501 rules in 152 ms. Remains 83 /322 variables (removed 239) and now considering 810/1161 (removed 351) transitions.
// Phase 1: matrix 810 rows 83 cols
[2023-03-11 08:16:54] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-11 08:16:54] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-11 08:16:54] [INFO ] Invariant cache hit.
[2023-03-11 08:16:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:16:55] [INFO ] Implicit Places using invariants and state equation in 605 ms returned [78, 82]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 859 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/322 places, 810/1161 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 80 transition count 809
Applied a total of 2 rules in 36 ms. Remains 80 /81 variables (removed 1) and now considering 809/810 (removed 1) transitions.
// Phase 1: matrix 809 rows 80 cols
[2023-03-11 08:16:55] [INFO ] Computed 10 place invariants in 8 ms
[2023-03-11 08:16:55] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-11 08:16:55] [INFO ] Invariant cache hit.
[2023-03-11 08:16:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:16:56] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/322 places, 809/1161 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1802 ms. Remains : 80/322 places, 809/1161 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s13 1) (EQ s20 1) (EQ s28 1) (EQ s35 1) (EQ s42 1) (EQ s49 1) (EQ s56 1) (EQ s63 1) (EQ s72 1) (EQ s76 1)), p0:(NEQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-03 finished in 2002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&F((G(F(p2))&&p1)))))'
Support contains 19 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 319 transition count 1158
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 319 transition count 1158
Applied a total of 6 rules in 27 ms. Remains 319 /322 variables (removed 3) and now considering 1158/1161 (removed 3) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2023-03-11 08:16:56] [INFO ] Computed 14 place invariants in 13 ms
[2023-03-11 08:16:56] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-11 08:16:56] [INFO ] Invariant cache hit.
[2023-03-11 08:16:57] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
[2023-03-11 08:16:57] [INFO ] Invariant cache hit.
[2023-03-11 08:16:57] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/322 places, 1158/1161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1491 ms. Remains : 319/322 places, 1158/1161 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s64 1) (EQ s84 1) (EQ s114 1) (EQ s134 1) (EQ s159 1) (EQ s189 1) (EQ s209 1) (EQ s239 1) (EQ s259 1) (EQ s286 1)), p1:(AND (EQ s4 1) (EQ s15 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 120 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-04 finished in 1868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((p0||G(p1))))))))'
Support contains 14 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 319 transition count 1158
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 319 transition count 1158
Applied a total of 6 rules in 24 ms. Remains 319 /322 variables (removed 3) and now considering 1158/1161 (removed 3) transitions.
[2023-03-11 08:16:58] [INFO ] Invariant cache hit.
[2023-03-11 08:16:58] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-11 08:16:58] [INFO ] Invariant cache hit.
[2023-03-11 08:16:59] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 948 ms to find 0 implicit places.
[2023-03-11 08:16:59] [INFO ] Invariant cache hit.
[2023-03-11 08:16:59] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/322 places, 1158/1161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1517 ms. Remains : 319/322 places, 1158/1161 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(AND (EQ s59 1) (EQ s84 1) (EQ s109 1) (EQ s139 1) (EQ s159 1) (EQ s184 1) (EQ s214 1) (EQ s234 1) (EQ s259 1) (EQ s286 1)), p0:(AND (EQ s4 1) (EQ s14 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-05 finished in 1798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((G(p1) U X(p2))||p0))))'
Support contains 14 out of 322 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Graph (trivial) has 273 edges and 322 vertex of which 4 / 322 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 319 transition count 1043
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 167 rules applied. Total rules applied 283 place count 204 transition count 991
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 314 place count 173 transition count 991
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 314 place count 173 transition count 986
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 324 place count 168 transition count 986
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 327 place count 165 transition count 983
Iterating global reduction 3 with 3 rules applied. Total rules applied 330 place count 165 transition count 983
Performed 60 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 450 place count 105 transition count 922
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 451 place count 105 transition count 921
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 462 place count 94 transition count 829
Iterating global reduction 4 with 11 rules applied. Total rules applied 473 place count 94 transition count 829
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 482 place count 94 transition count 820
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 5 with 4 rules applied. Total rules applied 486 place count 92 transition count 818
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 488 place count 90 transition count 816
Applied a total of 488 rules in 146 ms. Remains 90 /322 variables (removed 232) and now considering 816/1161 (removed 345) transitions.
// Phase 1: matrix 816 rows 90 cols
[2023-03-11 08:17:00] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-11 08:17:00] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-11 08:17:00] [INFO ] Invariant cache hit.
[2023-03-11 08:17:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:17:00] [INFO ] Implicit Places using invariants and state equation in 466 ms returned [85, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 661 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/322 places, 816/1161 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 87 transition count 815
Applied a total of 2 rules in 29 ms. Remains 87 /88 variables (removed 1) and now considering 815/816 (removed 1) transitions.
// Phase 1: matrix 815 rows 87 cols
[2023-03-11 08:17:00] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-11 08:17:01] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-11 08:17:01] [INFO ] Invariant cache hit.
[2023-03-11 08:17:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:17:01] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/322 places, 815/1161 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1420 ms. Remains : 87/322 places, 815/1161 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s7 0) (EQ s53 0) (EQ s82 0)), p2:(AND (EQ s15 1) (EQ s24 1) (EQ s32 1) (EQ s37 1) (EQ s44 1) (EQ s56 1) (EQ s64 1) (EQ s69 1) (EQ s76...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 501 reset in 151 ms.
Product exploration explored 100000 steps with 498 reset in 200 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 310 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 659264 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 659264 steps, saw 104431 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 08:17:05] [INFO ] Invariant cache hit.
[2023-03-11 08:17:05] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 08:17:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-11 08:17:06] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 08:17:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:17:06] [INFO ] After 222ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 08:17:06] [INFO ] Deduced a trap composed of 11 places in 311 ms of which 1 ms to minimize.
[2023-03-11 08:17:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 367 ms
[2023-03-11 08:17:07] [INFO ] After 971ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 283 ms.
[2023-03-11 08:17:07] [INFO ] After 1761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 14 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 815/815 transitions.
Graph (complete) has 973 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 86 transition count 812
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 1 with 6 rules applied. Total rules applied 9 place count 83 transition count 809
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 81 transition count 789
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 81 transition count 789
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 79 transition count 787
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 79 transition count 772
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 47 place count 64 transition count 772
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 64 transition count 773
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 63 transition count 773
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 54 place count 63 transition count 773
Applied a total of 54 rules in 162 ms. Remains 63 /87 variables (removed 24) and now considering 773/815 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 63/87 places, 773/815 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 777806 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :{}
Probabilistic random walk after 777806 steps, saw 114597 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 773 rows 63 cols
[2023-03-11 08:17:10] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-11 08:17:10] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 08:17:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-11 08:17:11] [INFO ] After 431ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 08:17:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:17:11] [INFO ] After 214ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 08:17:12] [INFO ] Deduced a trap composed of 6 places in 504 ms of which 1 ms to minimize.
[2023-03-11 08:17:12] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 1 ms to minimize.
[2023-03-11 08:17:13] [INFO ] Deduced a trap composed of 6 places in 378 ms of which 1 ms to minimize.
[2023-03-11 08:17:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1273 ms
[2023-03-11 08:17:13] [INFO ] After 1818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 217 ms.
[2023-03-11 08:17:13] [INFO ] After 2530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 14 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 773/773 transitions.
Applied a total of 0 rules in 30 ms. Remains 63 /63 variables (removed 0) and now considering 773/773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 63/63 places, 773/773 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 773/773 transitions.
Applied a total of 0 rules in 24 ms. Remains 63 /63 variables (removed 0) and now considering 773/773 (removed 0) transitions.
[2023-03-11 08:17:13] [INFO ] Invariant cache hit.
[2023-03-11 08:17:13] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-11 08:17:13] [INFO ] Invariant cache hit.
[2023-03-11 08:17:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:17:14] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
[2023-03-11 08:17:14] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-11 08:17:14] [INFO ] Invariant cache hit.
[2023-03-11 08:17:14] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1249 ms. Remains : 63/63 places, 773/773 transitions.
Applied a total of 0 rules in 28 ms. Remains 63 /63 variables (removed 0) and now considering 773/773 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-11 08:17:14] [INFO ] Invariant cache hit.
[2023-03-11 08:17:14] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 08:17:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-11 08:17:15] [INFO ] After 446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 08:17:16] [INFO ] Deduced a trap composed of 6 places in 558 ms of which 1 ms to minimize.
[2023-03-11 08:17:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 603 ms
[2023-03-11 08:17:16] [INFO ] After 1277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 218 ms.
[2023-03-11 08:17:16] [INFO ] After 1573ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 14 out of 87 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 815/815 transitions.
Applied a total of 0 rules in 57 ms. Remains 87 /87 variables (removed 0) and now considering 815/815 (removed 0) transitions.
// Phase 1: matrix 815 rows 87 cols
[2023-03-11 08:17:16] [INFO ] Computed 11 place invariants in 26 ms
[2023-03-11 08:17:16] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-11 08:17:16] [INFO ] Invariant cache hit.
[2023-03-11 08:17:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:17:17] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2023-03-11 08:17:17] [INFO ] Redundant transitions in 23 ms returned [578]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 814 rows 87 cols
[2023-03-11 08:17:17] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-11 08:17:17] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/87 places, 814/815 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 85 transition count 812
Applied a total of 2 rules in 28 ms. Remains 85 /87 variables (removed 2) and now considering 812/814 (removed 2) transitions.
// Phase 1: matrix 812 rows 85 cols
[2023-03-11 08:17:17] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-11 08:17:17] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-11 08:17:17] [INFO ] Invariant cache hit.
[2023-03-11 08:17:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:17:18] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/87 places, 812/815 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1413 ms. Remains : 85/87 places, 812/815 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 328 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 677047 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :{}
Probabilistic random walk after 677047 steps, saw 110738 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 08:17:21] [INFO ] Invariant cache hit.
[2023-03-11 08:17:21] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 08:17:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-11 08:17:22] [INFO ] After 435ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 08:17:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:17:22] [INFO ] After 214ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 08:17:23] [INFO ] Deduced a trap composed of 7 places in 369 ms of which 0 ms to minimize.
[2023-03-11 08:17:23] [INFO ] Deduced a trap composed of 9 places in 315 ms of which 0 ms to minimize.
[2023-03-11 08:17:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 766 ms
[2023-03-11 08:17:23] [INFO ] After 1240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 261 ms.
[2023-03-11 08:17:23] [INFO ] After 1979ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 30 ms.
Support contains 14 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 812/812 transitions.
Graph (complete) has 966 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 810
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 1 with 6 rules applied. Total rules applied 8 place count 81 transition count 807
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 79 transition count 787
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 79 transition count 787
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 77 transition count 785
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 77 transition count 770
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 46 place count 62 transition count 770
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 51 place count 62 transition count 770
Applied a total of 51 rules in 128 ms. Remains 62 /85 variables (removed 23) and now considering 770/812 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 62/85 places, 770/812 transitions.
Finished random walk after 5916 steps, including 27 resets, run visited all 2 properties in 123 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 32 reset in 131 ms.
Product exploration explored 100000 steps with 143 reset in 164 ms.
Built C files in :
/tmp/ltsmin8119781373915063321
[2023-03-11 08:17:24] [INFO ] Computing symmetric may disable matrix : 812 transitions.
[2023-03-11 08:17:25] [INFO ] Computation of Complete disable matrix. took 119 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:17:25] [INFO ] Computing symmetric may enable matrix : 812 transitions.
[2023-03-11 08:17:25] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:17:25] [INFO ] Computing Do-Not-Accords matrix : 812 transitions.
[2023-03-11 08:17:25] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:17:25] [INFO ] Built C files in 340ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8119781373915063321
Running compilation step : cd /tmp/ltsmin8119781373915063321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8119781373915063321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8119781373915063321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 14 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 812/812 transitions.
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 0 with 6 rules applied. Total rules applied 6 place count 82 transition count 809
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 80 transition count 789
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 80 transition count 789
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 78 transition count 787
Applied a total of 14 rules in 82 ms. Remains 78 /85 variables (removed 7) and now considering 787/812 (removed 25) transitions.
// Phase 1: matrix 787 rows 78 cols
[2023-03-11 08:17:28] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-11 08:17:28] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-11 08:17:28] [INFO ] Invariant cache hit.
[2023-03-11 08:17:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:17:29] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2023-03-11 08:17:29] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-11 08:17:29] [INFO ] Invariant cache hit.
[2023-03-11 08:17:29] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/85 places, 787/812 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1300 ms. Remains : 78/85 places, 787/812 transitions.
Built C files in :
/tmp/ltsmin12248865320935525343
[2023-03-11 08:17:29] [INFO ] Computing symmetric may disable matrix : 787 transitions.
[2023-03-11 08:17:29] [INFO ] Computation of Complete disable matrix. took 79 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:17:29] [INFO ] Computing symmetric may enable matrix : 787 transitions.
[2023-03-11 08:17:29] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:17:29] [INFO ] Computing Do-Not-Accords matrix : 787 transitions.
[2023-03-11 08:17:29] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:17:29] [INFO ] Built C files in 279ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12248865320935525343
Running compilation step : cd /tmp/ltsmin12248865320935525343;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12248865320935525343;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12248865320935525343;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 08:17:33] [INFO ] Flatten gal took : 156 ms
[2023-03-11 08:17:33] [INFO ] Flatten gal took : 86 ms
[2023-03-11 08:17:33] [INFO ] Time to serialize gal into /tmp/LTL11200030742083508397.gal : 12 ms
[2023-03-11 08:17:33] [INFO ] Time to serialize properties into /tmp/LTL17065021969672902737.prop : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11200030742083508397.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12799025795782646438.hoa' '-atoms' '/tmp/LTL17065021969672902737.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17065021969672902737.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12799025795782646438.hoa
Detected timeout of ITS tools.
[2023-03-11 08:17:48] [INFO ] Flatten gal took : 89 ms
[2023-03-11 08:17:48] [INFO ] Flatten gal took : 109 ms
[2023-03-11 08:17:48] [INFO ] Time to serialize gal into /tmp/LTL7565021866824608907.gal : 37 ms
[2023-03-11 08:17:48] [INFO ] Time to serialize properties into /tmp/LTL8982990613248034594.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7565021866824608907.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8982990613248034594.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((p6==0)||(p17==0))||((p222==0)||(p348==0)))")||((G("(((((p65==1)&&(p102==1))&&((p127==1)&&(p164==1)))&&(((p189==1)&&(p220==...350
Formula 0 simplified : FG(!"(((p6==0)||(p17==0))||((p222==0)||(p348==0)))" & (F!"(((((p65==1)&&(p102==1))&&((p127==1)&&(p164==1)))&&(((p189==1)&&(p220==1))...341
Detected timeout of ITS tools.
[2023-03-11 08:18:03] [INFO ] Flatten gal took : 93 ms
[2023-03-11 08:18:03] [INFO ] Applying decomposition
[2023-03-11 08:18:03] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11460095516677512277.txt' '-o' '/tmp/graph11460095516677512277.bin' '-w' '/tmp/graph11460095516677512277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11460095516677512277.bin' '-l' '-1' '-v' '-w' '/tmp/graph11460095516677512277.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:18:04] [INFO ] Decomposing Gal with order
[2023-03-11 08:18:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:18:04] [INFO ] Removed a total of 5683 redundant transitions.
[2023-03-11 08:18:04] [INFO ] Flatten gal took : 171 ms
[2023-03-11 08:18:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 40 ms.
[2023-03-11 08:18:04] [INFO ] Time to serialize gal into /tmp/LTL7759043066313639167.gal : 3 ms
[2023-03-11 08:18:04] [INFO ] Time to serialize properties into /tmp/LTL12227187345794436326.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7759043066313639167.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12227187345794436326.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((i0.u0.p6==0)||(i0.u0.p17==0))||((i0.u0.p222==0)||(i0.u0.p348==0)))")||((G("(((((i1.u2.p65==1)&&(i1.u5.p102==1))&&((i1.u6.p...504
Formula 0 simplified : FG(!"(((i0.u0.p6==0)||(i0.u0.p17==0))||((i0.u0.p222==0)||(i0.u0.p348==0)))" & (F!"(((((i1.u2.p65==1)&&(i1.u5.p102==1))&&((i1.u6.p127...495
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10977590303084301020
[2023-03-11 08:18:19] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10977590303084301020
Running compilation step : cd /tmp/ltsmin10977590303084301020;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2433 ms.
Running link step : cd /tmp/ltsmin10977590303084301020;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin10977590303084301020;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((([]((LTLAPp1==true)) U X((LTLAPp2==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutonomousCar-PT-09b-LTLFireability-06 finished in 94533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(p0)) U (G(!p2)&&p1)))))'
Support contains 14 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 319 transition count 1158
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 319 transition count 1158
Applied a total of 6 rules in 28 ms. Remains 319 /322 variables (removed 3) and now considering 1158/1161 (removed 3) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2023-03-11 08:18:34] [INFO ] Computed 14 place invariants in 10 ms
[2023-03-11 08:18:34] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-11 08:18:34] [INFO ] Invariant cache hit.
[2023-03-11 08:18:35] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
[2023-03-11 08:18:35] [INFO ] Invariant cache hit.
[2023-03-11 08:18:35] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/322 places, 1158/1161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1403 ms. Remains : 319/322 places, 1158/1161 transitions.
Stuttering acceptance computed with spot in 493 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (AND (NOT p0) p2), p2, (NOT p0), true, (AND p2 (NOT p0)), p2]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 5}, { cond=(NOT p2), acceptance={} source=3 dest: 7}], [{ cond=p2, acceptance={0} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=p2, acceptance={} source=8 dest: 6}, { cond=(NOT p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (EQ s64 1) (EQ s84 1) (EQ s109 1) (EQ s139 1) (EQ s159 1) (EQ s189 1) (EQ s214 1) (EQ s239 1) (EQ s259 1) (EQ s286 1)), p2:(AND (EQ s4 1) (EQ s14 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-08 finished in 1955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!(!p0 U !(X(!p1) U p0)))))'
Support contains 4 out of 322 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 319 transition count 1158
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 319 transition count 1158
Applied a total of 6 rules in 25 ms. Remains 319 /322 variables (removed 3) and now considering 1158/1161 (removed 3) transitions.
[2023-03-11 08:18:36] [INFO ] Invariant cache hit.
[2023-03-11 08:18:36] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-11 08:18:36] [INFO ] Invariant cache hit.
[2023-03-11 08:18:37] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 974 ms to find 0 implicit places.
[2023-03-11 08:18:37] [INFO ] Invariant cache hit.
[2023-03-11 08:18:38] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/322 places, 1158/1161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1521 ms. Remains : 319/322 places, 1158/1161 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s13 1) (EQ s110 1) (EQ s285 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 102 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-09 finished in 1673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)&&F(p2)))))'
Support contains 7 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 320 transition count 1159
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 320 transition count 1159
Applied a total of 4 rules in 27 ms. Remains 320 /322 variables (removed 2) and now considering 1159/1161 (removed 2) transitions.
// Phase 1: matrix 1159 rows 320 cols
[2023-03-11 08:18:38] [INFO ] Computed 14 place invariants in 9 ms
[2023-03-11 08:18:38] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-11 08:18:38] [INFO ] Invariant cache hit.
[2023-03-11 08:18:39] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
[2023-03-11 08:18:39] [INFO ] Invariant cache hit.
[2023-03-11 08:18:39] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 320/322 places, 1159/1161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1775 ms. Remains : 320/322 places, 1159/1161 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s235 1), p1:(NEQ s30 1), p2:(OR (NEQ s4 1) (NEQ s14 1) (NEQ s185 1) (NEQ s286 1) (NEQ s317 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-10 finished in 1997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Graph (trivial) has 305 edges and 322 vertex of which 4 / 322 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 319 transition count 1042
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 168 rules applied. Total rules applied 285 place count 203 transition count 990
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 316 place count 172 transition count 990
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 316 place count 172 transition count 984
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 328 place count 166 transition count 984
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 331 place count 163 transition count 981
Iterating global reduction 3 with 3 rules applied. Total rules applied 334 place count 163 transition count 981
Performed 73 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 480 place count 90 transition count 907
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 481 place count 90 transition count 906
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 499 place count 72 transition count 743
Iterating global reduction 4 with 18 rules applied. Total rules applied 517 place count 72 transition count 743
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 525 place count 72 transition count 735
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 5 with 4 rules applied. Total rules applied 529 place count 70 transition count 733
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 530 place count 70 transition count 733
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 532 place count 68 transition count 731
Applied a total of 532 rules in 225 ms. Remains 68 /322 variables (removed 254) and now considering 731/1161 (removed 430) transitions.
// Phase 1: matrix 731 rows 68 cols
[2023-03-11 08:18:40] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-11 08:18:40] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-11 08:18:40] [INFO ] Invariant cache hit.
[2023-03-11 08:18:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:18:41] [INFO ] Implicit Places using invariants and state equation in 701 ms returned [63, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1161 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/322 places, 731/1161 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 730
Applied a total of 2 rules in 75 ms. Remains 65 /66 variables (removed 1) and now considering 730/731 (removed 1) transitions.
// Phase 1: matrix 730 rows 65 cols
[2023-03-11 08:18:41] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-11 08:18:42] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-11 08:18:42] [INFO ] Invariant cache hit.
[2023-03-11 08:18:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:18:42] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 1143 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/322 places, 730/1161 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2605 ms. Remains : 65/322 places, 730/1161 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s1 1) (NEQ s10 1) (NEQ s33 1) (NEQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 671 reset in 110 ms.
Product exploration explored 100000 steps with 252 reset in 69 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 201 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 538 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1168586 steps, run timeout after 3007 ms. (steps per millisecond=388 ) properties seen :{}
Probabilistic random walk after 1168586 steps, saw 172253 distinct states, run finished after 3007 ms. (steps per millisecond=388 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 08:18:46] [INFO ] Invariant cache hit.
[2023-03-11 08:18:46] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-11 08:18:46] [INFO ] After 404ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:18:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 78 ms returned sat
[2023-03-11 08:18:47] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:18:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:18:47] [INFO ] After 132ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 08:18:47] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-11 08:18:47] [INFO ] After 806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 730/730 transitions.
Graph (complete) has 867 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 64 transition count 727
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 13 place count 64 transition count 717
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 54 transition count 717
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 54 transition count 718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 53 transition count 718
Applied a total of 25 rules in 113 ms. Remains 53 /65 variables (removed 12) and now considering 718/730 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 53/65 places, 718/730 transitions.
Finished random walk after 155 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=77 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 236 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 730/730 transitions.
Applied a total of 0 rules in 66 ms. Remains 65 /65 variables (removed 0) and now considering 730/730 (removed 0) transitions.
[2023-03-11 08:18:48] [INFO ] Invariant cache hit.
[2023-03-11 08:18:48] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-11 08:18:48] [INFO ] Invariant cache hit.
[2023-03-11 08:18:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:18:49] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 1223 ms to find 0 implicit places.
[2023-03-11 08:18:49] [INFO ] Redundant transitions in 62 ms returned [555]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 729 rows 65 cols
[2023-03-11 08:18:49] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-11 08:18:50] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/65 places, 729/730 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 727
Applied a total of 2 rules in 39 ms. Remains 63 /65 variables (removed 2) and now considering 727/729 (removed 2) transitions.
// Phase 1: matrix 727 rows 63 cols
[2023-03-11 08:18:50] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-11 08:18:50] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-11 08:18:50] [INFO ] Invariant cache hit.
[2023-03-11 08:18:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:18:51] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/65 places, 727/730 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2826 ms. Remains : 63/65 places, 727/730 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 566 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1145014 steps, run timeout after 3001 ms. (steps per millisecond=381 ) properties seen :{}
Probabilistic random walk after 1145014 steps, saw 170378 distinct states, run finished after 3001 ms. (steps per millisecond=381 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 08:18:54] [INFO ] Invariant cache hit.
[2023-03-11 08:18:54] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-11 08:18:54] [INFO ] After 372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:18:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-11 08:18:55] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:18:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:18:55] [INFO ] After 127ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 08:18:55] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-11 08:18:55] [INFO ] After 742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 727/727 transitions.
Graph (complete) has 860 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 725
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 12 place count 62 transition count 715
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 52 transition count 715
Applied a total of 22 rules in 79 ms. Remains 52 /63 variables (removed 11) and now considering 715/727 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 52/63 places, 715/727 transitions.
Finished random walk after 3608 steps, including 32 resets, run visited all 1 properties in 27 ms. (steps per millisecond=133 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8 reset in 72 ms.
Product exploration explored 100000 steps with 230 reset in 69 ms.
Built C files in :
/tmp/ltsmin1965890747701031529
[2023-03-11 08:18:56] [INFO ] Computing symmetric may disable matrix : 727 transitions.
[2023-03-11 08:18:56] [INFO ] Computation of Complete disable matrix. took 91 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:18:56] [INFO ] Computing symmetric may enable matrix : 727 transitions.
[2023-03-11 08:18:56] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:18:56] [INFO ] Computing Do-Not-Accords matrix : 727 transitions.
[2023-03-11 08:18:56] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:18:56] [INFO ] Built C files in 350ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1965890747701031529
Running compilation step : cd /tmp/ltsmin1965890747701031529;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1965890747701031529;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1965890747701031529;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 727/727 transitions.
Applied a total of 0 rules in 48 ms. Remains 63 /63 variables (removed 0) and now considering 727/727 (removed 0) transitions.
[2023-03-11 08:18:59] [INFO ] Invariant cache hit.
[2023-03-11 08:19:00] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-11 08:19:00] [INFO ] Invariant cache hit.
[2023-03-11 08:19:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:19:01] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
[2023-03-11 08:19:01] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-11 08:19:01] [INFO ] Invariant cache hit.
[2023-03-11 08:19:01] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1689 ms. Remains : 63/63 places, 727/727 transitions.
Built C files in :
/tmp/ltsmin16864257793613604420
[2023-03-11 08:19:01] [INFO ] Computing symmetric may disable matrix : 727 transitions.
[2023-03-11 08:19:01] [INFO ] Computation of Complete disable matrix. took 71 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:19:01] [INFO ] Computing symmetric may enable matrix : 727 transitions.
[2023-03-11 08:19:01] [INFO ] Computation of Complete enable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:19:01] [INFO ] Computing Do-Not-Accords matrix : 727 transitions.
[2023-03-11 08:19:01] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:19:01] [INFO ] Built C files in 261ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16864257793613604420
Running compilation step : cd /tmp/ltsmin16864257793613604420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16864257793613604420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16864257793613604420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 08:19:04] [INFO ] Flatten gal took : 83 ms
[2023-03-11 08:19:05] [INFO ] Flatten gal took : 100 ms
[2023-03-11 08:19:05] [INFO ] Time to serialize gal into /tmp/LTL17049202433019205514.gal : 10 ms
[2023-03-11 08:19:05] [INFO ] Time to serialize properties into /tmp/LTL9787152852192493305.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17049202433019205514.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18298553533060479574.hoa' '-atoms' '/tmp/LTL9787152852192493305.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9787152852192493305.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18298553533060479574.hoa
Detected timeout of ITS tools.
[2023-03-11 08:19:20] [INFO ] Flatten gal took : 117 ms
[2023-03-11 08:19:20] [INFO ] Flatten gal took : 90 ms
[2023-03-11 08:19:20] [INFO ] Time to serialize gal into /tmp/LTL7889967436262398182.gal : 10 ms
[2023-03-11 08:19:20] [INFO ] Time to serialize properties into /tmp/LTL5018066304889863970.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7889967436262398182.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5018066304889863970.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p6!=1)||(p20!=1))||((p184!=1)||(p348!=1)))"))))
Formula 0 simplified : FG!"(((p6!=1)||(p20!=1))||((p184!=1)||(p348!=1)))"
Detected timeout of ITS tools.
[2023-03-11 08:19:35] [INFO ] Flatten gal took : 83 ms
[2023-03-11 08:19:35] [INFO ] Applying decomposition
[2023-03-11 08:19:35] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7574074903727072413.txt' '-o' '/tmp/graph7574074903727072413.bin' '-w' '/tmp/graph7574074903727072413.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7574074903727072413.bin' '-l' '-1' '-v' '-w' '/tmp/graph7574074903727072413.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:19:35] [INFO ] Decomposing Gal with order
[2023-03-11 08:19:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:19:36] [INFO ] Removed a total of 5424 redundant transitions.
[2023-03-11 08:19:36] [INFO ] Flatten gal took : 167 ms
[2023-03-11 08:19:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 35 ms.
[2023-03-11 08:19:36] [INFO ] Time to serialize gal into /tmp/LTL8061576274362770678.gal : 7 ms
[2023-03-11 08:19:36] [INFO ] Time to serialize properties into /tmp/LTL7372418697817007292.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8061576274362770678.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7372418697817007292.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("(((u0.p6!=1)||(u0.p20!=1))||((i3.u9.p184!=1)||(u0.p348!=1)))"))))
Formula 0 simplified : FG!"(((u0.p6!=1)||(u0.p20!=1))||((i3.u9.p184!=1)||(u0.p348!=1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13129662995651493914
[2023-03-11 08:19:51] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13129662995651493914
Running compilation step : cd /tmp/ltsmin13129662995651493914;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2029 ms.
Running link step : cd /tmp/ltsmin13129662995651493914;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin13129662995651493914;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutonomousCar-PT-09b-LTLFireability-12 finished in 86383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((p0&&G(F(p1))))))))'
Support contains 11 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 320 transition count 1159
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 320 transition count 1159
Applied a total of 4 rules in 28 ms. Remains 320 /322 variables (removed 2) and now considering 1159/1161 (removed 2) transitions.
// Phase 1: matrix 1159 rows 320 cols
[2023-03-11 08:20:06] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-11 08:20:06] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-11 08:20:06] [INFO ] Invariant cache hit.
[2023-03-11 08:20:07] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
[2023-03-11 08:20:07] [INFO ] Invariant cache hit.
[2023-03-11 08:20:08] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 320/322 places, 1159/1161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1608 ms. Remains : 320/322 places, 1159/1161 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s157 0), p1:(OR (EQ s59 0) (EQ s89 0) (EQ s114 0) (EQ s139 0) (EQ s159 0) (EQ s190 0) (EQ s215 0) (EQ s235 0) (EQ s265 0) (EQ s287 0))], 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 106 reset in 201 ms.
Product exploration explored 100000 steps with 280 reset in 219 ms.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 300 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 71 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 08:20:09] [INFO ] Invariant cache hit.
[2023-03-11 08:20:09] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:20:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-11 08:20:09] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 258 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 320 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 1159/1159 transitions.
Applied a total of 0 rules in 13 ms. Remains 320 /320 variables (removed 0) and now considering 1159/1159 (removed 0) transitions.
[2023-03-11 08:20:10] [INFO ] Invariant cache hit.
[2023-03-11 08:20:10] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-11 08:20:10] [INFO ] Invariant cache hit.
[2023-03-11 08:20:11] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 1088 ms to find 0 implicit places.
[2023-03-11 08:20:11] [INFO ] Invariant cache hit.
[2023-03-11 08:20:11] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1598 ms. Remains : 320/320 places, 1159/1159 transitions.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3539 steps, including 28 resets, run visited all 1 properties in 21 ms. (steps per millisecond=168 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 272 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 203 reset in 270 ms.
Product exploration explored 100000 steps with 824 reset in 318 ms.
Built C files in :
/tmp/ltsmin15201575511494170369
[2023-03-11 08:20:13] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15201575511494170369
Running compilation step : cd /tmp/ltsmin15201575511494170369;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15201575511494170369;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15201575511494170369;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 1159/1159 transitions.
Applied a total of 0 rules in 9 ms. Remains 320 /320 variables (removed 0) and now considering 1159/1159 (removed 0) transitions.
[2023-03-11 08:20:16] [INFO ] Invariant cache hit.
[2023-03-11 08:20:17] [INFO ] Implicit Places using invariants in 575 ms returned []
[2023-03-11 08:20:17] [INFO ] Invariant cache hit.
[2023-03-11 08:20:18] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1352 ms to find 0 implicit places.
[2023-03-11 08:20:18] [INFO ] Invariant cache hit.
[2023-03-11 08:20:18] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1905 ms. Remains : 320/320 places, 1159/1159 transitions.
Built C files in :
/tmp/ltsmin12015841115122517688
[2023-03-11 08:20:18] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12015841115122517688
Running compilation step : cd /tmp/ltsmin12015841115122517688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2943 ms.
Running link step : cd /tmp/ltsmin12015841115122517688;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12015841115122517688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6420102182625371482.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 08:20:34] [INFO ] Flatten gal took : 75 ms
[2023-03-11 08:20:34] [INFO ] Flatten gal took : 75 ms
[2023-03-11 08:20:34] [INFO ] Time to serialize gal into /tmp/LTL15859144198524690170.gal : 11 ms
[2023-03-11 08:20:34] [INFO ] Time to serialize properties into /tmp/LTL13290969722978247811.prop : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15859144198524690170.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18089392344979777702.hoa' '-atoms' '/tmp/LTL13290969722978247811.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13290969722978247811.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18089392344979777702.hoa
Detected timeout of ITS tools.
[2023-03-11 08:20:49] [INFO ] Flatten gal took : 107 ms
[2023-03-11 08:20:49] [INFO ] Flatten gal took : 73 ms
[2023-03-11 08:20:49] [INFO ] Time to serialize gal into /tmp/LTL6406898933711285446.gal : 30 ms
[2023-03-11 08:20:49] [INFO ] Time to serialize properties into /tmp/LTL8248608759381629880.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6406898933711285446.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8248608759381629880.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p187==0)")||(X(("(p187==0)")&&(G(F("(((((p65==0)||(p102==0))||((p133==0)||(p164==0)))||(((p189==0)||(p226==0))||((p257==0)||...202
Formula 0 simplified : GF(!"(p187==0)" & X(!"(p187==0)" | FG!"(((((p65==0)||(p102==0))||((p133==0)||(p164==0)))||(((p189==0)||(p226==0))||((p257==0)||(p282...190
Detected timeout of ITS tools.
[2023-03-11 08:21:04] [INFO ] Flatten gal took : 84 ms
[2023-03-11 08:21:04] [INFO ] Applying decomposition
[2023-03-11 08:21:04] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4933430170637337647.txt' '-o' '/tmp/graph4933430170637337647.bin' '-w' '/tmp/graph4933430170637337647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4933430170637337647.bin' '-l' '-1' '-v' '-w' '/tmp/graph4933430170637337647.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:21:05] [INFO ] Decomposing Gal with order
[2023-03-11 08:21:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:21:05] [INFO ] Removed a total of 5974 redundant transitions.
[2023-03-11 08:21:05] [INFO ] Flatten gal took : 138 ms
[2023-03-11 08:21:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 20 ms.
[2023-03-11 08:21:05] [INFO ] Time to serialize gal into /tmp/LTL13578551839090953901.gal : 5 ms
[2023-03-11 08:21:05] [INFO ] Time to serialize properties into /tmp/LTL12091241245258627957.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13578551839090953901.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12091241245258627957.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i8.u54.p187==0)")||(X(("(i8.u54.p187==0)")&&(G(F("(((((i8.u19.p65==0)||(i8.u29.p102==0))||((i8.u38.p133==0)||(i8.u46.p164==0...286
Formula 0 simplified : GF(!"(i8.u54.p187==0)" & X(!"(i8.u54.p187==0)" | FG!"(((((i8.u19.p65==0)||(i8.u29.p102==0))||((i8.u38.p133==0)||(i8.u46.p164==0)))||...274
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5579228675768132264
[2023-03-11 08:21:20] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5579228675768132264
Running compilation step : cd /tmp/ltsmin5579228675768132264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5579228675768132264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5579228675768132264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutonomousCar-PT-09b-LTLFireability-13 finished in 76901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(G(p0))))||F(p1))))'
Support contains 11 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 320 transition count 1159
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 320 transition count 1159
Applied a total of 4 rules in 14 ms. Remains 320 /322 variables (removed 2) and now considering 1159/1161 (removed 2) transitions.
// Phase 1: matrix 1159 rows 320 cols
[2023-03-11 08:21:23] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-11 08:21:23] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-11 08:21:23] [INFO ] Invariant cache hit.
[2023-03-11 08:21:24] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1220 ms to find 0 implicit places.
[2023-03-11 08:21:24] [INFO ] Invariant cache hit.
[2023-03-11 08:21:25] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 320/322 places, 1159/1161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1753 ms. Remains : 320/322 places, 1159/1161 transitions.
Stuttering acceptance computed with spot in 347 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}]], initial=1, aps=[p1:(AND (EQ s59 1) (EQ s89 1) (EQ s109 1) (EQ s134 1) (EQ s159 1) (EQ s189 1) (EQ s214 1) (EQ s234 1) (EQ s259 1) (EQ s287 1)), p0:(EQ s272 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-14 finished in 2134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1)&&X((F(p3)&&p2)))))'
Support contains 15 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 319 transition count 1158
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 319 transition count 1158
Applied a total of 6 rules in 27 ms. Remains 319 /322 variables (removed 3) and now considering 1158/1161 (removed 3) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2023-03-11 08:21:25] [INFO ] Computed 14 place invariants in 10 ms
[2023-03-11 08:21:25] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-11 08:21:25] [INFO ] Invariant cache hit.
[2023-03-11 08:21:26] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
[2023-03-11 08:21:26] [INFO ] Invariant cache hit.
[2023-03-11 08:21:27] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/322 places, 1158/1161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1400 ms. Remains : 319/322 places, 1158/1161 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s11 0) (EQ s258 0) (EQ s285 0)), p1:(AND (EQ s4 1) (EQ s11 1) (EQ s258 1) (EQ s285 1)), p2:(AND (EQ s59 1) (EQ s89 1) (EQ s114 1) (EQ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-15 finished in 1725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((G(p1) U X(p2))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((p0&&G(F(p1))))))))'
Found a Lengthening insensitive property : AutonomousCar-PT-09b-LTLFireability-13
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 11 out of 322 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Graph (trivial) has 286 edges and 322 vertex of which 4 / 322 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 319 transition count 1042
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 168 rules applied. Total rules applied 285 place count 203 transition count 990
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 316 place count 172 transition count 990
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 316 place count 172 transition count 984
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 328 place count 166 transition count 984
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 330 place count 164 transition count 982
Iterating global reduction 3 with 2 rules applied. Total rules applied 332 place count 164 transition count 982
Performed 65 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 462 place count 99 transition count 916
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 463 place count 99 transition count 915
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 479 place count 83 transition count 773
Iterating global reduction 4 with 16 rules applied. Total rules applied 495 place count 83 transition count 773
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 504 place count 83 transition count 764
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 5 with 4 rules applied. Total rules applied 508 place count 81 transition count 762
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 510 place count 79 transition count 760
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 511 place count 78 transition count 760
Applied a total of 511 rules in 159 ms. Remains 78 /322 variables (removed 244) and now considering 760/1161 (removed 401) transitions.
// Phase 1: matrix 760 rows 78 cols
[2023-03-11 08:21:28] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-11 08:21:28] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-11 08:21:28] [INFO ] Invariant cache hit.
[2023-03-11 08:21:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:21:28] [INFO ] Implicit Places using invariants and state equation in 486 ms returned [73, 77]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 795 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 76/322 places, 760/1161 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 759
Applied a total of 2 rules in 27 ms. Remains 75 /76 variables (removed 1) and now considering 759/760 (removed 1) transitions.
// Phase 1: matrix 759 rows 75 cols
[2023-03-11 08:21:28] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-11 08:21:29] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-11 08:21:29] [INFO ] Invariant cache hit.
[2023-03-11 08:21:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:21:29] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 75/322 places, 759/1161 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1825 ms. Remains : 75/322 places, 759/1161 transitions.
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s36 0), p1:(OR (EQ s13 0) (EQ s22 0) (EQ s28 0) (EQ s34 0) (EQ s38 0) (EQ s48 0) (EQ s54 0) (EQ s58 0) (EQ s67 0) (EQ s71 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 462 reset in 143 ms.
Product exploration explored 100000 steps with 418 reset in 121 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 405 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 395 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 08:21:30] [INFO ] Invariant cache hit.
[2023-03-11 08:21:30] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:21:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-11 08:21:30] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 363 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 75 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 759/759 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2023-03-11 08:21:31] [INFO ] Invariant cache hit.
[2023-03-11 08:21:31] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-11 08:21:31] [INFO ] Invariant cache hit.
[2023-03-11 08:21:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:21:32] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2023-03-11 08:21:32] [INFO ] Invariant cache hit.
[2023-03-11 08:21:32] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1097 ms. Remains : 75/75 places, 759/759 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1858 steps, including 67 resets, run visited all 1 properties in 15 ms. (steps per millisecond=123 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 274 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 37 reset in 62 ms.
Product exploration explored 100000 steps with 56 reset in 58 ms.
Built C files in :
/tmp/ltsmin5851113928856988148
[2023-03-11 08:21:33] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5851113928856988148
Running compilation step : cd /tmp/ltsmin5851113928856988148;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2342 ms.
Running link step : cd /tmp/ltsmin5851113928856988148;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5851113928856988148;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13059262619299494590.hoa' '--buchi-type=spotba'
LTSmin run took 1188 ms.
Treatment of property AutonomousCar-PT-09b-LTLFireability-13 finished in 9921 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-13 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-11 08:21:37] [INFO ] Flatten gal took : 79 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17579960038578191605
[2023-03-11 08:21:37] [INFO ] Computing symmetric may disable matrix : 1161 transitions.
[2023-03-11 08:21:37] [INFO ] Applying decomposition
[2023-03-11 08:21:37] [INFO ] Flatten gal took : 80 ms
[2023-03-11 08:21:37] [INFO ] Computation of Complete disable matrix. took 110 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:21:37] [INFO ] Computing symmetric may enable matrix : 1161 transitions.
[2023-03-11 08:21:37] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:21:37] [INFO ] Computing Do-Not-Accords matrix : 1161 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph337737442105136354.txt' '-o' '/tmp/graph337737442105136354.bin' '-w' '/tmp/graph337737442105136354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph337737442105136354.bin' '-l' '-1' '-v' '-w' '/tmp/graph337737442105136354.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:21:37] [INFO ] Decomposing Gal with order
[2023-03-11 08:21:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:21:38] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:21:38] [INFO ] Built C files in 482ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17579960038578191605
Running compilation step : cd /tmp/ltsmin17579960038578191605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-11 08:21:38] [INFO ] Removed a total of 6072 redundant transitions.
[2023-03-11 08:21:38] [INFO ] Flatten gal took : 127 ms
[2023-03-11 08:21:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 17 ms.
[2023-03-11 08:21:38] [INFO ] Time to serialize gal into /tmp/LTLFireability1644604216361348495.gal : 4 ms
[2023-03-11 08:21:38] [INFO ] Time to serialize properties into /tmp/LTLFireability16849456000680954866.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1644604216361348495.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16849456000680954866.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(F(("(((i0.u2.p6==0)||(i0.u2.p17==0))||((i0.u2.p222==0)||(i0.u2.p348==0)))")||((G("(((((i6.u19.p65==1)&&(i6.u30.p102==1))&&((i6.u3...514
Formula 0 simplified : FG(!"(((i0.u2.p6==0)||(i0.u2.p17==0))||((i0.u2.p222==0)||(i0.u2.p348==0)))" & (F!"(((((i6.u19.p65==1)&&(i6.u30.p102==1))&&((i6.u37.p...505
Compilation finished in 5604 ms.
Running link step : cd /tmp/ltsmin17579960038578191605;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 116 ms.
Running LTSmin : cd /tmp/ltsmin17579960038578191605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((([]((LTLAPp1==true)) U X((LTLAPp2==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 08:44:01] [INFO ] Applying decomposition
[2023-03-11 08:44:02] [INFO ] Flatten gal took : 774 ms
[2023-03-11 08:44:03] [INFO ] Decomposing Gal with order
[2023-03-11 08:44:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:44:07] [INFO ] Removed a total of 6355 redundant transitions.
[2023-03-11 08:44:08] [INFO ] Flatten gal took : 1492 ms
[2023-03-11 08:44:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 416 labels/synchronizations in 157 ms.
[2023-03-11 08:44:08] [INFO ] Time to serialize gal into /tmp/LTLFireability10368206472988458031.gal : 25 ms
[2023-03-11 08:44:08] [INFO ] Time to serialize properties into /tmp/LTLFireability2312882196092619681.ltl : 4 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10368206472988458031.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2312882196092619681.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(F(("(((i0.u2.p6==0)||(i0.u3.p17==0))||((i1.i0.i0.i0.i0.i0.u19.p222==0)||(i1.i0.u23.p348==0)))")||((G("(((((i1.i0.i0.i0.i0.i0.i0.i...858
Formula 0 simplified : FG(!"(((i0.u2.p6==0)||(i0.u3.p17==0))||((i1.i0.i0.i0.i0.i0.u19.p222==0)||(i1.i0.u23.p348==0)))" & (F!"(((((i1.i0.i0.i0.i0.i0.i0.i0.i...849
Reverse transition relation is NOT exact ! Due to transitions t383, t518, i0.u2.t306, i0.u3.t304, i1.t1158, i1.i0.u23.t33, i1.i0.u23.t36, i1.i0.u23.t37, i1...2028
Computing Next relation with stutter on 7.84947e+06 deadlock states
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin17579960038578191605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((([]((LTLAPp1==true)) U X((LTLAPp2==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17579960038578191605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 09:06:29] [INFO ] Flatten gal took : 192 ms
[2023-03-11 09:06:31] [INFO ] Input system was already deterministic with 1161 transitions.
[2023-03-11 09:06:31] [INFO ] Transformed 322 places.
[2023-03-11 09:06:31] [INFO ] Transformed 1161 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-11 09:06:31] [INFO ] Time to serialize gal into /tmp/LTLFireability5933481689150705721.gal : 25 ms
[2023-03-11 09:06:31] [INFO ] Time to serialize properties into /tmp/LTLFireability10712448333943070906.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5933481689150705721.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10712448333943070906.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("(((p6==0)||(p17==0))||((p222==0)||(p348==0)))")||((G("(((((p65==1)&&(p102==1))&&((p127==1)&&(p164==1)))&&(((p189==1)&&(p220==...350
Formula 0 simplified : FG(!"(((p6==0)||(p17==0))||((p222==0)||(p348==0)))" & (F!"(((((p65==1)&&(p102==1))&&((p127==1)&&(p164==1)))&&(((p189==1)&&(p220==1))...341
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 11616880 kB
After kill :
MemTotal: 16393236 kB
MemFree: 15735480 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-09b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-09b, 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 r005-oct2-167813593500668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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