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-167813593500684.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-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593500684
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M 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-10b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678524562351

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-10b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 08:49:24] [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:49:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 08:49:24] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2023-03-11 08:49:24] [INFO ] Transformed 425 places.
[2023-03-11 08:49:24] [INFO ] Transformed 2252 transitions.
[2023-03-11 08:49:24] [INFO ] Found NUPN structural information;
[2023-03-11 08:49:24] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-10b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 362 transition count 2189
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 362 transition count 2189
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 526 place count 362 transition count 1789
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 538 place count 350 transition count 1777
Iterating global reduction 1 with 12 rules applied. Total rules applied 550 place count 350 transition count 1777
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 551 place count 349 transition count 1776
Iterating global reduction 1 with 1 rules applied. Total rules applied 552 place count 349 transition count 1776
Applied a total of 552 rules in 99 ms. Remains 349 /425 variables (removed 76) and now considering 1776/2252 (removed 476) transitions.
// Phase 1: matrix 1776 rows 349 cols
[2023-03-11 08:49:25] [INFO ] Computed 15 place invariants in 34 ms
[2023-03-11 08:49:25] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-11 08:49:25] [INFO ] Invariant cache hit.
[2023-03-11 08:49:26] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
[2023-03-11 08:49:26] [INFO ] Invariant cache hit.
[2023-03-11 08:49:27] [INFO ] Dead Transitions using invariants and state equation in 961 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 349/425 places, 1776/2252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2184 ms. Remains : 349/425 places, 1776/2252 transitions.
Support contains 47 out of 349 places after structural reductions.
[2023-03-11 08:49:27] [INFO ] Flatten gal took : 349 ms
[2023-03-11 08:49:27] [INFO ] Flatten gal took : 221 ms
[2023-03-11 08:49:28] [INFO ] Input system was already deterministic with 1776 transitions.
Incomplete random walk after 10000 steps, including 77 resets, run finished after 570 ms. (steps per millisecond=17 ) properties (out of 27) seen :7
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) 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 20) seen :0
Running SMT prover for 20 properties.
[2023-03-11 08:49:29] [INFO ] Invariant cache hit.
[2023-03-11 08:49:30] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-03-11 08:49:30] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-11 08:49:30] [INFO ] [Nat]Absence check using 15 positive place invariants in 61 ms returned sat
[2023-03-11 08:49:32] [INFO ] After 1919ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-11 08:49:35] [INFO ] After 4980ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 1431 ms.
[2023-03-11 08:49:37] [INFO ] After 6946ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 341 ms.
Support contains 40 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Graph (trivial) has 281 edges and 349 vertex of which 4 / 349 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1864 edges and 347 vertex of which 345 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 124 rules applied. Total rules applied 126 place count 345 transition count 1648
Reduce places removed 122 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 178 rules applied. Total rules applied 304 place count 223 transition count 1592
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 34 rules applied. Total rules applied 338 place count 190 transition count 1591
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 339 place count 189 transition count 1591
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 339 place count 189 transition count 1584
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 353 place count 182 transition count 1584
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 12 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 467 place count 125 transition count 1527
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 468 place count 125 transition count 1526
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 474 place count 119 transition count 1475
Iterating global reduction 5 with 6 rules applied. Total rules applied 480 place count 119 transition count 1475
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 485 place count 119 transition count 1470
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 6 with 2 rules applied. Total rules applied 487 place count 118 transition count 1469
Free-agglomeration rule applied 25 times.
Iterating global reduction 6 with 25 rules applied. Total rules applied 512 place count 118 transition count 1444
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 537 place count 93 transition count 1444
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 548 place count 93 transition count 1433
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 558 place count 93 transition count 1433
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 559 place count 92 transition count 1432
Applied a total of 559 rules in 865 ms. Remains 92 /349 variables (removed 257) and now considering 1432/1776 (removed 344) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 866 ms. Remains : 92/349 places, 1432/1776 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 20) seen :5
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 :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 :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 :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 :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 :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) 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 :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 5 ms. (steps per millisecond=200 ) 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 :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 1432 rows 92 cols
[2023-03-11 08:49:38] [INFO ] Computed 15 place invariants in 11 ms
[2023-03-11 08:49:39] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-11 08:49:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-11 08:49:40] [INFO ] After 1144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-11 08:49:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:49:41] [INFO ] After 848ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-11 08:49:42] [INFO ] After 2185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 816 ms.
[2023-03-11 08:49:43] [INFO ] After 4403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 210 ms.
Support contains 34 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 1432/1432 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 90 transition count 1430
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 89 transition count 1429
Applied a total of 5 rules in 128 ms. Remains 89 /92 variables (removed 3) and now considering 1429/1432 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 89/92 places, 1429/1432 transitions.
Incomplete random walk after 10000 steps, including 146 resets, run finished after 616 ms. (steps per millisecond=16 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) seen :0
Interrupted probabilistic random walk after 286232 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 286232 steps, saw 44988 distinct states, run finished after 3003 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 1429 rows 89 cols
[2023-03-11 08:49:47] [INFO ] Computed 15 place invariants in 10 ms
[2023-03-11 08:49:48] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-11 08:49:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-11 08:49:49] [INFO ] After 1016ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-11 08:49:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:49:50] [INFO ] After 743ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-11 08:49:51] [INFO ] After 2145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 837 ms.
[2023-03-11 08:49:52] [INFO ] After 4200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 192 ms.
Support contains 34 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1429/1429 transitions.
Applied a total of 0 rules in 66 ms. Remains 89 /89 variables (removed 0) and now considering 1429/1429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 89/89 places, 1429/1429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1429/1429 transitions.
Applied a total of 0 rules in 66 ms. Remains 89 /89 variables (removed 0) and now considering 1429/1429 (removed 0) transitions.
[2023-03-11 08:49:52] [INFO ] Invariant cache hit.
[2023-03-11 08:49:52] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-11 08:49:52] [INFO ] Invariant cache hit.
[2023-03-11 08:49:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:49:53] [INFO ] Implicit Places using invariants and state equation in 474 ms returned [84, 88]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 848 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 87/89 places, 1428/1429 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 86 transition count 1427
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 86 transition count 1426
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 85 transition count 1426
Applied a total of 4 rules in 166 ms. Remains 85 /87 variables (removed 2) and now considering 1426/1428 (removed 2) transitions.
// Phase 1: matrix 1426 rows 85 cols
[2023-03-11 08:49:53] [INFO ] Computed 13 place invariants in 21 ms
[2023-03-11 08:49:53] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-11 08:49:53] [INFO ] Invariant cache hit.
[2023-03-11 08:49:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:49:54] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 85/89 places, 1426/1429 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1897 ms. Remains : 85/89 places, 1426/1429 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :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 :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) 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 :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 :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 :0
Incomplete Best-First random walk after 1000 steps, including 2 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 6 ms. (steps per millisecond=166 ) properties (out of 15) 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 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 :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 349944 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 349944 steps, saw 50785 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-11 08:49:57] [INFO ] Invariant cache hit.
[2023-03-11 08:49:58] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-11 08:49:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-11 08:49:59] [INFO ] After 1191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-11 08:49:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:50:00] [INFO ] After 690ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-11 08:50:01] [INFO ] After 2026ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 727 ms.
[2023-03-11 08:50:02] [INFO ] After 4056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 259 ms.
Support contains 34 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1426/1426 transitions.
Applied a total of 0 rules in 68 ms. Remains 85 /85 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 85/85 places, 1426/1426 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 08:50:03] [INFO ] Invariant cache hit.
[2023-03-11 08:50:03] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-11 08:50:04] [INFO ] After 425ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-11 08:50:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:50:04] [INFO ] After 71ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1 real:5
[2023-03-11 08:50:04] [INFO ] After 172ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:5
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-11 08:50:04] [INFO ] After 746ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:5
[2023-03-11 08:50:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-11 08:50:05] [INFO ] After 622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 08:50:05] [INFO ] After 291ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 08:50:06] [INFO ] After 889ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 331 ms.
[2023-03-11 08:50:06] [INFO ] After 1953ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 111 ms.
Support contains 24 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1426/1426 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 85 transition count 1424
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 83 transition count 1424
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 6 place count 82 transition count 1423
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 82 transition count 1419
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 54 place count 78 transition count 1379
Applied a total of 54 rules in 159 ms. Remains 78 /85 variables (removed 7) and now considering 1379/1426 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 78/85 places, 1379/1426 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 439501 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 439501 steps, saw 63195 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1379 rows 78 cols
[2023-03-11 08:50:10] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-11 08:50:10] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-11 08:50:10] [INFO ] After 442ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-11 08:50:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:50:10] [INFO ] After 57ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1 real:5
[2023-03-11 08:50:11] [INFO ] After 164ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:5
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-11 08:50:11] [INFO ] After 750ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:5
[2023-03-11 08:50:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-11 08:50:11] [INFO ] After 594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 08:50:12] [INFO ] After 255ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 08:50:12] [INFO ] After 798ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 302 ms.
[2023-03-11 08:50:12] [INFO ] After 1806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 97 ms.
Support contains 24 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 1379/1379 transitions.
Applied a total of 0 rules in 74 ms. Remains 78 /78 variables (removed 0) and now considering 1379/1379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 78/78 places, 1379/1379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 1379/1379 transitions.
Applied a total of 0 rules in 62 ms. Remains 78 /78 variables (removed 0) and now considering 1379/1379 (removed 0) transitions.
[2023-03-11 08:50:13] [INFO ] Invariant cache hit.
[2023-03-11 08:50:13] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-11 08:50:13] [INFO ] Invariant cache hit.
[2023-03-11 08:50:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:50:13] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
[2023-03-11 08:50:14] [INFO ] Redundant transitions in 180 ms returned []
[2023-03-11 08:50:14] [INFO ] Invariant cache hit.
[2023-03-11 08:50:14] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1590 ms. Remains : 78/78 places, 1379/1379 transitions.
Graph (complete) has 1059 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output 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 77 transition count 1378
Applied a total of 2 rules in 82 ms. Remains 77 /78 variables (removed 1) and now considering 1378/1379 (removed 1) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 1378 rows 77 cols
[2023-03-11 08:50:14] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-11 08:50:15] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-11 08:50:15] [INFO ] After 365ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-11 08:50:15] [INFO ] After 422ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:5
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-11 08:50:15] [INFO ] After 632ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:5
[2023-03-11 08:50:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-11 08:50:16] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 08:50:16] [INFO ] After 1043ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 306 ms.
[2023-03-11 08:50:17] [INFO ] After 1532ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA AutonomousCar-PT-10b-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 52 stabilizing places and 53 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(G(p0)))'
Support contains 4 out of 349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Graph (trivial) has 330 edges and 349 vertex of which 4 / 349 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 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 127 place count 346 transition count 1647
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 183 rules applied. Total rules applied 310 place count 220 transition count 1590
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 344 place count 186 transition count 1590
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 344 place count 186 transition count 1583
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 358 place count 179 transition count 1583
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 360 place count 177 transition count 1581
Iterating global reduction 3 with 2 rules applied. Total rules applied 362 place count 177 transition count 1581
Performed 79 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 520 place count 98 transition count 1501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 521 place count 98 transition count 1500
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 541 place count 78 transition count 1300
Iterating global reduction 4 with 20 rules applied. Total rules applied 561 place count 78 transition count 1300
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 571 place count 78 transition count 1290
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 575 place count 76 transition count 1288
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 576 place count 75 transition count 1287
Applied a total of 576 rules in 427 ms. Remains 75 /349 variables (removed 274) and now considering 1287/1776 (removed 489) transitions.
// Phase 1: matrix 1287 rows 75 cols
[2023-03-11 08:50:18] [INFO ] Computed 14 place invariants in 14 ms
[2023-03-11 08:50:19] [INFO ] Implicit Places using invariants in 824 ms returned []
[2023-03-11 08:50:19] [INFO ] Invariant cache hit.
[2023-03-11 08:50:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:50:20] [INFO ] Implicit Places using invariants and state equation in 1436 ms returned [70, 74]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2286 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/349 places, 1287/1776 transitions.
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 2 place count 72 transition count 1286
Applied a total of 2 rules in 149 ms. Remains 72 /73 variables (removed 1) and now considering 1286/1287 (removed 1) transitions.
// Phase 1: matrix 1286 rows 72 cols
[2023-03-11 08:50:20] [INFO ] Computed 12 place invariants in 20 ms
[2023-03-11 08:50:21] [INFO ] Implicit Places using invariants in 947 ms returned []
[2023-03-11 08:50:21] [INFO ] Invariant cache hit.
[2023-03-11 08:50:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:50:22] [INFO ] Implicit Places using invariants and state equation in 1297 ms returned []
Implicit Place search using SMT with State Equation took 2268 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/349 places, 1286/1776 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5132 ms. Remains : 72/349 places, 1286/1776 transitions.
Stuttering acceptance computed with spot in 392 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s3 1) (EQ s46 1) (EQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 5 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-00 finished in 5702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&(p1||G(p0))))||X(F(p2))))'
Support contains 6 out of 349 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 347 transition count 1774
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 347 transition count 1774
Applied a total of 4 rules in 40 ms. Remains 347 /349 variables (removed 2) and now considering 1774/1776 (removed 2) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2023-03-11 08:50:23] [INFO ] Computed 15 place invariants in 13 ms
[2023-03-11 08:50:24] [INFO ] Implicit Places using invariants in 523 ms returned []
[2023-03-11 08:50:24] [INFO ] Invariant cache hit.
[2023-03-11 08:50:24] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1541 ms to find 0 implicit places.
[2023-03-11 08:50:25] [INFO ] Invariant cache hit.
[2023-03-11 08:50:25] [INFO ] Dead Transitions using invariants and state equation in 939 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/349 places, 1774/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2521 ms. Remains : 347/349 places, 1774/1776 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(AND (EQ s4 1) (EQ s11 1) (EQ s257 1) (EQ s313 1)), p0:(OR (EQ s4 0) (EQ s17 0) (EQ s182 0) (EQ s313 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 767 reset in 611 ms.
Product exploration explored 100000 steps with 147 reset in 331 ms.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 343 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 76 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 324155 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 324155 steps, saw 59449 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 08:50:31] [INFO ] Invariant cache hit.
[2023-03-11 08:50:31] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-11 08:50:31] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 08:50:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-11 08:50:32] [INFO ] After 702ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 08:50:33] [INFO ] Deduced a trap composed of 31 places in 1172 ms of which 0 ms to minimize.
[2023-03-11 08:50:34] [INFO ] Deduced a trap composed of 31 places in 1053 ms of which 1 ms to minimize.
[2023-03-11 08:50:35] [INFO ] Deduced a trap composed of 31 places in 841 ms of which 1 ms to minimize.
[2023-03-11 08:50:36] [INFO ] Deduced a trap composed of 31 places in 857 ms of which 1 ms to minimize.
[2023-03-11 08:50:37] [INFO ] Deduced a trap composed of 31 places in 1183 ms of which 1 ms to minimize.
[2023-03-11 08:50:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5388 ms
[2023-03-11 08:50:37] [INFO ] After 6323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 227 ms.
[2023-03-11 08:50:37] [INFO ] After 6671ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 6 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 328 edges and 347 vertex of which 4 / 347 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 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 128 rules applied. Total rules applied 130 place count 343 transition count 1642
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 185 rules applied. Total rules applied 315 place count 217 transition count 1583
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 350 place count 182 transition count 1583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 350 place count 182 transition count 1577
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 362 place count 176 transition count 1577
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 522 place count 96 transition count 1497
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 523 place count 96 transition count 1496
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 542 place count 77 transition count 1305
Iterating global reduction 4 with 19 rules applied. Total rules applied 561 place count 77 transition count 1305
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 569 place count 77 transition count 1297
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 571 place count 76 transition count 1296
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 583 place count 76 transition count 1284
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 595 place count 64 transition count 1284
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 596 place count 64 transition count 1284
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 597 place count 63 transition count 1283
Applied a total of 597 rules in 424 ms. Remains 63 /347 variables (removed 284) and now considering 1283/1774 (removed 491) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 425 ms. Remains : 63/347 places, 1283/1774 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :2
Finished Best-First random walk after 681 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=340 )
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F p2), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 610 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 226 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 347 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 22 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
[2023-03-11 08:50:39] [INFO ] Invariant cache hit.
[2023-03-11 08:50:40] [INFO ] Implicit Places using invariants in 511 ms returned []
[2023-03-11 08:50:40] [INFO ] Invariant cache hit.
[2023-03-11 08:50:41] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 1561 ms to find 0 implicit places.
[2023-03-11 08:50:41] [INFO ] Invariant cache hit.
[2023-03-11 08:50:42] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2359 ms. Remains : 347/347 places, 1774/1774 transitions.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 302 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 77 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 333412 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 333412 steps, saw 61383 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 08:50:45] [INFO ] Invariant cache hit.
[2023-03-11 08:50:46] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-03-11 08:50:46] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 08:50:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-11 08:50:46] [INFO ] After 672ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 08:50:48] [INFO ] Deduced a trap composed of 31 places in 1113 ms of which 1 ms to minimize.
[2023-03-11 08:50:49] [INFO ] Deduced a trap composed of 31 places in 965 ms of which 1 ms to minimize.
[2023-03-11 08:50:50] [INFO ] Deduced a trap composed of 31 places in 959 ms of which 1 ms to minimize.
[2023-03-11 08:50:50] [INFO ] Deduced a trap composed of 31 places in 704 ms of which 0 ms to minimize.
[2023-03-11 08:50:51] [INFO ] Deduced a trap composed of 31 places in 841 ms of which 1 ms to minimize.
[2023-03-11 08:50:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4828 ms
[2023-03-11 08:50:51] [INFO ] After 5721ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-03-11 08:50:52] [INFO ] After 6039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 37 ms.
Support contains 6 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 328 edges and 347 vertex of which 4 / 347 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 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 128 rules applied. Total rules applied 130 place count 343 transition count 1642
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 185 rules applied. Total rules applied 315 place count 217 transition count 1583
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 350 place count 182 transition count 1583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 350 place count 182 transition count 1577
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 362 place count 176 transition count 1577
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 522 place count 96 transition count 1497
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 523 place count 96 transition count 1496
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 542 place count 77 transition count 1305
Iterating global reduction 4 with 19 rules applied. Total rules applied 561 place count 77 transition count 1305
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 569 place count 77 transition count 1297
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 5 with 2 rules applied. Total rules applied 571 place count 76 transition count 1296
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 583 place count 76 transition count 1284
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 595 place count 64 transition count 1284
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 596 place count 64 transition count 1284
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 597 place count 63 transition count 1283
Applied a total of 597 rules in 414 ms. Remains 63 /347 variables (removed 284) and now considering 1283/1774 (removed 491) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 414 ms. Remains : 63/347 places, 1283/1774 transitions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Finished Best-First random walk after 2635 steps, including 2 resets, run visited all 3 properties in 5 ms. (steps per millisecond=527 )
Knowledge obtained : [(AND (NOT p2) p0), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F p2), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 6 factoid took 409 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 362 reset in 357 ms.
Product exploration explored 100000 steps with 118 reset in 264 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 209 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 328 edges and 347 vertex of which 4 / 347 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.
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 345 transition count 1772
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 149 place count 345 transition count 1749
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 149 place count 345 transition count 1749
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 174 place count 345 transition count 1749
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 282 place count 237 transition count 1641
Deduced a syphon composed of 43 places in 1 ms
Iterating global reduction 2 with 108 rules applied. Total rules applied 390 place count 237 transition count 1641
Performed 96 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 139 places in 1 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 486 place count 237 transition count 1652
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 488 place count 237 transition count 1650
Discarding 82 places :
Symmetric choice reduction at 3 with 82 rule applications. Total rules 570 place count 155 transition count 1396
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 3 with 82 rules applied. Total rules applied 652 place count 155 transition count 1396
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 668 place count 155 transition count 1380
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 677 place count 146 transition count 1371
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 686 place count 146 transition count 1371
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 687 place count 146 transition count 1371
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 689 place count 144 transition count 1369
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 691 place count 144 transition count 1369
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 692 place count 144 transition count 1371
Deduced a syphon composed of 67 places in 0 ms
Applied a total of 692 rules in 362 ms. Remains 144 /347 variables (removed 203) and now considering 1371/1774 (removed 403) transitions.
[2023-03-11 08:50:55] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 1371 rows 144 cols
[2023-03-11 08:50:55] [INFO ] Computed 14 place invariants in 9 ms
[2023-03-11 08:50:56] [INFO ] Dead Transitions using invariants and state equation in 717 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/347 places, 1371/1774 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1139 ms. Remains : 144/347 places, 1371/1774 transitions.
Built C files in :
/tmp/ltsmin17093116356880877939
[2023-03-11 08:50:56] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17093116356880877939
Running compilation step : cd /tmp/ltsmin17093116356880877939;'/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/ltsmin17093116356880877939;'/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/ltsmin17093116356880877939;'/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 6 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 8 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2023-03-11 08:50:59] [INFO ] Computed 15 place invariants in 43 ms
[2023-03-11 08:51:00] [INFO ] Implicit Places using invariants in 985 ms returned []
[2023-03-11 08:51:00] [INFO ] Invariant cache hit.
[2023-03-11 08:51:01] [INFO ] Implicit Places using invariants and state equation in 1416 ms returned []
Implicit Place search using SMT with State Equation took 2404 ms to find 0 implicit places.
[2023-03-11 08:51:01] [INFO ] Invariant cache hit.
[2023-03-11 08:51:02] [INFO ] Dead Transitions using invariants and state equation in 886 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3305 ms. Remains : 347/347 places, 1774/1774 transitions.
Built C files in :
/tmp/ltsmin9060058866312710055
[2023-03-11 08:51:02] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9060058866312710055
Running compilation step : cd /tmp/ltsmin9060058866312710055;'/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/ltsmin9060058866312710055;'/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/ltsmin9060058866312710055;'/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:51:06] [INFO ] Flatten gal took : 202 ms
[2023-03-11 08:51:06] [INFO ] Flatten gal took : 190 ms
[2023-03-11 08:51:06] [INFO ] Time to serialize gal into /tmp/LTL5207553398751849906.gal : 51 ms
[2023-03-11 08:51:06] [INFO ] Time to serialize properties into /tmp/LTL6111846995176225617.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/LTL5207553398751849906.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6229568393329114706.hoa' '-atoms' '/tmp/LTL6111846995176225617.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...317
Loading property file /tmp/LTL6111846995176225617.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6229568393329114706.hoa
Detected timeout of ITS tools.
[2023-03-11 08:51:22] [INFO ] Flatten gal took : 198 ms
[2023-03-11 08:51:22] [INFO ] Flatten gal took : 177 ms
[2023-03-11 08:51:22] [INFO ] Time to serialize gal into /tmp/LTL15140480734172300692.gal : 27 ms
[2023-03-11 08:51:22] [INFO ] Time to serialize properties into /tmp/LTL11570451431936347730.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/LTL15140480734172300692.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11570451431936347730.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...277
Read 1 LTL properties
Checking formula 0 : !(((G(("(((p6==0)||(p20==0))||((p218==0)||(p382==0)))")&&(("(((((p68==1)&&(p99==1))&&((p136==1)&&(p161==1)))&&(((p192==1)&&(p223==1))&...336
Formula 0 simplified : F(!"(((p6==0)||(p20==0))||((p218==0)||(p382==0)))" | (!"(((((p68==1)&&(p99==1))&&((p136==1)&&(p161==1)))&&(((p192==1)&&(p223==1))&&(...324
Detected timeout of ITS tools.
[2023-03-11 08:51:37] [INFO ] Flatten gal took : 194 ms
[2023-03-11 08:51:37] [INFO ] Applying decomposition
[2023-03-11 08:51:37] [INFO ] Flatten gal took : 200 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/graph15305938831162074300.txt' '-o' '/tmp/graph15305938831162074300.bin' '-w' '/tmp/graph15305938831162074300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15305938831162074300.bin' '-l' '-1' '-v' '-w' '/tmp/graph15305938831162074300.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:51:38] [INFO ] Decomposing Gal with order
[2023-03-11 08:51:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:51:39] [INFO ] Removed a total of 11985 redundant transitions.
[2023-03-11 08:51:39] [INFO ] Flatten gal took : 735 ms
[2023-03-11 08:51:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 166 labels/synchronizations in 76 ms.
[2023-03-11 08:51:39] [INFO ] Time to serialize gal into /tmp/LTL9375322053561367942.gal : 18 ms
[2023-03-11 08:51:39] [INFO ] Time to serialize properties into /tmp/LTL1311026753533569006.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/LTL9375322053561367942.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1311026753533569006.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(("(((i9.u2.p6==0)||(i9.u2.p20==0))||((i9.u2.p218==0)||(i9.u2.p382==0)))")&&(("(((((i7.u16.p68==1)&&(i7.u23.p99==1))&&((i7.u33.p1...485
Formula 0 simplified : F(!"(((i9.u2.p6==0)||(i9.u2.p20==0))||((i9.u2.p218==0)||(i9.u2.p382==0)))" | (!"(((((i7.u16.p68==1)&&(i7.u23.p99==1))&&((i7.u33.p136...473
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11477338353727164654
[2023-03-11 08:51:54] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11477338353727164654
Running compilation step : cd /tmp/ltsmin11477338353727164654;'/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/ltsmin11477338353727164654;'/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/ltsmin11477338353727164654;'/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-10b-LTLFireability-01 finished in 94377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G((F(p2)&&p1))))))'
Support contains 8 out of 349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Graph (trivial) has 327 edges and 349 vertex of which 4 / 349 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 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 346 transition count 1651
Reduce places removed 122 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 176 rules applied. Total rules applied 299 place count 224 transition count 1597
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 33 rules applied. Total rules applied 332 place count 192 transition count 1596
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 333 place count 191 transition count 1596
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 333 place count 191 transition count 1588
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 349 place count 183 transition count 1588
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 351 place count 181 transition count 1586
Iterating global reduction 4 with 2 rules applied. Total rules applied 353 place count 181 transition count 1586
Performed 79 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 4 with 158 rules applied. Total rules applied 511 place count 102 transition count 1506
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 512 place count 102 transition count 1505
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 531 place count 83 transition count 1315
Iterating global reduction 5 with 19 rules applied. Total rules applied 550 place count 83 transition count 1315
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 559 place count 83 transition count 1306
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 563 place count 81 transition count 1304
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 564 place count 81 transition count 1304
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 566 place count 79 transition count 1302
Applied a total of 566 rules in 419 ms. Remains 79 /349 variables (removed 270) and now considering 1302/1776 (removed 474) transitions.
// Phase 1: matrix 1302 rows 79 cols
[2023-03-11 08:51:58] [INFO ] Computed 14 place invariants in 34 ms
[2023-03-11 08:51:59] [INFO ] Implicit Places using invariants in 992 ms returned []
[2023-03-11 08:51:59] [INFO ] Invariant cache hit.
[2023-03-11 08:51:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:52:00] [INFO ] Implicit Places using invariants and state equation in 1284 ms returned [74, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2282 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/349 places, 1302/1776 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 76 transition count 1301
Applied a total of 2 rules in 157 ms. Remains 76 /77 variables (removed 1) and now considering 1301/1302 (removed 1) transitions.
// Phase 1: matrix 1301 rows 76 cols
[2023-03-11 08:52:00] [INFO ] Computed 12 place invariants in 16 ms
[2023-03-11 08:52:01] [INFO ] Implicit Places using invariants in 893 ms returned []
[2023-03-11 08:52:01] [INFO ] Invariant cache hit.
[2023-03-11 08:52:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:52:02] [INFO ] Implicit Places using invariants and state equation in 1362 ms returned []
Implicit Place search using SMT with State Equation took 2259 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/349 places, 1301/1776 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5117 ms. Remains : 76/349 places, 1301/1776 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s5 0) (EQ s35 0) (EQ s70 0)), p1:(AND (EQ s1 1) (EQ s9 1) (EQ s29 1) (EQ s70 1) (EQ s47 1)), p2:(EQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-02 finished in 5427 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) U p1))||((F(p0) U p1)&&F(p2))))'
Support contains 16 out of 349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Graph (trivial) has 305 edges and 349 vertex of which 4 / 349 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 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 346 transition count 1648
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 180 rules applied. Total rules applied 306 place count 221 transition count 1593
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 34 rules applied. Total rules applied 340 place count 188 transition count 1592
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 343 place count 187 transition count 1590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 344 place count 186 transition count 1590
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 344 place count 186 transition count 1585
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 354 place count 181 transition count 1585
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 356 place count 179 transition count 1583
Iterating global reduction 5 with 2 rules applied. Total rules applied 358 place count 179 transition count 1583
Performed 69 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 496 place count 110 transition count 1513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 497 place count 110 transition count 1512
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 513 place count 94 transition count 1356
Iterating global reduction 6 with 16 rules applied. Total rules applied 529 place count 94 transition count 1356
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 539 place count 94 transition count 1346
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 7 with 4 rules applied. Total rules applied 543 place count 92 transition count 1344
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 545 place count 90 transition count 1342
Applied a total of 545 rules in 325 ms. Remains 90 /349 variables (removed 259) and now considering 1342/1776 (removed 434) transitions.
// Phase 1: matrix 1342 rows 90 cols
[2023-03-11 08:52:03] [INFO ] Computed 14 place invariants in 19 ms
[2023-03-11 08:52:03] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-11 08:52:03] [INFO ] Invariant cache hit.
[2023-03-11 08:52:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:52:04] [INFO ] Implicit Places using invariants and state equation in 952 ms returned [85, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1351 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/349 places, 1342/1776 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 87 transition count 1341
Applied a total of 2 rules in 115 ms. Remains 87 /88 variables (removed 1) and now considering 1341/1342 (removed 1) transitions.
// Phase 1: matrix 1341 rows 87 cols
[2023-03-11 08:52:05] [INFO ] Computed 12 place invariants in 20 ms
[2023-03-11 08:52:05] [INFO ] Implicit Places using invariants in 546 ms returned []
[2023-03-11 08:52:05] [INFO ] Invariant cache hit.
[2023-03-11 08:52:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:52:06] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 1588 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/349 places, 1341/1776 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3379 ms. Remains : 87/349 places, 1341/1776 transitions.
Stuttering acceptance computed with spot in 433 ms :[(NOT p1), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s5 1) (EQ s24 1) (EQ s82 1)), p0:(AND (EQ s16 1) (EQ s23 1) (EQ s32 1) (EQ s41 1) (EQ s47 1) (EQ s51 1) (EQ s58 1) (EQ s67 1) (EQ s7...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-03 finished in 3850 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((G(p0) U p1)))&&(p2||X(X(p3))))))'
Support contains 18 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 348 transition count 1775
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 348 transition count 1775
Applied a total of 2 rules in 25 ms. Remains 348 /349 variables (removed 1) and now considering 1775/1776 (removed 1) transitions.
// Phase 1: matrix 1775 rows 348 cols
[2023-03-11 08:52:07] [INFO ] Computed 15 place invariants in 17 ms
[2023-03-11 08:52:07] [INFO ] Implicit Places using invariants in 705 ms returned []
[2023-03-11 08:52:07] [INFO ] Invariant cache hit.
[2023-03-11 08:52:08] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1618 ms to find 0 implicit places.
[2023-03-11 08:52:08] [INFO ] Invariant cache hit.
[2023-03-11 08:52:09] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 348/349 places, 1775/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2310 ms. Remains : 348/349 places, 1775/1776 transitions.
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p3), true]
Running random walk in product with property : AutonomousCar-PT-10b-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=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}], [{ cond=(OR p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s50 1), p1:(AND (EQ s4 1) (EQ s12 1) (EQ s199 1) (EQ s314 1)), p0:(AND (EQ s4 1) (EQ s6 1) (EQ s233 1) (EQ s314 1)), p3:(AND (EQ s68 1) (EQ s88 1) ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][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-10b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-04 finished in 2749 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) U (G((F(p0)||G(!p1)))||((F(p0)||G(!p1))&&(G(!p1)||(!p1&&F(p2))))))))'
Support contains 20 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 348 transition count 1775
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 348 transition count 1775
Applied a total of 2 rules in 34 ms. Remains 348 /349 variables (removed 1) and now considering 1775/1776 (removed 1) transitions.
// Phase 1: matrix 1775 rows 348 cols
[2023-03-11 08:52:09] [INFO ] Computed 15 place invariants in 24 ms
[2023-03-11 08:52:10] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-11 08:52:10] [INFO ] Invariant cache hit.
[2023-03-11 08:52:11] [INFO ] Implicit Places using invariants and state equation in 1157 ms returned []
Implicit Place search using SMT with State Equation took 1472 ms to find 0 implicit places.
[2023-03-11 08:52:11] [INFO ] Invariant cache hit.
[2023-03-11 08:52:12] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 348/349 places, 1775/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2235 ms. Remains : 348/349 places, 1775/1776 transitions.
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s67 1) (EQ s87 1) (EQ s117 1) (EQ s142 1) (EQ s163 1) (EQ s188 1) (EQ s218 1) (EQ s238 1) (EQ s263 1) (EQ s293 1) (EQ s315 1)), p0:(NEQ s122 1...], 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]]
Product exploration explored 100000 steps with 91 reset in 229 ms.
Product exploration explored 100000 steps with 771 reset in 444 ms.
Computed a total of 52 stabilizing places and 53 stable transitions
Computed a total of 52 stabilizing places and 53 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 755 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 77 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 08:52:14] [INFO ] Invariant cache hit.
[2023-03-11 08:52:14] [INFO ] [Real]Absence check using 15 positive place invariants in 20 ms returned sat
[2023-03-11 08:52:14] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-11 08:52:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 08:52:15] [INFO ] After 729ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 08:52:16] [INFO ] Deduced a trap composed of 5 places in 1201 ms of which 12 ms to minimize.
[2023-03-11 08:52:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1314 ms
[2023-03-11 08:52:16] [INFO ] After 2083ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-11 08:52:16] [INFO ] After 2239ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 12 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 1775/1775 transitions.
Graph (trivial) has 310 edges and 348 vertex of which 4 / 348 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 1863 edges and 346 vertex of which 344 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 129 rules applied. Total rules applied 131 place count 344 transition count 1642
Reduce places removed 127 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 186 rules applied. Total rules applied 317 place count 217 transition count 1583
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 352 place count 182 transition count 1583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 352 place count 182 transition count 1577
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 364 place count 176 transition count 1577
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 506 place count 105 transition count 1506
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 507 place count 105 transition count 1505
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 524 place count 88 transition count 1337
Iterating global reduction 4 with 17 rules applied. Total rules applied 541 place count 88 transition count 1337
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 550 place count 88 transition count 1328
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 552 place count 87 transition count 1327
Free-agglomeration rule applied 14 times.
Iterating global reduction 5 with 14 rules applied. Total rules applied 566 place count 87 transition count 1313
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 580 place count 73 transition count 1313
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 590 place count 73 transition count 1303
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 594 place count 73 transition count 1303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 595 place count 72 transition count 1302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 596 place count 71 transition count 1302
Applied a total of 596 rules in 441 ms. Remains 71 /348 variables (removed 277) and now considering 1302/1775 (removed 473) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 441 ms. Remains : 71/348 places, 1302/1775 transitions.
Finished random walk after 4600 steps, including 12 resets, run visited all 1 properties in 124 ms. (steps per millisecond=37 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p2) (NOT p0) p1)))]
False Knowledge obtained : [(F p2), (F (AND (NOT p2) (NOT p0)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) (NOT p0) p1)))
Knowledge based reduction with 13 factoid took 604 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10b-LTLFireability-05 finished in 8092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Graph (trivial) has 329 edges and 349 vertex of which 4 / 349 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 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 346 transition count 1648
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 182 rules applied. Total rules applied 308 place count 221 transition count 1591
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 342 place count 187 transition count 1591
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 342 place count 187 transition count 1584
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 356 place count 180 transition count 1584
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 358 place count 178 transition count 1582
Iterating global reduction 3 with 2 rules applied. Total rules applied 360 place count 178 transition count 1582
Performed 79 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 518 place count 99 transition count 1502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 519 place count 99 transition count 1501
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 539 place count 79 transition count 1301
Iterating global reduction 4 with 20 rules applied. Total rules applied 559 place count 79 transition count 1301
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 569 place count 79 transition count 1291
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 573 place count 77 transition count 1289
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 574 place count 76 transition count 1288
Applied a total of 574 rules in 293 ms. Remains 76 /349 variables (removed 273) and now considering 1288/1776 (removed 488) transitions.
// Phase 1: matrix 1288 rows 76 cols
[2023-03-11 08:52:18] [INFO ] Computed 14 place invariants in 17 ms
[2023-03-11 08:52:19] [INFO ] Implicit Places using invariants in 819 ms returned []
[2023-03-11 08:52:19] [INFO ] Invariant cache hit.
[2023-03-11 08:52:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:52:20] [INFO ] Implicit Places using invariants and state equation in 1245 ms returned [71, 75]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2080 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/349 places, 1288/1776 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 73 transition count 1287
Applied a total of 2 rules in 102 ms. Remains 73 /74 variables (removed 1) and now considering 1287/1288 (removed 1) transitions.
// Phase 1: matrix 1287 rows 73 cols
[2023-03-11 08:52:20] [INFO ] Computed 12 place invariants in 29 ms
[2023-03-11 08:52:21] [INFO ] Implicit Places using invariants in 868 ms returned []
[2023-03-11 08:52:21] [INFO ] Invariant cache hit.
[2023-03-11 08:52:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:52:22] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 2089 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/349 places, 1287/1776 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4565 ms. Remains : 73/349 places, 1287/1776 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s2 1) (NEQ s3 1) (NEQ s38 1) (NEQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 102 reset in 179 ms.
Product exploration explored 100000 steps with 302 reset in 146 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 208 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 275 steps, including 12 resets, run visited all 1 properties in 4 ms. (steps per millisecond=68 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 1287/1287 transitions.
Applied a total of 0 rules in 86 ms. Remains 73 /73 variables (removed 0) and now considering 1287/1287 (removed 0) transitions.
[2023-03-11 08:52:23] [INFO ] Invariant cache hit.
[2023-03-11 08:52:24] [INFO ] Implicit Places using invariants in 928 ms returned []
[2023-03-11 08:52:24] [INFO ] Invariant cache hit.
[2023-03-11 08:52:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:52:25] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned []
Implicit Place search using SMT with State Equation took 2282 ms to find 0 implicit places.
[2023-03-11 08:52:25] [INFO ] Redundant transitions in 100 ms returned [1074]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1286 rows 73 cols
[2023-03-11 08:52:25] [INFO ] Computed 12 place invariants in 7 ms
[2023-03-11 08:52:26] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/73 places, 1286/1287 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 71 transition count 1284
Applied a total of 2 rules in 102 ms. Remains 71 /73 variables (removed 2) and now considering 1284/1286 (removed 2) transitions.
// Phase 1: matrix 1284 rows 71 cols
[2023-03-11 08:52:26] [INFO ] Computed 12 place invariants in 21 ms
[2023-03-11 08:52:27] [INFO ] Implicit Places using invariants in 838 ms returned []
[2023-03-11 08:52:27] [INFO ] Invariant cache hit.
[2023-03-11 08:52:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:52:28] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1762 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/73 places, 1284/1287 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4872 ms. Remains : 71/73 places, 1284/1287 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Finished random walk after 110 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=55 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Product exploration explored 100000 steps with 230 reset in 169 ms.
Product exploration explored 100000 steps with 976 reset in 233 ms.
Built C files in :
/tmp/ltsmin10557742823730826144
[2023-03-11 08:52:29] [INFO ] Computing symmetric may disable matrix : 1284 transitions.
[2023-03-11 08:52:29] [INFO ] Computation of Complete disable matrix. took 443 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:52:29] [INFO ] Computing symmetric may enable matrix : 1284 transitions.
[2023-03-11 08:52:29] [INFO ] Computation of Complete enable matrix. took 117 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:52:30] [INFO ] Computing Do-Not-Accords matrix : 1284 transitions.
[2023-03-11 08:52:30] [INFO ] Computation of Completed DNA matrix. took 103 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:52:30] [INFO ] Built C files in 1330ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10557742823730826144
Running compilation step : cd /tmp/ltsmin10557742823730826144;'/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/ltsmin10557742823730826144;'/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/ltsmin10557742823730826144;'/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 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 1284/1284 transitions.
Applied a total of 0 rules in 103 ms. Remains 71 /71 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
[2023-03-11 08:52:33] [INFO ] Invariant cache hit.
[2023-03-11 08:52:34] [INFO ] Implicit Places using invariants in 729 ms returned []
[2023-03-11 08:52:34] [INFO ] Invariant cache hit.
[2023-03-11 08:52:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:52:35] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 1864 ms to find 0 implicit places.
[2023-03-11 08:52:35] [INFO ] Redundant transitions in 104 ms returned []
[2023-03-11 08:52:35] [INFO ] Invariant cache hit.
[2023-03-11 08:52:36] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2636 ms. Remains : 71/71 places, 1284/1284 transitions.
Built C files in :
/tmp/ltsmin1762293924032986190
[2023-03-11 08:52:36] [INFO ] Computing symmetric may disable matrix : 1284 transitions.
[2023-03-11 08:52:36] [INFO ] Computation of Complete disable matrix. took 393 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:52:36] [INFO ] Computing symmetric may enable matrix : 1284 transitions.
[2023-03-11 08:52:36] [INFO ] Computation of Complete enable matrix. took 125 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:52:37] [INFO ] Computing Do-Not-Accords matrix : 1284 transitions.
[2023-03-11 08:52:37] [INFO ] Computation of Completed DNA matrix. took 81 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:52:37] [INFO ] Built C files in 1177ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1762293924032986190
Running compilation step : cd /tmp/ltsmin1762293924032986190;'/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/ltsmin1762293924032986190;'/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/ltsmin1762293924032986190;'/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:52:40] [INFO ] Flatten gal took : 255 ms
[2023-03-11 08:52:41] [INFO ] Flatten gal took : 250 ms
[2023-03-11 08:52:41] [INFO ] Time to serialize gal into /tmp/LTL5851139600476563110.gal : 21 ms
[2023-03-11 08:52:41] [INFO ] Time to serialize properties into /tmp/LTL12543092129333905269.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/LTL5851139600476563110.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16378478798141325997.hoa' '-atoms' '/tmp/LTL12543092129333905269.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/LTL12543092129333905269.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16378478798141325997.hoa
Detected timeout of ITS tools.
[2023-03-11 08:52:56] [INFO ] Flatten gal took : 198 ms
[2023-03-11 08:52:56] [INFO ] Flatten gal took : 204 ms
[2023-03-11 08:52:56] [INFO ] Time to serialize gal into /tmp/LTL17176447726098983361.gal : 20 ms
[2023-03-11 08:52:56] [INFO ] Time to serialize properties into /tmp/LTL13562693678873663592.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/LTL17176447726098983361.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13562693678873663592.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(((p6!=1)||(p9!=1))||((p194!=1)||(p382!=1)))"))))
Formula 0 simplified : GF!"(((p6!=1)||(p9!=1))||((p194!=1)||(p382!=1)))"
Detected timeout of ITS tools.
[2023-03-11 08:53:12] [INFO ] Flatten gal took : 198 ms
[2023-03-11 08:53:12] [INFO ] Applying decomposition
[2023-03-11 08:53:12] [INFO ] Flatten gal took : 255 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/graph7924604390824215438.txt' '-o' '/tmp/graph7924604390824215438.bin' '-w' '/tmp/graph7924604390824215438.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7924604390824215438.bin' '-l' '-1' '-v' '-w' '/tmp/graph7924604390824215438.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:53:12] [INFO ] Decomposing Gal with order
[2023-03-11 08:53:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:53:13] [INFO ] Removed a total of 11632 redundant transitions.
[2023-03-11 08:53:13] [INFO ] Flatten gal took : 327 ms
[2023-03-11 08:53:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 56 ms.
[2023-03-11 08:53:13] [INFO ] Time to serialize gal into /tmp/LTL2251555649632199642.gal : 14 ms
[2023-03-11 08:53:13] [INFO ] Time to serialize properties into /tmp/LTL7437458498215193605.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/LTL2251555649632199642.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7437458498215193605.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 : !((F(G("(((u0.p6!=1)||(u0.p9!=1))||((u9.p194!=1)||(u0.p382!=1)))"))))
Formula 0 simplified : GF!"(((u0.p6!=1)||(u0.p9!=1))||((u9.p194!=1)||(u0.p382!=1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin345908453711538800
[2023-03-11 08:53:28] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin345908453711538800
Running compilation step : cd /tmp/ltsmin345908453711538800;'/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/ltsmin345908453711538800;'/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/ltsmin345908453711538800;'/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-10b-LTLFireability-06 finished in 73819 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)||G(p1))))'
Support contains 16 out of 349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Graph (trivial) has 302 edges and 349 vertex of which 4 / 349 are part of one of the 2 SCC in 2 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 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 128 place count 346 transition count 1646
Reduce places removed 127 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 184 rules applied. Total rules applied 312 place count 219 transition count 1589
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 346 place count 185 transition count 1589
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 346 place count 185 transition count 1583
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 358 place count 179 transition count 1583
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 360 place count 177 transition count 1581
Iterating global reduction 3 with 2 rules applied. Total rules applied 362 place count 177 transition count 1581
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 492 place count 112 transition count 1515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 493 place count 112 transition count 1514
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 504 place count 101 transition count 1413
Iterating global reduction 4 with 11 rules applied. Total rules applied 515 place count 101 transition count 1413
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 525 place count 101 transition count 1403
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 529 place count 99 transition count 1401
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 531 place count 97 transition count 1399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 532 place count 96 transition count 1399
Applied a total of 532 rules in 308 ms. Remains 96 /349 variables (removed 253) and now considering 1399/1776 (removed 377) transitions.
// Phase 1: matrix 1399 rows 96 cols
[2023-03-11 08:53:32] [INFO ] Computed 13 place invariants in 14 ms
[2023-03-11 08:53:32] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-11 08:53:32] [INFO ] Invariant cache hit.
[2023-03-11 08:53:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:53:33] [INFO ] Implicit Places using invariants and state equation in 708 ms returned [91, 95]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1081 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/349 places, 1399/1776 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 93 transition count 1398
Applied a total of 2 rules in 158 ms. Remains 93 /94 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 93 cols
[2023-03-11 08:53:33] [INFO ] Computed 11 place invariants in 13 ms
[2023-03-11 08:53:33] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-11 08:53:33] [INFO ] Invariant cache hit.
[2023-03-11 08:53:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:53:34] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/349 places, 1398/1776 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2587 ms. Remains : 93/349 places, 1398/1776 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s14 0) (EQ s25 0) (EQ s33 0) (EQ s37 0) (EQ s48 0) (EQ s52 0) (EQ s60 0) (EQ s71 0) (EQ s75 0) (EQ s82 0) (EQ s89 0)), p1:(OR (EQ s14 0) (EQ s2...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 251 reset in 172 ms.
Product exploration explored 100000 steps with 1001 reset in 312 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 (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 517 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 346 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 08:53:35] [INFO ] Invariant cache hit.
[2023-03-11 08:53:36] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 08:53:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-11 08:53:36] [INFO ] After 481ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 08:53:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:53:36] [INFO ] After 35ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-11 08:53:36] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-11 08:53:36] [INFO ] After 663ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 16 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 1398/1398 transitions.
Graph (complete) has 1102 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 92 transition count 1395
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 23 place count 92 transition count 1375
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 43 place count 72 transition count 1375
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 72 transition count 1376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 71 transition count 1376
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 55 place count 71 transition count 1376
Applied a total of 55 rules in 254 ms. Remains 71 /93 variables (removed 22) and now considering 1376/1398 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 71/93 places, 1376/1398 transitions.
Finished random walk after 336 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=67 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 605 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Support contains 16 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 1398/1398 transitions.
Applied a total of 0 rules in 96 ms. Remains 93 /93 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2023-03-11 08:53:37] [INFO ] Invariant cache hit.
[2023-03-11 08:53:38] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-11 08:53:38] [INFO ] Invariant cache hit.
[2023-03-11 08:53:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:53:39] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
[2023-03-11 08:53:39] [INFO ] Redundant transitions in 91 ms returned [1095]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1397 rows 93 cols
[2023-03-11 08:53:39] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-11 08:53:39] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/93 places, 1397/1398 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 91 transition count 1395
Applied a total of 2 rules in 103 ms. Remains 91 /93 variables (removed 2) and now considering 1395/1397 (removed 2) transitions.
// Phase 1: matrix 1395 rows 91 cols
[2023-03-11 08:53:39] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-11 08:53:40] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-11 08:53:40] [INFO ] Invariant cache hit.
[2023-03-11 08:53:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:53:40] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 91/93 places, 1395/1398 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3193 ms. Remains : 91/93 places, 1395/1398 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 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 489 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 362 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 08:53:42] [INFO ] Invariant cache hit.
[2023-03-11 08:53:42] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 08:53:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-11 08:53:42] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 08:53:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:53:42] [INFO ] After 74ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-11 08:53:42] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-11 08:53:42] [INFO ] After 589ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 16 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 1395/1395 transitions.
Graph (complete) has 1096 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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 90 transition count 1393
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 22 place count 90 transition count 1373
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 70 transition count 1373
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 70 transition count 1373
Applied a total of 52 rules in 196 ms. Remains 70 /91 variables (removed 21) and now considering 1373/1395 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 70/91 places, 1373/1395 transitions.
Finished random walk after 1352 steps, including 2 resets, run visited all 1 properties in 18 ms. (steps per millisecond=75 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 765 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1199 reset in 421 ms.
Product exploration explored 100000 steps with 2967 reset in 686 ms.
Built C files in :
/tmp/ltsmin16599537217646953825
[2023-03-11 08:53:45] [INFO ] Computing symmetric may disable matrix : 1395 transitions.
[2023-03-11 08:53:45] [INFO ] Computation of Complete disable matrix. took 469 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:53:45] [INFO ] Computing symmetric may enable matrix : 1395 transitions.
[2023-03-11 08:53:45] [INFO ] Computation of Complete enable matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:53:46] [INFO ] Computing Do-Not-Accords matrix : 1395 transitions.
[2023-03-11 08:53:46] [INFO ] Computation of Completed DNA matrix. took 86 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:53:46] [INFO ] Built C files in 1193ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16599537217646953825
Running compilation step : cd /tmp/ltsmin16599537217646953825;'/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/ltsmin16599537217646953825;'/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/ltsmin16599537217646953825;'/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 16 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 1395/1395 transitions.
Applied a total of 0 rules in 118 ms. Remains 91 /91 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
[2023-03-11 08:53:49] [INFO ] Invariant cache hit.
[2023-03-11 08:53:49] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-11 08:53:49] [INFO ] Invariant cache hit.
[2023-03-11 08:53:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:53:50] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
[2023-03-11 08:53:50] [INFO ] Redundant transitions in 82 ms returned []
[2023-03-11 08:53:50] [INFO ] Invariant cache hit.
[2023-03-11 08:53:51] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2023 ms. Remains : 91/91 places, 1395/1395 transitions.
Built C files in :
/tmp/ltsmin17037615836465602178
[2023-03-11 08:53:51] [INFO ] Computing symmetric may disable matrix : 1395 transitions.
[2023-03-11 08:53:51] [INFO ] Computation of Complete disable matrix. took 425 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:53:51] [INFO ] Computing symmetric may enable matrix : 1395 transitions.
[2023-03-11 08:53:51] [INFO ] Computation of Complete enable matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:53:52] [INFO ] Computing Do-Not-Accords matrix : 1395 transitions.
[2023-03-11 08:53:52] [INFO ] Computation of Completed DNA matrix. took 81 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:53:52] [INFO ] Built C files in 1117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17037615836465602178
Running compilation step : cd /tmp/ltsmin17037615836465602178;'/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/ltsmin17037615836465602178;'/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/ltsmin17037615836465602178;'/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:53:55] [INFO ] Flatten gal took : 182 ms
[2023-03-11 08:53:55] [INFO ] Flatten gal took : 193 ms
[2023-03-11 08:53:55] [INFO ] Time to serialize gal into /tmp/LTL13467056584849727076.gal : 20 ms
[2023-03-11 08:53:55] [INFO ] Time to serialize properties into /tmp/LTL10034118430300121733.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/LTL13467056584849727076.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13376788242647220103.hoa' '-atoms' '/tmp/LTL10034118430300121733.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/LTL10034118430300121733.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13376788242647220103.hoa
Detected timeout of ITS tools.
[2023-03-11 08:54:11] [INFO ] Flatten gal took : 274 ms
[2023-03-11 08:54:11] [INFO ] Flatten gal took : 182 ms
[2023-03-11 08:54:11] [INFO ] Time to serialize gal into /tmp/LTL15999279728581619991.gal : 19 ms
[2023-03-11 08:54:11] [INFO ] Time to serialize properties into /tmp/LTL7914934049515904178.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/LTL15999279728581619991.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7914934049515904178.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((G("(((((p68==0)||(p105==0))||((p136==0)||(p161==0)))||(((p198==0)||(p223==0))||((p254==0)||(p291==0))))||(((p316==0)||(p347==0))...320
Formula 0 simplified : G(F!"(((((p68==0)||(p105==0))||((p136==0)||(p161==0)))||(((p198==0)||(p223==0))||((p254==0)||(p291==0))))||(((p316==0)||(p347==0))||...312
Detected timeout of ITS tools.
[2023-03-11 08:54:26] [INFO ] Flatten gal took : 199 ms
[2023-03-11 08:54:26] [INFO ] Applying decomposition
[2023-03-11 08:54:27] [INFO ] Flatten gal took : 184 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/graph13363855051407585014.txt' '-o' '/tmp/graph13363855051407585014.bin' '-w' '/tmp/graph13363855051407585014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13363855051407585014.bin' '-l' '-1' '-v' '-w' '/tmp/graph13363855051407585014.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:54:27] [INFO ] Decomposing Gal with order
[2023-03-11 08:54:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:54:28] [INFO ] Removed a total of 11934 redundant transitions.
[2023-03-11 08:54:28] [INFO ] Flatten gal took : 254 ms
[2023-03-11 08:54:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 135 labels/synchronizations in 28 ms.
[2023-03-11 08:54:28] [INFO ] Time to serialize gal into /tmp/LTL80420307737198977.gal : 7 ms
[2023-03-11 08:54:28] [INFO ] Time to serialize properties into /tmp/LTL11280586987376512444.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL80420307737198977.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11280586987376512444.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...253
Read 1 LTL properties
Checking formula 0 : !((F((G("(((((i0.u0.p68==0)||(i0.u3.p105==0))||((i0.u5.p136==0)||(i0.u6.p161==0)))||(((i0.u9.p198==0)||(i0.u10.p223==0))||((i0.u12.p25...462
Formula 0 simplified : G(F!"(((((i0.u0.p68==0)||(i0.u3.p105==0))||((i0.u5.p136==0)||(i0.u6.p161==0)))||(((i0.u9.p198==0)||(i0.u10.p223==0))||((i0.u12.p254=...454
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1437471076318827354
[2023-03-11 08:54:43] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1437471076318827354
Running compilation step : cd /tmp/ltsmin1437471076318827354;'/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/ltsmin1437471076318827354;'/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/ltsmin1437471076318827354;'/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-10b-LTLFireability-07 finished in 74587 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((!p0 U G(p0)))&&F(p1))))'
Support contains 16 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 347 transition count 1774
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 347 transition count 1774
Applied a total of 4 rules in 39 ms. Remains 347 /349 variables (removed 2) and now considering 1774/1776 (removed 2) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2023-03-11 08:54:46] [INFO ] Computed 15 place invariants in 31 ms
[2023-03-11 08:54:46] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-11 08:54:46] [INFO ] Invariant cache hit.
[2023-03-11 08:54:47] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
[2023-03-11 08:54:47] [INFO ] Invariant cache hit.
[2023-03-11 08:54:48] [INFO ] Dead Transitions using invariants and state equation in 996 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/349 places, 1774/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2331 ms. Remains : 347/349 places, 1774/1776 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s62 1) (EQ s92 1) (EQ s117 1) (EQ s142 1) (EQ s162 1) (EQ s192 1) (EQ s212 1) (EQ s242 1) (EQ s267 1) (EQ s292 1) (EQ s314 1)), p0:(AND (EQ s6...], 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 121 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-09 finished in 2701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 11 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 347 transition count 1774
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 347 transition count 1774
Applied a total of 4 rules in 27 ms. Remains 347 /349 variables (removed 2) and now considering 1774/1776 (removed 2) transitions.
[2023-03-11 08:54:49] [INFO ] Invariant cache hit.
[2023-03-11 08:54:49] [INFO ] Implicit Places using invariants in 635 ms returned []
[2023-03-11 08:54:49] [INFO ] Invariant cache hit.
[2023-03-11 08:54:51] [INFO ] Implicit Places using invariants and state equation in 1372 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
[2023-03-11 08:54:51] [INFO ] Invariant cache hit.
[2023-03-11 08:54:51] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/349 places, 1774/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2738 ms. Remains : 347/349 places, 1774/1776 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s62 1) (EQ s92 1) (EQ s117 1) (EQ s137 1) (EQ s162 1) (EQ s187 1) (EQ s212 1) (EQ s237 1) (EQ s262 1) (EQ s292 1) (EQ s314 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-10 finished in 2838 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)))'
Support contains 4 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 347 transition count 1774
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 347 transition count 1774
Applied a total of 4 rules in 17 ms. Remains 347 /349 variables (removed 2) and now considering 1774/1776 (removed 2) transitions.
[2023-03-11 08:54:51] [INFO ] Invariant cache hit.
[2023-03-11 08:54:52] [INFO ] Implicit Places using invariants in 816 ms returned []
[2023-03-11 08:54:52] [INFO ] Invariant cache hit.
[2023-03-11 08:54:54] [INFO ] Implicit Places using invariants and state equation in 1886 ms returned []
Implicit Place search using SMT with State Equation took 2740 ms to find 0 implicit places.
[2023-03-11 08:54:54] [INFO ] Invariant cache hit.
[2023-03-11 08:54:55] [INFO ] Dead Transitions using invariants and state equation in 818 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/349 places, 1774/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3579 ms. Remains : 347/349 places, 1774/1776 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s4 1) (NEQ s16 1) (NEQ s61 1) (NEQ s313 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]]
Product exploration explored 100000 steps with 50000 reset in 410 ms.
Product exploration explored 100000 steps with 50000 reset in 385 ms.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10b-LTLFireability-13 finished in 4669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 15 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 347 transition count 1774
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 347 transition count 1774
Applied a total of 4 rules in 18 ms. Remains 347 /349 variables (removed 2) and now considering 1774/1776 (removed 2) transitions.
[2023-03-11 08:54:56] [INFO ] Invariant cache hit.
[2023-03-11 08:54:56] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-11 08:54:56] [INFO ] Invariant cache hit.
[2023-03-11 08:54:58] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
[2023-03-11 08:54:58] [INFO ] Invariant cache hit.
[2023-03-11 08:54:58] [INFO ] Dead Transitions using invariants and state equation in 902 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/349 places, 1774/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2477 ms. Remains : 347/349 places, 1774/1776 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s67 1) (EQ s92 1) (EQ s112 1) (EQ s137 1) (EQ s167 1) (EQ s187 1) (EQ s217 1) (EQ s242 1) (EQ s262 1) (EQ s292 1) (EQ s314 1)), p1:(AND (EQ s4...], 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 117 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-14 finished in 2630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U G(p0)))'
Support contains 4 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 347 transition count 1774
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 347 transition count 1774
Applied a total of 4 rules in 64 ms. Remains 347 /349 variables (removed 2) and now considering 1774/1776 (removed 2) transitions.
[2023-03-11 08:54:59] [INFO ] Invariant cache hit.
[2023-03-11 08:55:00] [INFO ] Implicit Places using invariants in 1086 ms returned []
[2023-03-11 08:55:00] [INFO ] Invariant cache hit.
[2023-03-11 08:55:01] [INFO ] Implicit Places using invariants and state equation in 1525 ms returned []
Implicit Place search using SMT with State Equation took 2639 ms to find 0 implicit places.
[2023-03-11 08:55:01] [INFO ] Invariant cache hit.
[2023-03-11 08:55:02] [INFO ] Dead Transitions using invariants and state equation in 784 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/349 places, 1774/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3510 ms. Remains : 347/349 places, 1774/1776 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s4 1) (EQ s6 1) (EQ s213 1) (EQ s313 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-15 finished in 3632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&(p1||G(p0))))||X(F(p2))))'
Found a Shortening insensitive property : AutonomousCar-PT-10b-LTLFireability-01
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 349 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 349/349 places, 1776/1776 transitions.
Graph (trivial) has 309 edges and 349 vertex of which 4 / 349 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 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 128 place count 346 transition count 1646
Reduce places removed 127 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 184 rules applied. Total rules applied 312 place count 219 transition count 1589
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 346 place count 185 transition count 1589
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 346 place count 185 transition count 1584
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 356 place count 180 transition count 1584
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 358 place count 178 transition count 1582
Iterating global reduction 3 with 2 rules applied. Total rules applied 360 place count 178 transition count 1582
Performed 68 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 496 place count 110 transition count 1513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 497 place count 110 transition count 1512
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 510 place count 97 transition count 1387
Iterating global reduction 4 with 13 rules applied. Total rules applied 523 place count 97 transition count 1387
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 531 place count 97 transition count 1379
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 535 place count 95 transition count 1377
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 537 place count 95 transition count 1377
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 539 place count 93 transition count 1375
Applied a total of 539 rules in 190 ms. Remains 93 /349 variables (removed 256) and now considering 1375/1776 (removed 401) transitions.
// Phase 1: matrix 1375 rows 93 cols
[2023-03-11 08:55:03] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-11 08:55:03] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-11 08:55:03] [INFO ] Invariant cache hit.
[2023-03-11 08:55:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:55:04] [INFO ] Implicit Places using invariants and state equation in 889 ms returned [88, 92]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1329 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 91/349 places, 1375/1776 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 90 transition count 1374
Applied a total of 2 rules in 42 ms. Remains 90 /91 variables (removed 1) and now considering 1374/1375 (removed 1) transitions.
// Phase 1: matrix 1374 rows 90 cols
[2023-03-11 08:55:04] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-11 08:55:04] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-11 08:55:05] [INFO ] Invariant cache hit.
[2023-03-11 08:55:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:55:05] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 90/349 places, 1374/1776 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2840 ms. Remains : 90/349 places, 1374/1776 transitions.
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(AND (EQ s1 1) (EQ s4 1) (EQ s69 1) (EQ s85 1)), p0:(OR (EQ s1 0) (EQ s10 0) (EQ s48 0) (EQ s85 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1201 reset in 329 ms.
Product exploration explored 100000 steps with 269 reset in 125 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 p2) p0), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 463 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 357 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 445733 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 445733 steps, saw 71780 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 08:55:10] [INFO ] Invariant cache hit.
[2023-03-11 08:55:10] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-11 08:55:10] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 08:55:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-11 08:55:10] [INFO ] After 505ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 08:55:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:55:11] [INFO ] After 74ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 08:55:11] [INFO ] Deduced a trap composed of 7 places in 575 ms of which 0 ms to minimize.
[2023-03-11 08:55:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 635 ms
[2023-03-11 08:55:11] [INFO ] After 863ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 130 ms.
[2023-03-11 08:55:11] [INFO ] After 1579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 1374/1374 transitions.
Graph (complete) has 1150 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 1371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 89 transition count 1370
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 88 transition count 1370
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 17 place count 82 transition count 1364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 76 transition count 1298
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 76 transition count 1298
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 72 transition count 1294
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 72 transition count 1282
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 61 place count 60 transition count 1282
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 60 transition count 1283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 59 transition count 1283
Applied a total of 63 rules in 299 ms. Remains 59 /90 variables (removed 31) and now considering 1283/1374 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 300 ms. Remains : 59/90 places, 1283/1374 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 3) seen :2
Finished Best-First random walk after 1503 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=501 )
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F p2), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 545 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 90 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 1374/1374 transitions.
Applied a total of 0 rules in 11 ms. Remains 90 /90 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
[2023-03-11 08:55:13] [INFO ] Invariant cache hit.
[2023-03-11 08:55:14] [INFO ] Implicit Places using invariants in 765 ms returned []
[2023-03-11 08:55:14] [INFO ] Invariant cache hit.
[2023-03-11 08:55:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:55:14] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1642 ms to find 0 implicit places.
[2023-03-11 08:55:14] [INFO ] Invariant cache hit.
[2023-03-11 08:55:15] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2207 ms. Remains : 90/90 places, 1374/1374 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 : [(AND (NOT p2) p0), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 228 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 364 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 416282 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{}
Probabilistic random walk after 416282 steps, saw 66851 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 08:55:19] [INFO ] Invariant cache hit.
[2023-03-11 08:55:19] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-11 08:55:19] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 08:55:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-11 08:55:19] [INFO ] After 504ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 08:55:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:55:20] [INFO ] After 110ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 08:55:20] [INFO ] Deduced a trap composed of 7 places in 630 ms of which 0 ms to minimize.
[2023-03-11 08:55:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 682 ms
[2023-03-11 08:55:20] [INFO ] After 929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-11 08:55:21] [INFO ] After 1624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 1374/1374 transitions.
Graph (complete) has 1150 edges and 90 vertex of which 89 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 89 transition count 1371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 89 transition count 1370
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 88 transition count 1370
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 17 place count 82 transition count 1364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 76 transition count 1298
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 76 transition count 1298
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 72 transition count 1294
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 72 transition count 1282
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 61 place count 60 transition count 1282
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 60 transition count 1283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 59 transition count 1283
Applied a total of 63 rules in 238 ms. Remains 59 /90 variables (removed 31) and now considering 1283/1374 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 59/90 places, 1283/1374 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 3) seen :2
Finished Best-First random walk after 1555 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=518 )
Knowledge obtained : [(AND (NOT p2) p0), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F p2), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 6 factoid took 310 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 197 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 2298 reset in 588 ms.
Product exploration explored 100000 steps with 918 reset in 253 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 1374/1374 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 90 transition count 1374
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 12 place count 84 transition count 1308
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 84 transition count 1308
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 18 rules in 122 ms. Remains 84 /90 variables (removed 6) and now considering 1308/1374 (removed 66) transitions.
[2023-03-11 08:55:23] [INFO ] Redundant transitions in 38 ms returned [1083]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1307 rows 84 cols
[2023-03-11 08:55:23] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-11 08:55:24] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/90 places, 1307/1374 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 84 transition count 1309
Deduced a syphon composed of 7 places in 1 ms
Applied a total of 1 rules in 70 ms. Remains 84 /84 variables (removed 0) and now considering 1309/1307 (removed -2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/90 places, 1309/1374 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 727 ms. Remains : 84/90 places, 1309/1374 transitions.
Built C files in :
/tmp/ltsmin15976138723898125760
[2023-03-11 08:55:24] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15976138723898125760
Running compilation step : cd /tmp/ltsmin15976138723898125760;'/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/ltsmin15976138723898125760;'/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/ltsmin15976138723898125760;'/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 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 1374/1374 transitions.
Applied a total of 0 rules in 16 ms. Remains 90 /90 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
// Phase 1: matrix 1374 rows 90 cols
[2023-03-11 08:55:27] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-11 08:55:28] [INFO ] Implicit Places using invariants in 840 ms returned []
[2023-03-11 08:55:28] [INFO ] Invariant cache hit.
[2023-03-11 08:55:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:55:29] [INFO ] Implicit Places using invariants and state equation in 1423 ms returned []
Implicit Place search using SMT with State Equation took 2266 ms to find 0 implicit places.
[2023-03-11 08:55:29] [INFO ] Invariant cache hit.
[2023-03-11 08:55:30] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2712 ms. Remains : 90/90 places, 1374/1374 transitions.
Built C files in :
/tmp/ltsmin2677527400445252047
[2023-03-11 08:55:30] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2677527400445252047
Running compilation step : cd /tmp/ltsmin2677527400445252047;'/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/ltsmin2677527400445252047;'/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/ltsmin2677527400445252047;'/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:55:33] [INFO ] Flatten gal took : 197 ms
[2023-03-11 08:55:33] [INFO ] Flatten gal took : 189 ms
[2023-03-11 08:55:33] [INFO ] Time to serialize gal into /tmp/LTL5239589457074498959.gal : 20 ms
[2023-03-11 08:55:33] [INFO ] Time to serialize properties into /tmp/LTL12294185164542229150.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/LTL5239589457074498959.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4029411676052053452.hoa' '-atoms' '/tmp/LTL12294185164542229150.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/LTL12294185164542229150.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4029411676052053452.hoa
Detected timeout of ITS tools.
[2023-03-11 08:55:49] [INFO ] Flatten gal took : 295 ms
[2023-03-11 08:55:49] [INFO ] Flatten gal took : 212 ms
[2023-03-11 08:55:49] [INFO ] Time to serialize gal into /tmp/LTL15643829588490942987.gal : 22 ms
[2023-03-11 08:55:49] [INFO ] Time to serialize properties into /tmp/LTL9737496411497612013.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/LTL15643829588490942987.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9737496411497612013.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 : !(((G(("(((p6==0)||(p20==0))||((p218==0)||(p382==0)))")&&(("(((((p68==1)&&(p99==1))&&((p136==1)&&(p161==1)))&&(((p192==1)&&(p223==1))&...336
Formula 0 simplified : F(!"(((p6==0)||(p20==0))||((p218==0)||(p382==0)))" | (!"(((((p68==1)&&(p99==1))&&((p136==1)&&(p161==1)))&&(((p192==1)&&(p223==1))&&(...324
Detected timeout of ITS tools.
[2023-03-11 08:56:04] [INFO ] Flatten gal took : 187 ms
[2023-03-11 08:56:04] [INFO ] Applying decomposition
[2023-03-11 08:56:04] [INFO ] Flatten gal took : 192 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/graph8611754507695363942.txt' '-o' '/tmp/graph8611754507695363942.bin' '-w' '/tmp/graph8611754507695363942.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8611754507695363942.bin' '-l' '-1' '-v' '-w' '/tmp/graph8611754507695363942.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:56:05] [INFO ] Decomposing Gal with order
[2023-03-11 08:56:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:56:05] [INFO ] Removed a total of 12102 redundant transitions.
[2023-03-11 08:56:05] [INFO ] Flatten gal took : 290 ms
[2023-03-11 08:56:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 32 ms.
[2023-03-11 08:56:05] [INFO ] Time to serialize gal into /tmp/LTL4327721277508786481.gal : 4 ms
[2023-03-11 08:56:06] [INFO ] Time to serialize properties into /tmp/LTL7108569761063345166.ltl : 350 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/LTL4327721277508786481.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7108569761063345166.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(("(((u0.p6==0)||(u0.p20==0))||((u12.p218==0)||(u0.p382==0)))")&&(("(((((i3.u1.p68==1)&&(i3.u3.p99==1))&&((i3.u6.p136==1)&&(i3.u7...446
Formula 0 simplified : F(!"(((u0.p6==0)||(u0.p20==0))||((u12.p218==0)||(u0.p382==0)))" | (!"(((((i3.u1.p68==1)&&(i3.u3.p99==1))&&((i3.u6.p136==1)&&(i3.u7.p...434
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2792348731598567700
[2023-03-11 08:56:21] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2792348731598567700
Running compilation step : cd /tmp/ltsmin2792348731598567700;'/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/ltsmin2792348731598567700;'/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/ltsmin2792348731598567700;'/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-10b-LTLFireability-01 finished in 81665 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)))'
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)||G(p1))))'
[2023-03-11 08:56:24] [INFO ] Flatten gal took : 150 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14208279579759212316
[2023-03-11 08:56:25] [INFO ] Too many transitions (1776) to apply POR reductions. Disabling POR matrices.
[2023-03-11 08:56:25] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14208279579759212316
Running compilation step : cd /tmp/ltsmin14208279579759212316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' '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:56:25] [INFO ] Applying decomposition
[2023-03-11 08:56:25] [INFO ] Flatten gal took : 151 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/graph803719936284542282.txt' '-o' '/tmp/graph803719936284542282.bin' '-w' '/tmp/graph803719936284542282.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph803719936284542282.bin' '-l' '-1' '-v' '-w' '/tmp/graph803719936284542282.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:56:26] [INFO ] Decomposing Gal with order
[2023-03-11 08:56:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:56:26] [INFO ] Removed a total of 12081 redundant transitions.
[2023-03-11 08:56:26] [INFO ] Flatten gal took : 303 ms
[2023-03-11 08:56:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 36 ms.
[2023-03-11 08:56:27] [INFO ] Time to serialize gal into /tmp/LTLFireability1518290970795946529.gal : 17 ms
[2023-03-11 08:56:27] [INFO ] Time to serialize properties into /tmp/LTLFireability12451623190543459269.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/LTLFireability1518290970795946529.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12451623190543459269.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 3 LTL properties
Checking formula 0 : !(((G(("(((i2.i1.u2.p6==0)||(i2.i1.u2.p20==0))||((i2.i1.u2.p218==0)||(i2.i1.u2.p382==0)))")&&(("(((((i9.u18.p68==1)&&(i9.u26.p99==1))&...521
Formula 0 simplified : F(!"(((i2.i1.u2.p6==0)||(i2.i1.u2.p20==0))||((i2.i1.u2.p218==0)||(i2.i1.u2.p382==0)))" | (!"(((((i9.u18.p68==1)&&(i9.u26.p99==1))&&(...509
Compilation finished in 7219 ms.
Running link step : cd /tmp/ltsmin14208279579759212316;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin14208279579759212316;'/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)||[]((LTLAPp0==true)))))||X(<>((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin14208279579759212316;'/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)||[]((LTLAPp0==true)))))||X(<>((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14208279579759212316;'/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:18:48] [INFO ] Applying decomposition
[2023-03-11 09:18:48] [INFO ] Flatten gal took : 375 ms
[2023-03-11 09:18:49] [INFO ] Decomposing Gal with order
[2023-03-11 09:18:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 09:18:49] [INFO ] Removed a total of 12796 redundant transitions.
[2023-03-11 09:18:50] [INFO ] Flatten gal took : 744 ms
[2023-03-11 09:18:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 492 labels/synchronizations in 116 ms.
[2023-03-11 09:18:50] [INFO ] Time to serialize gal into /tmp/LTLFireability12973500583420433864.gal : 15 ms
[2023-03-11 09:18:50] [INFO ] Time to serialize properties into /tmp/LTLFireability2762972345678706451.ltl : 2 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/LTLFireability12973500583420433864.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2762972345678706451.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 3 LTL properties
Checking formula 0 : !(((G(("(((i0.u2.p6==0)||(i0.u3.p20==0))||((i1.i0.i0.i0.i0.i0.i0.u20.p218==0)||(i1.i0.u25.p382==0)))")&&(("(((((i1.i0.i0.i0.i0.i0.i0.i...740
Formula 0 simplified : F(!"(((i0.u2.p6==0)||(i0.u3.p20==0))||((i1.i0.i0.i0.i0.i0.i0.u20.p218==0)||(i1.i0.u25.p382==0)))" | (!"(((((i1.i0.i0.i0.i0.i0.i0.i0....728
Reverse transition relation is NOT exact ! Due to transitions t394, t604, t664, i0.u2.t332, i0.u3.t330, i1.t1773, i1.i0.u25.t33, i1.i0.u25.t36, i1.i0.u25.t...2293
Computing Next relation with stutter on 3.45702e+07 deadlock states
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin14208279579759212316;'/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'
Running LTSmin : cd /tmp/ltsmin14208279579759212316;'/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' '<>(([]((LTLAPp4==true))||[]((LTLAPp5==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 09:41:11] [INFO ] Flatten gal took : 419 ms
[2023-03-11 09:41:11] [INFO ] Input system was already deterministic with 1776 transitions.
[2023-03-11 09:41:11] [INFO ] Transformed 349 places.
[2023-03-11 09:41:11] [INFO ] Transformed 1776 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:41:12] [INFO ] Time to serialize gal into /tmp/LTLFireability7751510242276756314.gal : 58 ms
[2023-03-11 09:41:12] [INFO ] Time to serialize properties into /tmp/LTLFireability12833558488248683373.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/LTLFireability7751510242276756314.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12833558488248683373.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 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G(("(((p6==0)||(p20==0))||((p218==0)||(p382==0)))")&&(("(((((p68==1)&&(p99==1))&&((p136==1)&&(p161==1)))&&(((p192==1)&&(p223==1))&...336
Formula 0 simplified : F(!"(((p6==0)||(p20==0))||((p218==0)||(p382==0)))" | (!"(((((p68==1)&&(p99==1))&&((p136==1)&&(p161==1)))&&(((p192==1)&&(p223==1))&&(...324
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 10766484 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16018696 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-10b"
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-10b, 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-167813593500684"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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