Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180400218.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is AutonomousCar-PT-09a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180400218
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 781K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716316473410

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 18:34:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 18:34:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:34:36] [INFO ] Load time of PNML (sax parser for PT used): 308 ms
[2024-05-21 18:34:36] [INFO ] Transformed 89 places.
[2024-05-21 18:34:36] [INFO ] Transformed 1249 transitions.
[2024-05-21 18:34:36] [INFO ] Found NUPN structural information;
[2024-05-21 18:34:36] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 498 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 345 transitions
Reduce redundant transitions removed 345 transitions.
FORMULA AutonomousCar-PT-09a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 904/904 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 863
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 863
Applied a total of 10 rules in 77 ms. Remains 84 /89 variables (removed 5) and now considering 863/904 (removed 41) transitions.
// Phase 1: matrix 863 rows 84 cols
[2024-05-21 18:34:37] [INFO ] Computed 13 invariants in 35 ms
[2024-05-21 18:34:37] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-21 18:34:37] [INFO ] Invariant cache hit.
[2024-05-21 18:34:37] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-21 18:34:37] [INFO ] Implicit Places using invariants and state equation in 524 ms returned [80, 82]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 971 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/89 places, 863/904 transitions.
Applied a total of 0 rules in 17 ms. Remains 82 /82 variables (removed 0) and now considering 863/863 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1066 ms. Remains : 82/89 places, 863/904 transitions.
Support contains 39 out of 82 places after structural reductions.
[2024-05-21 18:34:38] [INFO ] Flatten gal took : 296 ms
[2024-05-21 18:34:38] [INFO ] Flatten gal took : 181 ms
[2024-05-21 18:34:38] [INFO ] Input system was already deterministic with 863 transitions.
Incomplete random walk after 10000 steps, including 499 resets, run finished after 830 ms. (steps per millisecond=12 ) properties (out of 19) seen :6
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 863 rows 82 cols
[2024-05-21 18:34:40] [INFO ] Computed 11 invariants in 15 ms
[2024-05-21 18:34:40] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 18:34:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 18:34:41] [INFO ] After 913ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-21 18:34:41] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-21 18:34:42] [INFO ] After 568ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-21 18:34:42] [INFO ] After 1240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 542 ms.
[2024-05-21 18:34:43] [INFO ] After 2792ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 174 ms.
Support contains 20 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 863/863 transitions.
Graph (complete) has 990 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.26 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 81 transition count 852
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 74 transition count 851
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 73 transition count 851
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 20 place count 73 transition count 848
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 70 transition count 848
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 30 place count 66 transition count 817
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 66 transition count 817
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 65 transition count 816
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 44 place count 65 transition count 808
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 71 rules applied. Total rules applied 115 place count 57 transition count 745
Applied a total of 115 rules in 296 ms. Remains 57 /82 variables (removed 25) and now considering 745/863 (removed 118) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 57/82 places, 745/863 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 745 rows 57 cols
[2024-05-21 18:34:44] [INFO ] Computed 13 invariants in 7 ms
[2024-05-21 18:34:44] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 18:34:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-21 18:34:45] [INFO ] After 675ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 18:34:45] [INFO ] State equation strengthened by 199 read => feed constraints.
[2024-05-21 18:34:45] [INFO ] After 398ms SMT Verify possible using 199 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-21 18:34:46] [INFO ] After 847ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 486 ms.
[2024-05-21 18:34:46] [INFO ] After 2066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 54 ms.
Support contains 10 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 745/745 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 55 transition count 743
Applied a total of 4 rules in 76 ms. Remains 55 /57 variables (removed 2) and now considering 743/745 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 55/57 places, 743/745 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 562013 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 562013 steps, saw 76971 distinct states, run finished after 3002 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 743 rows 55 cols
[2024-05-21 18:34:50] [INFO ] Computed 13 invariants in 9 ms
[2024-05-21 18:34:50] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 18:34:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 18:34:51] [INFO ] After 630ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 18:34:51] [INFO ] State equation strengthened by 199 read => feed constraints.
[2024-05-21 18:34:51] [INFO ] After 381ms SMT Verify possible using 199 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-21 18:34:52] [INFO ] After 820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 371 ms.
[2024-05-21 18:34:52] [INFO ] After 1882ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 103 ms.
Support contains 10 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 743/743 transitions.
Applied a total of 0 rules in 71 ms. Remains 55 /55 variables (removed 0) and now considering 743/743 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 55/55 places, 743/743 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 743/743 transitions.
Applied a total of 0 rules in 70 ms. Remains 55 /55 variables (removed 0) and now considering 743/743 (removed 0) transitions.
[2024-05-21 18:34:52] [INFO ] Invariant cache hit.
[2024-05-21 18:34:53] [INFO ] Implicit Places using invariants in 320 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 324 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 54/55 places, 743/743 transitions.
Applied a total of 0 rules in 69 ms. Remains 54 /54 variables (removed 0) and now considering 743/743 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 464 ms. Remains : 54/55 places, 743/743 transitions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 575939 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :{}
Probabilistic random walk after 575939 steps, saw 78362 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 743 rows 54 cols
[2024-05-21 18:34:56] [INFO ] Computed 12 invariants in 10 ms
[2024-05-21 18:34:56] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 18:34:56] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-21 18:34:57] [INFO ] After 592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 18:34:57] [INFO ] State equation strengthened by 199 read => feed constraints.
[2024-05-21 18:34:57] [INFO ] After 361ms SMT Verify possible using 199 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-21 18:34:58] [INFO ] After 788ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 344 ms.
[2024-05-21 18:34:58] [INFO ] After 1772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 105 ms.
Support contains 10 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 743/743 transitions.
Applied a total of 0 rules in 44 ms. Remains 54 /54 variables (removed 0) and now considering 743/743 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 54/54 places, 743/743 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 743/743 transitions.
Applied a total of 0 rules in 45 ms. Remains 54 /54 variables (removed 0) and now considering 743/743 (removed 0) transitions.
[2024-05-21 18:34:58] [INFO ] Invariant cache hit.
[2024-05-21 18:34:59] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-21 18:34:59] [INFO ] Invariant cache hit.
[2024-05-21 18:34:59] [INFO ] State equation strengthened by 199 read => feed constraints.
[2024-05-21 18:34:59] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
[2024-05-21 18:34:59] [INFO ] Redundant transitions in 56 ms returned []
[2024-05-21 18:34:59] [INFO ] Invariant cache hit.
[2024-05-21 18:35:00] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1630 ms. Remains : 54/54 places, 743/743 transitions.
Applied a total of 0 rules in 42 ms. Remains 54 /54 variables (removed 0) and now considering 743/743 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-21 18:35:00] [INFO ] Invariant cache hit.
[2024-05-21 18:35:00] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 18:35:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 18:35:01] [INFO ] After 583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 18:35:01] [INFO ] After 987ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 339 ms.
[2024-05-21 18:35:01] [INFO ] After 1377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 82 transition count 854
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 73 transition count 854
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 73 transition count 852
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 71 transition count 852
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 66 transition count 802
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 66 transition count 802
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 65 transition count 801
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 64 transition count 801
Applied a total of 36 rules in 316 ms. Remains 64 /82 variables (removed 18) and now considering 801/863 (removed 62) transitions.
// Phase 1: matrix 801 rows 64 cols
[2024-05-21 18:35:02] [INFO ] Computed 11 invariants in 11 ms
[2024-05-21 18:35:02] [INFO ] Implicit Places using invariants in 331 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 340 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/82 places, 801/863 transitions.
Applied a total of 0 rules in 119 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 776 ms. Remains : 63/82 places, 801/863 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 195 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-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:(OR (EQ s15 0) (EQ s18 0) (EQ s25 0) (EQ s28 0) (EQ s35 0) (EQ s38 0) (EQ s45 0) (EQ s48 0) (EQ s53 0) (EQ s60 0))], 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 767 reset in 446 ms.
Product exploration explored 100000 steps with 581 reset in 279 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 89 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 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 616 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Finished Best-First random walk after 8831 steps, including 35 resets, run visited all 1 properties in 17 ms. (steps per millisecond=519 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 10 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 801/801 transitions.
Applied a total of 0 rules in 50 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
// Phase 1: matrix 801 rows 63 cols
[2024-05-21 18:35:04] [INFO ] Computed 10 invariants in 4 ms
[2024-05-21 18:35:04] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-21 18:35:04] [INFO ] Invariant cache hit.
[2024-05-21 18:35:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 18:35:05] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2024-05-21 18:35:05] [INFO ] Redundant transitions in 175 ms returned []
[2024-05-21 18:35:05] [INFO ] Invariant cache hit.
[2024-05-21 18:35:06] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1628 ms. Remains : 63/63 places, 801/801 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 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 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 593 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 917273 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :{}
Probabilistic random walk after 917273 steps, saw 115097 distinct states, run finished after 3001 ms. (steps per millisecond=305 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 18:35:09] [INFO ] Invariant cache hit.
[2024-05-21 18:35:09] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 18:35:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-21 18:35:09] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 18:35:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 18:35:09] [INFO ] After 107ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 18:35:10] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2024-05-21 18:35:10] [INFO ] After 718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 10 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 801/801 transitions.
Graph (complete) has 893 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 62 transition count 798
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 61 transition count 796
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 61 transition count 796
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 14 place count 61 transition count 787
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 104 place count 52 transition count 706
Applied a total of 104 rules in 96 ms. Remains 52 /63 variables (removed 11) and now considering 706/801 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 52/63 places, 706/801 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Finished Best-First random walk after 494 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=247 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 173 reset in 109 ms.
Product exploration explored 100000 steps with 326 reset in 365 ms.
Built C files in :
/tmp/ltsmin18273351575436874035
[2024-05-21 18:35:11] [INFO ] Computing symmetric may disable matrix : 801 transitions.
[2024-05-21 18:35:11] [INFO ] Computation of Complete disable matrix. took 114 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:35:11] [INFO ] Computing symmetric may enable matrix : 801 transitions.
[2024-05-21 18:35:11] [INFO ] Computation of Complete enable matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:35:11] [INFO ] Computing Do-Not-Accords matrix : 801 transitions.
[2024-05-21 18:35:11] [INFO ] Computation of Completed DNA matrix. took 53 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:35:11] [INFO ] Built C files in 481ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18273351575436874035
Running compilation step : cd /tmp/ltsmin18273351575436874035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin18273351575436874035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18273351575436874035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 10 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 801/801 transitions.
Applied a total of 0 rules in 49 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2024-05-21 18:35:14] [INFO ] Invariant cache hit.
[2024-05-21 18:35:14] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-21 18:35:14] [INFO ] Invariant cache hit.
[2024-05-21 18:35:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 18:35:15] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2024-05-21 18:35:15] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-21 18:35:15] [INFO ] Invariant cache hit.
[2024-05-21 18:35:15] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1161 ms. Remains : 63/63 places, 801/801 transitions.
Built C files in :
/tmp/ltsmin4504447605146757349
[2024-05-21 18:35:15] [INFO ] Computing symmetric may disable matrix : 801 transitions.
[2024-05-21 18:35:15] [INFO ] Computation of Complete disable matrix. took 88 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:35:16] [INFO ] Computing symmetric may enable matrix : 801 transitions.
[2024-05-21 18:35:16] [INFO ] Computation of Complete enable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:35:16] [INFO ] Computing Do-Not-Accords matrix : 801 transitions.
[2024-05-21 18:35:16] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:35:16] [INFO ] Built C files in 374ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4504447605146757349
Running compilation step : cd /tmp/ltsmin4504447605146757349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin4504447605146757349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4504447605146757349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-21 18:35:19] [INFO ] Flatten gal took : 208 ms
[2024-05-21 18:35:19] [INFO ] Flatten gal took : 201 ms
[2024-05-21 18:35:20] [INFO ] Time to serialize gal into /tmp/LTL17207982103951671135.gal : 24 ms
[2024-05-21 18:35:20] [INFO ] Time to serialize properties into /tmp/LTL706897326050428803.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17207982103951671135.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5784253779010546376.hoa' '-atoms' '/tmp/LTL706897326050428803.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL706897326050428803.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5784253779010546376.hoa
Detected timeout of ITS tools.
[2024-05-21 18:35:35] [INFO ] Flatten gal took : 124 ms
[2024-05-21 18:35:35] [INFO ] Flatten gal took : 143 ms
[2024-05-21 18:35:35] [INFO ] Time to serialize gal into /tmp/LTL879801082900663833.gal : 34 ms
[2024-05-21 18:35:35] [INFO ] Time to serialize properties into /tmp/LTL756408103483805632.ltl : 123 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL879801082900663833.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL756408103483805632.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...273
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((p19==0)||(p23==0))||((p33==0)||(p37==0)))||(((p47==0)||(p51==0))||((p61==0)||(p65==0))))||((p72==0)||(p82==0)))"))))
Formula 0 simplified : GF!"(((((p19==0)||(p23==0))||((p33==0)||(p37==0)))||(((p47==0)||(p51==0))||((p61==0)||(p65==0))))||((p72==0)||(p82==0)))"
Detected timeout of ITS tools.
[2024-05-21 18:35:50] [INFO ] Flatten gal took : 130 ms
[2024-05-21 18:35:50] [INFO ] Applying decomposition
[2024-05-21 18:35:50] [INFO ] Flatten gal took : 116 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3945631467427024330.txt' '-o' '/tmp/graph3945631467427024330.bin' '-w' '/tmp/graph3945631467427024330.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3945631467427024330.bin' '-l' '-1' '-v' '-w' '/tmp/graph3945631467427024330.weights' '-q' '0' '-e' '0.001'
[2024-05-21 18:35:51] [INFO ] Decomposing Gal with order
[2024-05-21 18:35:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 18:35:51] [INFO ] Removed a total of 5811 redundant transitions.
[2024-05-21 18:35:51] [INFO ] Flatten gal took : 370 ms
[2024-05-21 18:35:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 79 ms.
[2024-05-21 18:35:52] [INFO ] Time to serialize gal into /tmp/LTL17541271398222329297.gal : 13 ms
[2024-05-21 18:35:52] [INFO ] Time to serialize properties into /tmp/LTL3672924925189690064.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17541271398222329297.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3672924925189690064.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((u1.p19==0)||(i0.u2.p23==0))||((u5.p33==0)||(i0.u6.p37==0)))||(((u9.p47==0)||(i0.u10.p51==0))||((u13.p61==0)||(i0.u14.p65=...202
Formula 0 simplified : GF!"(((((u1.p19==0)||(i0.u2.p23==0))||((u5.p33==0)||(i0.u6.p37==0)))||(((u9.p47==0)||(i0.u10.p51==0))||((u13.p61==0)||(i0.u14.p65==0...196
Reverse transition relation is NOT exact ! Due to transitions t339, t340, t341, t342, t343, t344, t345, t346, t347, t348, t349, t350, t351, t352, t353, t35...1937
Computing Next relation with stutter on 393130 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15041322796970994478
[2024-05-21 18:36:07] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15041322796970994478
Running compilation step : cd /tmp/ltsmin15041322796970994478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin15041322796970994478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15041322796970994478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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-09a-LTLFireability-00 finished in 68093 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((G(p1)||X(G(p2))))||p0))))'
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 78 transition count 823
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 78 transition count 823
Applied a total of 8 rules in 10 ms. Remains 78 /82 variables (removed 4) and now considering 823/863 (removed 40) transitions.
// Phase 1: matrix 823 rows 78 cols
[2024-05-21 18:36:10] [INFO ] Computed 11 invariants in 6 ms
[2024-05-21 18:36:10] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-21 18:36:10] [INFO ] Invariant cache hit.
[2024-05-21 18:36:10] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-21 18:36:11] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
[2024-05-21 18:36:11] [INFO ] Invariant cache hit.
[2024-05-21 18:36:11] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/82 places, 823/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1497 ms. Remains : 78/82 places, 823/863 transitions.
Stuttering acceptance computed with spot in 284 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(OR (EQ s1 0) (EQ s6 0) (EQ s23 0) (EQ s73 0)), p0:(OR (EQ s1 0) (EQ s6 0) (EQ s23 0) (EQ s73 0)), p2:(OR (EQ s1 0) (EQ s12 0) (EQ s21 0) (EQ s73 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 459 reset in 323 ms.
Product exploration explored 100000 steps with 567 reset in 229 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 479 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-21 18:36:13] [INFO ] Invariant cache hit.
[2024-05-21 18:36:13] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 18:36:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-21 18:36:14] [INFO ] After 564ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-21 18:36:14] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-21 18:36:14] [INFO ] After 310ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-21 18:36:14] [INFO ] After 633ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 361 ms.
[2024-05-21 18:36:15] [INFO ] After 1622ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 246 ms.
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 823/823 transitions.
Graph (complete) has 946 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 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 77 transition count 808
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 66 transition count 808
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 66 transition count 807
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 65 transition count 807
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 64 transition count 806
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 64 transition count 806
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 61 transition count 803
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 61 transition count 794
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 135 place count 52 transition count 713
Applied a total of 135 rules in 127 ms. Remains 52 /78 variables (removed 26) and now considering 713/823 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 52/78 places, 713/823 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 591295 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :{}
Probabilistic random walk after 591295 steps, saw 72915 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 713 rows 52 cols
[2024-05-21 18:36:18] [INFO ] Computed 13 invariants in 9 ms
[2024-05-21 18:36:19] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 18:36:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-21 18:36:19] [INFO ] After 444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 18:36:19] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 18:36:19] [INFO ] After 249ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 18:36:20] [INFO ] After 531ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 242 ms.
[2024-05-21 18:36:20] [INFO ] After 1291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 40 ms.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 35 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 52/52 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 40 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2024-05-21 18:36:20] [INFO ] Invariant cache hit.
[2024-05-21 18:36:20] [INFO ] Implicit Places using invariants in 326 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 327 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/52 places, 713/713 transitions.
Applied a total of 0 rules in 39 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 406 ms. Remains : 51/52 places, 713/713 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 507775 steps, run timeout after 3003 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 507775 steps, saw 63128 distinct states, run finished after 3004 ms. (steps per millisecond=169 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 713 rows 51 cols
[2024-05-21 18:36:24] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 18:36:24] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 18:36:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-21 18:36:24] [INFO ] After 493ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 18:36:24] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 18:36:25] [INFO ] After 294ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 18:36:25] [INFO ] After 612ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 268 ms.
[2024-05-21 18:36:25] [INFO ] After 1422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 39 ms.
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 39 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 51/51 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 37 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2024-05-21 18:36:25] [INFO ] Invariant cache hit.
[2024-05-21 18:36:26] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-21 18:36:26] [INFO ] Invariant cache hit.
[2024-05-21 18:36:26] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 18:36:26] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
[2024-05-21 18:36:26] [INFO ] Redundant transitions in 43 ms returned []
[2024-05-21 18:36:26] [INFO ] Invariant cache hit.
[2024-05-21 18:36:27] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1606 ms. Remains : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 35 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-05-21 18:36:27] [INFO ] Invariant cache hit.
[2024-05-21 18:36:27] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 18:36:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-21 18:36:28] [INFO ] After 476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 18:36:28] [INFO ] After 766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 238 ms.
[2024-05-21 18:36:28] [INFO ] After 1044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p0)), (X (X p1)), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT (AND p2 p1))), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 823/823 (removed 0) transitions.
// Phase 1: matrix 823 rows 78 cols
[2024-05-21 18:36:29] [INFO ] Computed 11 invariants in 6 ms
[2024-05-21 18:36:29] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-21 18:36:29] [INFO ] Invariant cache hit.
[2024-05-21 18:36:29] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-21 18:36:30] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
[2024-05-21 18:36:30] [INFO ] Invariant cache hit.
[2024-05-21 18:36:30] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1456 ms. Remains : 78/78 places, 823/823 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 498 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 18:36:31] [INFO ] Invariant cache hit.
[2024-05-21 18:36:31] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 18:36:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 18:36:32] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 18:36:32] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-21 18:36:32] [INFO ] After 210ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 18:36:32] [INFO ] After 469ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 222 ms.
[2024-05-21 18:36:32] [INFO ] After 1196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 66 ms.
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 823/823 transitions.
Graph (complete) has 946 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 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 77 transition count 808
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 66 transition count 808
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 66 transition count 807
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 65 transition count 807
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 64 transition count 806
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 64 transition count 806
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 61 transition count 803
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 61 transition count 794
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 135 place count 52 transition count 713
Applied a total of 135 rules in 122 ms. Remains 52 /78 variables (removed 26) and now considering 713/823 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 52/78 places, 713/823 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 627204 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 627204 steps, saw 76971 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 713 rows 52 cols
[2024-05-21 18:36:36] [INFO ] Computed 13 invariants in 4 ms
[2024-05-21 18:36:36] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 18:36:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-21 18:36:36] [INFO ] After 398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 18:36:36] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 18:36:37] [INFO ] After 190ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 18:36:37] [INFO ] After 396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 180 ms.
[2024-05-21 18:36:37] [INFO ] After 1019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 25 ms.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 37 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 52/52 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 36 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2024-05-21 18:36:37] [INFO ] Invariant cache hit.
[2024-05-21 18:36:37] [INFO ] Implicit Places using invariants in 316 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 319 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/52 places, 713/713 transitions.
Applied a total of 0 rules in 36 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 394 ms. Remains : 51/52 places, 713/713 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 633614 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 633614 steps, saw 77502 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 713 rows 51 cols
[2024-05-21 18:36:41] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 18:36:41] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 18:36:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-21 18:36:41] [INFO ] After 406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 18:36:41] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 18:36:42] [INFO ] After 195ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 18:36:42] [INFO ] After 404ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 178 ms.
[2024-05-21 18:36:42] [INFO ] After 1029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 36 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 51/51 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 36 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2024-05-21 18:36:42] [INFO ] Invariant cache hit.
[2024-05-21 18:36:42] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-21 18:36:42] [INFO ] Invariant cache hit.
[2024-05-21 18:36:43] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 18:36:43] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
[2024-05-21 18:36:43] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-21 18:36:43] [INFO ] Invariant cache hit.
[2024-05-21 18:36:44] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1517 ms. Remains : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 34 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 18:36:44] [INFO ] Invariant cache hit.
[2024-05-21 18:36:44] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 18:36:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 18:36:44] [INFO ] After 383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 18:36:44] [INFO ] After 585ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 170 ms.
[2024-05-21 18:36:44] [INFO ] After 791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 288 reset in 148 ms.
Product exploration explored 100000 steps with 349 reset in 178 ms.
Applying partial POR strategy [true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 78 transition count 823
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 11 place count 78 transition count 825
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 78 transition count 825
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 78 transition count 825
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 77 transition count 824
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 77 transition count 824
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 77 transition count 827
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 17 rules in 183 ms. Remains 77 /78 variables (removed 1) and now considering 827/823 (removed -4) transitions.
[2024-05-21 18:36:46] [INFO ] Redundant transitions in 54 ms returned []
// Phase 1: matrix 827 rows 77 cols
[2024-05-21 18:36:46] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 18:36:47] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/78 places, 827/823 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 837 ms. Remains : 77/78 places, 827/823 transitions.
Built C files in :
/tmp/ltsmin15944435073340612840
[2024-05-21 18:36:47] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15944435073340612840
Running compilation step : cd /tmp/ltsmin15944435073340612840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin15944435073340612840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15944435073340612840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 823/823 (removed 0) transitions.
// Phase 1: matrix 823 rows 78 cols
[2024-05-21 18:36:50] [INFO ] Computed 11 invariants in 5 ms
[2024-05-21 18:36:50] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-21 18:36:50] [INFO ] Invariant cache hit.
[2024-05-21 18:36:51] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-21 18:36:51] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 1017 ms to find 0 implicit places.
[2024-05-21 18:36:51] [INFO ] Invariant cache hit.
[2024-05-21 18:36:52] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1600 ms. Remains : 78/78 places, 823/823 transitions.
Built C files in :
/tmp/ltsmin937730880450937493
[2024-05-21 18:36:52] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin937730880450937493
Running compilation step : cd /tmp/ltsmin937730880450937493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin937730880450937493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin937730880450937493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-21 18:36:55] [INFO ] Flatten gal took : 104 ms
[2024-05-21 18:36:55] [INFO ] Flatten gal took : 75 ms
[2024-05-21 18:36:55] [INFO ] Time to serialize gal into /tmp/LTL12523604511922440196.gal : 18 ms
[2024-05-21 18:36:55] [INFO ] Time to serialize properties into /tmp/LTL9258452377375212639.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12523604511922440196.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4482333898829089867.hoa' '-atoms' '/tmp/LTL9258452377375212639.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((p1==0)||(p6==0))||((p24==0)||(p81==0)))")||(X((G("(((p1==0)||(p6==0))||((p24==0)||(p81==0)))"))||(X(G("(((p1==0)||(p12==0)...189
Formula 0 simplified : XF(!"(((p1==0)||(p6==0))||((p24==0)||(p81==0)))" & X(F!"(((p1==0)||(p6==0))||((p24==0)||(p81==0)))" & XF!"(((p1==0)||(p12==0))||((p2...175
Detected timeout of ITS tools.
[2024-05-21 18:37:25] [INFO ] Flatten gal took : 122 ms
[2024-05-21 18:37:25] [INFO ] Applying decomposition
[2024-05-21 18:37:26] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2259779922105601599.txt' '-o' '/tmp/graph2259779922105601599.bin' '-w' '/tmp/graph2259779922105601599.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2259779922105601599.bin' '-l' '-1' '-v' '-w' '/tmp/graph2259779922105601599.weights' '-q' '0' '-e' '0.001'
[2024-05-21 18:37:26] [INFO ] Decomposing Gal with order
[2024-05-21 18:37:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 18:37:26] [INFO ] Removed a total of 6171 redundant transitions.
[2024-05-21 18:37:26] [INFO ] Flatten gal took : 167 ms
[2024-05-21 18:37:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 80 ms.
[2024-05-21 18:37:26] [INFO ] Time to serialize gal into /tmp/LTL13451384567669421847.gal : 8 ms
[2024-05-21 18:37:26] [INFO ] Time to serialize properties into /tmp/LTL2260264851049424006.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13451384567669421847.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2260264851049424006.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((i2.u0.p1==0)||(i2.u0.p6==0))||((u6.p24==0)||(i2.u0.p81==0)))")||(X((G("(((i2.u0.p1==0)||(i2.u0.p6==0))||((u6.p24==0)||(i2....252
Formula 0 simplified : XF(!"(((i2.u0.p1==0)||(i2.u0.p6==0))||((u6.p24==0)||(i2.u0.p81==0)))" & X(F!"(((i2.u0.p1==0)||(i2.u0.p6==0))||((u6.p24==0)||(i2.u0.p...238
Reverse transition relation is NOT exact ! Due to transitions t235, t341, t342, t345, t346, t349, t350, t353, t354, t357, t358, t361, t362, t365, t366, t36...1969
Computing Next relation with stutter on 393130 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15808217869466044010
[2024-05-21 18:37:41] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15808217869466044010
Running compilation step : cd /tmp/ltsmin15808217869466044010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin15808217869466044010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15808217869466044010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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-09a-LTLFireability-02 finished in 94554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 14 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 82 transition count 855
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 74 transition count 854
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 73 transition count 854
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 73 transition count 852
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 71 transition count 852
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 27 place count 66 transition count 802
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 66 transition count 802
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 65 transition count 801
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 64 transition count 801
Applied a total of 36 rules in 101 ms. Remains 64 /82 variables (removed 18) and now considering 801/863 (removed 62) transitions.
// Phase 1: matrix 801 rows 64 cols
[2024-05-21 18:37:44] [INFO ] Computed 11 invariants in 5 ms
[2024-05-21 18:37:45] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-21 18:37:45] [INFO ] Invariant cache hit.
[2024-05-21 18:37:45] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-21 18:37:45] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2024-05-21 18:37:45] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-21 18:37:45] [INFO ] Invariant cache hit.
[2024-05-21 18:37:46] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/82 places, 801/863 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1293 ms. Remains : 64/82 places, 801/863 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-03 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 (AND (EQ s16 1) (EQ s19 1) (EQ s24 1) (EQ s31 1) (EQ s34 1) (EQ s39 1) (EQ s46 1) (EQ s51 1) (EQ s54 1) (EQ s61 1)) (AND (EQ s1 1) (EQ s5 1) (EQ s2...], 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 15 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-03 finished in 1368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 82 transition count 854
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 73 transition count 854
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 73 transition count 852
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 71 transition count 852
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 66 transition count 802
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 66 transition count 802
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 2 with 2 rules applied. Total rules applied 34 place count 65 transition count 801
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 64 transition count 801
Applied a total of 36 rules in 95 ms. Remains 64 /82 variables (removed 18) and now considering 801/863 (removed 62) transitions.
// Phase 1: matrix 801 rows 64 cols
[2024-05-21 18:37:46] [INFO ] Computed 11 invariants in 5 ms
[2024-05-21 18:37:46] [INFO ] Implicit Places using invariants in 326 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 328 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/82 places, 801/863 transitions.
Applied a total of 0 rules in 45 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 469 ms. Remains : 63/82 places, 801/863 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s20 1) (EQ s23 1) (EQ s28 1) (EQ s35 1) (EQ s38 1) (EQ s45 1) (EQ s48 1) (EQ s53 1) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-06 finished in 560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X(p1)))))'
Support contains 15 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 82 transition count 856
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 75 transition count 854
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 73 transition count 854
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 73 transition count 852
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 71 transition count 852
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 27 place count 66 transition count 802
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 66 transition count 802
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 65 transition count 802
Applied a total of 34 rules in 96 ms. Remains 65 /82 variables (removed 17) and now considering 802/863 (removed 61) transitions.
// Phase 1: matrix 802 rows 65 cols
[2024-05-21 18:37:46] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 18:37:46] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-21 18:37:46] [INFO ] Invariant cache hit.
[2024-05-21 18:37:47] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-21 18:37:47] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
[2024-05-21 18:37:47] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-21 18:37:47] [INFO ] Invariant cache hit.
[2024-05-21 18:37:47] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/82 places, 802/863 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1257 ms. Remains : 65/82 places, 802/863 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s1 0) (EQ s2 0) (EQ s21 0) (EQ s61 0)), p0:(AND (OR (EQ s1 0) (EQ s2 0) (EQ s16 0) (EQ s61 0)) (OR (EQ s17 0) (EQ s22 0) (EQ s25 0) (EQ s32 0) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 827 reset in 245 ms.
Product exploration explored 100000 steps with 2434 reset in 646 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 146 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 15 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 802/802 transitions.
Applied a total of 0 rules in 55 ms. Remains 65 /65 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-21 18:37:49] [INFO ] Invariant cache hit.
[2024-05-21 18:37:49] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-21 18:37:49] [INFO ] Invariant cache hit.
[2024-05-21 18:37:49] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-21 18:37:50] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2024-05-21 18:37:50] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-21 18:37:50] [INFO ] Invariant cache hit.
[2024-05-21 18:37:50] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1400 ms. Remains : 65/65 places, 802/802 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 69 steps, including 4 resets, run visited all 2 properties in 2 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 238 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 945 reset in 273 ms.
Product exploration explored 100000 steps with 1622 reset in 423 ms.
Built C files in :
/tmp/ltsmin15187464823855526282
[2024-05-21 18:37:52] [INFO ] Computing symmetric may disable matrix : 802 transitions.
[2024-05-21 18:37:52] [INFO ] Computation of Complete disable matrix. took 90 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:37:52] [INFO ] Computing symmetric may enable matrix : 802 transitions.
[2024-05-21 18:37:52] [INFO ] Computation of Complete enable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:37:52] [INFO ] Computing Do-Not-Accords matrix : 802 transitions.
[2024-05-21 18:37:52] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:37:52] [INFO ] Built C files in 353ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15187464823855526282
Running compilation step : cd /tmp/ltsmin15187464823855526282;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin15187464823855526282;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15187464823855526282;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 15 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 802/802 transitions.
Applied a total of 0 rules in 51 ms. Remains 65 /65 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-21 18:37:55] [INFO ] Invariant cache hit.
[2024-05-21 18:37:55] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-21 18:37:55] [INFO ] Invariant cache hit.
[2024-05-21 18:37:56] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-21 18:37:56] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2024-05-21 18:37:56] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-21 18:37:56] [INFO ] Invariant cache hit.
[2024-05-21 18:37:56] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1183 ms. Remains : 65/65 places, 802/802 transitions.
Built C files in :
/tmp/ltsmin12441892915197862727
[2024-05-21 18:37:56] [INFO ] Computing symmetric may disable matrix : 802 transitions.
[2024-05-21 18:37:56] [INFO ] Computation of Complete disable matrix. took 90 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:37:56] [INFO ] Computing symmetric may enable matrix : 802 transitions.
[2024-05-21 18:37:56] [INFO ] Computation of Complete enable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:37:57] [INFO ] Computing Do-Not-Accords matrix : 802 transitions.
[2024-05-21 18:37:57] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:37:57] [INFO ] Built C files in 352ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12441892915197862727
Running compilation step : cd /tmp/ltsmin12441892915197862727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin12441892915197862727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12441892915197862727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-21 18:38:00] [INFO ] Flatten gal took : 100 ms
[2024-05-21 18:38:00] [INFO ] Flatten gal took : 101 ms
[2024-05-21 18:38:00] [INFO ] Time to serialize gal into /tmp/LTL10230590664540435018.gal : 12 ms
[2024-05-21 18:38:00] [INFO ] Time to serialize properties into /tmp/LTL757684695025831458.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10230590664540435018.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9096845444559183250.hoa' '-atoms' '/tmp/LTL757684695025831458.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL757684695025831458.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9096845444559183250.hoa
Detected timeout of ITS tools.
[2024-05-21 18:38:15] [INFO ] Flatten gal took : 98 ms
[2024-05-21 18:38:15] [INFO ] Flatten gal took : 100 ms
[2024-05-21 18:38:15] [INFO ] Time to serialize gal into /tmp/LTL9414344378546073865.gal : 12 ms
[2024-05-21 18:38:15] [INFO ] Time to serialize properties into /tmp/LTL13292048806664111570.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9414344378546073865.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13292048806664111570.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((F("((((p1==0)||(p2==0))||((p18==0)||(p81==0)))&&(((((p19==0)||(p26==0))||((p30==0)||(p40==0)))||(((p47==0)||(p54==0))||((p61==...252
Formula 0 simplified : G(FG!"((((p1==0)||(p2==0))||((p18==0)||(p81==0)))&&(((((p19==0)||(p26==0))||((p30==0)||(p40==0)))||(((p47==0)||(p54==0))||((p61==0)|...242
Detected timeout of ITS tools.
[2024-05-21 18:38:30] [INFO ] Flatten gal took : 98 ms
[2024-05-21 18:38:30] [INFO ] Applying decomposition
[2024-05-21 18:38:30] [INFO ] Flatten gal took : 104 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1201889758539346129.txt' '-o' '/tmp/graph1201889758539346129.bin' '-w' '/tmp/graph1201889758539346129.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1201889758539346129.bin' '-l' '-1' '-v' '-w' '/tmp/graph1201889758539346129.weights' '-q' '0' '-e' '0.001'
[2024-05-21 18:38:31] [INFO ] Decomposing Gal with order
[2024-05-21 18:38:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 18:38:31] [INFO ] Removed a total of 5811 redundant transitions.
[2024-05-21 18:38:31] [INFO ] Flatten gal took : 144 ms
[2024-05-21 18:38:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 25 ms.
[2024-05-21 18:38:31] [INFO ] Time to serialize gal into /tmp/LTL3799772873133266118.gal : 2 ms
[2024-05-21 18:38:31] [INFO ] Time to serialize properties into /tmp/LTL11521764606074067165.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3799772873133266118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11521764606074067165.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G((F("((((i7.u18.p1==0)||(i7.u18.p2==0))||((u1.p18==0)||(i7.u18.p81==0)))&&(((((u1.p19==0)||(u3.p26==0))||((i0.u4.p30==0)||(i0.u7...349
Formula 0 simplified : G(FG!"((((i7.u18.p1==0)||(i7.u18.p2==0))||((u1.p18==0)||(i7.u18.p81==0)))&&(((((u1.p19==0)||(u3.p26==0))||((i0.u4.p30==0)||(i0.u7.p4...339
Reverse transition relation is NOT exact ! Due to transitions t347, t348, t349, t350, t351, t352, t353, t354, t363, t364, t365, t366, t367, t368, t369, t37...798
Computing Next relation with stutter on 393130 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14114684188808380973
[2024-05-21 18:38:46] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14114684188808380973
Running compilation step : cd /tmp/ltsmin14114684188808380973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin14114684188808380973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14114684188808380973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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-09a-LTLFireability-08 finished in 63008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p1)))))'
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 79 transition count 833
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 79 transition count 833
Applied a total of 6 rules in 11 ms. Remains 79 /82 variables (removed 3) and now considering 833/863 (removed 30) transitions.
// Phase 1: matrix 833 rows 79 cols
[2024-05-21 18:38:49] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 18:38:50] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-21 18:38:50] [INFO ] Invariant cache hit.
[2024-05-21 18:38:50] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-21 18:38:50] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
[2024-05-21 18:38:50] [INFO ] Invariant cache hit.
[2024-05-21 18:38:51] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/82 places, 833/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1441 ms. Remains : 79/82 places, 833/863 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s1 1) (NEQ s7 1) (NEQ s35 1) (NEQ s74 1)), p1:(OR (NEQ s1 1) (NEQ s2 1) (NEQ s54 1) (NEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 4697 ms.
Product exploration explored 100000 steps with 33333 reset in 4740 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-09a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09a-LTLFireability-09 finished in 11136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U (p1||X(p2))))&&F(p0)))'
Support contains 15 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 78 transition count 823
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 78 transition count 823
Applied a total of 8 rules in 7 ms. Remains 78 /82 variables (removed 4) and now considering 823/863 (removed 40) transitions.
// Phase 1: matrix 823 rows 78 cols
[2024-05-21 18:39:00] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 18:39:01] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-21 18:39:01] [INFO ] Invariant cache hit.
[2024-05-21 18:39:01] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-21 18:39:01] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2024-05-21 18:39:01] [INFO ] Invariant cache hit.
[2024-05-21 18:39:02] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/82 places, 823/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1290 ms. Remains : 78/82 places, 823/863 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s18 1) (EQ s24 1) (EQ s31 1) (EQ s37 1) (EQ s43 1) (EQ s49 1) (EQ s55 1) (EQ s59 1) (EQ s67 1) (EQ s74 1)), p1:(AND (EQ s1 1) (EQ s5 1) (EQ s2...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-10 finished in 1515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 77 transition count 813
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 77 transition count 813
Applied a total of 10 rules in 7 ms. Remains 77 /82 variables (removed 5) and now considering 813/863 (removed 50) transitions.
// Phase 1: matrix 813 rows 77 cols
[2024-05-21 18:39:02] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 18:39:02] [INFO ] Implicit Places using invariants in 317 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 320 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/82 places, 813/863 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 813/813 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 331 ms. Remains : 76/82 places, 813/863 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s23 1) (EQ s29 1) (EQ s33 1) (EQ s41 1) (EQ s45 1) (EQ s51 1) (EQ s59 1) (EQ s65 1) (EQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-11 finished in 506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 80 transition count 851
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 69 transition count 851
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 23 place count 69 transition count 850
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 68 transition count 850
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 29 place count 64 transition count 810
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 64 transition count 810
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 62 transition count 808
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 61 transition count 808
Applied a total of 39 rules in 96 ms. Remains 61 /82 variables (removed 21) and now considering 808/863 (removed 55) transitions.
// Phase 1: matrix 808 rows 61 cols
[2024-05-21 18:39:02] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 18:39:03] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-21 18:39:03] [INFO ] Invariant cache hit.
[2024-05-21 18:39:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:39:03] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
[2024-05-21 18:39:03] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-21 18:39:03] [INFO ] Invariant cache hit.
[2024-05-21 18:39:04] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/82 places, 808/863 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1535 ms. Remains : 61/82 places, 808/863 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s13 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 12 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-12 finished in 1586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G((p1||G(p2))))))'
Support contains 16 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 77 transition count 813
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 77 transition count 813
Applied a total of 10 rules in 8 ms. Remains 77 /82 variables (removed 5) and now considering 813/863 (removed 50) transitions.
// Phase 1: matrix 813 rows 77 cols
[2024-05-21 18:39:04] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 18:39:04] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 18:39:04] [INFO ] Invariant cache hit.
[2024-05-21 18:39:04] [INFO ] State equation strengthened by 246 read => feed constraints.
[2024-05-21 18:39:05] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2024-05-21 18:39:05] [INFO ] Invariant cache hit.
[2024-05-21 18:39:05] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 77/82 places, 813/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1084 ms. Remains : 77/82 places, 813/863 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s8 1) (EQ s19 1) (EQ s72 1) (OR (EQ s1 0) (EQ s10 0) (EQ s29 0) (EQ s72 0))), p1:(AND (EQ s1 1) (EQ s10 1) (EQ s29 1) (EQ s72 1)), p...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-14 finished in 1292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 82 transition count 854
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 73 transition count 854
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 73 transition count 852
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 71 transition count 852
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 66 transition count 802
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 66 transition count 802
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 2 with 2 rules applied. Total rules applied 34 place count 65 transition count 801
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 64 transition count 801
Applied a total of 36 rules in 90 ms. Remains 64 /82 variables (removed 18) and now considering 801/863 (removed 62) transitions.
// Phase 1: matrix 801 rows 64 cols
[2024-05-21 18:39:05] [INFO ] Computed 11 invariants in 5 ms
[2024-05-21 18:39:06] [INFO ] Implicit Places using invariants in 318 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 321 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/82 places, 801/863 transitions.
Applied a total of 0 rules in 66 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 481 ms. Remains : 63/82 places, 801/863 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s18 1) (EQ s23 1) (EQ s30 1) (EQ s33 1) (EQ s38 1) (EQ s45 1) (EQ s48 1) (EQ s53 1) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-15 finished in 666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((G(p1)||X(G(p2))))||p0))))'
Found a Lengthening insensitive property : AutonomousCar-PT-09a-LTLFireability-02
Stuttering acceptance computed with spot in 240 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 82 transition count 852
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 71 transition count 852
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 71 transition count 851
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 24 place count 70 transition count 851
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 66 transition count 811
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 66 transition count 811
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 64 transition count 809
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 63 transition count 809
Applied a total of 38 rules in 70 ms. Remains 63 /82 variables (removed 19) and now considering 809/863 (removed 54) transitions.
// Phase 1: matrix 809 rows 63 cols
[2024-05-21 18:39:06] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 18:39:07] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-21 18:39:07] [INFO ] Invariant cache hit.
[2024-05-21 18:39:07] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-05-21 18:39:07] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
[2024-05-21 18:39:07] [INFO ] Invariant cache hit.
[2024-05-21 18:39:08] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 63/82 places, 809/863 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1501 ms. Remains : 63/82 places, 809/863 transitions.
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(OR (EQ s1 0) (EQ s5 0) (EQ s20 0) (EQ s59 0)), p0:(OR (EQ s1 0) (EQ s5 0) (EQ s20 0) (EQ s59 0)), p2:(OR (EQ s1 0) (EQ s11 0) (EQ s18 0) (EQ s59 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 543 reset in 210 ms.
Product exploration explored 100000 steps with 932 reset in 317 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 637 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-21 18:39:09] [INFO ] Invariant cache hit.
[2024-05-21 18:39:09] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 18:39:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-21 18:39:10] [INFO ] After 520ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-21 18:39:10] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-05-21 18:39:10] [INFO ] After 321ms SMT Verify possible using 257 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-21 18:39:11] [INFO ] After 706ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 285 ms.
[2024-05-21 18:39:11] [INFO ] After 1565ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 64 ms.
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 809/809 transitions.
Graph (complete) has 935 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 62 transition count 806
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 12 place count 62 transition count 797
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 102 place count 53 transition count 716
Applied a total of 102 rules in 103 ms. Remains 53 /63 variables (removed 10) and now considering 716/809 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 53/63 places, 716/809 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 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 44 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 514359 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :{}
Probabilistic random walk after 514359 steps, saw 66468 distinct states, run finished after 3002 ms. (steps per millisecond=171 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 716 rows 53 cols
[2024-05-21 18:39:15] [INFO ] Computed 12 invariants in 6 ms
[2024-05-21 18:39:15] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 18:39:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 18:39:15] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 18:39:15] [INFO ] After 492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 18:39:15] [INFO ] State equation strengthened by 175 read => feed constraints.
[2024-05-21 18:39:16] [INFO ] After 284ms SMT Verify possible using 175 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 18:39:16] [INFO ] After 597ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 260 ms.
[2024-05-21 18:39:16] [INFO ] After 1397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 72 ms.
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 37 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 53/53 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 37 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-21 18:39:16] [INFO ] Invariant cache hit.
[2024-05-21 18:39:17] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-21 18:39:17] [INFO ] Invariant cache hit.
[2024-05-21 18:39:17] [INFO ] State equation strengthened by 175 read => feed constraints.
[2024-05-21 18:39:17] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
[2024-05-21 18:39:17] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-21 18:39:17] [INFO ] Invariant cache hit.
[2024-05-21 18:39:18] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1347 ms. Remains : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 40 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-05-21 18:39:18] [INFO ] Invariant cache hit.
[2024-05-21 18:39:18] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 18:39:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 18:39:18] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 18:39:18] [INFO ] After 496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 18:39:19] [INFO ] After 806ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 268 ms.
[2024-05-21 18:39:19] [INFO ] After 1122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p0)), (X (X p1)), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT (AND p2 p1))), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 301 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 242 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
// Phase 1: matrix 809 rows 63 cols
[2024-05-21 18:39:20] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 18:39:20] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-21 18:39:20] [INFO ] Invariant cache hit.
[2024-05-21 18:39:20] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-05-21 18:39:21] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
[2024-05-21 18:39:21] [INFO ] Invariant cache hit.
[2024-05-21 18:39:21] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1458 ms. Remains : 63/63 places, 809/809 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 649 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 33 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 35 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 18:39:22] [INFO ] Invariant cache hit.
[2024-05-21 18:39:22] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 18:39:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 18:39:22] [INFO ] After 448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 18:39:22] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-05-21 18:39:22] [INFO ] After 208ms SMT Verify possible using 257 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 18:39:23] [INFO ] After 429ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 184 ms.
[2024-05-21 18:39:23] [INFO ] After 1107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 55 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 809/809 transitions.
Graph (complete) has 935 edges and 63 vertex of which 62 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 62 transition count 806
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 12 place count 62 transition count 797
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 102 place count 53 transition count 716
Applied a total of 102 rules in 97 ms. Remains 53 /63 variables (removed 10) and now considering 716/809 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 53/63 places, 716/809 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 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 43 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 625394 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 625394 steps, saw 79048 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 716 rows 53 cols
[2024-05-21 18:39:26] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 18:39:26] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 18:39:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-21 18:39:26] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 18:39:27] [INFO ] After 383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 18:39:27] [INFO ] State equation strengthened by 175 read => feed constraints.
[2024-05-21 18:39:27] [INFO ] After 180ms SMT Verify possible using 175 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 18:39:27] [INFO ] After 379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 183 ms.
[2024-05-21 18:39:27] [INFO ] After 989ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 38 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 53/53 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 36 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-21 18:39:27] [INFO ] Invariant cache hit.
[2024-05-21 18:39:28] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-21 18:39:28] [INFO ] Invariant cache hit.
[2024-05-21 18:39:28] [INFO ] State equation strengthened by 175 read => feed constraints.
[2024-05-21 18:39:28] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 895 ms to find 0 implicit places.
[2024-05-21 18:39:28] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-21 18:39:28] [INFO ] Invariant cache hit.
[2024-05-21 18:39:29] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1377 ms. Remains : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 38 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 18:39:29] [INFO ] Invariant cache hit.
[2024-05-21 18:39:29] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 18:39:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-21 18:39:29] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 18:39:29] [INFO ] After 407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 18:39:30] [INFO ] After 622ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 175 ms.
[2024-05-21 18:39:30] [INFO ] After 834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 217 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 299 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 3 reset in 82 ms.
Product exploration explored 100000 steps with 456 reset in 203 ms.
Applying partial POR strategy [true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 67 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2024-05-21 18:39:32] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 809 rows 63 cols
[2024-05-21 18:39:32] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 18:39:32] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 636 ms. Remains : 63/63 places, 809/809 transitions.
Built C files in :
/tmp/ltsmin9121870475077558316
[2024-05-21 18:39:32] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9121870475077558316
Running compilation step : cd /tmp/ltsmin9121870475077558316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin9121870475077558316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9121870475077558316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2024-05-21 18:39:35] [INFO ] Invariant cache hit.
[2024-05-21 18:39:35] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-21 18:39:35] [INFO ] Invariant cache hit.
[2024-05-21 18:39:36] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-05-21 18:39:36] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 974 ms to find 0 implicit places.
[2024-05-21 18:39:36] [INFO ] Invariant cache hit.
[2024-05-21 18:39:37] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1408 ms. Remains : 63/63 places, 809/809 transitions.
Built C files in :
/tmp/ltsmin13572122098420047498
[2024-05-21 18:39:37] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13572122098420047498
Running compilation step : cd /tmp/ltsmin13572122098420047498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin13572122098420047498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13572122098420047498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-21 18:39:40] [INFO ] Flatten gal took : 98 ms
[2024-05-21 18:39:40] [INFO ] Flatten gal took : 98 ms
[2024-05-21 18:39:40] [INFO ] Time to serialize gal into /tmp/LTL6505349044205522857.gal : 16 ms
[2024-05-21 18:39:40] [INFO ] Time to serialize properties into /tmp/LTL11902588572142829770.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6505349044205522857.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7247399160452357254.hoa' '-atoms' '/tmp/LTL11902588572142829770.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11902588572142829770.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7247399160452357254.hoa
Detected timeout of ITS tools.
[2024-05-21 18:39:55] [INFO ] Flatten gal took : 91 ms
[2024-05-21 18:39:55] [INFO ] Flatten gal took : 93 ms
[2024-05-21 18:39:55] [INFO ] Time to serialize gal into /tmp/LTL7217951442473131765.gal : 13 ms
[2024-05-21 18:39:55] [INFO ] Time to serialize properties into /tmp/LTL17249008622376115403.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7217951442473131765.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17249008622376115403.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((p1==0)||(p6==0))||((p24==0)||(p81==0)))")||(X((G("(((p1==0)||(p6==0))||((p24==0)||(p81==0)))"))||(X(G("(((p1==0)||(p12==0)...189
Formula 0 simplified : XF(!"(((p1==0)||(p6==0))||((p24==0)||(p81==0)))" & X(F!"(((p1==0)||(p6==0))||((p24==0)||(p81==0)))" & XF!"(((p1==0)||(p12==0))||((p2...175
Detected timeout of ITS tools.
[2024-05-21 18:40:10] [INFO ] Flatten gal took : 92 ms
[2024-05-21 18:40:10] [INFO ] Applying decomposition
[2024-05-21 18:40:10] [INFO ] Flatten gal took : 91 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3531115399206629540.txt' '-o' '/tmp/graph3531115399206629540.bin' '-w' '/tmp/graph3531115399206629540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3531115399206629540.bin' '-l' '-1' '-v' '-w' '/tmp/graph3531115399206629540.weights' '-q' '0' '-e' '0.001'
[2024-05-21 18:40:11] [INFO ] Decomposing Gal with order
[2024-05-21 18:40:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 18:40:11] [INFO ] Removed a total of 5570 redundant transitions.
[2024-05-21 18:40:11] [INFO ] Flatten gal took : 145 ms
[2024-05-21 18:40:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 79 ms.
[2024-05-21 18:40:11] [INFO ] Time to serialize gal into /tmp/LTL4326403303585808959.gal : 12 ms
[2024-05-21 18:40:11] [INFO ] Time to serialize properties into /tmp/LTL5952844953116328169.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4326403303585808959.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5952844953116328169.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((i10.u18.p1==0)||(i10.u18.p6==0))||((i4.u2.p24==0)||(i10.u18.p81==0)))")||(X((G("(((i10.u18.p1==0)||(i10.u18.p6==0))||((i4....279
Formula 0 simplified : XF(!"(((i10.u18.p1==0)||(i10.u18.p6==0))||((i4.u2.p24==0)||(i10.u18.p81==0)))" & X(F!"(((i10.u18.p1==0)||(i10.u18.p6==0))||((i4.u2.p...265
Reverse transition relation is NOT exact ! Due to transitions t341, t342, t345, t346, t349, t350, t353, t354, t357, t358, t361, t362, t365, t366, t369, t37...1948
Computing Next relation with stutter on 393130 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9085745237844577927
[2024-05-21 18:40:26] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9085745237844577927
Running compilation step : cd /tmp/ltsmin9085745237844577927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin9085745237844577927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9085745237844577927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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-09a-LTLFireability-02 finished in 83091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X(p1)))))'
[2024-05-21 18:40:29] [INFO ] Flatten gal took : 74 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8929129385347902606
[2024-05-21 18:40:29] [INFO ] Computing symmetric may disable matrix : 863 transitions.
[2024-05-21 18:40:29] [INFO ] Applying decomposition
[2024-05-21 18:40:29] [INFO ] Computation of Complete disable matrix. took 92 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:40:29] [INFO ] Flatten gal took : 76 ms
[2024-05-21 18:40:29] [INFO ] Computing symmetric may enable matrix : 863 transitions.
[2024-05-21 18:40:30] [INFO ] Computation of Complete enable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:40:30] [INFO ] Computing Do-Not-Accords matrix : 863 transitions.
[2024-05-21 18:40:30] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10206698623742183842.txt' '-o' '/tmp/graph10206698623742183842.bin' '-w' '/tmp/graph10206698623742183842.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10206698623742183842.bin' '-l' '-1' '-v' '-w' '/tmp/graph10206698623742183842.weights' '-q' '0' '-e' '0.001'
[2024-05-21 18:40:30] [INFO ] Decomposing Gal with order
[2024-05-21 18:40:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 18:40:30] [INFO ] Built C files in 422ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8929129385347902606
Running compilation step : cd /tmp/ltsmin8929129385347902606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 18:40:30] [INFO ] Removed a total of 5983 redundant transitions.
[2024-05-21 18:40:30] [INFO ] Flatten gal took : 153 ms
[2024-05-21 18:40:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 33 ms.
[2024-05-21 18:40:30] [INFO ] Time to serialize gal into /tmp/LTLFireability17452291914536543584.gal : 11 ms
[2024-05-21 18:40:30] [INFO ] Time to serialize properties into /tmp/LTLFireability344396473267105460.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17452291914536543584.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability344396473267105460.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((F(G("(((((i2.u3.p19==0)||(i2.u5.p23==0))||((i3.u9.p33==0)||(i2.u11.p37==0)))||(((i5.u15.p47==0)||(i2.u17.p51==0))||((i7.u21.p61==0)...216
Formula 0 simplified : GF!"(((((i2.u3.p19==0)||(i2.u5.p23==0))||((i3.u9.p33==0)||(i2.u11.p37==0)))||(((i5.u15.p47==0)||(i2.u17.p51==0))||((i7.u21.p61==0)||...210
Compilation finished in 7088 ms.
Running link step : cd /tmp/ltsmin8929129385347902606;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 100 ms.
Running LTSmin : cd /tmp/ltsmin8929129385347902606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin8929129385347902606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8929129385347902606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(([]((LTLAPp2==true))||X([]((LTLAPp3==true)))))||(LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 19:02:28] [INFO ] Applying decomposition
[2024-05-21 19:02:28] [INFO ] Flatten gal took : 184 ms
[2024-05-21 19:02:28] [INFO ] Decomposing Gal with order
[2024-05-21 19:02:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:02:28] [INFO ] Removed a total of 6215 redundant transitions.
[2024-05-21 19:02:28] [INFO ] Flatten gal took : 219 ms
[2024-05-21 19:02:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 30 ms.
[2024-05-21 19:02:29] [INFO ] Time to serialize gal into /tmp/LTLFireability6839845951316201694.gal : 1 ms
[2024-05-21 19:02:29] [INFO ] Time to serialize properties into /tmp/LTLFireability16191161362073420898.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6839845951316201694.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16191161362073420898.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((F(G("(((((u3.p19==0)||(u4.p23==0))||((u5.p33==0)||(u6.p37==0)))||(((u7.p47==0)||(u8.p51==0))||((u9.p61==0)||(u10.p65==0))))||((u11....183
Formula 0 simplified : GF!"(((((u3.p19==0)||(u4.p23==0))||((u5.p33==0)||(u6.p37==0)))||(((u7.p47==0)||(u8.p51==0))||((u9.p61==0)||(u10.p65==0))))||((u11.p7...177
Reverse transition relation is NOT exact ! Due to transitions t95, t140, t203, t221, t257, t338, t764, t861, u2.t336, u3.t41, u3.t42, u3.t43, u4.t36, u4.t3...427
Computing Next relation with stutter on 393130 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
285 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.86645,113408,1,0,256627,1360,823,240180,372,8951,275791
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-09a-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(("(((u1.p1==0)||(u2.p6==0))||((u4.p24==0)||(u12.p81==0)))")||(X((G("(((u1.p1==0)||(u2.p6==0))||((u4.p24==0)||(u12.p81==0)))"))|...228
Formula 1 simplified : XF(!"(((u1.p1==0)||(u2.p6==0))||((u4.p24==0)||(u12.p81==0)))" & X(F!"(((u1.p1==0)||(u2.p6==0))||((u4.p24==0)||(u12.p81==0)))" & XF!"...214
Computing Next relation with stutter on 393130 deadlock states
1078 unique states visited
6 strongly connected components in search stack
1145 transitions explored
190 items max in DFS search stack
986 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.7334,370344,1,0,833079,1623,997,965435,395,14248,1082494
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA AutonomousCar-PT-09a-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G((F("((((u1.p1==0)||(u2.p2==0))||((u3.p18==0)||(u12.p81==0)))&&(((((u3.p19==0)||(u4.p26==0))||((u5.p30==0)||(u6.p40==0)))||(((u7...311
Formula 2 simplified : G(FG!"((((u1.p1==0)||(u2.p2==0))||((u3.p18==0)||(u12.p81==0)))&&(((((u3.p19==0)||(u4.p26==0))||((u5.p30==0)||(u6.p40==0)))||(((u7.p4...301
Computing Next relation with stutter on 393130 deadlock states
150 unique states visited
150 strongly connected components in search stack
151 transitions explored
150 items max in DFS search stack
142 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.1453,394236,1,0,878663,1623,1061,1.0451e+06,395,14290,1170499
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA AutonomousCar-PT-09a-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1711472 ms.

BK_STOP 1716318188514

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-09a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is AutonomousCar-PT-09a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-smll-171620180400218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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