Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r329-tall-171662361800218.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 RERS2020-PT-pb103, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662361800218
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 18M May 18 16:43 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 RERS2020-PT-pb103-LTLFireability-00
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-01
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-02
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-03
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-04
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-05
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-06
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-07
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-08
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-09
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-10
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-11
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-12
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-13
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-14
FORMULA_NAME RERS2020-PT-pb103-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716841798093

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=RERS2020-PT-pb103
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 20:29:59] [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-27 20:29:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:30:00] [INFO ] Load time of PNML (sax parser for PT used): 754 ms
[2024-05-27 20:30:00] [INFO ] Transformed 520 places.
[2024-05-27 20:30:00] [INFO ] Transformed 31658 transitions.
[2024-05-27 20:30:00] [INFO ] Found NUPN structural information;
[2024-05-27 20:30:00] [INFO ] Parsed PT model containing 520 places and 31658 transitions and 125892 arcs in 953 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 3229 transitions
Reduce redundant transitions removed 3229 transitions.
Support contains 69 out of 520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 520/520 places, 28429/28429 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 28429
Applied a total of 7 rules in 100 ms. Remains 513 /520 variables (removed 7) and now considering 28429/28429 (removed 0) transitions.
[2024-05-27 20:30:01] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2024-05-27 20:30:01] [INFO ] Computed 8 invariants in 156 ms
[2024-05-27 20:30:02] [INFO ] Implicit Places using invariants in 1284 ms returned []
Implicit Place search using SMT only with invariants took 1309 ms to find 0 implicit places.
[2024-05-27 20:30:02] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:30:02] [INFO ] Invariant cache hit.
[2024-05-27 20:30:11] [INFO ] Dead Transitions using invariants and state equation in 8613 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 513/520 places, 28429/28429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10029 ms. Remains : 513/520 places, 28429/28429 transitions.
Support contains 69 out of 513 places after structural reductions.
[2024-05-27 20:30:12] [INFO ] Flatten gal took : 1021 ms
[2024-05-27 20:30:13] [INFO ] Flatten gal took : 774 ms
[2024-05-27 20:30:14] [INFO ] Input system was already deterministic with 28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 834 ms. (steps per millisecond=11 ) properties (out of 40) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 39) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 38) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 37) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 36) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Running SMT prover for 34 properties.
[2024-05-27 20:30:16] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:30:16] [INFO ] Invariant cache hit.
[2024-05-27 20:30:17] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-27 20:30:33] [INFO ] After 16931ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:34
[2024-05-27 20:30:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-27 20:30:48] [INFO ] After 14360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :34
[2024-05-27 20:30:48] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2024-05-27 20:30:58] [INFO ] After 9878ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :34
[2024-05-27 20:30:58] [INFO ] After 9880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :34
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-27 20:30:58] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :34
Parikh walk visited 0 properties in 442 ms.
Support contains 58 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 41 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 1076 place count 511 transition count 27367
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 1174 place count 501 transition count 27279
Applied a total of 1174 rules in 769 ms. Remains 501 /513 variables (removed 12) and now considering 27279/28429 (removed 1150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 771 ms. Remains : 501/513 places, 27279/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 652 ms. (steps per millisecond=15 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 34) seen :0
Interrupted probabilistic random walk after 33891 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33891 steps, saw 24165 distinct states, run finished after 3002 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 34 properties.
[2024-05-27 20:31:03] [INFO ] Flow matrix only has 18599 transitions (discarded 8680 similar events)
// Phase 1: matrix 18599 rows 501 cols
[2024-05-27 20:31:04] [INFO ] Computed 8 invariants in 85 ms
[2024-05-27 20:31:04] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-27 20:31:19] [INFO ] After 15413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:34
[2024-05-27 20:31:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-05-27 20:31:35] [INFO ] After 15632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :34
[2024-05-27 20:31:36] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2024-05-27 20:31:44] [INFO ] After 8610ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :33
[2024-05-27 20:31:44] [INFO ] After 8611ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :33
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-27 20:31:44] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :33
Parikh walk visited 0 properties in 83 ms.
Support contains 58 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 27279/27279 transitions.
Applied a total of 0 rules in 140 ms. Remains 501 /501 variables (removed 0) and now considering 27279/27279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 501/501 places, 27279/27279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 27279/27279 transitions.
Applied a total of 0 rules in 167 ms. Remains 501 /501 variables (removed 0) and now considering 27279/27279 (removed 0) transitions.
[2024-05-27 20:31:45] [INFO ] Flow matrix only has 18599 transitions (discarded 8680 similar events)
[2024-05-27 20:31:45] [INFO ] Invariant cache hit.
[2024-05-27 20:31:46] [INFO ] Implicit Places using invariants in 1017 ms returned []
Implicit Place search using SMT only with invariants took 1019 ms to find 0 implicit places.
[2024-05-27 20:31:46] [INFO ] Flow matrix only has 18599 transitions (discarded 8680 similar events)
[2024-05-27 20:31:46] [INFO ] Invariant cache hit.
[2024-05-27 20:31:54] [INFO ] Dead Transitions using invariants and state equation in 8314 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9508 ms. Remains : 501/501 places, 27279/27279 transitions.
Graph (trivial) has 7234 edges and 501 vertex of which 294 / 501 are part of one of the 52 SCC in 6 ms
Free SCC test removed 242 places
Drop transitions removed 6652 transitions
Ensure Unique test removed 13958 transitions
Reduce isomorphic transitions removed 20610 transitions.
Graph (complete) has 5589 edges and 259 vertex of which 252 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 252 transition count 6658
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 250 transition count 6658
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 249 transition count 6657
Drop transitions removed 3593 transitions
Redundant transition composition rules discarded 3593 transitions
Iterating global reduction 2 with 3593 rules applied. Total rules applied 3610 place count 249 transition count 3064
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 3859 edges and 248 vertex of which 243 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 3 rules applied. Total rules applied 3613 place count 243 transition count 3063
Drop transitions removed 14 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 3628 place count 243 transition count 3048
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 3631 place count 240 transition count 3045
Iterating global reduction 4 with 3 rules applied. Total rules applied 3634 place count 240 transition count 3045
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 3639 place count 240 transition count 3040
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3640 place count 239 transition count 3038
Iterating global reduction 5 with 1 rules applied. Total rules applied 3641 place count 239 transition count 3038
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3643 place count 239 transition count 3036
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3645 place count 238 transition count 3035
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 3655 place count 238 transition count 3025
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 3659 place count 238 transition count 3021
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 3665 place count 234 transition count 3019
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 7 with 17 rules applied. Total rules applied 3682 place count 234 transition count 3002
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3684 place count 234 transition count 3198
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 3686 place count 232 transition count 3198
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 8 with 44 rules applied. Total rules applied 3730 place count 232 transition count 3154
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 3742 place count 232 transition count 3154
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 3749 place count 232 transition count 3147
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 3751 place count 232 transition count 3147
Applied a total of 3751 rules in 834 ms. Remains 232 /501 variables (removed 269) and now considering 3147/27279 (removed 24132) transitions.
Running SMT prover for 34 properties.
[2024-05-27 20:31:55] [INFO ] Flow matrix only has 3126 transitions (discarded 21 similar events)
// Phase 1: matrix 3126 rows 232 cols
[2024-05-27 20:31:55] [INFO ] Computed 1 invariants in 24 ms
[2024-05-27 20:31:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-27 20:31:58] [INFO ] After 3188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:34
[2024-05-27 20:31:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-27 20:32:01] [INFO ] After 2697ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :34
[2024-05-27 20:32:01] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-27 20:32:04] [INFO ] After 2449ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :34
[2024-05-27 20:32:08] [INFO ] After 6376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :34
Attempting to minimize the solution found.
Minimization took 2533 ms.
[2024-05-27 20:32:10] [INFO ] After 11890ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :34
Computed a total of 121 stabilizing places and 10286 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 40 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2024-05-27 20:32:11] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2024-05-27 20:32:11] [INFO ] Computed 8 invariants in 64 ms
[2024-05-27 20:32:12] [INFO ] Implicit Places using invariants in 1021 ms returned []
Implicit Place search using SMT only with invariants took 1022 ms to find 0 implicit places.
[2024-05-27 20:32:12] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:32:12] [INFO ] Invariant cache hit.
[2024-05-27 20:32:20] [INFO ] Dead Transitions using invariants and state equation in 8075 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9144 ms. Remains : 513/513 places, 28429/28429 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 198 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s16 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 6 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-00 finished in 9436 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))||G(p1))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 336 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2024-05-27 20:32:20] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2024-05-27 20:32:20] [INFO ] Computed 8 invariants in 65 ms
[2024-05-27 20:32:21] [INFO ] Implicit Places using invariants in 919 ms returned []
Implicit Place search using SMT only with invariants took 923 ms to find 0 implicit places.
[2024-05-27 20:32:21] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:32:21] [INFO ] Invariant cache hit.
[2024-05-27 20:32:29] [INFO ] Dead Transitions using invariants and state equation in 8351 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9615 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-01 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:(AND (EQ s43 1) (EQ s237 1)), p0:(AND (EQ s160 1) (EQ s451 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 6 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-01 finished in 9775 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&&(X(G(p2))||p1)))))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 242 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2024-05-27 20:32:30] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:32:30] [INFO ] Invariant cache hit.
[2024-05-27 20:32:31] [INFO ] Implicit Places using invariants in 825 ms returned []
Implicit Place search using SMT only with invariants took 827 ms to find 0 implicit places.
[2024-05-27 20:32:31] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:32:31] [INFO ] Invariant cache hit.
[2024-05-27 20:32:39] [INFO ] Dead Transitions using invariants and state equation in 8345 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9417 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s344 0) (EQ s509 0)), p0:(OR (EQ s193 0) (EQ s454 0)), p2:(AND (EQ s1 1) (EQ s388 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 2952 ms.
Product exploration explored 100000 steps with 0 reset in 2485 ms.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (AND p1 p0)), (X (NOT (AND p0 p2))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (X (AND p1 p0))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 180 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 35310 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35310 steps, saw 24209 distinct states, run finished after 3002 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-27 20:32:49] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:32:49] [INFO ] Invariant cache hit.
[2024-05-27 20:32:49] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:32:53] [INFO ] After 4016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 20:32:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:32:59] [INFO ] After 5905ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 20:32:59] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2024-05-27 20:33:09] [INFO ] After 9810ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-27 20:33:12] [INFO ] Deduced a trap composed of 101 places in 1875 ms of which 1 ms to minimize.
[2024-05-27 20:33:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2594 ms
[2024-05-27 20:33:15] [INFO ] Deduced a trap composed of 11 places in 1739 ms of which 1 ms to minimize.
[2024-05-27 20:33:18] [INFO ] Deduced a trap composed of 33 places in 1913 ms of which 0 ms to minimize.
[2024-05-27 20:33:18] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 4675 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 20:33:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:33:18] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 25 ms.
Support contains 6 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 510 transition count 27376
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 1073 place count 510 transition count 27365
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 1172 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1173 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1174 place count 498 transition count 27457
Applied a total of 1174 rules in 456 ms. Remains 498 /510 variables (removed 12) and now considering 27457/28438 (removed 981) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 457 ms. Remains : 498/510 places, 27457/28438 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 35091 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35091 steps, saw 24961 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-27 20:33:22] [INFO ] Flow matrix only has 18729 transitions (discarded 8728 similar events)
// Phase 1: matrix 18729 rows 498 cols
[2024-05-27 20:33:22] [INFO ] Computed 8 invariants in 75 ms
[2024-05-27 20:33:23] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-27 20:33:26] [INFO ] After 3879ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 20:33:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:33:32] [INFO ] After 5499ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 20:33:32] [INFO ] State equation strengthened by 1375 read => feed constraints.
[2024-05-27 20:33:41] [INFO ] After 9353ms SMT Verify possible using 1375 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-27 20:33:45] [INFO ] Deduced a trap composed of 101 places in 1939 ms of which 1 ms to minimize.
[2024-05-27 20:33:48] [INFO ] Deduced a trap composed of 11 places in 1795 ms of which 0 ms to minimize.
[2024-05-27 20:33:51] [INFO ] Deduced a trap composed of 11 places in 1819 ms of which 0 ms to minimize.
[2024-05-27 20:33:53] [INFO ] Deduced a trap composed of 68 places in 1969 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 20:33:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:33:53] [INFO ] After 26991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 20 ms.
Support contains 6 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27457/27457 transitions.
Applied a total of 0 rules in 114 ms. Remains 498 /498 variables (removed 0) and now considering 27457/27457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 498/498 places, 27457/27457 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27457/27457 transitions.
Applied a total of 0 rules in 106 ms. Remains 498 /498 variables (removed 0) and now considering 27457/27457 (removed 0) transitions.
[2024-05-27 20:33:54] [INFO ] Flow matrix only has 18729 transitions (discarded 8728 similar events)
[2024-05-27 20:33:54] [INFO ] Invariant cache hit.
[2024-05-27 20:33:55] [INFO ] Implicit Places using invariants in 962 ms returned []
Implicit Place search using SMT only with invariants took 963 ms to find 0 implicit places.
[2024-05-27 20:33:55] [INFO ] Flow matrix only has 18729 transitions (discarded 8728 similar events)
[2024-05-27 20:33:55] [INFO ] Invariant cache hit.
[2024-05-27 20:34:03] [INFO ] Dead Transitions using invariants and state equation in 8321 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9394 ms. Remains : 498/498 places, 27457/27457 transitions.
Graph (trivial) has 10125 edges and 498 vertex of which 370 / 498 are part of one of the 60 SCC in 3 ms
Free SCC test removed 310 places
Drop transitions removed 10584 transitions
Ensure Unique test removed 14251 transitions
Reduce isomorphic transitions removed 24835 transitions.
Graph (complete) has 2565 edges and 188 vertex of which 180 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 180 transition count 2608
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 178 transition count 2608
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 176 transition count 2606
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 176 transition count 2573
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 57 place count 175 transition count 2583
Drop transitions removed 1427 transitions
Redundant transition composition rules discarded 1427 transitions
Iterating global reduction 3 with 1427 rules applied. Total rules applied 1484 place count 175 transition count 1156
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1351 edges and 173 vertex of which 157 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 10 rules applied. Total rules applied 1494 place count 157 transition count 1147
Drop transitions removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 4 with 102 rules applied. Total rules applied 1596 place count 157 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1599 place count 154 transition count 1034
Iterating global reduction 5 with 3 rules applied. Total rules applied 1602 place count 154 transition count 1034
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1606 place count 154 transition count 1030
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 6 with 2 rules applied. Total rules applied 1608 place count 153 transition count 1029
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 1614 place count 153 transition count 1023
Free-agglomeration rule applied 10 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1624 place count 153 transition count 1006
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 28 rules applied. Total rules applied 1652 place count 143 transition count 988
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1653 place count 142 transition count 986
Iterating global reduction 7 with 1 rules applied. Total rules applied 1654 place count 142 transition count 986
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1662 place count 142 transition count 978
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 8 with 50 rules applied. Total rules applied 1712 place count 142 transition count 928
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1715 place count 142 transition count 925
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1718 place count 139 transition count 925
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 1727 place count 139 transition count 916
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1731 place count 139 transition count 1006
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1740 place count 135 transition count 1001
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1741 place count 134 transition count 997
Iterating global reduction 10 with 1 rules applied. Total rules applied 1742 place count 134 transition count 997
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1751 place count 134 transition count 988
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 11 with 23 rules applied. Total rules applied 1774 place count 134 transition count 965
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 1780 place count 134 transition count 965
Applied a total of 1780 rules in 234 ms. Remains 134 /498 variables (removed 364) and now considering 965/27457 (removed 26492) transitions.
Running SMT prover for 6 properties.
[2024-05-27 20:34:03] [INFO ] Flow matrix only has 926 transitions (discarded 39 similar events)
// Phase 1: matrix 926 rows 134 cols
[2024-05-27 20:34:03] [INFO ] Computed 0 invariants in 7 ms
[2024-05-27 20:34:03] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 20:34:04] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 20:34:04] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-27 20:34:04] [INFO ] After 177ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-27 20:34:04] [INFO ] After 418ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 152 ms.
[2024-05-27 20:34:04] [INFO ] After 907ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (AND p1 p0)), (X (NOT (AND p0 p2))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (X (AND p1 p0))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 133 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 120 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2024-05-27 20:34:05] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2024-05-27 20:34:05] [INFO ] Computed 8 invariants in 58 ms
[2024-05-27 20:34:06] [INFO ] Implicit Places using invariants in 847 ms returned []
Implicit Place search using SMT only with invariants took 860 ms to find 0 implicit places.
[2024-05-27 20:34:06] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:34:06] [INFO ] Invariant cache hit.
[2024-05-27 20:34:13] [INFO ] Dead Transitions using invariants and state equation in 7768 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8755 ms. Remains : 510/510 places, 28438/28438 transitions.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (OR (NOT p0) (AND p1 (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p0) (AND p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 127 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 34997 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 34997 steps, saw 24000 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-27 20:34:17] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:34:17] [INFO ] Invariant cache hit.
[2024-05-27 20:34:18] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-27 20:34:22] [INFO ] After 4104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 20:34:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:34:27] [INFO ] After 5503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 20:34:27] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2024-05-27 20:34:41] [INFO ] After 13473ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-27 20:34:47] [INFO ] Deduced a trap composed of 78 places in 1988 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 20:34:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:34:47] [INFO ] After 25707ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 22 ms.
Support contains 6 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 510 transition count 27376
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 1073 place count 510 transition count 27365
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 1172 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1173 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1174 place count 498 transition count 27457
Applied a total of 1174 rules in 365 ms. Remains 498 /510 variables (removed 12) and now considering 27457/28438 (removed 981) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 498/510 places, 27457/28438 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 35516 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35516 steps, saw 25240 distinct states, run finished after 3003 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-27 20:34:51] [INFO ] Flow matrix only has 18729 transitions (discarded 8728 similar events)
// Phase 1: matrix 18729 rows 498 cols
[2024-05-27 20:34:52] [INFO ] Computed 8 invariants in 60 ms
[2024-05-27 20:34:52] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:34:56] [INFO ] After 4056ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 20:34:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-05-27 20:35:01] [INFO ] After 5285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 20:35:01] [INFO ] State equation strengthened by 1375 read => feed constraints.
[2024-05-27 20:35:20] [INFO ] After 19141ms SMT Verify possible using 1375 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-27 20:35:21] [INFO ] After 19478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-27 20:35:21] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 21 ms.
Support contains 6 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27457/27457 transitions.
Applied a total of 0 rules in 126 ms. Remains 498 /498 variables (removed 0) and now considering 27457/27457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 498/498 places, 27457/27457 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27457/27457 transitions.
Applied a total of 0 rules in 125 ms. Remains 498 /498 variables (removed 0) and now considering 27457/27457 (removed 0) transitions.
[2024-05-27 20:35:21] [INFO ] Flow matrix only has 18729 transitions (discarded 8728 similar events)
[2024-05-27 20:35:21] [INFO ] Invariant cache hit.
[2024-05-27 20:35:22] [INFO ] Implicit Places using invariants in 939 ms returned []
Implicit Place search using SMT only with invariants took 939 ms to find 0 implicit places.
[2024-05-27 20:35:22] [INFO ] Flow matrix only has 18729 transitions (discarded 8728 similar events)
[2024-05-27 20:35:22] [INFO ] Invariant cache hit.
[2024-05-27 20:35:30] [INFO ] Dead Transitions using invariants and state equation in 8358 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9428 ms. Remains : 498/498 places, 27457/27457 transitions.
Graph (trivial) has 10125 edges and 498 vertex of which 370 / 498 are part of one of the 60 SCC in 2 ms
Free SCC test removed 310 places
Drop transitions removed 10584 transitions
Ensure Unique test removed 14251 transitions
Reduce isomorphic transitions removed 24835 transitions.
Graph (complete) has 2565 edges and 188 vertex of which 180 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 180 transition count 2608
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 178 transition count 2608
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 176 transition count 2606
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 176 transition count 2573
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 57 place count 175 transition count 2583
Drop transitions removed 1427 transitions
Redundant transition composition rules discarded 1427 transitions
Iterating global reduction 3 with 1427 rules applied. Total rules applied 1484 place count 175 transition count 1156
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1351 edges and 173 vertex of which 157 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 10 rules applied. Total rules applied 1494 place count 157 transition count 1147
Drop transitions removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 4 with 102 rules applied. Total rules applied 1596 place count 157 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1599 place count 154 transition count 1034
Iterating global reduction 5 with 3 rules applied. Total rules applied 1602 place count 154 transition count 1034
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1606 place count 154 transition count 1030
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 6 with 2 rules applied. Total rules applied 1608 place count 153 transition count 1029
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 1614 place count 153 transition count 1023
Free-agglomeration rule applied 10 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1624 place count 153 transition count 1006
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 28 rules applied. Total rules applied 1652 place count 143 transition count 988
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1653 place count 142 transition count 986
Iterating global reduction 7 with 1 rules applied. Total rules applied 1654 place count 142 transition count 986
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1662 place count 142 transition count 978
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 8 with 50 rules applied. Total rules applied 1712 place count 142 transition count 928
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1715 place count 142 transition count 925
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1718 place count 139 transition count 925
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 1727 place count 139 transition count 916
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1731 place count 139 transition count 1006
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1740 place count 135 transition count 1001
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1741 place count 134 transition count 997
Iterating global reduction 10 with 1 rules applied. Total rules applied 1742 place count 134 transition count 997
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1751 place count 134 transition count 988
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 11 with 23 rules applied. Total rules applied 1774 place count 134 transition count 965
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 1780 place count 134 transition count 965
Applied a total of 1780 rules in 208 ms. Remains 134 /498 variables (removed 364) and now considering 965/27457 (removed 26492) transitions.
Running SMT prover for 6 properties.
[2024-05-27 20:35:31] [INFO ] Flow matrix only has 926 transitions (discarded 39 similar events)
// Phase 1: matrix 926 rows 134 cols
[2024-05-27 20:35:31] [INFO ] Computed 0 invariants in 7 ms
[2024-05-27 20:35:31] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 20:35:31] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 20:35:31] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-27 20:35:31] [INFO ] After 158ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-27 20:35:32] [INFO ] After 392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 164 ms.
[2024-05-27 20:35:32] [INFO ] After 900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (OR (NOT p0) (AND p1 (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p0) (AND p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 148 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 2416 ms.
Product exploration explored 100000 steps with 0 reset in 2061 ms.
Built C files in :
/tmp/ltsmin470394811253603013
[2024-05-27 20:35:37] [INFO ] Too many transitions (28438) to apply POR reductions. Disabling POR matrices.
[2024-05-27 20:35:37] [INFO ] Built C files in 316ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin470394811253603013
Running compilation step : cd /tmp/ltsmin470394811253603013;'/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/ltsmin470394811253603013;'/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/ltsmin470394811253603013;'/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 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 110 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2024-05-27 20:35:40] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2024-05-27 20:35:40] [INFO ] Computed 8 invariants in 66 ms
[2024-05-27 20:35:41] [INFO ] Implicit Places using invariants in 906 ms returned []
Implicit Place search using SMT only with invariants took 907 ms to find 0 implicit places.
[2024-05-27 20:35:41] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:35:41] [INFO ] Invariant cache hit.
[2024-05-27 20:35:50] [INFO ] Dead Transitions using invariants and state equation in 8631 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9650 ms. Remains : 510/510 places, 28438/28438 transitions.
Built C files in :
/tmp/ltsmin12126397732444943936
[2024-05-27 20:35:50] [INFO ] Too many transitions (28438) to apply POR reductions. Disabling POR matrices.
[2024-05-27 20:35:50] [INFO ] Built C files in 236ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12126397732444943936
Running compilation step : cd /tmp/ltsmin12126397732444943936;'/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/ltsmin12126397732444943936;'/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/ltsmin12126397732444943936;'/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-27 20:35:55] [INFO ] Flatten gal took : 813 ms
[2024-05-27 20:35:56] [INFO ] Flatten gal took : 791 ms
[2024-05-27 20:35:56] [INFO ] Time to serialize gal into /tmp/LTL4018960995825010674.gal : 143 ms
[2024-05-27 20:35:56] [INFO ] Time to serialize properties into /tmp/LTL2317777497412907755.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/LTL4018960995825010674.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4082869130012921557.hoa' '-atoms' '/tmp/LTL2317777497412907755.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/LTL2317777497412907755.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4082869130012921557.hoa
Detected timeout of ITS tools.
[2024-05-27 20:36:12] [INFO ] Flatten gal took : 680 ms
[2024-05-27 20:36:13] [INFO ] Flatten gal took : 704 ms
[2024-05-27 20:36:13] [INFO ] Time to serialize gal into /tmp/LTL12275643360943726121.gal : 119 ms
[2024-05-27 20:36:13] [INFO ] Time to serialize properties into /tmp/LTL17386891427117800053.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12275643360943726121.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17386891427117800053.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("((ps318==0)||(ps491==0))")&&(("((ps46==0)||(ps405==0))")||(X(G("((ps274==1)&&(ps446==1))"))))))))
Formula 0 simplified : GF(!"((ps318==0)||(ps491==0))" | (!"((ps46==0)||(ps405==0))" & XF!"((ps274==1)&&(ps446==1))"))
Detected timeout of ITS tools.
[2024-05-27 20:36:29] [INFO ] Flatten gal took : 683 ms
[2024-05-27 20:36:29] [INFO ] Applying decomposition
[2024-05-27 20:36:29] [INFO ] Flatten gal took : 791 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/graph11754517194306425604.txt' '-o' '/tmp/graph11754517194306425604.bin' '-w' '/tmp/graph11754517194306425604.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11754517194306425604.bin' '-l' '-1' '-v' '-w' '/tmp/graph11754517194306425604.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:36:31] [INFO ] Decomposing Gal with order
[2024-05-27 20:36:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:36:35] [INFO ] Removed a total of 64251 redundant transitions.
[2024-05-27 20:36:35] [INFO ] Flatten gal took : 2679 ms
[2024-05-27 20:36:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 2136 labels/synchronizations in 788 ms.
[2024-05-27 20:36:37] [INFO ] Time to serialize gal into /tmp/LTL12055382970098760860.gal : 53 ms
[2024-05-27 20:36:37] [INFO ] Time to serialize properties into /tmp/LTL15156898788862347161.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/LTL12055382970098760860.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15156898788862347161.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...256
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i0.i1.u46.ps318==0)||(i7.u106.ps491==0))")&&(("((i4.i1.u80.ps46==0)||(i4.i0.u20.ps405==0))")||(X(G("((i0.i0.u0.ps274==1)&&(...184
Formula 0 simplified : GF(!"((i0.i1.u46.ps318==0)||(i7.u106.ps491==0))" | (!"((i4.i1.u80.ps46==0)||(i4.i0.u20.ps405==0))" & XF!"((i0.i0.u0.ps274==1)&&(i6.i...174
Reverse transition relation is NOT exact ! Due to transitions t215, t278, t610, t626, t642, t706, t723, t739, t1024, t1032, t1040, t1063, t1375, t1439, t14...1945
Computing Next relation with stutter on 6 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17347705479068567800
[2024-05-27 20:36:52] [INFO ] Built C files in 190ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17347705479068567800
Running compilation step : cd /tmp/ltsmin17347705479068567800;'/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/ltsmin17347705479068567800;'/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/ltsmin17347705479068567800;'/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 RERS2020-PT-pb103-LTLFireability-02 finished in 265563 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 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 240 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2024-05-27 20:36:55] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:36:55] [INFO ] Invariant cache hit.
[2024-05-27 20:36:56] [INFO ] Implicit Places using invariants in 846 ms returned []
Implicit Place search using SMT only with invariants took 847 ms to find 0 implicit places.
[2024-05-27 20:36:56] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:36:56] [INFO ] Invariant cache hit.
[2024-05-27 20:37:04] [INFO ] Dead Transitions using invariants and state equation in 8003 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9095 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-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:(AND (EQ s116 1) (EQ s364 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 38 steps with 0 reset in 3 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-03 finished in 9196 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)&&F(G(p1)))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 230 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2024-05-27 20:37:05] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:37:05] [INFO ] Invariant cache hit.
[2024-05-27 20:37:06] [INFO ] Implicit Places using invariants in 862 ms returned []
Implicit Place search using SMT only with invariants took 867 ms to find 0 implicit places.
[2024-05-27 20:37:06] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:37:06] [INFO ] Invariant cache hit.
[2024-05-27 20:37:14] [INFO ] Dead Transitions using invariants and state equation in 8191 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9304 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s327 0) (EQ s479 0)), p1:(OR (EQ s450 0) (EQ s493 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 2572 ms.
Product exploration explored 100000 steps with 1 reset in 1877 ms.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 113 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:37:19] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:37:19] [INFO ] Invariant cache hit.
[2024-05-27 20:37:19] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:37:23] [INFO ] After 3695ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:37:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:37:27] [INFO ] After 3800ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:37:27] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2024-05-27 20:37:34] [INFO ] After 7111ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:37:36] [INFO ] Deduced a trap composed of 49 places in 1414 ms of which 1 ms to minimize.
[2024-05-27 20:37:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 1734 ms
[2024-05-27 20:37:36] [INFO ] After 9132ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2024-05-27 20:37:36] [INFO ] After 13135ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (G p0)]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 140 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 510 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 115 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2024-05-27 20:37:36] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:37:36] [INFO ] Invariant cache hit.
[2024-05-27 20:37:37] [INFO ] Implicit Places using invariants in 789 ms returned []
Implicit Place search using SMT only with invariants took 804 ms to find 0 implicit places.
[2024-05-27 20:37:37] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:37:37] [INFO ] Invariant cache hit.
[2024-05-27 20:37:46] [INFO ] Dead Transitions using invariants and state equation in 8537 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9469 ms. Remains : 510/510 places, 28438/28438 transitions.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Finished Best-First random walk after 433 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=144 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 2236 ms.
Product exploration explored 100000 steps with 0 reset in 2321 ms.
Built C files in :
/tmp/ltsmin16544364763259459065
[2024-05-27 20:37:51] [INFO ] Too many transitions (28438) to apply POR reductions. Disabling POR matrices.
[2024-05-27 20:37:51] [INFO ] Built C files in 176ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16544364763259459065
Running compilation step : cd /tmp/ltsmin16544364763259459065;'/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/ltsmin16544364763259459065;'/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/ltsmin16544364763259459065;'/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 2 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 103 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2024-05-27 20:37:54] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:37:54] [INFO ] Invariant cache hit.
[2024-05-27 20:37:55] [INFO ] Implicit Places using invariants in 757 ms returned []
Implicit Place search using SMT only with invariants took 768 ms to find 0 implicit places.
[2024-05-27 20:37:55] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:37:55] [INFO ] Invariant cache hit.
[2024-05-27 20:38:04] [INFO ] Dead Transitions using invariants and state equation in 8542 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9416 ms. Remains : 510/510 places, 28438/28438 transitions.
Built C files in :
/tmp/ltsmin1998274803702365225
[2024-05-27 20:38:04] [INFO ] Too many transitions (28438) to apply POR reductions. Disabling POR matrices.
[2024-05-27 20:38:04] [INFO ] Built C files in 167ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1998274803702365225
Running compilation step : cd /tmp/ltsmin1998274803702365225;'/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/ltsmin1998274803702365225;'/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/ltsmin1998274803702365225;'/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-27 20:38:08] [INFO ] Flatten gal took : 667 ms
[2024-05-27 20:38:09] [INFO ] Flatten gal took : 690 ms
[2024-05-27 20:38:09] [INFO ] Time to serialize gal into /tmp/LTL16551458682832482468.gal : 98 ms
[2024-05-27 20:38:09] [INFO ] Time to serialize properties into /tmp/LTL16873529838102189949.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16551458682832482468.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8786809825595794491.hoa' '-atoms' '/tmp/LTL16873529838102189949.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...319
Loading property file /tmp/LTL16873529838102189949.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8786809825595794491.hoa
Detected timeout of ITS tools.
[2024-05-27 20:38:25] [INFO ] Flatten gal took : 1030 ms
[2024-05-27 20:38:26] [INFO ] Flatten gal took : 726 ms
[2024-05-27 20:38:26] [INFO ] Time to serialize gal into /tmp/LTL649729065372024372.gal : 103 ms
[2024-05-27 20:38:26] [INFO ] Time to serialize properties into /tmp/LTL11760831038178768563.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/LTL649729065372024372.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11760831038178768563.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...275
Read 1 LTL properties
Checking formula 0 : !((G((F("((ps241==0)||(ps456==0))"))&&(F(G("((ps104==0)||(ps32==0))"))))))
Formula 0 simplified : F(G!"((ps241==0)||(ps456==0))" | GF!"((ps104==0)||(ps32==0))")
Detected timeout of ITS tools.
[2024-05-27 20:38:42] [INFO ] Flatten gal took : 699 ms
[2024-05-27 20:38:42] [INFO ] Applying decomposition
[2024-05-27 20:38:43] [INFO ] Flatten gal took : 651 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/graph16037726494093662682.txt' '-o' '/tmp/graph16037726494093662682.bin' '-w' '/tmp/graph16037726494093662682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16037726494093662682.bin' '-l' '-1' '-v' '-w' '/tmp/graph16037726494093662682.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:38:44] [INFO ] Decomposing Gal with order
[2024-05-27 20:38:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:38:45] [INFO ] Removed a total of 64258 redundant transitions.
[2024-05-27 20:38:46] [INFO ] Flatten gal took : 1204 ms
[2024-05-27 20:38:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 2423 labels/synchronizations in 566 ms.
[2024-05-27 20:38:47] [INFO ] Time to serialize gal into /tmp/LTL5463446406308328350.gal : 41 ms
[2024-05-27 20:38:47] [INFO ] Time to serialize properties into /tmp/LTL14294241092677051131.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/LTL5463446406308328350.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14294241092677051131.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 : !((G((F("((i0.u20.ps241==0)||(i5.i1.u118.ps456==0))"))&&(F(G("((i7.i1.u99.ps104==0)||(i2.i2.u115.ps32==0))"))))))
Formula 0 simplified : F(G!"((i0.u20.ps241==0)||(i5.i1.u118.ps456==0))" | GF!"((i7.i1.u99.ps104==0)||(i2.i2.u115.ps32==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7828225419957686825
[2024-05-27 20:39:02] [INFO ] Built C files in 158ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7828225419957686825
Running compilation step : cd /tmp/ltsmin7828225419957686825;'/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/ltsmin7828225419957686825;'/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/ltsmin7828225419957686825;'/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 RERS2020-PT-pb103-LTLFireability-04 finished in 120384 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((G((X(X(X(!p1)))&&p0))||X(!p2))) U p1))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 38 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2024-05-27 20:39:05] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2024-05-27 20:39:05] [INFO ] Computed 8 invariants in 54 ms
[2024-05-27 20:39:06] [INFO ] Implicit Places using invariants in 843 ms returned []
Implicit Place search using SMT only with invariants took 844 ms to find 0 implicit places.
[2024-05-27 20:39:06] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:39:06] [INFO ] Invariant cache hit.
[2024-05-27 20:39:14] [INFO ] Dead Transitions using invariants and state equation in 8679 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9565 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), p2, (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2)), true, (OR p1 (AND (NOT p0) (NOT p2))), p1]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(OR p0 p2), acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 4}]], initial=0, aps=[p1:(AND (EQ s36 1) (EQ s86 1)), p0:(AND (EQ s36 1) (EQ s86 1)), p2:(AND (EQ s272 1) (EQ s409 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28621 reset in 3478 ms.
Product exploration explored 100000 steps with 28598 reset in 3319 ms.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (OR p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 211 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[(NOT p1), p2, (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2)), true, (OR p1 (AND (NOT p0) (NOT p2))), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 575 ms. (steps per millisecond=17 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 34401 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 34401 steps, saw 23617 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 10 properties.
[2024-05-27 20:39:26] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:39:26] [INFO ] Invariant cache hit.
[2024-05-27 20:39:27] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:39:32] [INFO ] After 5861ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2024-05-27 20:39:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:39:39] [INFO ] After 6652ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2024-05-27 20:39:39] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2024-05-27 20:39:50] [INFO ] After 10957ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :1 sat :9
[2024-05-27 20:39:53] [INFO ] Deduced a trap composed of 88 places in 2037 ms of which 0 ms to minimize.
[2024-05-27 20:39:55] [INFO ] Deduced a trap composed of 14 places in 1904 ms of which 1 ms to minimize.
[2024-05-27 20:39:57] [INFO ] Deduced a trap composed of 102 places in 1647 ms of which 0 ms to minimize.
[2024-05-27 20:39:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 6601 ms
[2024-05-27 20:39:57] [INFO ] After 18062ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :6
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-27 20:39:57] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :6
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1180 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1181 place count 497 transition count 27456
Applied a total of 1181 rules in 670 ms. Remains 497 /513 variables (removed 16) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 671 ms. Remains : 497/513 places, 27456/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 35355 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35355 steps, saw 25149 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 7 properties.
[2024-05-27 20:40:02] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:40:02] [INFO ] Computed 8 invariants in 73 ms
[2024-05-27 20:40:02] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:40:07] [INFO ] After 5021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-27 20:40:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:40:14] [INFO ] After 6056ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-27 20:40:14] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-05-27 20:40:22] [INFO ] After 8589ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-27 20:40:24] [INFO ] Deduced a trap composed of 51 places in 1798 ms of which 0 ms to minimize.
[2024-05-27 20:40:26] [INFO ] Deduced a trap composed of 68 places in 1163 ms of which 1 ms to minimize.
[2024-05-27 20:40:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 3597 ms
[2024-05-27 20:40:28] [INFO ] Deduced a trap composed of 13 places in 1055 ms of which 1 ms to minimize.
[2024-05-27 20:40:29] [INFO ] Deduced a trap composed of 101 places in 978 ms of which 1 ms to minimize.
[2024-05-27 20:40:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 2659 ms
[2024-05-27 20:40:29] [INFO ] After 15755ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :0
[2024-05-27 20:40:29] [INFO ] After 22118ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 10 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (OR p0 p2)))), (G (NOT p0)), (G (NOT p2)), (G (NOT (AND p0 p2))), (G (NOT (AND (NOT p0) p2))), (G (NOT p1)), (G (NOT (AND p0 (NOT p1)))), (G (AND (NOT p0) (NOT p1))), (G (NOT (AND p0 (NOT p2)))), (G (AND (NOT p0) (NOT p2))), (G (NOT (OR p0 p2)))]
False Knowledge obtained : []
Property proved to be false thanks to knowledge (Minato strategy)
Knowledge based reduction with 29 factoid took 17 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb103-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb103-LTLFireability-05 finished in 84644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!p0)) U ((p1||X(p2)) U p2)))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 32 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2024-05-27 20:40:29] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2024-05-27 20:40:30] [INFO ] Computed 8 invariants in 55 ms
[2024-05-27 20:40:30] [INFO ] Implicit Places using invariants in 840 ms returned []
Implicit Place search using SMT only with invariants took 848 ms to find 0 implicit places.
[2024-05-27 20:40:30] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:40:30] [INFO ] Invariant cache hit.
[2024-05-27 20:40:39] [INFO ] Dead Transitions using invariants and state equation in 8854 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9743 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 284 ms :[(NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2)), true, p0, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s240 1) (EQ s348 1)), p1:(AND (EQ s120 1) (EQ s296 1)), p0:(AND (EQ s47 1) (EQ s202 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2358 ms.
Product exploration explored 100000 steps with 0 reset in 2433 ms.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 207 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[true, p0, (OR (NOT p2) p0), (OR (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 32483 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 32483 steps, saw 22327 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-27 20:40:48] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:40:48] [INFO ] Invariant cache hit.
[2024-05-27 20:40:49] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:40:53] [INFO ] After 4345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:40:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:40:57] [INFO ] After 4492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 20:40:58] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2024-05-27 20:41:06] [INFO ] After 8052ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 20:41:09] [INFO ] Deduced a trap composed of 50 places in 2175 ms of which 1 ms to minimize.
[2024-05-27 20:41:11] [INFO ] Deduced a trap composed of 73 places in 2296 ms of which 2 ms to minimize.
[2024-05-27 20:41:14] [INFO ] Deduced a trap composed of 59 places in 2147 ms of which 1 ms to minimize.
[2024-05-27 20:41:16] [INFO ] Deduced a trap composed of 155 places in 1930 ms of which 1 ms to minimize.
[2024-05-27 20:41:19] [INFO ] Deduced a trap composed of 102 places in 1981 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 20:41:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:41:19] [INFO ] After 25873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 498 transition count 27276
Applied a total of 1179 rules in 517 ms. Remains 498 /513 variables (removed 15) and now considering 27276/28429 (removed 1153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 518 ms. Remains : 498/513 places, 27276/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 34695 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 34695 steps, saw 24709 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-27 20:41:23] [INFO ] Flow matrix only has 18595 transitions (discarded 8681 similar events)
// Phase 1: matrix 18595 rows 498 cols
[2024-05-27 20:41:23] [INFO ] Computed 8 invariants in 61 ms
[2024-05-27 20:41:23] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-05-27 20:41:27] [INFO ] After 4473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:41:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-27 20:41:32] [INFO ] After 4389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 20:41:32] [INFO ] State equation strengthened by 1369 read => feed constraints.
[2024-05-27 20:41:41] [INFO ] After 9013ms SMT Verify possible using 1369 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 20:41:45] [INFO ] Deduced a trap composed of 33 places in 1972 ms of which 0 ms to minimize.
[2024-05-27 20:41:47] [INFO ] Deduced a trap composed of 49 places in 1504 ms of which 0 ms to minimize.
[2024-05-27 20:41:49] [INFO ] Deduced a trap composed of 101 places in 1608 ms of which 1 ms to minimize.
[2024-05-27 20:41:51] [INFO ] Deduced a trap composed of 147 places in 1493 ms of which 1 ms to minimize.
[2024-05-27 20:41:53] [INFO ] Deduced a trap composed of 19 places in 1548 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 20:41:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:41:53] [INFO ] After 25844ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27276/27276 transitions.
Applied a total of 0 rules in 109 ms. Remains 498 /498 variables (removed 0) and now considering 27276/27276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 498/498 places, 27276/27276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27276/27276 transitions.
Applied a total of 0 rules in 108 ms. Remains 498 /498 variables (removed 0) and now considering 27276/27276 (removed 0) transitions.
[2024-05-27 20:41:53] [INFO ] Flow matrix only has 18595 transitions (discarded 8681 similar events)
[2024-05-27 20:41:53] [INFO ] Invariant cache hit.
[2024-05-27 20:41:54] [INFO ] Implicit Places using invariants in 916 ms returned []
Implicit Place search using SMT only with invariants took 932 ms to find 0 implicit places.
[2024-05-27 20:41:54] [INFO ] Flow matrix only has 18595 transitions (discarded 8681 similar events)
[2024-05-27 20:41:54] [INFO ] Invariant cache hit.
[2024-05-27 20:42:03] [INFO ] Dead Transitions using invariants and state equation in 8248 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9292 ms. Remains : 498/498 places, 27276/27276 transitions.
Graph (trivial) has 10133 edges and 498 vertex of which 376 / 498 are part of one of the 62 SCC in 1 ms
Free SCC test removed 314 places
Drop transitions removed 11058 transitions
Ensure Unique test removed 13766 transitions
Reduce isomorphic transitions removed 24824 transitions.
Graph (complete) has 2500 edges and 184 vertex of which 176 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 176 transition count 2438
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 174 transition count 2438
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 173 transition count 2424
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 173 transition count 2424
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 171 transition count 2422
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 35 place count 171 transition count 2411
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 37 place count 170 transition count 2421
Drop transitions removed 1300 transitions
Redundant transition composition rules discarded 1300 transitions
Iterating global reduction 3 with 1300 rules applied. Total rules applied 1337 place count 170 transition count 1121
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1294 edges and 168 vertex of which 149 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1348 place count 149 transition count 1110
Drop transitions removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Iterating post reduction 4 with 114 rules applied. Total rules applied 1462 place count 149 transition count 996
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1464 place count 147 transition count 986
Iterating global reduction 5 with 2 rules applied. Total rules applied 1466 place count 147 transition count 986
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1467 place count 147 transition count 985
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 6 with 2 rules applied. Total rules applied 1469 place count 146 transition count 984
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1474 place count 146 transition count 979
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1486 place count 146 transition count 960
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1518 place count 134 transition count 940
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1519 place count 133 transition count 938
Iterating global reduction 7 with 1 rules applied. Total rules applied 1520 place count 133 transition count 938
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1528 place count 133 transition count 930
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 8 with 62 rules applied. Total rules applied 1590 place count 133 transition count 868
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1596 place count 133 transition count 862
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1606 place count 127 transition count 858
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1612 place count 127 transition count 852
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1614 place count 127 transition count 850
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1618 place count 125 transition count 848
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1622 place count 125 transition count 844
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1624 place count 125 transition count 842
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1628 place count 123 transition count 840
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1630 place count 123 transition count 838
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1634 place count 123 transition count 931
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 1643 place count 119 transition count 926
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1644 place count 118 transition count 922
Iterating global reduction 12 with 1 rules applied. Total rules applied 1645 place count 118 transition count 922
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1654 place count 118 transition count 913
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 13 with 23 rules applied. Total rules applied 1677 place count 118 transition count 890
Applied a total of 1677 rules in 218 ms. Remains 118 /498 variables (removed 380) and now considering 890/27276 (removed 26386) transitions.
Running SMT prover for 3 properties.
[2024-05-27 20:42:03] [INFO ] Flow matrix only has 852 transitions (discarded 38 similar events)
// Phase 1: matrix 852 rows 118 cols
[2024-05-27 20:42:03] [INFO ] Computed 0 invariants in 3 ms
[2024-05-27 20:42:03] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:42:03] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 20:42:03] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-27 20:42:03] [INFO ] After 76ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 20:42:04] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 70 ms.
[2024-05-27 20:42:04] [INFO ] After 486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 131 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[true, p0, (OR (NOT p2) p0), (OR (NOT p2) p0)]
Stuttering acceptance computed with spot in 134 ms :[true, p0, (OR (NOT p2) p0), (OR (NOT p2) p0)]
[2024-05-27 20:42:04] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2024-05-27 20:42:04] [INFO ] Computed 8 invariants in 56 ms
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 15 factoid took 178 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb103-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb103-LTLFireability-06 finished in 109340 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 5 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 241 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2024-05-27 20:42:19] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2024-05-27 20:42:19] [INFO ] Computed 8 invariants in 59 ms
[2024-05-27 20:42:20] [INFO ] Implicit Places using invariants in 825 ms returned []
Implicit Place search using SMT only with invariants took 839 ms to find 0 implicit places.
[2024-05-27 20:42:20] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:42:20] [INFO ] Invariant cache hit.
[2024-05-27 20:42:28] [INFO ] Dead Transitions using invariants and state equation in 8345 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9439 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s32 0) (EQ s148 0)) (OR (EQ s388 0) (EQ s469 0)) (OR (EQ s32 0) (EQ s92 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 0 reset in 1927 ms.
Product exploration explored 100000 steps with 0 reset in 2447 ms.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 38002 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 38002 steps, saw 25904 distinct states, run finished after 3004 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:42:36] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:42:36] [INFO ] Invariant cache hit.
[2024-05-27 20:42:36] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-27 20:42:36] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:42:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:42:40] [INFO ] After 3963ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:42:41] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2024-05-27 20:42:48] [INFO ] After 7901ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:42:52] [INFO ] Deduced a trap composed of 72 places in 1770 ms of which 1 ms to minimize.
[2024-05-27 20:42:54] [INFO ] Deduced a trap composed of 117 places in 1657 ms of which 0 ms to minimize.
[2024-05-27 20:42:56] [INFO ] Deduced a trap composed of 84 places in 1840 ms of which 0 ms to minimize.
[2024-05-27 20:42:58] [INFO ] Deduced a trap composed of 30 places in 1817 ms of which 17 ms to minimize.
[2024-05-27 20:43:01] [INFO ] Deduced a trap composed of 119 places in 1653 ms of which 1 ms to minimize.
[2024-05-27 20:43:03] [INFO ] Deduced a trap composed of 84 places in 1713 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 20:43:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:43:03] [INFO ] After 26411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 510 transition count 27376
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 510 transition count 27364
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 497 transition count 27456
Applied a total of 1176 rules in 409 ms. Remains 497 /510 variables (removed 13) and now considering 27456/28438 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 410 ms. Remains : 497/510 places, 27456/28438 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 38282 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 38282 steps, saw 27094 distinct states, run finished after 3002 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:43:06] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:43:07] [INFO ] Computed 8 invariants in 52 ms
[2024-05-27 20:43:07] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:43:07] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:43:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-27 20:43:10] [INFO ] After 3534ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:43:10] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-05-27 20:43:19] [INFO ] After 9009ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:43:22] [INFO ] Deduced a trap composed of 13 places in 1680 ms of which 1 ms to minimize.
[2024-05-27 20:43:24] [INFO ] Deduced a trap composed of 12 places in 1707 ms of which 0 ms to minimize.
[2024-05-27 20:43:27] [INFO ] Deduced a trap composed of 72 places in 1689 ms of which 2 ms to minimize.
[2024-05-27 20:43:31] [INFO ] Deduced a trap composed of 60 places in 1456 ms of which 5 ms to minimize.
[2024-05-27 20:43:33] [INFO ] Deduced a trap composed of 139 places in 1635 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 20:43:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:43:33] [INFO ] After 26185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 96 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 96 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2024-05-27 20:43:33] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:43:33] [INFO ] Invariant cache hit.
[2024-05-27 20:43:34] [INFO ] Implicit Places using invariants in 948 ms returned []
Implicit Place search using SMT only with invariants took 963 ms to find 0 implicit places.
[2024-05-27 20:43:34] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:43:34] [INFO ] Invariant cache hit.
[2024-05-27 20:43:42] [INFO ] Dead Transitions using invariants and state equation in 8435 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9510 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10153 edges and 497 vertex of which 376 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 314 places
Drop transitions removed 10777 transitions
Ensure Unique test removed 14072 transitions
Reduce isomorphic transitions removed 24849 transitions.
Graph (complete) has 2519 edges and 183 vertex of which 175 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 175 transition count 2593
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 173 transition count 2593
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 22 place count 171 transition count 2591
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 171 transition count 2558
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 57 place count 170 transition count 2568
Drop transitions removed 1384 transitions
Redundant transition composition rules discarded 1384 transitions
Iterating global reduction 3 with 1384 rules applied. Total rules applied 1441 place count 170 transition count 1184
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1384 edges and 168 vertex of which 150 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1452 place count 150 transition count 1174
Drop transitions removed 109 transitions
Reduce isomorphic transitions removed 109 transitions.
Iterating post reduction 4 with 109 rules applied. Total rules applied 1561 place count 150 transition count 1065
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1563 place count 148 transition count 1055
Iterating global reduction 5 with 2 rules applied. Total rules applied 1565 place count 148 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1566 place count 148 transition count 1054
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1569 place count 148 transition count 1051
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 1576 place count 148 transition count 1044
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1588 place count 141 transition count 1039
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 7 with 55 rules applied. Total rules applied 1643 place count 141 transition count 984
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1645 place count 141 transition count 982
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1647 place count 139 transition count 982
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 1660 place count 139 transition count 969
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1661 place count 139 transition count 968
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1662 place count 138 transition count 968
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1666 place count 138 transition count 1033
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 1687 place count 134 transition count 1016
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1688 place count 133 transition count 1012
Iterating global reduction 10 with 1 rules applied. Total rules applied 1689 place count 133 transition count 1012
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1698 place count 133 transition count 1003
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 11 with 13 rules applied. Total rules applied 1711 place count 133 transition count 990
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1713 place count 133 transition count 990
Applied a total of 1713 rules in 230 ms. Remains 133 /497 variables (removed 364) and now considering 990/27456 (removed 26466) transitions.
Running SMT prover for 1 properties.
[2024-05-27 20:43:43] [INFO ] Flow matrix only has 952 transitions (discarded 38 similar events)
// Phase 1: matrix 952 rows 133 cols
[2024-05-27 20:43:43] [INFO ] Computed 0 invariants in 4 ms
[2024-05-27 20:43:43] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:43:43] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:43:43] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-27 20:43:43] [INFO ] After 35ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:43:43] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-27 20:43:43] [INFO ] After 319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 5 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 114 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2024-05-27 20:43:44] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2024-05-27 20:43:44] [INFO ] Computed 8 invariants in 56 ms
[2024-05-27 20:43:45] [INFO ] Implicit Places using invariants in 969 ms returned []
Implicit Place search using SMT only with invariants took 978 ms to find 0 implicit places.
[2024-05-27 20:43:45] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:43:45] [INFO ] Invariant cache hit.
[2024-05-27 20:43:53] [INFO ] Dead Transitions using invariants and state equation in 8544 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9665 ms. Remains : 510/510 places, 28438/28438 transitions.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 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 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Finished Best-First random walk after 6696 steps, including 2 resets, run visited all 1 properties in 17 ms. (steps per millisecond=393 )
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 97 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1758 ms.
Product exploration explored 100000 steps with 0 reset in 2358 ms.
Built C files in :
/tmp/ltsmin16877675430799024952
[2024-05-27 20:43:58] [INFO ] Too many transitions (28438) to apply POR reductions. Disabling POR matrices.
[2024-05-27 20:43:58] [INFO ] Built C files in 171ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16877675430799024952
Running compilation step : cd /tmp/ltsmin16877675430799024952;'/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/ltsmin16877675430799024952;'/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/ltsmin16877675430799024952;'/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 5 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 109 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2024-05-27 20:44:01] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:44:01] [INFO ] Invariant cache hit.
[2024-05-27 20:44:02] [INFO ] Implicit Places using invariants in 893 ms returned []
Implicit Place search using SMT only with invariants took 907 ms to find 0 implicit places.
[2024-05-27 20:44:02] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:44:02] [INFO ] Invariant cache hit.
[2024-05-27 20:44:11] [INFO ] Dead Transitions using invariants and state equation in 9092 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10130 ms. Remains : 510/510 places, 28438/28438 transitions.
Built C files in :
/tmp/ltsmin5595061470401484998
[2024-05-27 20:44:11] [INFO ] Too many transitions (28438) to apply POR reductions. Disabling POR matrices.
[2024-05-27 20:44:12] [INFO ] Built C files in 198ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5595061470401484998
Running compilation step : cd /tmp/ltsmin5595061470401484998;'/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/ltsmin5595061470401484998;'/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/ltsmin5595061470401484998;'/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-27 20:44:16] [INFO ] Flatten gal took : 690 ms
[2024-05-27 20:44:16] [INFO ] Flatten gal took : 704 ms
[2024-05-27 20:44:17] [INFO ] Time to serialize gal into /tmp/LTL16445980477472648625.gal : 99 ms
[2024-05-27 20:44:17] [INFO ] Time to serialize properties into /tmp/LTL17417055765530984680.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16445980477472648625.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2989197984463669613.hoa' '-atoms' '/tmp/LTL17417055765530984680.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...319
Loading property file /tmp/LTL17417055765530984680.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2989197984463669613.hoa
Detected timeout of ITS tools.
[2024-05-27 20:44:33] [INFO ] Flatten gal took : 665 ms
[2024-05-27 20:44:33] [INFO ] Flatten gal took : 694 ms
[2024-05-27 20:44:33] [INFO ] Time to serialize gal into /tmp/LTL14153806587873465430.gal : 98 ms
[2024-05-27 20:44:33] [INFO ] Time to serialize properties into /tmp/LTL12120918956083104654.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/LTL14153806587873465430.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12120918956083104654.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((((ps500==0)||(ps437==0))&&((ps446==0)||(ps224==0)))&&((ps500==0)||(ps351==0)))"))))
Formula 0 simplified : GF!"((((ps500==0)||(ps437==0))&&((ps446==0)||(ps224==0)))&&((ps500==0)||(ps351==0)))"
Detected timeout of ITS tools.
[2024-05-27 20:44:49] [INFO ] Flatten gal took : 690 ms
[2024-05-27 20:44:49] [INFO ] Applying decomposition
[2024-05-27 20:44:50] [INFO ] Flatten gal took : 702 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/graph12571883925049339137.txt' '-o' '/tmp/graph12571883925049339137.bin' '-w' '/tmp/graph12571883925049339137.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12571883925049339137.bin' '-l' '-1' '-v' '-w' '/tmp/graph12571883925049339137.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:44:51] [INFO ] Decomposing Gal with order
[2024-05-27 20:44:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:44:53] [INFO ] Removed a total of 64251 redundant transitions.
[2024-05-27 20:44:53] [INFO ] Flatten gal took : 1244 ms
[2024-05-27 20:44:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2331 labels/synchronizations in 604 ms.
[2024-05-27 20:44:54] [INFO ] Time to serialize gal into /tmp/LTL10530454814470022462.gal : 37 ms
[2024-05-27 20:44:54] [INFO ] Time to serialize properties into /tmp/LTL2531329528662143322.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/LTL10530454814470022462.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2531329528662143322.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("((((i6.u5.ps500==0)||(i3.i1.u108.ps437==0))&&((i6.u47.ps446==0)||(i1.i0.u109.ps224==0)))&&((i6.u5.ps500==0)||(i2.u23.ps351==0)...162
Formula 0 simplified : GF!"((((i6.u5.ps500==0)||(i3.i1.u108.ps437==0))&&((i6.u47.ps446==0)||(i1.i0.u109.ps224==0)))&&((i6.u5.ps500==0)||(i2.u23.ps351==0)))...156
Reverse transition relation is NOT exact ! Due to transitions t217, t280, t612, t628, t644, t708, t725, t741, t1025, t1033, t1041, t1064, t1377, t1441, t14...2255
Computing Next relation with stutter on 6 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16467975693121521590
[2024-05-27 20:45:09] [INFO ] Built C files in 159ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16467975693121521590
Running compilation step : cd /tmp/ltsmin16467975693121521590;'/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/ltsmin16467975693121521590;'/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/ltsmin16467975693121521590;'/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 RERS2020-PT-pb103-LTLFireability-07 finished in 173464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&(p1||X(G(p2))))))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 32 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2024-05-27 20:45:12] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2024-05-27 20:45:12] [INFO ] Computed 8 invariants in 47 ms
[2024-05-27 20:45:13] [INFO ] Implicit Places using invariants in 838 ms returned []
Implicit Place search using SMT only with invariants took 839 ms to find 0 implicit places.
[2024-05-27 20:45:13] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:45:13] [INFO ] Invariant cache hit.
[2024-05-27 20:45:22] [INFO ] Dead Transitions using invariants and state equation in 8624 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9500 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s60 0) (EQ s327 0)), p1:(AND (EQ s30 1) (EQ s146 1)), p2:(AND (EQ s331 1) (EQ s410 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-08 finished in 9671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||(X((!X(F(p0)) U p2))&&F(p3))))'
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 33 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2024-05-27 20:45:22] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:45:22] [INFO ] Invariant cache hit.
[2024-05-27 20:45:23] [INFO ] Implicit Places using invariants in 795 ms returned []
Implicit Place search using SMT only with invariants took 812 ms to find 0 implicit places.
[2024-05-27 20:45:23] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:45:23] [INFO ] Invariant cache hit.
[2024-05-27 20:45:32] [INFO ] Dead Transitions using invariants and state equation in 8860 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9717 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 440 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p3), (NOT p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) p0), true, p0, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1)]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=p0, acceptance={0} source=5 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 6}, { cond=(NOT p0), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=9 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(AND (EQ s107 1) (EQ s483 1)), p0:(AND (EQ s284 1) (EQ s293 1)), p3:(AND (EQ s238 1) (EQ s299 1)), p2:(AND (EQ s187 1) (EQ s476 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 2 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-09 finished in 10213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U X((X(X(p2))&&p1))))))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 34 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2024-05-27 20:45:32] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:45:32] [INFO ] Invariant cache hit.
[2024-05-27 20:45:33] [INFO ] Implicit Places using invariants in 765 ms returned []
Implicit Place search using SMT only with invariants took 768 ms to find 0 implicit places.
[2024-05-27 20:45:33] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:45:33] [INFO ] Invariant cache hit.
[2024-05-27 20:45:42] [INFO ] Dead Transitions using invariants and state equation in 8735 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9538 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 711 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 13}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 7}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 8}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 10}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 13}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 10}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 13}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=10 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=10 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=10 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=10 dest: 5}], [{ cond=(NOT p0), acceptance={} source=11 dest: 4}, { cond=p0, acceptance={} source=11 dest: 5}], [{ cond=true, acceptance={} source=12 dest: 11}], [{ cond=true, acceptance={0} source=13 dest: 13}], [{ cond=true, acceptance={} source=14 dest: 12}]], initial=14, aps=[p2:(AND (EQ s243 1) (EQ s512 1)), p1:(AND (EQ s218 1) (EQ s498 1)), p0:(AND (EQ s187 1) (EQ s399 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, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-10 finished in 10311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F((G(p1)||(F(p2)&&F(p1))))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 42 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2024-05-27 20:45:43] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:45:43] [INFO ] Invariant cache hit.
[2024-05-27 20:45:43] [INFO ] Implicit Places using invariants in 887 ms returned []
Implicit Place search using SMT only with invariants took 888 ms to find 0 implicit places.
[2024-05-27 20:45:43] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:45:43] [INFO ] Invariant cache hit.
[2024-05-27 20:45:52] [INFO ] Dead Transitions using invariants and state equation in 8900 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9843 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1), true]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s86 0) (EQ s271 0)), p1:(AND (EQ s86 1) (EQ s271 1)), p0:(AND (EQ s8 1) (EQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-11 finished in 10092 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(((p1 U p2)&&p0))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 34 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2024-05-27 20:45:53] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:45:53] [INFO ] Invariant cache hit.
[2024-05-27 20:45:53] [INFO ] Implicit Places using invariants in 776 ms returned []
Implicit Place search using SMT only with invariants took 792 ms to find 0 implicit places.
[2024-05-27 20:45:53] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:45:53] [INFO ] Invariant cache hit.
[2024-05-27 20:46:02] [INFO ] Dead Transitions using invariants and state equation in 8292 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9121 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s4 1) (EQ s155 1)), p1:(AND (EQ s136 1) (EQ s350 1)), p0:(AND (EQ s136 1) (EQ s350 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]]
Stuttering criterion allowed to conclude after 82 steps with 0 reset in 3 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-12 finished in 9322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||(X(p3)&&p2)||p0)))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 33 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2024-05-27 20:46:02] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:46:02] [INFO ] Invariant cache hit.
[2024-05-27 20:46:03] [INFO ] Implicit Places using invariants in 863 ms returned []
Implicit Place search using SMT only with invariants took 868 ms to find 0 implicit places.
[2024-05-27 20:46:03] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:46:03] [INFO ] Invariant cache hit.
[2024-05-27 20:46:12] [INFO ] Dead Transitions using invariants and state equation in 8766 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9671 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2) p1) (AND (NOT p0) (NOT p2) p3)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2 p1) (AND (NOT p0) p2 p3)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p0 p1) (AND p0 p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(AND (EQ s48 1) (EQ s149 1)), p0:(OR (EQ s48 0) (EQ s149 0)), p2:(AND (EQ s48 1) (EQ s149 1)), p3:(AND (EQ s147 1) (EQ s344 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3078 ms.
Product exploration explored 100000 steps with 0 reset in 3070 ms.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 566 ms. (steps per millisecond=17 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 33950 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33950 steps, saw 23303 distinct states, run finished after 3003 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 11 properties.
[2024-05-27 20:46:23] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:46:23] [INFO ] Invariant cache hit.
[2024-05-27 20:46:23] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-27 20:46:28] [INFO ] After 4546ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:7
[2024-05-27 20:46:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-27 20:46:34] [INFO ] After 6381ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :7
[2024-05-27 20:46:34] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2024-05-27 20:46:44] [INFO ] After 9701ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :4 sat :7
[2024-05-27 20:46:47] [INFO ] Deduced a trap composed of 49 places in 2183 ms of which 1 ms to minimize.
[2024-05-27 20:46:49] [INFO ] Deduced a trap composed of 53 places in 1896 ms of which 0 ms to minimize.
[2024-05-27 20:46:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 4764 ms
[2024-05-27 20:46:52] [INFO ] Deduced a trap composed of 161 places in 2289 ms of which 1 ms to minimize.
[2024-05-27 20:46:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 2630 ms
[2024-05-27 20:46:52] [INFO ] After 17735ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :0
[2024-05-27 20:46:52] [INFO ] After 24438ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :0
Fused 11 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 11 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (G (AND (NOT p1) (NOT p3))), (G (NOT (AND p1 p0))), (G (NOT (OR (AND p1 p2 (NOT p0)) (AND p2 (NOT p0) p3)))), (G (NOT (OR (AND p1 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p3)))), (G (NOT p1)), (G (NOT (AND p1 p2 (NOT p0)))), (G (NOT (AND p1 (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p0)))), (G p0), (G (NOT (OR (AND p1 p0) (AND p0 p3)))), (G (NOT (AND p2 (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 16 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb103-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb103-LTLFireability-13 finished in 50279 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(p1)&&p0)))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 41 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2024-05-27 20:46:52] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:46:52] [INFO ] Invariant cache hit.
[2024-05-27 20:46:53] [INFO ] Implicit Places using invariants in 882 ms returned []
Implicit Place search using SMT only with invariants took 894 ms to find 0 implicit places.
[2024-05-27 20:46:53] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:46:53] [INFO ] Invariant cache hit.
[2024-05-27 20:47:02] [INFO ] Dead Transitions using invariants and state equation in 8828 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9767 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s358 0) (EQ s444 0)), p0:(AND (OR (EQ s358 0) (EQ s444 0)) (OR (EQ s46 0) (EQ s90 0)) (OR (EQ s481 0) (EQ s498 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][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2870 ms.
Product exploration explored 100000 steps with 0 reset in 2519 ms.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 37804 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37804 steps, saw 25778 distinct states, run finished after 3004 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:47:11] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:47:11] [INFO ] Invariant cache hit.
[2024-05-27 20:47:11] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-27 20:47:15] [INFO ] After 4025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:47:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:47:19] [INFO ] After 3920ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:47:19] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2024-05-27 20:47:25] [INFO ] After 5903ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:47:28] [INFO ] Deduced a trap composed of 96 places in 1733 ms of which 0 ms to minimize.
[2024-05-27 20:47:30] [INFO ] Deduced a trap composed of 61 places in 2010 ms of which 1 ms to minimize.
[2024-05-27 20:47:32] [INFO ] Deduced a trap composed of 50 places in 1851 ms of which 0 ms to minimize.
[2024-05-27 20:47:35] [INFO ] Deduced a trap composed of 155 places in 1899 ms of which 1 ms to minimize.
[2024-05-27 20:47:37] [INFO ] Deduced a trap composed of 22 places in 2249 ms of which 1 ms to minimize.
[2024-05-27 20:47:40] [INFO ] Deduced a trap composed of 135 places in 2258 ms of which 2 ms to minimize.
[2024-05-27 20:47:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 14270 ms
[2024-05-27 20:47:40] [INFO ] After 20659ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2024-05-27 20:47:40] [INFO ] After 24814ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X p1)), (G p1)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 26 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb103-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb103-LTLFireability-14 finished in 47965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 512 transition count 28428
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 511 transition count 28439
Applied a total of 4 rules in 270 ms. Remains 511 /513 variables (removed 2) and now considering 28439/28429 (removed -10) transitions.
[2024-05-27 20:47:40] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
// Phase 1: matrix 18683 rows 511 cols
[2024-05-27 20:47:40] [INFO ] Computed 8 invariants in 66 ms
[2024-05-27 20:47:41] [INFO ] Implicit Places using invariants in 919 ms returned []
Implicit Place search using SMT only with invariants took 923 ms to find 0 implicit places.
[2024-05-27 20:47:41] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
[2024-05-27 20:47:41] [INFO ] Invariant cache hit.
[2024-05-27 20:47:49] [INFO ] Dead Transitions using invariants and state equation in 8108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 511/513 places, 28439/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9304 ms. Remains : 511/513 places, 28439/28429 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s349 1) (EQ s426 1)), p1:(OR (EQ s150 0) (EQ s322 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2542 ms.
Product exploration explored 100000 steps with 0 reset in 2565 ms.
Computed a total of 119 stabilizing places and 10296 stable transitions
Computed a total of 119 stabilizing places and 10296 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 85 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 35214 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35214 steps, saw 24141 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-27 20:47:59] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
[2024-05-27 20:47:59] [INFO ] Invariant cache hit.
[2024-05-27 20:47:59] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-27 20:48:03] [INFO ] After 4324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-27 20:48:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-27 20:48:08] [INFO ] After 4977ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-27 20:48:08] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2024-05-27 20:48:14] [INFO ] After 5947ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-27 20:48:16] [INFO ] Deduced a trap composed of 44 places in 1754 ms of which 0 ms to minimize.
[2024-05-27 20:48:19] [INFO ] Deduced a trap composed of 73 places in 1623 ms of which 1 ms to minimize.
[2024-05-27 20:48:21] [INFO ] Deduced a trap composed of 61 places in 1624 ms of which 1 ms to minimize.
[2024-05-27 20:48:23] [INFO ] Deduced a trap composed of 31 places in 1560 ms of which 1 ms to minimize.
[2024-05-27 20:48:24] [INFO ] Deduced a trap composed of 84 places in 1615 ms of which 11 ms to minimize.
[2024-05-27 20:48:26] [INFO ] Deduced a trap composed of 96 places in 1356 ms of which 0 ms to minimize.
[2024-05-27 20:48:28] [INFO ] Deduced a trap composed of 69 places in 1834 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 20:48:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:48:28] [INFO ] After 25504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 28439/28439 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 498 transition count 27457
Applied a total of 1176 rules in 485 ms. Remains 498 /511 variables (removed 13) and now considering 27457/28439 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 486 ms. Remains : 498/511 places, 27457/28439 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 685 ms. (steps per millisecond=14 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 35448 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35448 steps, saw 25198 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-27 20:48:33] [INFO ] Flow matrix only has 18728 transitions (discarded 8729 similar events)
// Phase 1: matrix 18728 rows 498 cols
[2024-05-27 20:48:33] [INFO ] Computed 8 invariants in 53 ms
[2024-05-27 20:48:33] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:48:37] [INFO ] After 4450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-27 20:48:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:48:43] [INFO ] After 5208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-27 20:48:43] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-05-27 20:48:52] [INFO ] After 9104ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-27 20:48:54] [INFO ] Deduced a trap composed of 48 places in 1696 ms of which 4 ms to minimize.
[2024-05-27 20:48:56] [INFO ] Deduced a trap composed of 20 places in 1510 ms of which 1 ms to minimize.
[2024-05-27 20:48:58] [INFO ] Deduced a trap composed of 50 places in 1562 ms of which 0 ms to minimize.
[2024-05-27 20:49:00] [INFO ] Deduced a trap composed of 73 places in 1045 ms of which 1 ms to minimize.
[2024-05-27 20:49:01] [INFO ] Deduced a trap composed of 93 places in 1260 ms of which 0 ms to minimize.
[2024-05-27 20:49:04] [INFO ] Deduced a trap composed of 102 places in 1938 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 20:49:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:49:04] [INFO ] After 26294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27457/27457 transitions.
Applied a total of 0 rules in 109 ms. Remains 498 /498 variables (removed 0) and now considering 27457/27457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 498/498 places, 27457/27457 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27457/27457 transitions.
Applied a total of 0 rules in 120 ms. Remains 498 /498 variables (removed 0) and now considering 27457/27457 (removed 0) transitions.
[2024-05-27 20:49:04] [INFO ] Flow matrix only has 18728 transitions (discarded 8729 similar events)
[2024-05-27 20:49:04] [INFO ] Invariant cache hit.
[2024-05-27 20:49:05] [INFO ] Implicit Places using invariants in 939 ms returned []
Implicit Place search using SMT only with invariants took 959 ms to find 0 implicit places.
[2024-05-27 20:49:05] [INFO ] Flow matrix only has 18728 transitions (discarded 8729 similar events)
[2024-05-27 20:49:05] [INFO ] Invariant cache hit.
[2024-05-27 20:49:14] [INFO ] Dead Transitions using invariants and state equation in 8700 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9798 ms. Remains : 498/498 places, 27457/27457 transitions.
Graph (trivial) has 10049 edges and 498 vertex of which 377 / 498 are part of one of the 61 SCC in 1 ms
Free SCC test removed 316 places
Drop transitions removed 11111 transitions
Ensure Unique test removed 13707 transitions
Reduce isomorphic transitions removed 24818 transitions.
Graph (complete) has 2436 edges and 182 vertex of which 174 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 174 transition count 2626
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 172 transition count 2626
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 170 transition count 2606
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 170 transition count 2606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 170 transition count 2605
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 24 place count 169 transition count 2604
Drop transitions removed 1442 transitions
Redundant transition composition rules discarded 1442 transitions
Iterating global reduction 3 with 1442 rules applied. Total rules applied 1466 place count 169 transition count 1162
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1430 edges and 168 vertex of which 153 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 4 rules applied. Total rules applied 1470 place count 153 transition count 1158
Drop transitions removed 52 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 53 rules applied. Total rules applied 1523 place count 153 transition count 1105
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1524 place count 152 transition count 1100
Iterating global reduction 5 with 1 rules applied. Total rules applied 1525 place count 152 transition count 1100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1529 place count 150 transition count 1098
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 1540 place count 150 transition count 1087
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1552 place count 150 transition count 1068
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1574 place count 138 transition count 1058
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1575 place count 137 transition count 1053
Iterating global reduction 6 with 1 rules applied. Total rules applied 1576 place count 137 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1577 place count 137 transition count 1052
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 7 with 57 rules applied. Total rules applied 1634 place count 137 transition count 995
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1640 place count 137 transition count 989
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1650 place count 131 transition count 985
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1656 place count 131 transition count 979
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1658 place count 131 transition count 977
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1662 place count 129 transition count 975
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1666 place count 129 transition count 971
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1668 place count 129 transition count 969
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1672 place count 127 transition count 967
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1674 place count 127 transition count 965
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 1677 place count 127 transition count 1047
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1691 place count 124 transition count 1036
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 11 with 19 rules applied. Total rules applied 1710 place count 124 transition count 1017
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 1715 place count 124 transition count 1017
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1718 place count 124 transition count 1014
Applied a total of 1718 rules in 395 ms. Remains 124 /498 variables (removed 374) and now considering 1014/27457 (removed 26443) transitions.
Running SMT prover for 4 properties.
[2024-05-27 20:49:14] [INFO ] Flow matrix only has 979 transitions (discarded 35 similar events)
// Phase 1: matrix 979 rows 124 cols
[2024-05-27 20:49:14] [INFO ] Computed 0 invariants in 3 ms
[2024-05-27 20:49:14] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-27 20:49:15] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-27 20:49:15] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-27 20:49:15] [INFO ] After 194ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-27 20:49:15] [INFO ] After 451ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 218 ms.
[2024-05-27 20:49:15] [INFO ] After 1033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 104 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 28439/28439 transitions.
Applied a total of 0 rules in 109 ms. Remains 511 /511 variables (removed 0) and now considering 28439/28439 (removed 0) transitions.
[2024-05-27 20:49:16] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
// Phase 1: matrix 18683 rows 511 cols
[2024-05-27 20:49:16] [INFO ] Computed 8 invariants in 60 ms
[2024-05-27 20:49:17] [INFO ] Implicit Places using invariants in 846 ms returned []
Implicit Place search using SMT only with invariants took 860 ms to find 0 implicit places.
[2024-05-27 20:49:17] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
[2024-05-27 20:49:17] [INFO ] Invariant cache hit.
[2024-05-27 20:49:26] [INFO ] Dead Transitions using invariants and state equation in 9040 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10026 ms. Remains : 511/511 places, 28439/28439 transitions.
Computed a total of 119 stabilizing places and 10296 stable transitions
Computed a total of 119 stabilizing places and 10296 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 585 ms. (steps per millisecond=17 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 33669 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33669 steps, saw 23108 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-27 20:49:30] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
[2024-05-27 20:49:30] [INFO ] Invariant cache hit.
[2024-05-27 20:49:30] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-05-27 20:49:35] [INFO ] After 4634ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-27 20:49:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:49:40] [INFO ] After 5147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-27 20:49:40] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2024-05-27 20:49:47] [INFO ] After 6370ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-27 20:49:49] [INFO ] Deduced a trap composed of 44 places in 1816 ms of which 1 ms to minimize.
[2024-05-27 20:49:51] [INFO ] Deduced a trap composed of 73 places in 1769 ms of which 1 ms to minimize.
[2024-05-27 20:49:53] [INFO ] Deduced a trap composed of 61 places in 1720 ms of which 0 ms to minimize.
[2024-05-27 20:49:55] [INFO ] Deduced a trap composed of 31 places in 1576 ms of which 3 ms to minimize.
[2024-05-27 20:49:57] [INFO ] Deduced a trap composed of 84 places in 1681 ms of which 0 ms to minimize.
[2024-05-27 20:49:59] [INFO ] Deduced a trap composed of 96 places in 1378 ms of which 0 ms to minimize.
[2024-05-27 20:50:01] [INFO ] Deduced a trap composed of 69 places in 1795 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 20:50:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:50:01] [INFO ] After 26476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 28439/28439 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 498 transition count 27457
Applied a total of 1176 rules in 419 ms. Remains 498 /511 variables (removed 13) and now considering 27457/28439 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 420 ms. Remains : 498/511 places, 27457/28439 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 35463 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35463 steps, saw 25204 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-27 20:50:05] [INFO ] Flow matrix only has 18728 transitions (discarded 8729 similar events)
// Phase 1: matrix 18728 rows 498 cols
[2024-05-27 20:50:05] [INFO ] Computed 8 invariants in 55 ms
[2024-05-27 20:50:06] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-27 20:50:10] [INFO ] After 4392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-27 20:50:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-27 20:50:15] [INFO ] After 5174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-27 20:50:15] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-05-27 20:50:24] [INFO ] After 8944ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-27 20:50:27] [INFO ] Deduced a trap composed of 48 places in 1841 ms of which 1 ms to minimize.
[2024-05-27 20:50:29] [INFO ] Deduced a trap composed of 20 places in 1538 ms of which 1 ms to minimize.
[2024-05-27 20:50:30] [INFO ] Deduced a trap composed of 50 places in 1526 ms of which 1 ms to minimize.
[2024-05-27 20:50:32] [INFO ] Deduced a trap composed of 73 places in 1027 ms of which 1 ms to minimize.
[2024-05-27 20:50:33] [INFO ] Deduced a trap composed of 93 places in 1229 ms of which 1 ms to minimize.
[2024-05-27 20:50:36] [INFO ] Deduced a trap composed of 102 places in 1902 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 20:50:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:50:36] [INFO ] After 26079ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27457/27457 transitions.
Applied a total of 0 rules in 113 ms. Remains 498 /498 variables (removed 0) and now considering 27457/27457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 498/498 places, 27457/27457 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27457/27457 transitions.
Applied a total of 0 rules in 109 ms. Remains 498 /498 variables (removed 0) and now considering 27457/27457 (removed 0) transitions.
[2024-05-27 20:50:36] [INFO ] Flow matrix only has 18728 transitions (discarded 8729 similar events)
[2024-05-27 20:50:36] [INFO ] Invariant cache hit.
[2024-05-27 20:50:37] [INFO ] Implicit Places using invariants in 916 ms returned []
Implicit Place search using SMT only with invariants took 942 ms to find 0 implicit places.
[2024-05-27 20:50:37] [INFO ] Flow matrix only has 18728 transitions (discarded 8729 similar events)
[2024-05-27 20:50:37] [INFO ] Invariant cache hit.
[2024-05-27 20:50:46] [INFO ] Dead Transitions using invariants and state equation in 8695 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9757 ms. Remains : 498/498 places, 27457/27457 transitions.
Graph (trivial) has 10049 edges and 498 vertex of which 377 / 498 are part of one of the 61 SCC in 1 ms
Free SCC test removed 316 places
Drop transitions removed 11111 transitions
Ensure Unique test removed 13707 transitions
Reduce isomorphic transitions removed 24818 transitions.
Graph (complete) has 2436 edges and 182 vertex of which 174 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 174 transition count 2626
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 172 transition count 2626
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 170 transition count 2606
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 170 transition count 2606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 170 transition count 2605
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 24 place count 169 transition count 2604
Drop transitions removed 1442 transitions
Redundant transition composition rules discarded 1442 transitions
Iterating global reduction 3 with 1442 rules applied. Total rules applied 1466 place count 169 transition count 1162
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1430 edges and 168 vertex of which 153 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 4 rules applied. Total rules applied 1470 place count 153 transition count 1158
Drop transitions removed 52 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 53 rules applied. Total rules applied 1523 place count 153 transition count 1105
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1524 place count 152 transition count 1100
Iterating global reduction 5 with 1 rules applied. Total rules applied 1525 place count 152 transition count 1100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1529 place count 150 transition count 1098
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 1540 place count 150 transition count 1087
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1552 place count 150 transition count 1068
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1574 place count 138 transition count 1058
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1575 place count 137 transition count 1053
Iterating global reduction 6 with 1 rules applied. Total rules applied 1576 place count 137 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1577 place count 137 transition count 1052
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 7 with 57 rules applied. Total rules applied 1634 place count 137 transition count 995
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1640 place count 137 transition count 989
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1650 place count 131 transition count 985
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1656 place count 131 transition count 979
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1658 place count 131 transition count 977
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1662 place count 129 transition count 975
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1666 place count 129 transition count 971
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1668 place count 129 transition count 969
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1672 place count 127 transition count 967
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1674 place count 127 transition count 965
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 1677 place count 127 transition count 1047
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1691 place count 124 transition count 1036
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 11 with 19 rules applied. Total rules applied 1710 place count 124 transition count 1017
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 1715 place count 124 transition count 1017
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1718 place count 124 transition count 1014
Applied a total of 1718 rules in 254 ms. Remains 124 /498 variables (removed 374) and now considering 1014/27457 (removed 26443) transitions.
Running SMT prover for 4 properties.
[2024-05-27 20:50:46] [INFO ] Flow matrix only has 979 transitions (discarded 35 similar events)
// Phase 1: matrix 979 rows 124 cols
[2024-05-27 20:50:46] [INFO ] Computed 0 invariants in 3 ms
[2024-05-27 20:50:46] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-27 20:50:47] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-27 20:50:47] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-27 20:50:47] [INFO ] After 192ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-27 20:50:47] [INFO ] After 457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 219 ms.
[2024-05-27 20:50:47] [INFO ] After 1053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 2464 ms.
Product exploration explored 100000 steps with 0 reset in 2463 ms.
Built C files in :
/tmp/ltsmin18171862903650495038
[2024-05-27 20:50:53] [INFO ] Too many transitions (28439) to apply POR reductions. Disabling POR matrices.
[2024-05-27 20:50:53] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18171862903650495038
Running compilation step : cd /tmp/ltsmin18171862903650495038;'/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/ltsmin18171862903650495038;'/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/ltsmin18171862903650495038;'/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 4 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 28439/28439 transitions.
Applied a total of 0 rules in 113 ms. Remains 511 /511 variables (removed 0) and now considering 28439/28439 (removed 0) transitions.
[2024-05-27 20:50:56] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
// Phase 1: matrix 18683 rows 511 cols
[2024-05-27 20:50:56] [INFO ] Computed 8 invariants in 56 ms
[2024-05-27 20:50:57] [INFO ] Implicit Places using invariants in 825 ms returned []
Implicit Place search using SMT only with invariants took 834 ms to find 0 implicit places.
[2024-05-27 20:50:57] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
[2024-05-27 20:50:57] [INFO ] Invariant cache hit.
[2024-05-27 20:51:06] [INFO ] Dead Transitions using invariants and state equation in 8928 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9885 ms. Remains : 511/511 places, 28439/28439 transitions.
Built C files in :
/tmp/ltsmin17216476438201362986
[2024-05-27 20:51:06] [INFO ] Too many transitions (28439) to apply POR reductions. Disabling POR matrices.
[2024-05-27 20:51:06] [INFO ] Built C files in 156ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17216476438201362986
Running compilation step : cd /tmp/ltsmin17216476438201362986;'/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/ltsmin17216476438201362986;'/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/ltsmin17216476438201362986;'/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-27 20:51:10] [INFO ] Flatten gal took : 709 ms
[2024-05-27 20:51:11] [INFO ] Flatten gal took : 731 ms
[2024-05-27 20:51:11] [INFO ] Time to serialize gal into /tmp/LTL574318494991306078.gal : 100 ms
[2024-05-27 20:51:11] [INFO ] Time to serialize properties into /tmp/LTL10261307262707017257.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL574318494991306078.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1825530393088035814.hoa' '-atoms' '/tmp/LTL10261307262707017257.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/LTL10261307262707017257.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1825530393088035814.hoa
Detected timeout of ITS tools.
[2024-05-27 20:51:27] [INFO ] Flatten gal took : 923 ms
[2024-05-27 20:51:28] [INFO ] Flatten gal took : 897 ms
[2024-05-27 20:51:28] [INFO ] Time to serialize gal into /tmp/LTL3094539884957738835.gal : 101 ms
[2024-05-27 20:51:28] [INFO ] Time to serialize properties into /tmp/LTL16651657383097315871.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/LTL3094539884957738835.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16651657383097315871.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("((ps2==1)&&(ps98==1))"))||(G("((ps208==0)||(ps511==0))")))))
Formula 0 simplified : G(F!"((ps2==1)&&(ps98==1))" & F!"((ps208==0)||(ps511==0))")
Detected timeout of ITS tools.
[2024-05-27 20:51:44] [INFO ] Flatten gal took : 674 ms
[2024-05-27 20:51:44] [INFO ] Applying decomposition
[2024-05-27 20:51:45] [INFO ] Flatten gal took : 715 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/graph16122096720804177440.txt' '-o' '/tmp/graph16122096720804177440.bin' '-w' '/tmp/graph16122096720804177440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16122096720804177440.bin' '-l' '-1' '-v' '-w' '/tmp/graph16122096720804177440.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:51:46] [INFO ] Decomposing Gal with order
[2024-05-27 20:51:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:51:48] [INFO ] Removed a total of 64251 redundant transitions.
[2024-05-27 20:51:48] [INFO ] Flatten gal took : 1320 ms
[2024-05-27 20:51:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2101 labels/synchronizations in 623 ms.
[2024-05-27 20:51:49] [INFO ] Time to serialize gal into /tmp/LTL1365620098043979011.gal : 40 ms
[2024-05-27 20:51:49] [INFO ] Time to serialize properties into /tmp/LTL2869038408686367095.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/LTL1365620098043979011.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2869038408686367095.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 : !((F((G("((i7.u102.ps2==1)&&(i7.u102.ps98==1))"))||(G("((i0.i1.i0.u66.ps208==0)||(i0.i0.i0.u5.ps511==0))")))))
Formula 0 simplified : G(F!"((i7.u102.ps2==1)&&(i7.u102.ps98==1))" & F!"((i0.i1.i0.u66.ps208==0)||(i0.i0.i0.u5.ps511==0))")
Reverse transition relation is NOT exact ! Due to transitions t219, t282, t614, t630, t646, t694, t710, t727, t743, t1034, t1042, t1065, t1379, t1443, t145...2032
Computing Next relation with stutter on 6 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12016502786300680675
[2024-05-27 20:52:04] [INFO ] Built C files in 164ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12016502786300680675
Running compilation step : cd /tmp/ltsmin12016502786300680675;'/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/ltsmin12016502786300680675;'/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/ltsmin12016502786300680675;'/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 RERS2020-PT-pb103-LTLFireability-15 finished in 267258 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&&(X(G(p2))||p1)))))'
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)&&F(G(p1)))))'
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' '!(F((G(p0)||G(p1))))'
[2024-05-27 20:52:09] [INFO ] Flatten gal took : 789 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13426905288854841929
[2024-05-27 20:52:09] [INFO ] Too many transitions (28429) to apply POR reductions. Disabling POR matrices.
[2024-05-27 20:52:09] [INFO ] Built C files in 188ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13426905288854841929
Running compilation step : cd /tmp/ltsmin13426905288854841929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' '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-27 20:52:10] [INFO ] Applying decomposition
[2024-05-27 20:52:10] [INFO ] Flatten gal took : 726 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/graph11007500739047203267.txt' '-o' '/tmp/graph11007500739047203267.bin' '-w' '/tmp/graph11007500739047203267.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11007500739047203267.bin' '-l' '-1' '-v' '-w' '/tmp/graph11007500739047203267.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:52:12] [INFO ] Decomposing Gal with order
[2024-05-27 20:52:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:52:14] [INFO ] Removed a total of 64410 redundant transitions.
[2024-05-27 20:52:14] [INFO ] Flatten gal took : 1518 ms
[2024-05-27 20:52:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 1939 labels/synchronizations in 604 ms.
[2024-05-27 20:52:15] [INFO ] Time to serialize gal into /tmp/LTLFireability12588299640334452540.gal : 35 ms
[2024-05-27 20:52:15] [INFO ] Time to serialize properties into /tmp/LTLFireability867076971358318161.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/LTLFireability12588299640334452540.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability867076971358318161.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 4 LTL properties
Checking formula 0 : !((F(G(("((i6.i2.u48.ps318==0)||(i8.u45.ps491==0))")&&(("((i2.i3.u85.ps46==0)||(i2.i0.u89.ps405==0))")||(X(G("((i6.i0.u0.ps274==1)&&(i...180
Formula 0 simplified : GF(!"((i6.i2.u48.ps318==0)||(i8.u45.ps491==0))" | (!"((i2.i3.u85.ps46==0)||(i2.i0.u89.ps405==0))" & XF!"((i6.i0.u0.ps274==1)&&(i0.u5...170
Reverse transition relation is NOT exact ! Due to transitions t215, t278, t610, t626, t642, t706, t723, t739, t1024, t1032, t1040, t1063, t1375, t1439, t14...1993
Computing Next relation with stutter on 6 deadlock states
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/ltsmin13426905288854841929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' '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 180 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13426905288854841929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' '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 180 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)

BK_STOP 1716843537403

--------------------
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="RERS2020-PT-pb103"
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 RERS2020-PT-pb103, 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 r329-tall-171662361800218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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