Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K 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 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 12M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716221184081

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=CANConstruction-PT-090
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 16:06:25] [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-20 16:06:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 16:06:26] [INFO ] Load time of PNML (sax parser for PT used): 574 ms
[2024-05-20 16:06:26] [INFO ] Transformed 17282 places.
[2024-05-20 16:06:26] [INFO ] Transformed 33120 transitions.
[2024-05-20 16:06:26] [INFO ] Parsed PT model containing 17282 places and 33120 transitions and 99000 arcs in 773 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-090-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 17282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Discarding 7905 places :
Symmetric choice reduction at 0 with 7905 rule applications. Total rules 7905 place count 9377 transition count 17310
Iterating global reduction 0 with 7905 rules applied. Total rules applied 15810 place count 9377 transition count 17310
Applied a total of 15810 rules in 6976 ms. Remains 9377 /17282 variables (removed 7905) and now considering 17310/33120 (removed 15810) transitions.
// Phase 1: matrix 17310 rows 9377 cols
[2024-05-20 16:06:34] [INFO ] Computed 181 invariants in 235 ms
[2024-05-20 16:06:35] [INFO ] Implicit Places using invariants in 1314 ms returned []
Implicit Place search using SMT only with invariants took 1353 ms to find 0 implicit places.
[2024-05-20 16:06:35] [INFO ] Invariant cache hit.
[2024-05-20 16:06:36] [INFO ] Dead Transitions using invariants and state equation in 927 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9377/17282 places, 17310/33120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9266 ms. Remains : 9377/17282 places, 17310/33120 transitions.
Support contains 40 out of 9377 places after structural reductions.
[2024-05-20 16:06:37] [INFO ] Flatten gal took : 716 ms
[2024-05-20 16:06:37] [INFO ] Flatten gal took : 499 ms
[2024-05-20 16:06:38] [INFO ] Input system was already deterministic with 17310 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 732 ms. (steps per millisecond=13 ) properties (out of 28) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2024-05-20 16:06:39] [INFO ] Invariant cache hit.
[2024-05-20 16:06:42] [INFO ] [Real]Absence check using 91 positive place invariants in 234 ms returned sat
[2024-05-20 16:06:42] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 118 ms returned sat
[2024-05-20 16:07:00] [INFO ] After 16137ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16
[2024-05-20 16:07:01] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2024-05-20 16:07:04] [INFO ] After 3510ms SMT Verify possible using 16110 Read/Feed constraints in real domain returned unsat :0 sat :13 real:3
[2024-05-20 16:07:04] [INFO ] After 3511ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :13 real:3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-20 16:07:04] [INFO ] After 25068ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :13 real:3
[2024-05-20 16:07:07] [INFO ] [Nat]Absence check using 91 positive place invariants in 195 ms returned sat
[2024-05-20 16:07:07] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 116 ms returned sat
[2024-05-20 16:07:26] [INFO ] After 17146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-05-20 16:07:29] [INFO ] After 3317ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-20 16:07:29] [INFO ] After 3318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-20 16:07:29] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 16 Parikh solutions to 12 different solutions.
Parikh walk visited 5 properties in 583 ms.
Support contains 15 out of 9377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9377/9377 places, 17310/17310 transitions.
Drop transitions removed 626 transitions
Trivial Post-agglo rules discarded 626 transitions
Performed 626 trivial Post agglomeration. Transition count delta: 626
Iterating post reduction 0 with 626 rules applied. Total rules applied 626 place count 9377 transition count 16684
Reduce places removed 626 places and 0 transitions.
Iterating post reduction 1 with 626 rules applied. Total rules applied 1252 place count 8751 transition count 16684
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1252 place count 8751 transition count 16683
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1254 place count 8750 transition count 16683
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1260 place count 8744 transition count 16671
Iterating global reduction 2 with 6 rules applied. Total rules applied 1266 place count 8744 transition count 16671
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 6 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1444 place count 8655 transition count 16582
Free-agglomeration rule applied 164 times.
Iterating global reduction 2 with 164 rules applied. Total rules applied 1608 place count 8655 transition count 16418
Reduce places removed 164 places and 0 transitions.
Iterating post reduction 2 with 164 rules applied. Total rules applied 1772 place count 8491 transition count 16418
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 1775 place count 8491 transition count 16415
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1778 place count 8488 transition count 16415
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 1795 place count 8488 transition count 16415
Applied a total of 1795 rules in 17714 ms. Remains 8488 /9377 variables (removed 889) and now considering 16415/17310 (removed 895) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17719 ms. Remains : 8488/9377 places, 16415/17310 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 16415 rows 8488 cols
[2024-05-20 16:07:48] [INFO ] Computed 181 invariants in 129 ms
[2024-05-20 16:07:50] [INFO ] [Real]Absence check using 91 positive place invariants in 181 ms returned sat
[2024-05-20 16:07:50] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 100 ms returned sat
[2024-05-20 16:08:02] [INFO ] After 11129ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2024-05-20 16:08:02] [INFO ] State equation strengthened by 16208 read => feed constraints.
[2024-05-20 16:08:07] [INFO ] After 4820ms SMT Verify possible using 16208 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 16:08:07] [INFO ] After 18326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 16:08:08] [INFO ] [Nat]Absence check using 91 positive place invariants in 178 ms returned sat
[2024-05-20 16:08:08] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 104 ms returned sat
[2024-05-20 16:08:20] [INFO ] After 11048ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 16:08:24] [INFO ] After 4670ms SMT Verify possible using 16208 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 16:08:29] [INFO ] After 8876ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2708 ms.
[2024-05-20 16:08:31] [INFO ] After 24777ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 6 ms.
Support contains 5 out of 8488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8488/8488 places, 16415/16415 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 8483 transition count 16410
Applied a total of 10 rules in 4954 ms. Remains 8483 /8488 variables (removed 5) and now considering 16410/16415 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4956 ms. Remains : 8483/8488 places, 16410/16415 transitions.
Computed a total of 361 stabilizing places and 450 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((p0||(X((p0||G(p1)))&&F(p2)))))'
Support contains 4 out of 9377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9377/9377 places, 17310/17310 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 9364 transition count 17284
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 9364 transition count 17284
Applied a total of 26 rules in 5617 ms. Remains 9364 /9377 variables (removed 13) and now considering 17284/17310 (removed 26) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2024-05-20 16:08:43] [INFO ] Computed 181 invariants in 167 ms
[2024-05-20 16:08:43] [INFO ] Implicit Places using invariants in 1010 ms returned []
Implicit Place search using SMT only with invariants took 1012 ms to find 0 implicit places.
[2024-05-20 16:08:43] [INFO ] Invariant cache hit.
[2024-05-20 16:08:44] [INFO ] Dead Transitions using invariants and state equation in 858 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9364/9377 places, 17284/17310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7493 ms. Remains : 9364/9377 places, 17284/17310 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 420 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s4650 1), p2:(AND (GEQ s762 1) (GEQ s837 1)), p1:(AND (GEQ s762 1) (GEQ s837 1) (GEQ s4458 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-090-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-00 finished in 8003 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&&(p1 U p2)))))'
Support contains 3 out of 9377 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9377/9377 places, 17310/17310 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 9377 transition count 16682
Reduce places removed 628 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 629 rules applied. Total rules applied 1257 place count 8749 transition count 16681
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1258 place count 8748 transition count 16681
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1271 place count 8735 transition count 16655
Iterating global reduction 3 with 13 rules applied. Total rules applied 1284 place count 8735 transition count 16655
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1462 place count 8646 transition count 16566
Applied a total of 1462 rules in 8252 ms. Remains 8646 /9377 variables (removed 731) and now considering 16566/17310 (removed 744) transitions.
// Phase 1: matrix 16566 rows 8646 cols
[2024-05-20 16:08:53] [INFO ] Computed 181 invariants in 116 ms
[2024-05-20 16:08:54] [INFO ] Implicit Places using invariants in 853 ms returned []
Implicit Place search using SMT only with invariants took 854 ms to find 0 implicit places.
[2024-05-20 16:08:54] [INFO ] Invariant cache hit.
[2024-05-20 16:08:55] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8646/9377 places, 16566/17310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9893 ms. Remains : 8646/9377 places, 16566/17310 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(GEQ s179 1), p0:(GEQ s8026 1), p1:(GEQ s6363 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 752 steps with 0 reset in 34 ms.
FORMULA CANConstruction-PT-090-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-01 finished in 10104 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) U p1))'
Support contains 2 out of 9377 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9377/9377 places, 17310/17310 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9377 transition count 16680
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8747 transition count 16680
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1273 place count 8734 transition count 16654
Iterating global reduction 2 with 13 rules applied. Total rules applied 1286 place count 8734 transition count 16654
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1466 place count 8644 transition count 16564
Applied a total of 1466 rules in 7857 ms. Remains 8644 /9377 variables (removed 733) and now considering 16564/17310 (removed 746) transitions.
// Phase 1: matrix 16564 rows 8644 cols
[2024-05-20 16:09:03] [INFO ] Computed 181 invariants in 109 ms
[2024-05-20 16:09:04] [INFO ] Implicit Places using invariants in 842 ms returned []
Implicit Place search using SMT only with invariants took 843 ms to find 0 implicit places.
[2024-05-20 16:09:04] [INFO ] Invariant cache hit.
[2024-05-20 16:09:04] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8644/9377 places, 16564/17310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9470 ms. Remains : 8644/9377 places, 16564/17310 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s8019 1), p0:(LT s5441 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 4232 steps with 5 reset in 174 ms.
FORMULA CANConstruction-PT-090-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-02 finished in 9774 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(X(X((G(p0)||((p1 U X(p2))&&G(p1))))))))'
Support contains 5 out of 9377 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9377/9377 places, 17310/17310 transitions.
Drop transitions removed 626 transitions
Trivial Post-agglo rules discarded 626 transitions
Performed 626 trivial Post agglomeration. Transition count delta: 626
Iterating post reduction 0 with 626 rules applied. Total rules applied 626 place count 9377 transition count 16684
Reduce places removed 626 places and 0 transitions.
Iterating post reduction 1 with 626 rules applied. Total rules applied 1252 place count 8751 transition count 16684
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1252 place count 8751 transition count 16682
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1256 place count 8749 transition count 16682
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1270 place count 8735 transition count 16654
Iterating global reduction 2 with 14 rules applied. Total rules applied 1284 place count 8735 transition count 16654
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 3 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 1460 place count 8647 transition count 16566
Applied a total of 1460 rules in 7663 ms. Remains 8647 /9377 variables (removed 730) and now considering 16566/17310 (removed 744) transitions.
// Phase 1: matrix 16566 rows 8647 cols
[2024-05-20 16:09:12] [INFO ] Computed 181 invariants in 106 ms
[2024-05-20 16:09:13] [INFO ] Implicit Places using invariants in 873 ms returned []
Implicit Place search using SMT only with invariants took 874 ms to find 0 implicit places.
[2024-05-20 16:09:13] [INFO ] Invariant cache hit.
[2024-05-20 16:09:14] [INFO ] Dead Transitions using invariants and state equation in 753 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8647/9377 places, 16566/17310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9292 ms. Remains : 8647/9377 places, 16566/17310 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-04 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}, { cond=(AND p0 p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=2 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s131 1) (GEQ s222 1)), p1:(AND (GEQ s204 1) (GEQ s313 1)), p2:(GEQ s912 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 832 steps with 0 reset in 21 ms.
FORMULA CANConstruction-PT-090-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-04 finished in 9511 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||X(X((p1||(X(p0)&&p2))))))))'
Support contains 5 out of 9377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9377/9377 places, 17310/17310 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 9363 transition count 17282
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 9363 transition count 17282
Applied a total of 28 rules in 5442 ms. Remains 9363 /9377 variables (removed 14) and now considering 17282/17310 (removed 28) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2024-05-20 16:09:20] [INFO ] Computed 181 invariants in 123 ms
[2024-05-20 16:09:21] [INFO ] Implicit Places using invariants in 944 ms returned []
Implicit Place search using SMT only with invariants took 945 ms to find 0 implicit places.
[2024-05-20 16:09:21] [INFO ] Invariant cache hit.
[2024-05-20 16:09:21] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9377 places, 17282/17310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7222 ms. Remains : 9363/9377 places, 17282/17310 transitions.
Stuttering acceptance computed with spot in 264 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}]], initial=0, aps=[p0:(OR (LT s874 1) (LT s5508 1)), p1:(LT s2138 1), p2:(AND (GEQ s104 1) (GEQ s585 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19951 reset in 3753 ms.
Product exploration explored 100000 steps with 19981 reset in 3713 ms.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 141676 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 141676 steps, saw 139452 distinct states, run finished after 3002 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-20 16:09:33] [INFO ] Invariant cache hit.
[2024-05-20 16:09:34] [INFO ] [Real]Absence check using 91 positive place invariants in 224 ms returned sat
[2024-05-20 16:09:34] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 130 ms returned sat
[2024-05-20 16:09:46] [INFO ] After 11571ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-20 16:09:47] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2024-05-20 16:09:49] [INFO ] After 2532ms SMT Verify possible using 16110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 16:09:49] [INFO ] After 16235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 16:09:50] [INFO ] [Nat]Absence check using 91 positive place invariants in 224 ms returned sat
[2024-05-20 16:09:51] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 126 ms returned sat
[2024-05-20 16:10:02] [INFO ] After 11557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 16:10:06] [INFO ] After 3114ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 16:10:08] [INFO ] After 5906ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1900 ms.
[2024-05-20 16:10:10] [INFO ] After 21144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 21 ms.
Support contains 3 out of 9363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9363/9363 places, 17282/17282 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 9363 transition count 16654
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 8735 transition count 16654
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 8735 transition count 16653
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 8734 transition count 16653
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1436 place count 8645 transition count 16564
Free-agglomeration rule applied 178 times.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1614 place count 8645 transition count 16386
Reduce places removed 178 places and 0 transitions.
Iterating post reduction 2 with 178 rules applied. Total rules applied 1792 place count 8467 transition count 16386
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1793 place count 8467 transition count 16385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1794 place count 8466 transition count 16385
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1797 place count 8466 transition count 16385
Applied a total of 1797 rules in 12930 ms. Remains 8466 /9363 variables (removed 897) and now considering 16385/17282 (removed 897) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12931 ms. Remains : 8466/9363 places, 16385/17282 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 97240 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97240 steps, saw 90693 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16385 rows 8466 cols
[2024-05-20 16:10:27] [INFO ] Computed 181 invariants in 107 ms
[2024-05-20 16:10:28] [INFO ] [Real]Absence check using 91 positive place invariants in 177 ms returned sat
[2024-05-20 16:10:28] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 108 ms returned sat
[2024-05-20 16:10:38] [INFO ] After 9480ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-20 16:10:38] [INFO ] State equation strengthened by 16201 read => feed constraints.
[2024-05-20 16:10:40] [INFO ] After 1789ms SMT Verify possible using 16201 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:10:40] [INFO ] After 12869ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:10:41] [INFO ] [Nat]Absence check using 91 positive place invariants in 168 ms returned sat
[2024-05-20 16:10:41] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 106 ms returned sat
[2024-05-20 16:10:51] [INFO ] After 10045ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:10:53] [INFO ] After 2381ms SMT Verify possible using 16201 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 16:10:55] [INFO ] After 3863ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1242 ms.
[2024-05-20 16:10:56] [INFO ] After 16563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 8466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8466/8466 places, 16385/16385 transitions.
Applied a total of 0 rules in 2577 ms. Remains 8466 /8466 variables (removed 0) and now considering 16385/16385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2581 ms. Remains : 8466/8466 places, 16385/16385 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8466/8466 places, 16385/16385 transitions.
Applied a total of 0 rules in 2580 ms. Remains 8466 /8466 variables (removed 0) and now considering 16385/16385 (removed 0) transitions.
[2024-05-20 16:11:01] [INFO ] Invariant cache hit.
[2024-05-20 16:11:02] [INFO ] Implicit Places using invariants in 773 ms returned []
Implicit Place search using SMT only with invariants took 774 ms to find 0 implicit places.
[2024-05-20 16:11:02] [INFO ] Invariant cache hit.
[2024-05-20 16:11:03] [INFO ] Dead Transitions using invariants and state equation in 786 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4149 ms. Remains : 8466/8466 places, 16385/16385 transitions.
Graph (trivial) has 16021 edges and 8466 vertex of which 8098 / 8466 are part of one of the 89 SCC in 14 ms
Free SCC test removed 8009 places
Drop transitions removed 15929 transitions
Reduce isomorphic transitions removed 15929 transitions.
Graph (complete) has 998 edges and 457 vertex of which 103 are kept as prefixes of interest. Removing 354 places using SCC suffix rule.0 ms
Discarding 354 places :
Also discarding 175 output transitions
Drop transitions removed 175 transitions
Ensure Unique test removed 1 places
Drop transitions removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Iterating post reduction 0 with 182 rules applied. Total rules applied 184 place count 102 transition count 100
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 178 rules applied. Total rules applied 362 place count 12 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 362 place count 12 transition count 10
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 366 place count 10 transition count 10
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 367 place count 9 transition count 9
Iterating global reduction 2 with 1 rules applied. Total rules applied 368 place count 9 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 369 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 370 place count 8 transition count 8
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 371 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 372 place count 7 transition count 7
Iterating global reduction 3 with 1 rules applied. Total rules applied 373 place count 7 transition count 7
Applied a total of 373 rules in 53 ms. Remains 7 /8466 variables (removed 8459) and now considering 7/16385 (removed 16378) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 7 rows 7 cols
[2024-05-20 16:11:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-20 16:11:03] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-20 16:11:03] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-20 16:11:03] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 16:11:03] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2024-05-20 16:11:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-20 16:11:03] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:11:03] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 16:11:03] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0)]
Stuttering acceptance computed with spot in 185 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0)]
Support contains 5 out of 9363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9363/9363 places, 17282/17282 transitions.
Applied a total of 0 rules in 2721 ms. Remains 9363 /9363 variables (removed 0) and now considering 17282/17282 (removed 0) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2024-05-20 16:11:06] [INFO ] Computed 181 invariants in 115 ms
[2024-05-20 16:11:07] [INFO ] Implicit Places using invariants in 960 ms returned []
Implicit Place search using SMT only with invariants took 969 ms to find 0 implicit places.
[2024-05-20 16:11:07] [INFO ] Invariant cache hit.
[2024-05-20 16:11:08] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4513 ms. Remains : 9363/9363 places, 17282/17282 transitions.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 199 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 173363 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 173363 steps, saw 170616 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-20 16:11:12] [INFO ] Invariant cache hit.
[2024-05-20 16:11:13] [INFO ] [Real]Absence check using 91 positive place invariants in 227 ms returned sat
[2024-05-20 16:11:13] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 126 ms returned sat
[2024-05-20 16:11:25] [INFO ] After 11374ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-20 16:11:25] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2024-05-20 16:11:28] [INFO ] After 2505ms SMT Verify possible using 16110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 16:11:28] [INFO ] After 15899ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 16:11:29] [INFO ] [Nat]Absence check using 91 positive place invariants in 219 ms returned sat
[2024-05-20 16:11:29] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 125 ms returned sat
[2024-05-20 16:11:42] [INFO ] After 12181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 16:11:45] [INFO ] After 3224ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 16:11:48] [INFO ] After 6179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1944 ms.
[2024-05-20 16:11:50] [INFO ] After 22080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 15 ms.
Support contains 3 out of 9363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9363/9363 places, 17282/17282 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 9363 transition count 16654
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 8735 transition count 16654
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 8735 transition count 16653
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 8734 transition count 16653
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1436 place count 8645 transition count 16564
Free-agglomeration rule applied 178 times.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1614 place count 8645 transition count 16386
Reduce places removed 178 places and 0 transitions.
Iterating post reduction 2 with 178 rules applied. Total rules applied 1792 place count 8467 transition count 16386
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1793 place count 8467 transition count 16385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1794 place count 8466 transition count 16385
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1797 place count 8466 transition count 16385
Applied a total of 1797 rules in 13265 ms. Remains 8466 /9363 variables (removed 897) and now considering 16385/17282 (removed 897) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13267 ms. Remains : 8466/9363 places, 16385/17282 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 98353 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98353 steps, saw 90954 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16385 rows 8466 cols
[2024-05-20 16:12:07] [INFO ] Computed 181 invariants in 111 ms
[2024-05-20 16:12:08] [INFO ] [Real]Absence check using 91 positive place invariants in 172 ms returned sat
[2024-05-20 16:12:08] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 100 ms returned sat
[2024-05-20 16:12:18] [INFO ] After 9526ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-20 16:12:18] [INFO ] State equation strengthened by 16201 read => feed constraints.
[2024-05-20 16:12:20] [INFO ] After 1740ms SMT Verify possible using 16201 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:12:20] [INFO ] After 12775ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:12:21] [INFO ] [Nat]Absence check using 91 positive place invariants in 169 ms returned sat
[2024-05-20 16:12:21] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 99 ms returned sat
[2024-05-20 16:12:31] [INFO ] After 10092ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:12:33] [INFO ] After 2377ms SMT Verify possible using 16201 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 16:12:35] [INFO ] After 3833ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1219 ms.
[2024-05-20 16:12:36] [INFO ] After 16505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 8466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8466/8466 places, 16385/16385 transitions.
Applied a total of 0 rules in 2530 ms. Remains 8466 /8466 variables (removed 0) and now considering 16385/16385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2530 ms. Remains : 8466/8466 places, 16385/16385 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8466/8466 places, 16385/16385 transitions.
Applied a total of 0 rules in 2502 ms. Remains 8466 /8466 variables (removed 0) and now considering 16385/16385 (removed 0) transitions.
[2024-05-20 16:12:41] [INFO ] Invariant cache hit.
[2024-05-20 16:12:42] [INFO ] Implicit Places using invariants in 738 ms returned []
Implicit Place search using SMT only with invariants took 738 ms to find 0 implicit places.
[2024-05-20 16:12:42] [INFO ] Invariant cache hit.
[2024-05-20 16:12:43] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4017 ms. Remains : 8466/8466 places, 16385/16385 transitions.
Graph (trivial) has 16021 edges and 8466 vertex of which 8098 / 8466 are part of one of the 89 SCC in 4 ms
Free SCC test removed 8009 places
Drop transitions removed 15929 transitions
Reduce isomorphic transitions removed 15929 transitions.
Graph (complete) has 998 edges and 457 vertex of which 103 are kept as prefixes of interest. Removing 354 places using SCC suffix rule.1 ms
Discarding 354 places :
Also discarding 175 output transitions
Drop transitions removed 175 transitions
Ensure Unique test removed 1 places
Drop transitions removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Iterating post reduction 0 with 182 rules applied. Total rules applied 184 place count 102 transition count 100
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 178 rules applied. Total rules applied 362 place count 12 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 362 place count 12 transition count 10
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 366 place count 10 transition count 10
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 367 place count 9 transition count 9
Iterating global reduction 2 with 1 rules applied. Total rules applied 368 place count 9 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 369 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 370 place count 8 transition count 8
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 371 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 372 place count 7 transition count 7
Iterating global reduction 3 with 1 rules applied. Total rules applied 373 place count 7 transition count 7
Applied a total of 373 rules in 24 ms. Remains 7 /8466 variables (removed 8459) and now considering 7/16385 (removed 16378) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 7 rows 7 cols
[2024-05-20 16:12:43] [INFO ] Computed 2 invariants in 1 ms
[2024-05-20 16:12:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-20 16:12:43] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-20 16:12:43] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 16:12:43] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2024-05-20 16:12:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-20 16:12:43] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:12:43] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 16:12:43] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0)]
Stuttering acceptance computed with spot in 203 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0)]
Product exploration explored 100000 steps with 20005 reset in 3600 ms.
Product exploration explored 100000 steps with 20030 reset in 3657 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 205 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0)]
Support contains 5 out of 9363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9363/9363 places, 17282/17282 transitions.
Performed 447 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 447 rules applied. Total rules applied 447 place count 9363 transition count 17282
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 93 Pre rules applied. Total rules applied 447 place count 9363 transition count 17282
Deduced a syphon composed of 540 places in 5 ms
Iterating global reduction 1 with 93 rules applied. Total rules applied 540 place count 9363 transition count 17282
Discarding 180 places :
Symmetric choice reduction at 1 with 180 rule applications. Total rules 720 place count 9183 transition count 17102
Deduced a syphon composed of 360 places in 4 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 900 place count 9183 transition count 17102
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 537 places in 3 ms
Iterating global reduction 1 with 177 rules applied. Total rules applied 1077 place count 9183 transition count 17102
Discarding 354 places :
Symmetric choice reduction at 1 with 354 rule applications. Total rules 1431 place count 8829 transition count 16748
Deduced a syphon composed of 183 places in 3 ms
Iterating global reduction 1 with 354 rules applied. Total rules applied 1785 place count 8829 transition count 16748
Deduced a syphon composed of 183 places in 3 ms
Applied a total of 1785 rules in 12979 ms. Remains 8829 /9363 variables (removed 534) and now considering 16748/17282 (removed 534) transitions.
// Phase 1: matrix 16748 rows 8829 cols
[2024-05-20 16:13:04] [INFO ] Computed 181 invariants in 111 ms
[2024-05-20 16:13:05] [INFO ] Dead Transitions using invariants and state equation in 970 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8829/9363 places, 16748/17282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13951 ms. Remains : 8829/9363 places, 16748/17282 transitions.
Built C files in :
/tmp/ltsmin2352260483781752764
[2024-05-20 16:13:05] [INFO ] Built C files in 190ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2352260483781752764
Running compilation step : cd /tmp/ltsmin2352260483781752764;'/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/ltsmin2352260483781752764;'/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/ltsmin2352260483781752764;'/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 9363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9363/9363 places, 17282/17282 transitions.
Applied a total of 0 rules in 3421 ms. Remains 9363 /9363 variables (removed 0) and now considering 17282/17282 (removed 0) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2024-05-20 16:13:12] [INFO ] Computed 181 invariants in 119 ms
[2024-05-20 16:13:13] [INFO ] Implicit Places using invariants in 963 ms returned []
Implicit Place search using SMT only with invariants took 964 ms to find 0 implicit places.
[2024-05-20 16:13:13] [INFO ] Invariant cache hit.
[2024-05-20 16:13:13] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5212 ms. Remains : 9363/9363 places, 17282/17282 transitions.
Built C files in :
/tmp/ltsmin14909028363747146990
[2024-05-20 16:13:14] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14909028363747146990
Running compilation step : cd /tmp/ltsmin14909028363747146990;'/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/ltsmin14909028363747146990;'/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/ltsmin14909028363747146990;'/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-20 16:13:18] [INFO ] Flatten gal took : 417 ms
[2024-05-20 16:13:18] [INFO ] Flatten gal took : 402 ms
[2024-05-20 16:13:18] [INFO ] Time to serialize gal into /tmp/LTL14964338155900550065.gal : 102 ms
[2024-05-20 16:13:18] [INFO ] Time to serialize properties into /tmp/LTL491425663535799858.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/LTL14964338155900550065.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5972598117342943688.hoa' '-atoms' '/tmp/LTL491425663535799858.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/LTL491425663535799858.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5972598117342943688.hoa
Detected timeout of ITS tools.
[2024-05-20 16:13:34] [INFO ] Flatten gal took : 383 ms
[2024-05-20 16:13:34] [INFO ] Flatten gal took : 401 ms
[2024-05-20 16:13:34] [INFO ] Time to serialize gal into /tmp/LTL9905453987219790385.gal : 61 ms
[2024-05-20 16:13:34] [INFO ] Time to serialize properties into /tmp/LTL8565294408173792841.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9905453987219790385.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8565294408173792841.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 : !((X(G((X(X(("(Node8GiveAnswer74<1)")||(("((Node7IsInserted>=1)&&(Node41Request>=1))")&&(X("((Node62IsInserted<1)||(Node46requestsent6...226
Formula 0 simplified : XF(!"((Node62IsInserted>=1)&&(Node46requestsent62>=1))" & XX(!"(Node8GiveAnswer74<1)" & (!"((Node7IsInserted>=1)&&(Node41Request>=1)...214
Detected timeout of ITS tools.
[2024-05-20 16:13:50] [INFO ] Flatten gal took : 379 ms
[2024-05-20 16:13:50] [INFO ] Applying decomposition
[2024-05-20 16:13:50] [INFO ] Flatten gal took : 388 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/graph10385421575369350710.txt' '-o' '/tmp/graph10385421575369350710.bin' '-w' '/tmp/graph10385421575369350710.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10385421575369350710.bin' '-l' '-1' '-v' '-w' '/tmp/graph10385421575369350710.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:13:51] [INFO ] Decomposing Gal with order
[2024-05-20 16:13:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:13:55] [INFO ] Removed a total of 16334 redundant transitions.
[2024-05-20 16:13:55] [INFO ] Flatten gal took : 2861 ms
[2024-05-20 16:13:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 32652 labels/synchronizations in 3171 ms.
[2024-05-20 16:13:59] [INFO ] Time to serialize gal into /tmp/LTL9151926324058475432.gal : 136 ms
[2024-05-20 16:13:59] [INFO ] Time to serialize properties into /tmp/LTL6993358874356676995.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/LTL9151926324058475432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6993358874356676995.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(("(i74.u360.Node8GiveAnswer74<1)")||(("((i75.u28.Node7IsInserted>=1)&&(i41.u167.Node41Request>=1))")&&(X("((i66.u248.Node6...288
Formula 0 simplified : XF(!"((i66.u248.Node62IsInserted>=1)&&(i46.u187.Node46requestsent62>=1))" & XX(!"(i74.u360.Node8GiveAnswer74<1)" & (!"((i75.u28.Node...276
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2567582872793446395
[2024-05-20 16:14:14] [INFO ] Built C files in 135ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2567582872793446395
Running compilation step : cd /tmp/ltsmin2567582872793446395;'/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/ltsmin2567582872793446395;'/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/ltsmin2567582872793446395;'/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 CANConstruction-PT-090-LTLFireability-06 finished in 302990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 9377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9377/9377 places, 17310/17310 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 9362 transition count 17280
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 9362 transition count 17280
Applied a total of 30 rules in 7362 ms. Remains 9362 /9377 variables (removed 15) and now considering 17280/17310 (removed 30) transitions.
// Phase 1: matrix 17280 rows 9362 cols
[2024-05-20 16:14:25] [INFO ] Computed 181 invariants in 125 ms
[2024-05-20 16:14:25] [INFO ] Implicit Places using invariants in 966 ms returned []
Implicit Place search using SMT only with invariants took 969 ms to find 0 implicit places.
[2024-05-20 16:14:26] [INFO ] Invariant cache hit.
[2024-05-20 16:14:26] [INFO ] Dead Transitions using invariants and state equation in 781 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9362/9377 places, 17280/17310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9127 ms. Remains : 9362/9377 places, 17280/17310 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (LT s734 1) (LT s1117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 4110 ms.
Product exploration explored 100000 steps with 20000 reset in 4134 ms.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 4047 steps, including 2 resets, run visited all 1 properties in 66 ms. (steps per millisecond=61 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 9362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9362/9362 places, 17280/17280 transitions.
Applied a total of 0 rules in 3507 ms. Remains 9362 /9362 variables (removed 0) and now considering 17280/17280 (removed 0) transitions.
[2024-05-20 16:14:39] [INFO ] Invariant cache hit.
[2024-05-20 16:14:40] [INFO ] Implicit Places using invariants in 851 ms returned []
Implicit Place search using SMT only with invariants took 852 ms to find 0 implicit places.
[2024-05-20 16:14:40] [INFO ] Invariant cache hit.
[2024-05-20 16:14:41] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5185 ms. Remains : 9362/9362 places, 17280/17280 transitions.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 9294 steps, including 5 resets, run visited all 1 properties in 171 ms. (steps per millisecond=54 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 3963 ms.
Product exploration explored 100000 steps with 20000 reset in 3991 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 9362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9362/9362 places, 17280/17280 transitions.
Performed 448 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 448 rules applied. Total rules applied 448 place count 9362 transition count 17280
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 92 Pre rules applied. Total rules applied 448 place count 9362 transition count 17280
Deduced a syphon composed of 540 places in 4 ms
Iterating global reduction 1 with 92 rules applied. Total rules applied 540 place count 9362 transition count 17280
Discarding 180 places :
Symmetric choice reduction at 1 with 180 rule applications. Total rules 720 place count 9182 transition count 17100
Deduced a syphon composed of 360 places in 4 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 900 place count 9182 transition count 17100
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 538 places in 3 ms
Iterating global reduction 1 with 178 rules applied. Total rules applied 1078 place count 9182 transition count 17100
Discarding 356 places :
Symmetric choice reduction at 1 with 356 rule applications. Total rules 1434 place count 8826 transition count 16744
Deduced a syphon composed of 182 places in 3 ms
Iterating global reduction 1 with 356 rules applied. Total rules applied 1790 place count 8826 transition count 16744
Deduced a syphon composed of 182 places in 3 ms
Applied a total of 1790 rules in 14377 ms. Remains 8826 /9362 variables (removed 536) and now considering 16744/17280 (removed 536) transitions.
// Phase 1: matrix 16744 rows 8826 cols
[2024-05-20 16:15:05] [INFO ] Computed 181 invariants in 117 ms
[2024-05-20 16:15:06] [INFO ] Dead Transitions using invariants and state equation in 917 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8826/9362 places, 16744/17280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15295 ms. Remains : 8826/9362 places, 16744/17280 transitions.
Built C files in :
/tmp/ltsmin7226139644709565602
[2024-05-20 16:15:06] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7226139644709565602
Running compilation step : cd /tmp/ltsmin7226139644709565602;'/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/ltsmin7226139644709565602;'/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/ltsmin7226139644709565602;'/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 9362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9362/9362 places, 17280/17280 transitions.
Applied a total of 0 rules in 3476 ms. Remains 9362 /9362 variables (removed 0) and now considering 17280/17280 (removed 0) transitions.
// Phase 1: matrix 17280 rows 9362 cols
[2024-05-20 16:15:12] [INFO ] Computed 181 invariants in 116 ms
[2024-05-20 16:15:13] [INFO ] Implicit Places using invariants in 976 ms returned []
Implicit Place search using SMT only with invariants took 977 ms to find 0 implicit places.
[2024-05-20 16:15:13] [INFO ] Invariant cache hit.
[2024-05-20 16:15:14] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5302 ms. Remains : 9362/9362 places, 17280/17280 transitions.
Built C files in :
/tmp/ltsmin9459723653577467755
[2024-05-20 16:15:14] [INFO ] Built C files in 113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9459723653577467755
Running compilation step : cd /tmp/ltsmin9459723653577467755;'/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/ltsmin9459723653577467755;'/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/ltsmin9459723653577467755;'/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-20 16:15:18] [INFO ] Flatten gal took : 380 ms
[2024-05-20 16:15:18] [INFO ] Flatten gal took : 398 ms
[2024-05-20 16:15:18] [INFO ] Time to serialize gal into /tmp/LTL10895673989354527595.gal : 61 ms
[2024-05-20 16:15:18] [INFO ] Time to serialize properties into /tmp/LTL13290962111128867909.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/LTL10895673989354527595.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1735767564911253008.hoa' '-atoms' '/tmp/LTL13290962111128867909.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/LTL13290962111128867909.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1735767564911253008.hoa
Detected timeout of ITS tools.
[2024-05-20 16:15:34] [INFO ] Flatten gal took : 374 ms
[2024-05-20 16:15:34] [INFO ] Flatten gal took : 392 ms
[2024-05-20 16:15:34] [INFO ] Time to serialize gal into /tmp/LTL7727392201890665187.gal : 58 ms
[2024-05-20 16:15:34] [INFO ] Time to serialize properties into /tmp/LTL3642920333070354731.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/LTL7727392201890665187.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3642920333070354731.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 : !((X(X(X(X(F("((Node52IsInserted<1)||(Node79Request<1))")))))))
Formula 0 simplified : XXXXG!"((Node52IsInserted<1)||(Node79Request<1))"
Detected timeout of ITS tools.
[2024-05-20 16:15:50] [INFO ] Flatten gal took : 378 ms
[2024-05-20 16:15:50] [INFO ] Applying decomposition
[2024-05-20 16:15:50] [INFO ] Flatten gal took : 391 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/graph10121532963773399414.txt' '-o' '/tmp/graph10121532963773399414.bin' '-w' '/tmp/graph10121532963773399414.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10121532963773399414.bin' '-l' '-1' '-v' '-w' '/tmp/graph10121532963773399414.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:15:51] [INFO ] Decomposing Gal with order
[2024-05-20 16:15:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:15:54] [INFO ] Removed a total of 16343 redundant transitions.
[2024-05-20 16:15:54] [INFO ] Flatten gal took : 2035 ms
[2024-05-20 16:15:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 32132 labels/synchronizations in 2976 ms.
[2024-05-20 16:15:57] [INFO ] Time to serialize gal into /tmp/LTL16548839099166793106.gal : 90 ms
[2024-05-20 16:15:57] [INFO ] Time to serialize properties into /tmp/LTL11899194804215521897.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/LTL16548839099166793106.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11899194804215521897.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 : !((X(X(X(X(F("((i1.u207.Node52IsInserted<1)||(i80.u318.Node79Request<1))")))))))
Formula 0 simplified : XXXXG!"((i1.u207.Node52IsInserted<1)||(i80.u318.Node79Request<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5123580393455857020
[2024-05-20 16:16:13] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5123580393455857020
Running compilation step : cd /tmp/ltsmin5123580393455857020;'/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/ltsmin5123580393455857020;'/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/ltsmin5123580393455857020;'/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 CANConstruction-PT-090-LTLFireability-08 finished in 118447 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)||(p0&&F(!p1)))))'
Support contains 3 out of 9377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9377/9377 places, 17310/17310 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 9363 transition count 17282
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 9363 transition count 17282
Applied a total of 28 rules in 7092 ms. Remains 9363 /9377 variables (removed 14) and now considering 17282/17310 (removed 28) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2024-05-20 16:16:23] [INFO ] Computed 181 invariants in 118 ms
[2024-05-20 16:16:24] [INFO ] Implicit Places using invariants in 998 ms returned []
Implicit Place search using SMT only with invariants took 1000 ms to find 0 implicit places.
[2024-05-20 16:16:24] [INFO ] Invariant cache hit.
[2024-05-20 16:16:25] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9377 places, 17282/17310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8955 ms. Remains : 9363/9377 places, 17282/17310 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, p1, (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s314 1) (GEQ s697 1)), p0:(LT s2396 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 7436 ms.
Product exploration explored 100000 steps with 50000 reset in 7230 ms.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-090-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-090-LTLFireability-09 finished in 23902 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((F(p0)||G((G(p1) U (!p2||F(p0))))))))'
Support contains 5 out of 9377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9377/9377 places, 17310/17310 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 9363 transition count 17282
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 9363 transition count 17282
Applied a total of 28 rules in 6875 ms. Remains 9363 /9377 variables (removed 14) and now considering 17282/17310 (removed 28) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2024-05-20 16:16:47] [INFO ] Computed 181 invariants in 110 ms
[2024-05-20 16:16:47] [INFO ] Implicit Places using invariants in 937 ms returned []
Implicit Place search using SMT only with invariants took 942 ms to find 0 implicit places.
[2024-05-20 16:16:47] [INFO ] Invariant cache hit.
[2024-05-20 16:16:48] [INFO ] Dead Transitions using invariants and state equation in 812 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9377 places, 17282/17310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8632 ms. Remains : 9363/9377 places, 17282/17310 transitions.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s725 1) (GEQ s1014 1)), p2:(AND (GEQ s48 1) (GEQ s949 1)), p1:(LT s4048 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 75 reset in 1616 ms.
Product exploration explored 100000 steps with 76 reset in 1709 ms.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 16:16:53] [INFO ] Invariant cache hit.
[2024-05-20 16:16:54] [INFO ] [Real]Absence check using 91 positive place invariants in 223 ms returned sat
[2024-05-20 16:16:54] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 123 ms returned sat
[2024-05-20 16:16:54] [INFO ] After 1582ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:16:55] [INFO ] [Nat]Absence check using 91 positive place invariants in 219 ms returned sat
[2024-05-20 16:16:55] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 125 ms returned sat
[2024-05-20 16:17:08] [INFO ] After 12255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:17:08] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2024-05-20 16:17:12] [INFO ] After 3573ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 16:17:14] [INFO ] After 6074ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1626 ms.
[2024-05-20 16:17:16] [INFO ] After 21676ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 ms.
Support contains 5 out of 9363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9363/9363 places, 17282/17282 transitions.
Drop transitions removed 626 transitions
Trivial Post-agglo rules discarded 626 transitions
Performed 626 trivial Post agglomeration. Transition count delta: 626
Iterating post reduction 0 with 626 rules applied. Total rules applied 626 place count 9363 transition count 16656
Reduce places removed 626 places and 0 transitions.
Iterating post reduction 1 with 626 rules applied. Total rules applied 1252 place count 8737 transition count 16656
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1252 place count 8737 transition count 16654
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1256 place count 8735 transition count 16654
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 4 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 1432 place count 8647 transition count 16566
Free-agglomeration rule applied 178 times.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1610 place count 8647 transition count 16388
Reduce places removed 178 places and 0 transitions.
Iterating post reduction 2 with 178 rules applied. Total rules applied 1788 place count 8469 transition count 16388
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1790 place count 8469 transition count 16386
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1792 place count 8467 transition count 16386
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1796 place count 8467 transition count 16386
Applied a total of 1796 rules in 16233 ms. Remains 8467 /9363 variables (removed 896) and now considering 16386/17282 (removed 896) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16233 ms. Remains : 8467/9363 places, 16386/17282 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 96899 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96899 steps, saw 90075 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16386 rows 8467 cols
[2024-05-20 16:17:36] [INFO ] Computed 181 invariants in 116 ms
[2024-05-20 16:17:37] [INFO ] [Real]Absence check using 91 positive place invariants in 169 ms returned sat
[2024-05-20 16:17:37] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 99 ms returned sat
[2024-05-20 16:17:47] [INFO ] After 11901ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:17:49] [INFO ] [Nat]Absence check using 91 positive place invariants in 180 ms returned sat
[2024-05-20 16:17:49] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 87 ms returned sat
[2024-05-20 16:17:59] [INFO ] After 9996ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:17:59] [INFO ] State equation strengthened by 16201 read => feed constraints.
[2024-05-20 16:18:02] [INFO ] After 2496ms SMT Verify possible using 16201 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 16:18:03] [INFO ] After 3899ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1060 ms.
[2024-05-20 16:18:04] [INFO ] After 16484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 17 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (F (AND (NOT p0) p2 p1)), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 4 factoid took 279 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Support contains 5 out of 9363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9363/9363 places, 17282/17282 transitions.
Applied a total of 0 rules in 3502 ms. Remains 9363 /9363 variables (removed 0) and now considering 17282/17282 (removed 0) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2024-05-20 16:18:08] [INFO ] Computed 181 invariants in 116 ms
[2024-05-20 16:18:09] [INFO ] Implicit Places using invariants in 953 ms returned []
Implicit Place search using SMT only with invariants took 954 ms to find 0 implicit places.
[2024-05-20 16:18:09] [INFO ] Invariant cache hit.
[2024-05-20 16:18:10] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5266 ms. Remains : 9363/9363 places, 17282/17282 transitions.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 358 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 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 146624 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{0=1, 3=1, 5=1}
Probabilistic random walk after 146624 steps, saw 144327 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :3
Running SMT prover for 3 properties.
[2024-05-20 16:18:14] [INFO ] Invariant cache hit.
[2024-05-20 16:18:15] [INFO ] [Real]Absence check using 91 positive place invariants in 218 ms returned sat
[2024-05-20 16:18:15] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 125 ms returned sat
[2024-05-20 16:18:16] [INFO ] After 1674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 16:18:17] [INFO ] [Nat]Absence check using 91 positive place invariants in 221 ms returned sat
[2024-05-20 16:18:17] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 133 ms returned sat
[2024-05-20 16:18:30] [INFO ] After 12179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 16:18:30] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2024-05-20 16:18:34] [INFO ] After 4120ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 16:18:36] [INFO ] After 6534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1519 ms.
[2024-05-20 16:18:38] [INFO ] After 22235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 13 ms.
Support contains 5 out of 9363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9363/9363 places, 17282/17282 transitions.
Drop transitions removed 626 transitions
Trivial Post-agglo rules discarded 626 transitions
Performed 626 trivial Post agglomeration. Transition count delta: 626
Iterating post reduction 0 with 626 rules applied. Total rules applied 626 place count 9363 transition count 16656
Reduce places removed 626 places and 0 transitions.
Iterating post reduction 1 with 626 rules applied. Total rules applied 1252 place count 8737 transition count 16656
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1252 place count 8737 transition count 16654
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1256 place count 8735 transition count 16654
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 4 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 1432 place count 8647 transition count 16566
Free-agglomeration rule applied 178 times.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1610 place count 8647 transition count 16388
Reduce places removed 178 places and 0 transitions.
Iterating post reduction 2 with 178 rules applied. Total rules applied 1788 place count 8469 transition count 16388
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1790 place count 8469 transition count 16386
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1792 place count 8467 transition count 16386
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1796 place count 8467 transition count 16386
Applied a total of 1796 rules in 15694 ms. Remains 8467 /9363 variables (removed 896) and now considering 16386/17282 (removed 896) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15694 ms. Remains : 8467/9363 places, 16386/17282 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 96635 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96635 steps, saw 89987 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16386 rows 8467 cols
[2024-05-20 16:18:57] [INFO ] Computed 181 invariants in 113 ms
[2024-05-20 16:18:58] [INFO ] [Real]Absence check using 91 positive place invariants in 164 ms returned sat
[2024-05-20 16:18:58] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 111 ms returned sat
[2024-05-20 16:19:09] [INFO ] After 11600ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:19:10] [INFO ] [Nat]Absence check using 91 positive place invariants in 163 ms returned sat
[2024-05-20 16:19:10] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 99 ms returned sat
[2024-05-20 16:19:20] [INFO ] After 10079ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:19:20] [INFO ] State equation strengthened by 16201 read => feed constraints.
[2024-05-20 16:19:23] [INFO ] After 2491ms SMT Verify possible using 16201 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 16:19:24] [INFO ] After 3912ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1045 ms.
[2024-05-20 16:19:25] [INFO ] After 16583ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 17 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (F (AND (NOT p0) p2 p1)), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 4 factoid took 262 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 73 reset in 1645 ms.
Product exploration explored 100000 steps with 76 reset in 1691 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Support contains 5 out of 9363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9363/9363 places, 17282/17282 transitions.
Performed 446 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 446 rules applied. Total rules applied 446 place count 9363 transition count 17282
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 94 Pre rules applied. Total rules applied 446 place count 9363 transition count 17282
Deduced a syphon composed of 540 places in 4 ms
Iterating global reduction 1 with 94 rules applied. Total rules applied 540 place count 9363 transition count 17282
Discarding 180 places :
Symmetric choice reduction at 1 with 180 rule applications. Total rules 720 place count 9183 transition count 17102
Deduced a syphon composed of 360 places in 4 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 900 place count 9183 transition count 17102
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 536 places in 3 ms
Iterating global reduction 1 with 176 rules applied. Total rules applied 1076 place count 9183 transition count 17102
Discarding 352 places :
Symmetric choice reduction at 1 with 352 rule applications. Total rules 1428 place count 8831 transition count 16750
Deduced a syphon composed of 184 places in 3 ms
Iterating global reduction 1 with 352 rules applied. Total rules applied 1780 place count 8831 transition count 16750
Deduced a syphon composed of 184 places in 2 ms
Applied a total of 1780 rules in 14057 ms. Remains 8831 /9363 variables (removed 532) and now considering 16750/17282 (removed 532) transitions.
// Phase 1: matrix 16750 rows 8831 cols
[2024-05-20 16:19:44] [INFO ] Computed 181 invariants in 108 ms
[2024-05-20 16:19:45] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8831/9363 places, 16750/17282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14948 ms. Remains : 8831/9363 places, 16750/17282 transitions.
Built C files in :
/tmp/ltsmin423586158678331571
[2024-05-20 16:19:45] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin423586158678331571
Running compilation step : cd /tmp/ltsmin423586158678331571;'/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/ltsmin423586158678331571;'/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/ltsmin423586158678331571;'/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 9363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9363/9363 places, 17282/17282 transitions.
Applied a total of 0 rules in 3420 ms. Remains 9363 /9363 variables (removed 0) and now considering 17282/17282 (removed 0) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2024-05-20 16:19:52] [INFO ] Computed 181 invariants in 115 ms
[2024-05-20 16:19:52] [INFO ] Implicit Places using invariants in 966 ms returned []
Implicit Place search using SMT only with invariants took 967 ms to find 0 implicit places.
[2024-05-20 16:19:52] [INFO ] Invariant cache hit.
[2024-05-20 16:19:53] [INFO ] Dead Transitions using invariants and state equation in 853 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5241 ms. Remains : 9363/9363 places, 17282/17282 transitions.
Built C files in :
/tmp/ltsmin8094751553946178225
[2024-05-20 16:19:53] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8094751553946178225
Running compilation step : cd /tmp/ltsmin8094751553946178225;'/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/ltsmin8094751553946178225;'/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/ltsmin8094751553946178225;'/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-20 16:19:57] [INFO ] Flatten gal took : 376 ms
[2024-05-20 16:19:57] [INFO ] Flatten gal took : 370 ms
[2024-05-20 16:19:57] [INFO ] Time to serialize gal into /tmp/LTL6406999551950396640.gal : 76 ms
[2024-05-20 16:19:57] [INFO ] Time to serialize properties into /tmp/LTL3088380570675596929.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/LTL6406999551950396640.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1372344851287522248.hoa' '-atoms' '/tmp/LTL3088380570675596929.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/LTL3088380570675596929.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1372344851287522248.hoa
Detected timeout of ITS tools.
[2024-05-20 16:20:13] [INFO ] Flatten gal took : 386 ms
[2024-05-20 16:20:13] [INFO ] Flatten gal took : 404 ms
[2024-05-20 16:20:14] [INFO ] Time to serialize gal into /tmp/LTL10783628564180242228.gal : 57 ms
[2024-05-20 16:20:14] [INFO ] Time to serialize properties into /tmp/LTL4443801593630987862.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10783628564180242228.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4443801593630987862.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((Node51Request>=1)&&(Node72IsInserted>=1))"))||(G((G("(Node30GiveAnswer25<1)"))U((!("((Node3IsInserted>=1)&&(Node67Request...222
Formula 0 simplified : XX(G!"((Node51Request>=1)&&(Node72IsInserted>=1))" & F(F!"(Node30GiveAnswer25<1)" R ("((Node3IsInserted>=1)&&(Node67Request>=1))" & ...205
Detected timeout of ITS tools.
[2024-05-20 16:20:29] [INFO ] Flatten gal took : 357 ms
[2024-05-20 16:20:29] [INFO ] Applying decomposition
[2024-05-20 16:20:29] [INFO ] Flatten gal took : 373 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/graph94204016366789509.txt' '-o' '/tmp/graph94204016366789509.bin' '-w' '/tmp/graph94204016366789509.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph94204016366789509.bin' '-l' '-1' '-v' '-w' '/tmp/graph94204016366789509.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:20:30] [INFO ] Decomposing Gal with order
[2024-05-20 16:20:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:20:33] [INFO ] Removed a total of 16340 redundant transitions.
[2024-05-20 16:20:33] [INFO ] Flatten gal took : 1944 ms
[2024-05-20 16:20:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 32828 labels/synchronizations in 2771 ms.
[2024-05-20 16:20:36] [INFO ] Time to serialize gal into /tmp/LTL17644720359153251233.gal : 83 ms
[2024-05-20 16:20:36] [INFO ] Time to serialize properties into /tmp/LTL5457108466430979047.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/LTL17644720359153251233.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5457108466430979047.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((i51.u205.Node51Request>=1)&&(i44.u287.Node72IsInserted>=1))"))||(G((G("(i26.u360.Node30GiveAnswer25<1)"))U((!("((i63.u12....284
Formula 0 simplified : XX(G!"((i51.u205.Node51Request>=1)&&(i44.u287.Node72IsInserted>=1))" & F(F!"(i26.u360.Node30GiveAnswer25<1)" R ("((i63.u12.Node3IsIn...267
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13196674856608118244
[2024-05-20 16:20:51] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13196674856608118244
Running compilation step : cd /tmp/ltsmin13196674856608118244;'/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/ltsmin13196674856608118244;'/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/ltsmin13196674856608118244;'/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 CANConstruction-PT-090-LTLFireability-11 finished in 254718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U X(G(p1)))))'
Support contains 3 out of 9377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9377/9377 places, 17310/17310 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 9363 transition count 17282
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 9363 transition count 17282
Applied a total of 28 rules in 7209 ms. Remains 9363 /9377 variables (removed 14) and now considering 17282/17310 (removed 28) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2024-05-20 16:21:02] [INFO ] Computed 181 invariants in 115 ms
[2024-05-20 16:21:02] [INFO ] Implicit Places using invariants in 1037 ms returned []
Implicit Place search using SMT only with invariants took 1038 ms to find 0 implicit places.
[2024-05-20 16:21:02] [INFO ] Invariant cache hit.
[2024-05-20 16:21:03] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9377 places, 17282/17310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9082 ms. Remains : 9363/9377 places, 17282/17310 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LT s7864 1), p0:(AND (GEQ s907 1) (GEQ s1000 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25079 reset in 4471 ms.
Product exploration explored 100000 steps with 25000 reset in 4244 ms.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 88 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 16:21:13] [INFO ] Invariant cache hit.
[2024-05-20 16:21:14] [INFO ] [Real]Absence check using 91 positive place invariants in 234 ms returned sat
[2024-05-20 16:21:14] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 137 ms returned sat
[2024-05-20 16:21:26] [INFO ] After 11465ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-20 16:21:26] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2024-05-20 16:21:28] [INFO ] After 1967ms SMT Verify possible using 16110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:21:28] [INFO ] After 15267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:21:29] [INFO ] [Nat]Absence check using 91 positive place invariants in 219 ms returned sat
[2024-05-20 16:21:30] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 125 ms returned sat
[2024-05-20 16:21:41] [INFO ] After 11707ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:21:44] [INFO ] After 2316ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 16:21:45] [INFO ] After 3886ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 979 ms.
[2024-05-20 16:21:46] [INFO ] After 18166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 11 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F p0)]
Knowledge based reduction with 6 factoid took 139 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 9363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9363/9363 places, 17282/17282 transitions.
Applied a total of 0 rules in 3459 ms. Remains 9363 /9363 variables (removed 0) and now considering 17282/17282 (removed 0) transitions.
[2024-05-20 16:21:50] [INFO ] Invariant cache hit.
[2024-05-20 16:21:51] [INFO ] Implicit Places using invariants in 793 ms returned []
Implicit Place search using SMT only with invariants took 794 ms to find 0 implicit places.
[2024-05-20 16:21:51] [INFO ] Invariant cache hit.
[2024-05-20 16:21:52] [INFO ] Dead Transitions using invariants and state equation in 785 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5039 ms. Remains : 9363/9363 places, 17282/17282 transitions.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 74 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 16:21:53] [INFO ] Invariant cache hit.
[2024-05-20 16:21:54] [INFO ] [Real]Absence check using 91 positive place invariants in 219 ms returned sat
[2024-05-20 16:21:54] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 124 ms returned sat
[2024-05-20 16:22:04] [INFO ] After 10313ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-20 16:22:05] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2024-05-20 16:22:07] [INFO ] After 2000ms SMT Verify possible using 16110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:22:07] [INFO ] After 14023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:22:08] [INFO ] [Nat]Absence check using 91 positive place invariants in 226 ms returned sat
[2024-05-20 16:22:08] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 133 ms returned sat
[2024-05-20 16:22:20] [INFO ] After 11896ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:22:22] [INFO ] After 2339ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 16:22:24] [INFO ] After 3884ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1033 ms.
[2024-05-20 16:22:25] [INFO ] After 18360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 11 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F p0)]
Knowledge based reduction with 6 factoid took 175 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 24993 reset in 4242 ms.
Product exploration explored 100000 steps with 25047 reset in 4264 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 9363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9363/9363 places, 17282/17282 transitions.
Performed 448 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 448 rules applied. Total rules applied 448 place count 9363 transition count 17282
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 92 Pre rules applied. Total rules applied 448 place count 9363 transition count 17282
Deduced a syphon composed of 540 places in 4 ms
Iterating global reduction 1 with 92 rules applied. Total rules applied 540 place count 9363 transition count 17282
Discarding 180 places :
Symmetric choice reduction at 1 with 180 rule applications. Total rules 720 place count 9183 transition count 17102
Deduced a syphon composed of 360 places in 4 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 900 place count 9183 transition count 17102
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 538 places in 3 ms
Iterating global reduction 1 with 178 rules applied. Total rules applied 1078 place count 9183 transition count 17102
Discarding 356 places :
Symmetric choice reduction at 1 with 356 rule applications. Total rules 1434 place count 8827 transition count 16746
Deduced a syphon composed of 182 places in 2 ms
Iterating global reduction 1 with 356 rules applied. Total rules applied 1790 place count 8827 transition count 16746
Deduced a syphon composed of 182 places in 3 ms
Applied a total of 1790 rules in 14272 ms. Remains 8827 /9363 variables (removed 536) and now considering 16746/17282 (removed 536) transitions.
// Phase 1: matrix 16746 rows 8827 cols
[2024-05-20 16:22:49] [INFO ] Computed 181 invariants in 129 ms
[2024-05-20 16:22:49] [INFO ] Dead Transitions using invariants and state equation in 921 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8827/9363 places, 16746/17282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15195 ms. Remains : 8827/9363 places, 16746/17282 transitions.
Built C files in :
/tmp/ltsmin7844759361605764416
[2024-05-20 16:22:50] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7844759361605764416
Running compilation step : cd /tmp/ltsmin7844759361605764416;'/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/ltsmin7844759361605764416;'/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/ltsmin7844759361605764416;'/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 3 out of 9363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9363/9363 places, 17282/17282 transitions.
Applied a total of 0 rules in 3405 ms. Remains 9363 /9363 variables (removed 0) and now considering 17282/17282 (removed 0) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2024-05-20 16:22:56] [INFO ] Computed 181 invariants in 113 ms
[2024-05-20 16:22:57] [INFO ] Implicit Places using invariants in 930 ms returned []
Implicit Place search using SMT only with invariants took 931 ms to find 0 implicit places.
[2024-05-20 16:22:57] [INFO ] Invariant cache hit.
[2024-05-20 16:22:58] [INFO ] Dead Transitions using invariants and state equation in 803 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5142 ms. Remains : 9363/9363 places, 17282/17282 transitions.
Built C files in :
/tmp/ltsmin5750520498072849301
[2024-05-20 16:22:58] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5750520498072849301
Running compilation step : cd /tmp/ltsmin5750520498072849301;'/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/ltsmin5750520498072849301;'/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/ltsmin5750520498072849301;'/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-20 16:23:01] [INFO ] Flatten gal took : 363 ms
[2024-05-20 16:23:02] [INFO ] Flatten gal took : 374 ms
[2024-05-20 16:23:02] [INFO ] Time to serialize gal into /tmp/LTL13375824338274576431.gal : 77 ms
[2024-05-20 16:23:02] [INFO ] Time to serialize properties into /tmp/LTL10587186639082781418.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/LTL13375824338274576431.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11983964488253095183.hoa' '-atoms' '/tmp/LTL10587186639082781418.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...320
Loading property file /tmp/LTL10587186639082781418.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11983964488253095183.hoa
Detected timeout of ITS tools.
[2024-05-20 16:23:18] [INFO ] Flatten gal took : 367 ms
[2024-05-20 16:23:18] [INFO ] Flatten gal took : 379 ms
[2024-05-20 16:23:18] [INFO ] Time to serialize gal into /tmp/LTL18237034305264583631.gal : 56 ms
[2024-05-20 16:23:18] [INFO ] Time to serialize properties into /tmp/LTL2684614175410464332.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18237034305264583631.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2684614175410464332.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F("((Node64Request>=1)&&(Node71IsInserted>=1))"))U(X(G("(Node73GiveAnswer14<1)"))))))
Formula 0 simplified : X(G!"((Node64Request>=1)&&(Node71IsInserted>=1))" R XF!"(Node73GiveAnswer14<1)")
Detected timeout of ITS tools.
[2024-05-20 16:23:33] [INFO ] Flatten gal took : 389 ms
[2024-05-20 16:23:33] [INFO ] Applying decomposition
[2024-05-20 16:23:34] [INFO ] Flatten gal took : 358 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/graph18292867462309525412.txt' '-o' '/tmp/graph18292867462309525412.bin' '-w' '/tmp/graph18292867462309525412.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18292867462309525412.bin' '-l' '-1' '-v' '-w' '/tmp/graph18292867462309525412.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:23:35] [INFO ] Decomposing Gal with order
[2024-05-20 16:23:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:23:37] [INFO ] Removed a total of 16334 redundant transitions.
[2024-05-20 16:23:37] [INFO ] Flatten gal took : 1954 ms
[2024-05-20 16:23:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 32124 labels/synchronizations in 2890 ms.
[2024-05-20 16:23:41] [INFO ] Time to serialize gal into /tmp/LTL8073437651160511902.gal : 79 ms
[2024-05-20 16:23:41] [INFO ] Time to serialize properties into /tmp/LTL530215300231013535.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8073437651160511902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL530215300231013535.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...253
Read 1 LTL properties
Checking formula 0 : !((X((F("((i64.u257.Node64Request>=1)&&(i13.u282.Node71IsInserted>=1))"))U(X(G("(i89.u360.Node73GiveAnswer14<1)"))))))
Formula 0 simplified : X(G!"((i64.u257.Node64Request>=1)&&(i13.u282.Node71IsInserted>=1))" R XF!"(i89.u360.Node73GiveAnswer14<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3483987679736241706
[2024-05-20 16:23:56] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3483987679736241706
Running compilation step : cd /tmp/ltsmin3483987679736241706;'/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/ltsmin3483987679736241706;'/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/ltsmin3483987679736241706;'/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 CANConstruction-PT-090-LTLFireability-12 finished in 184554 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||X(G(!p0))) U (p1&&(p1 U p2)))))'
Support contains 4 out of 9377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9377/9377 places, 17310/17310 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 9364 transition count 17284
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 9364 transition count 17284
Applied a total of 26 rules in 6573 ms. Remains 9364 /9377 variables (removed 13) and now considering 17284/17310 (removed 26) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2024-05-20 16:24:05] [INFO ] Computed 181 invariants in 111 ms
[2024-05-20 16:24:06] [INFO ] Implicit Places using invariants in 911 ms returned []
Implicit Place search using SMT only with invariants took 912 ms to find 0 implicit places.
[2024-05-20 16:24:06] [INFO ] Invariant cache hit.
[2024-05-20 16:24:07] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9364/9377 places, 17284/17310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8291 ms. Remains : 9364/9377 places, 17284/17310 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) (NOT p2)), p0, (OR (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LT s4238 1), p0:(AND (GEQ s440 1) (GEQ s6368 1)), p2:(GEQ s6483 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1678 steps with 0 reset in 27 ms.
FORMULA CANConstruction-PT-090-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-13 finished in 8606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 9377 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9377/9377 places, 17310/17310 transitions.
Drop transitions removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 9377 transition count 16681
Reduce places removed 629 places and 0 transitions.
Iterating post reduction 1 with 629 rules applied. Total rules applied 1258 place count 8748 transition count 16681
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1272 place count 8734 transition count 16653
Iterating global reduction 2 with 14 rules applied. Total rules applied 1286 place count 8734 transition count 16653
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1466 place count 8644 transition count 16563
Applied a total of 1466 rules in 9187 ms. Remains 8644 /9377 variables (removed 733) and now considering 16563/17310 (removed 747) transitions.
// Phase 1: matrix 16563 rows 8644 cols
[2024-05-20 16:24:17] [INFO ] Computed 181 invariants in 109 ms
[2024-05-20 16:24:17] [INFO ] Implicit Places using invariants in 886 ms returned []
Implicit Place search using SMT only with invariants took 887 ms to find 0 implicit places.
[2024-05-20 16:24:17] [INFO ] Invariant cache hit.
[2024-05-20 16:24:18] [INFO ] Dead Transitions using invariants and state equation in 767 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8644/9377 places, 16563/17310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10847 ms. Remains : 8644/9377 places, 16563/17310 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (LT s172 1) (LT s6536 1)), p0:(GEQ s899 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 125 reset in 2104 ms.
Product exploration explored 100000 steps with 125 reset in 2237 ms.
Computed a total of 273 stabilizing places and 271 stable transitions
Computed a total of 273 stabilizing places and 271 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 206488 steps, run timeout after 3002 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206488 steps, saw 202790 distinct states, run finished after 3002 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-20 16:24:26] [INFO ] Invariant cache hit.
[2024-05-20 16:24:27] [INFO ] [Real]Absence check using 91 positive place invariants in 181 ms returned sat
[2024-05-20 16:24:27] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 113 ms returned sat
[2024-05-20 16:24:28] [INFO ] After 1342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:24:29] [INFO ] [Nat]Absence check using 91 positive place invariants in 174 ms returned sat
[2024-05-20 16:24:29] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 111 ms returned sat
[2024-05-20 16:24:40] [INFO ] After 10866ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:24:40] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2024-05-20 16:24:42] [INFO ] After 2207ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 16:24:44] [INFO ] After 3679ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1192 ms.
[2024-05-20 16:24:45] [INFO ] After 17257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 208 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 8644 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8644/8644 places, 16563/16563 transitions.
Applied a total of 0 rules in 3109 ms. Remains 8644 /8644 variables (removed 0) and now considering 16563/16563 (removed 0) transitions.
[2024-05-20 16:24:48] [INFO ] Invariant cache hit.
[2024-05-20 16:24:49] [INFO ] Implicit Places using invariants in 775 ms returned []
Implicit Place search using SMT only with invariants took 775 ms to find 0 implicit places.
[2024-05-20 16:24:49] [INFO ] Invariant cache hit.
[2024-05-20 16:24:50] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4644 ms. Remains : 8644/8644 places, 16563/16563 transitions.
Computed a total of 273 stabilizing places and 271 stable transitions
Computed a total of 273 stabilizing places and 271 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 173 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
[2024-05-20 16:24:50] [INFO ] Invariant cache hit.
[2024-05-20 16:24:51] [INFO ] [Real]Absence check using 91 positive place invariants in 179 ms returned sat
[2024-05-20 16:24:51] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 110 ms returned sat
[2024-05-20 16:25:01] [INFO ] After 9791ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 16:25:01] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2024-05-20 16:25:03] [INFO ] After 1587ms SMT Verify possible using 16200 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:25:03] [INFO ] After 12741ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:25:04] [INFO ] [Nat]Absence check using 91 positive place invariants in 175 ms returned sat
[2024-05-20 16:25:04] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 111 ms returned sat
[2024-05-20 16:25:15] [INFO ] After 11036ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:25:17] [INFO ] After 1778ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:25:18] [INFO ] After 2496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 649 ms.
[2024-05-20 16:25:18] [INFO ] After 15368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 123 reset in 2177 ms.
Stack based approach found an accepted trace after 91404 steps with 114 reset with depth 810 and stack size 810 in 1955 ms.
FORMULA CANConstruction-PT-090-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-14 finished in 75506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 9377 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9377/9377 places, 17310/17310 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9377 transition count 16680
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8747 transition count 16680
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1274 place count 8733 transition count 16652
Iterating global reduction 2 with 14 rules applied. Total rules applied 1288 place count 8733 transition count 16652
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1468 place count 8643 transition count 16562
Applied a total of 1468 rules in 8901 ms. Remains 8643 /9377 variables (removed 734) and now considering 16562/17310 (removed 748) transitions.
// Phase 1: matrix 16562 rows 8643 cols
[2024-05-20 16:25:32] [INFO ] Computed 181 invariants in 109 ms
[2024-05-20 16:25:33] [INFO ] Implicit Places using invariants in 898 ms returned []
Implicit Place search using SMT only with invariants took 900 ms to find 0 implicit places.
[2024-05-20 16:25:33] [INFO ] Invariant cache hit.
[2024-05-20 16:25:33] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8643/9377 places, 16562/17310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10572 ms. Remains : 8643/9377 places, 16562/17310 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s3830 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 124 reset in 2171 ms.
Product exploration explored 100000 steps with 123 reset in 2157 ms.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 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 39 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 353878 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 353878 steps, saw 346442 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 16:25:41] [INFO ] Invariant cache hit.
[2024-05-20 16:25:42] [INFO ] [Real]Absence check using 91 positive place invariants in 194 ms returned sat
[2024-05-20 16:25:42] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 113 ms returned sat
[2024-05-20 16:25:52] [INFO ] After 9707ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 16:25:52] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2024-05-20 16:25:54] [INFO ] After 1658ms SMT Verify possible using 16200 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:25:54] [INFO ] After 12713ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:25:55] [INFO ] [Nat]Absence check using 91 positive place invariants in 193 ms returned sat
[2024-05-20 16:25:55] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 124 ms returned sat
[2024-05-20 16:26:06] [INFO ] After 10968ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:26:08] [INFO ] After 1547ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:26:08] [INFO ] After 2273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 468 ms.
[2024-05-20 16:26:09] [INFO ] After 14913ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 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)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 1 out of 8643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8643/8643 places, 16562/16562 transitions.
Applied a total of 0 rules in 3248 ms. Remains 8643 /8643 variables (removed 0) and now considering 16562/16562 (removed 0) transitions.
[2024-05-20 16:26:12] [INFO ] Invariant cache hit.
[2024-05-20 16:26:13] [INFO ] Implicit Places using invariants in 828 ms returned []
Implicit Place search using SMT only with invariants took 829 ms to find 0 implicit places.
[2024-05-20 16:26:13] [INFO ] Invariant cache hit.
[2024-05-20 16:26:14] [INFO ] Dead Transitions using invariants and state equation in 810 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4890 ms. Remains : 8643/8643 places, 16562/16562 transitions.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 242 ms. (steps per millisecond=41 ) 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 349114 steps, run timeout after 3002 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 349114 steps, saw 341836 distinct states, run finished after 3002 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 16:26:18] [INFO ] Invariant cache hit.
[2024-05-20 16:26:19] [INFO ] [Real]Absence check using 91 positive place invariants in 191 ms returned sat
[2024-05-20 16:26:19] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 111 ms returned sat
[2024-05-20 16:26:28] [INFO ] After 9605ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 16:26:29] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2024-05-20 16:26:30] [INFO ] After 1598ms SMT Verify possible using 16200 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:26:30] [INFO ] After 12627ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:26:31] [INFO ] [Nat]Absence check using 91 positive place invariants in 186 ms returned sat
[2024-05-20 16:26:31] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 105 ms returned sat
[2024-05-20 16:26:42] [INFO ] After 10991ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:26:44] [INFO ] After 1582ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:26:45] [INFO ] After 2286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 484 ms.
[2024-05-20 16:26:45] [INFO ] After 14958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 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 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 125 reset in 2097 ms.
Product exploration explored 100000 steps with 124 reset in 2137 ms.
Built C files in :
/tmp/ltsmin11938385369183197656
[2024-05-20 16:26:50] [INFO ] Too many transitions (16562) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:26:50] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11938385369183197656
Running compilation step : cd /tmp/ltsmin11938385369183197656;'/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/ltsmin11938385369183197656;'/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/ltsmin11938385369183197656;'/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 1 out of 8643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8643/8643 places, 16562/16562 transitions.
Applied a total of 0 rules in 3085 ms. Remains 8643 /8643 variables (removed 0) and now considering 16562/16562 (removed 0) transitions.
[2024-05-20 16:26:56] [INFO ] Invariant cache hit.
[2024-05-20 16:26:57] [INFO ] Implicit Places using invariants in 741 ms returned []
Implicit Place search using SMT only with invariants took 742 ms to find 0 implicit places.
[2024-05-20 16:26:57] [INFO ] Invariant cache hit.
[2024-05-20 16:26:57] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4581 ms. Remains : 8643/8643 places, 16562/16562 transitions.
Built C files in :
/tmp/ltsmin17456535057929038979
[2024-05-20 16:26:57] [INFO ] Too many transitions (16562) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:26:57] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17456535057929038979
Running compilation step : cd /tmp/ltsmin17456535057929038979;'/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/ltsmin17456535057929038979;'/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/ltsmin17456535057929038979;'/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-20 16:27:01] [INFO ] Flatten gal took : 353 ms
[2024-05-20 16:27:01] [INFO ] Flatten gal took : 370 ms
[2024-05-20 16:27:01] [INFO ] Time to serialize gal into /tmp/LTL2473526493511743888.gal : 52 ms
[2024-05-20 16:27:01] [INFO ] Time to serialize properties into /tmp/LTL7288462743002495408.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/LTL2473526493511743888.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9350507599920387668.hoa' '-atoms' '/tmp/LTL7288462743002495408.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/LTL7288462743002495408.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9350507599920387668.hoa
Detected timeout of ITS tools.
[2024-05-20 16:27:17] [INFO ] Flatten gal took : 341 ms
[2024-05-20 16:27:17] [INFO ] Flatten gal took : 358 ms
[2024-05-20 16:27:17] [INFO ] Time to serialize gal into /tmp/LTL1147645197465223472.gal : 55 ms
[2024-05-20 16:27:17] [INFO ] Time to serialize properties into /tmp/LTL3315764851635978409.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/LTL1147645197465223472.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3315764851635978409.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 : !((F(G("(Node35GiveAnswer83<1)"))))
Formula 0 simplified : GF!"(Node35GiveAnswer83<1)"
Detected timeout of ITS tools.
[2024-05-20 16:27:33] [INFO ] Flatten gal took : 349 ms
[2024-05-20 16:27:33] [INFO ] Applying decomposition
[2024-05-20 16:27:33] [INFO ] Flatten gal took : 361 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/graph17809348889822272781.txt' '-o' '/tmp/graph17809348889822272781.bin' '-w' '/tmp/graph17809348889822272781.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17809348889822272781.bin' '-l' '-1' '-v' '-w' '/tmp/graph17809348889822272781.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:27:34] [INFO ] Decomposing Gal with order
[2024-05-20 16:27:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:27:36] [INFO ] Removed a total of 16011 redundant transitions.
[2024-05-20 16:27:36] [INFO ] Flatten gal took : 1936 ms
[2024-05-20 16:27:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 16014 labels/synchronizations in 2556 ms.
[2024-05-20 16:27:39] [INFO ] Time to serialize gal into /tmp/LTL9839768087161240946.gal : 62 ms
[2024-05-20 16:27:39] [INFO ] Time to serialize properties into /tmp/LTL1695766356279486835.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9839768087161240946.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1695766356279486835.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("(i83.u91.Node35GiveAnswer83<1)"))))
Formula 0 simplified : GF!"(i83.u91.Node35GiveAnswer83<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8878831785760711330
[2024-05-20 16:27:54] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8878831785760711330
Running compilation step : cd /tmp/ltsmin8878831785760711330;'/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/ltsmin8878831785760711330;'/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/ltsmin8878831785760711330;'/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 CANConstruction-PT-090-LTLFireability-15 finished in 154502 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||X(X((p1||(X(p0)&&p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Found a Shortening insensitive property : CANConstruction-PT-090-LTLFireability-08
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 9377 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 9377/9377 places, 17310/17310 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 9377 transition count 16682
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 8749 transition count 16682
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 8749 transition count 16681
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 8748 transition count 16681
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1273 place count 8733 transition count 16651
Iterating global reduction 2 with 15 rules applied. Total rules applied 1288 place count 8733 transition count 16651
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1466 place count 8644 transition count 16562
Applied a total of 1466 rules in 8859 ms. Remains 8644 /9377 variables (removed 733) and now considering 16562/17310 (removed 748) transitions.
// Phase 1: matrix 16562 rows 8644 cols
[2024-05-20 16:28:07] [INFO ] Computed 181 invariants in 104 ms
[2024-05-20 16:28:07] [INFO ] Implicit Places using invariants in 859 ms returned []
Implicit Place search using SMT only with invariants took 860 ms to find 0 implicit places.
[2024-05-20 16:28:07] [INFO ] Invariant cache hit.
[2024-05-20 16:28:08] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 8644/9377 places, 16562/17310 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10489 ms. Remains : 8644/9377 places, 16562/17310 transitions.
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (LT s316 1) (LT s480 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 4384 ms.
Product exploration explored 100000 steps with 20000 reset in 4391 ms.
Computed a total of 270 stabilizing places and 270 stable transitions
Computed a total of 270 stabilizing places and 270 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 614 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 8644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8644/8644 places, 16562/16562 transitions.
Applied a total of 0 rules in 2833 ms. Remains 8644 /8644 variables (removed 0) and now considering 16562/16562 (removed 0) transitions.
[2024-05-20 16:28:21] [INFO ] Invariant cache hit.
[2024-05-20 16:28:21] [INFO ] Implicit Places using invariants in 760 ms returned []
Implicit Place search using SMT only with invariants took 769 ms to find 0 implicit places.
[2024-05-20 16:28:21] [INFO ] Invariant cache hit.
[2024-05-20 16:28:22] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4360 ms. Remains : 8644/8644 places, 16562/16562 transitions.
Computed a total of 270 stabilizing places and 270 stable transitions
Computed a total of 270 stabilizing places and 270 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 311 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=38 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 4359 ms.
Product exploration explored 100000 steps with 20000 reset in 4408 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 8644 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8644/8644 places, 16562/16562 transitions.
Applied a total of 0 rules in 3107 ms. Remains 8644 /8644 variables (removed 0) and now considering 16562/16562 (removed 0) transitions.
[2024-05-20 16:28:35] [INFO ] Invariant cache hit.
[2024-05-20 16:28:36] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3874 ms. Remains : 8644/8644 places, 16562/16562 transitions.
Built C files in :
/tmp/ltsmin12266287432414558893
[2024-05-20 16:28:36] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12266287432414558893
Running compilation step : cd /tmp/ltsmin12266287432414558893;'/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/ltsmin12266287432414558893;'/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/ltsmin12266287432414558893;'/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 8644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8644/8644 places, 16562/16562 transitions.
Applied a total of 0 rules in 2788 ms. Remains 8644 /8644 variables (removed 0) and now considering 16562/16562 (removed 0) transitions.
[2024-05-20 16:28:42] [INFO ] Invariant cache hit.
[2024-05-20 16:28:43] [INFO ] Implicit Places using invariants in 743 ms returned []
Implicit Place search using SMT only with invariants took 744 ms to find 0 implicit places.
[2024-05-20 16:28:43] [INFO ] Invariant cache hit.
[2024-05-20 16:28:43] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4291 ms. Remains : 8644/8644 places, 16562/16562 transitions.
Built C files in :
/tmp/ltsmin9991581885565045488
[2024-05-20 16:28:44] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9991581885565045488
Running compilation step : cd /tmp/ltsmin9991581885565045488;'/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/ltsmin9991581885565045488;'/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/ltsmin9991581885565045488;'/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-20 16:28:47] [INFO ] Flatten gal took : 347 ms
[2024-05-20 16:28:47] [INFO ] Flatten gal took : 357 ms
[2024-05-20 16:28:48] [INFO ] Time to serialize gal into /tmp/LTL8284017660136393942.gal : 53 ms
[2024-05-20 16:28:48] [INFO ] Time to serialize properties into /tmp/LTL14615466915329978423.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/LTL8284017660136393942.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1617207785716013312.hoa' '-atoms' '/tmp/LTL14615466915329978423.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14615466915329978423.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1617207785716013312.hoa
Detected timeout of ITS tools.
[2024-05-20 16:29:03] [INFO ] Flatten gal took : 385 ms
[2024-05-20 16:29:03] [INFO ] Flatten gal took : 345 ms
[2024-05-20 16:29:04] [INFO ] Time to serialize gal into /tmp/LTL17370539703387256057.gal : 57 ms
[2024-05-20 16:29:04] [INFO ] Time to serialize properties into /tmp/LTL16941307954861048038.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/LTL17370539703387256057.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16941307954861048038.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 : !((X(X(X(X(F("((Node52IsInserted<1)||(Node79Request<1))")))))))
Formula 0 simplified : XXXXG!"((Node52IsInserted<1)||(Node79Request<1))"
Detected timeout of ITS tools.
[2024-05-20 16:29:19] [INFO ] Flatten gal took : 343 ms
[2024-05-20 16:29:19] [INFO ] Applying decomposition
[2024-05-20 16:29:19] [INFO ] Flatten gal took : 360 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/graph7385392377317893029.txt' '-o' '/tmp/graph7385392377317893029.bin' '-w' '/tmp/graph7385392377317893029.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7385392377317893029.bin' '-l' '-1' '-v' '-w' '/tmp/graph7385392377317893029.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:29:20] [INFO ] Decomposing Gal with order
[2024-05-20 16:29:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:29:22] [INFO ] Removed a total of 15988 redundant transitions.
[2024-05-20 16:29:23] [INFO ] Flatten gal took : 1936 ms
[2024-05-20 16:29:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 15842 labels/synchronizations in 2539 ms.
[2024-05-20 16:29:25] [INFO ] Time to serialize gal into /tmp/LTL12632497656217319465.gal : 62 ms
[2024-05-20 16:29:25] [INFO ] Time to serialize properties into /tmp/LTL14273079698397916958.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/LTL12632497656217319465.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14273079698397916958.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 : !((X(X(X(X(F("((u57.Node52IsInserted<1)||(u80.Node79Request<1))")))))))
Formula 0 simplified : XXXXG!"((u57.Node52IsInserted<1)||(u80.Node79Request<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14414382305782470968
[2024-05-20 16:29:40] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14414382305782470968
Running compilation step : cd /tmp/ltsmin14414382305782470968;'/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/ltsmin14414382305782470968;'/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/ltsmin14414382305782470968;'/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 CANConstruction-PT-090-LTLFireability-08 finished in 105953 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((F(p0)||G((G(p1) U (!p2||F(p0))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U X(G(p1)))))'
Found a Lengthening insensitive property : CANConstruction-PT-090-LTLFireability-12
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 9377 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 9377/9377 places, 17310/17310 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 9377 transition count 16682
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 8749 transition count 16682
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 8749 transition count 16681
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 8748 transition count 16681
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1272 place count 8734 transition count 16653
Iterating global reduction 2 with 14 rules applied. Total rules applied 1286 place count 8734 transition count 16653
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 5 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1464 place count 8645 transition count 16564
Applied a total of 1464 rules in 9069 ms. Remains 8645 /9377 variables (removed 732) and now considering 16564/17310 (removed 746) transitions.
// Phase 1: matrix 16564 rows 8645 cols
[2024-05-20 16:29:53] [INFO ] Computed 181 invariants in 107 ms
[2024-05-20 16:29:54] [INFO ] Implicit Places using invariants in 989 ms returned []
Implicit Place search using SMT only with invariants took 990 ms to find 0 implicit places.
[2024-05-20 16:29:54] [INFO ] Invariant cache hit.
[2024-05-20 16:29:55] [INFO ] Dead Transitions using invariants and state equation in 866 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 8645/9377 places, 16564/17310 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10927 ms. Remains : 8645/9377 places, 16564/17310 transitions.
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LT s7146 1), p0:(AND (GEQ s389 1) (GEQ s431 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25039 reset in 4943 ms.
Product exploration explored 100000 steps with 24952 reset in 5046 ms.
Computed a total of 270 stabilizing places and 270 stable transitions
Computed a total of 270 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 84 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 4588 steps, including 5 resets, run visited all 3 properties in 156 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F p0)]
Knowledge based reduction with 6 factoid took 198 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 8645 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8645/8645 places, 16564/16564 transitions.
Applied a total of 0 rules in 2885 ms. Remains 8645 /8645 variables (removed 0) and now considering 16564/16564 (removed 0) transitions.
[2024-05-20 16:30:09] [INFO ] Invariant cache hit.
[2024-05-20 16:30:09] [INFO ] Implicit Places using invariants in 784 ms returned []
Implicit Place search using SMT only with invariants took 789 ms to find 0 implicit places.
[2024-05-20 16:30:09] [INFO ] Invariant cache hit.
[2024-05-20 16:30:10] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4461 ms. Remains : 8645/8645 places, 16564/16564 transitions.
Computed a total of 270 stabilizing places and 270 stable transitions
Computed a total of 270 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 106 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 16:30:11] [INFO ] Invariant cache hit.
[2024-05-20 16:30:12] [INFO ] [Real]Absence check using 91 positive place invariants in 185 ms returned sat
[2024-05-20 16:30:12] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 123 ms returned sat
[2024-05-20 16:30:22] [INFO ] After 9859ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-20 16:30:22] [INFO ] State equation strengthened by 16199 read => feed constraints.
[2024-05-20 16:30:24] [INFO ] After 1631ms SMT Verify possible using 16199 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:30:24] [INFO ] After 13101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:30:25] [INFO ] [Nat]Absence check using 91 positive place invariants in 184 ms returned sat
[2024-05-20 16:30:25] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 111 ms returned sat
[2024-05-20 16:30:36] [INFO ] After 10132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 16:30:38] [INFO ] After 2024ms SMT Verify possible using 16199 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 16:30:39] [INFO ] After 3368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 902 ms.
[2024-05-20 16:30:40] [INFO ] After 15807ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 4 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F p0)]
Knowledge based reduction with 6 factoid took 161 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 25009 reset in 5089 ms.
Product exploration explored 100000 steps with 24944 reset in 5197 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 8645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8645/8645 places, 16564/16564 transitions.
Applied a total of 0 rules in 3304 ms. Remains 8645 /8645 variables (removed 0) and now considering 16564/16564 (removed 0) transitions.
[2024-05-20 16:30:54] [INFO ] Invariant cache hit.
[2024-05-20 16:30:55] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4112 ms. Remains : 8645/8645 places, 16564/16564 transitions.
Built C files in :
/tmp/ltsmin9413598740510915718
[2024-05-20 16:30:55] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9413598740510915718
Running compilation step : cd /tmp/ltsmin9413598740510915718;'/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/ltsmin9413598740510915718;'/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/ltsmin9413598740510915718;'/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 3 out of 8645 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8645/8645 places, 16564/16564 transitions.
Applied a total of 0 rules in 2972 ms. Remains 8645 /8645 variables (removed 0) and now considering 16564/16564 (removed 0) transitions.
[2024-05-20 16:31:01] [INFO ] Invariant cache hit.
[2024-05-20 16:31:02] [INFO ] Implicit Places using invariants in 808 ms returned []
Implicit Place search using SMT only with invariants took 809 ms to find 0 implicit places.
[2024-05-20 16:31:02] [INFO ] Invariant cache hit.
[2024-05-20 16:31:03] [INFO ] Dead Transitions using invariants and state equation in 798 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4581 ms. Remains : 8645/8645 places, 16564/16564 transitions.
Built C files in :
/tmp/ltsmin1308330392550474059
[2024-05-20 16:31:03] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1308330392550474059
Running compilation step : cd /tmp/ltsmin1308330392550474059;'/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/ltsmin1308330392550474059;'/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/ltsmin1308330392550474059;'/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-20 16:31:06] [INFO ] Flatten gal took : 369 ms
[2024-05-20 16:31:07] [INFO ] Flatten gal took : 368 ms
[2024-05-20 16:31:07] [INFO ] Time to serialize gal into /tmp/LTL3286086893206754193.gal : 55 ms
[2024-05-20 16:31:07] [INFO ] Time to serialize properties into /tmp/LTL12722591971378623347.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/LTL3286086893206754193.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2910789402678567715.hoa' '-atoms' '/tmp/LTL12722591971378623347.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12722591971378623347.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2910789402678567715.hoa
Detected timeout of ITS tools.
[2024-05-20 16:31:22] [INFO ] Flatten gal took : 336 ms
[2024-05-20 16:31:23] [INFO ] Flatten gal took : 355 ms
[2024-05-20 16:31:23] [INFO ] Time to serialize gal into /tmp/LTL11240554256543689968.gal : 54 ms
[2024-05-20 16:31:23] [INFO ] Time to serialize properties into /tmp/LTL10638887940255642099.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/LTL11240554256543689968.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10638887940255642099.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 : !((X((F("((Node64Request>=1)&&(Node71IsInserted>=1))"))U(X(G("(Node73GiveAnswer14<1)"))))))
Formula 0 simplified : X(G!"((Node64Request>=1)&&(Node71IsInserted>=1))" R XF!"(Node73GiveAnswer14<1)")
Detected timeout of ITS tools.
[2024-05-20 16:31:38] [INFO ] Flatten gal took : 345 ms
[2024-05-20 16:31:38] [INFO ] Applying decomposition
[2024-05-20 16:31:39] [INFO ] Flatten gal took : 364 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/graph3069589231581074668.txt' '-o' '/tmp/graph3069589231581074668.bin' '-w' '/tmp/graph3069589231581074668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3069589231581074668.bin' '-l' '-1' '-v' '-w' '/tmp/graph3069589231581074668.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:31:39] [INFO ] Decomposing Gal with order
[2024-05-20 16:31:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:31:42] [INFO ] Removed a total of 15997 redundant transitions.
[2024-05-20 16:31:42] [INFO ] Flatten gal took : 1961 ms
[2024-05-20 16:31:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 16016 labels/synchronizations in 2609 ms.
[2024-05-20 16:31:45] [INFO ] Time to serialize gal into /tmp/LTL5077441148174749086.gal : 62 ms
[2024-05-20 16:31:45] [INFO ] Time to serialize properties into /tmp/LTL5826032250517645777.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/LTL5077441148174749086.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5826032250517645777.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((F("((u67.Node64Request>=1)&&(u52.Node71IsInserted>=1))"))U(X(G("(i15.u16.Node73GiveAnswer14<1)"))))))
Formula 0 simplified : X(G!"((u67.Node64Request>=1)&&(u52.Node71IsInserted>=1))" R XF!"(i15.u16.Node73GiveAnswer14<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin158159001241759083
[2024-05-20 16:32:00] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin158159001241759083
Running compilation step : cd /tmp/ltsmin158159001241759083;'/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/ltsmin158159001241759083;'/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/ltsmin158159001241759083;'/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 CANConstruction-PT-090-LTLFireability-12 finished in 139397 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)))'
[2024-05-20 16:32:03] [INFO ] Flatten gal took : 370 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6140547784960780554
[2024-05-20 16:32:04] [INFO ] Too many transitions (17310) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:32:04] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6140547784960780554
Running compilation step : cd /tmp/ltsmin6140547784960780554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '144' '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-20 16:32:04] [INFO ] Applying decomposition
[2024-05-20 16:32:04] [INFO ] Flatten gal took : 386 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/graph6746363436947556385.txt' '-o' '/tmp/graph6746363436947556385.bin' '-w' '/tmp/graph6746363436947556385.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6746363436947556385.bin' '-l' '-1' '-v' '-w' '/tmp/graph6746363436947556385.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:32:05] [INFO ] Decomposing Gal with order
[2024-05-20 16:32:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:32:08] [INFO ] Removed a total of 16342 redundant transitions.
[2024-05-20 16:32:08] [INFO ] Flatten gal took : 1936 ms
[2024-05-20 16:32:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 33895 labels/synchronizations in 2991 ms.
[2024-05-20 16:32:11] [INFO ] Time to serialize gal into /tmp/LTLFireability6512614433287032247.gal : 87 ms
[2024-05-20 16:32:11] [INFO ] Time to serialize properties into /tmp/LTLFireability13426695580148762820.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6512614433287032247.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13426695580148762820.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 5 LTL properties
Checking formula 0 : !((X(G((!("((i31.u250.Node62IsInserted<1)||(i48.u189.Node46requestsent62<1))"))||(X(X(("(i75.u364.Node8GiveAnswer74<1)")||(("((i23.u28...289
Formula 0 simplified : XF("((i31.u250.Node62IsInserted<1)||(i48.u189.Node46requestsent62<1))" & XX(!"(i75.u364.Node8GiveAnswer74<1)" & (!"((i23.u28.Node7Is...273
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/ltsmin6140547784960780554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '144' '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 144 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6140547784960780554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '144' '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 144 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)
ITS-tools command line returned an error code 137
[2024-05-20 16:49:42] [INFO ] Flatten gal took : 4526 ms
[2024-05-20 16:49:42] [INFO ] Time to serialize gal into /tmp/LTLFireability3999110369405368305.gal : 92 ms
[2024-05-20 16:49:42] [INFO ] Time to serialize properties into /tmp/LTLFireability13845549418644411696.ltl : 10 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/LTLFireability3999110369405368305.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13845549418644411696.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...298
Read 5 LTL properties
Checking formula 0 : !((X(G((!("((Node62IsInserted<1)||(Node46requestsent62<1))"))||(X(X(("(Node8GiveAnswer74<1)")||(("((Node7IsInserted>=1)&&(Node41Reques...227
Formula 0 simplified : XF("((Node62IsInserted<1)||(Node46requestsent62<1))" & XX(!"(Node8GiveAnswer74<1)" & (!"((Node7IsInserted>=1)&&(Node41Request>=1))" ...211
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 135292 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16226864 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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="CANConstruction-PT-090"
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 CANConstruction-PT-090, 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 r087-tall-171620521400048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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