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.r285-smll-171654422100178.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 Peterson-PT-6, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422100178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.9M
-rw-r--r-- 1 mcc users 150K Apr 12 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 608K Apr 12 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 135K Apr 12 02:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 633K Apr 12 02:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 84K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 254K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 294K Apr 12 03:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 12 03:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 432K Apr 12 03:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.9M Apr 12 03:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 877K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716911887595

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=Peterson-PT-6
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 15:58:10] [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-28 15:58:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:58:10] [INFO ] Load time of PNML (sax parser for PT used): 235 ms
[2024-05-28 15:58:10] [INFO ] Transformed 1330 places.
[2024-05-28 15:58:10] [INFO ] Transformed 2030 transitions.
[2024-05-28 15:58:10] [INFO ] Found NUPN structural information;
[2024-05-28 15:58:10] [INFO ] Parsed PT model containing 1330 places and 2030 transitions and 6272 arcs in 373 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-PT-6-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1003 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 125 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-28 15:58:11] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-28 15:58:11] [INFO ] Computed 27 invariants in 64 ms
[2024-05-28 15:58:12] [INFO ] Implicit Places using invariants in 944 ms returned []
[2024-05-28 15:58:12] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 15:58:12] [INFO ] Invariant cache hit.
[2024-05-28 15:58:13] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 15:58:13] [INFO ] Implicit Places using invariants and state equation in 1517 ms returned []
Implicit Place search using SMT with State Equation took 2537 ms to find 0 implicit places.
[2024-05-28 15:58:13] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 15:58:13] [INFO ] Invariant cache hit.
[2024-05-28 15:58:16] [INFO ] Dead Transitions using invariants and state equation in 2290 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4964 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Support contains 1003 out of 1330 places after structural reductions.
[2024-05-28 15:58:17] [INFO ] Flatten gal took : 376 ms
[2024-05-28 15:58:17] [INFO ] Flatten gal took : 130 ms
[2024-05-28 15:58:17] [INFO ] Input system was already deterministic with 2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 676 ms. (steps per millisecond=14 ) properties (out of 30) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-28 15:58:19] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 15:58:19] [INFO ] Invariant cache hit.
[2024-05-28 15:58:19] [INFO ] [Real]Absence check using 20 positive place invariants in 31 ms returned sat
[2024-05-28 15:58:19] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-28 15:58:21] [INFO ] After 1614ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:8
[2024-05-28 15:58:21] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 15:58:22] [INFO ] After 574ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-28 15:58:22] [INFO ] After 3245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-28 15:58:23] [INFO ] [Nat]Absence check using 20 positive place invariants in 20 ms returned sat
[2024-05-28 15:58:23] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-28 15:58:25] [INFO ] After 1757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-28 15:58:26] [INFO ] After 1457ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-28 15:58:27] [INFO ] Deduced a trap composed of 91 places in 844 ms of which 11 ms to minimize.
[2024-05-28 15:58:28] [INFO ] Deduced a trap composed of 183 places in 728 ms of which 1 ms to minimize.
[2024-05-28 15:58:29] [INFO ] Deduced a trap composed of 157 places in 625 ms of which 2 ms to minimize.
[2024-05-28 15:58:29] [INFO ] Deduced a trap composed of 91 places in 467 ms of which 3 ms to minimize.
[2024-05-28 15:58:30] [INFO ] Deduced a trap composed of 158 places in 876 ms of which 3 ms to minimize.
[2024-05-28 15:58:30] [INFO ] Deduced a trap composed of 92 places in 336 ms of which 1 ms to minimize.
[2024-05-28 15:58:31] [INFO ] Deduced a trap composed of 91 places in 448 ms of which 1 ms to minimize.
[2024-05-28 15:58:31] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:58:31] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 0 ms to minimize.
[2024-05-28 15:58:32] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2024-05-28 15:58:32] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 0 ms to minimize.
[2024-05-28 15:58:32] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 0 ms to minimize.
[2024-05-28 15:58:32] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 1 ms to minimize.
[2024-05-28 15:58:32] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6309 ms
[2024-05-28 15:58:34] [INFO ] Deduced a trap composed of 58 places in 1094 ms of which 2 ms to minimize.
[2024-05-28 15:58:35] [INFO ] Deduced a trap composed of 57 places in 1095 ms of which 2 ms to minimize.
[2024-05-28 15:58:36] [INFO ] Deduced a trap composed of 88 places in 1149 ms of which 1 ms to minimize.
[2024-05-28 15:58:37] [INFO ] Deduced a trap composed of 58 places in 949 ms of which 1 ms to minimize.
[2024-05-28 15:58:38] [INFO ] Deduced a trap composed of 120 places in 1166 ms of which 1 ms to minimize.
[2024-05-28 15:58:40] [INFO ] Deduced a trap composed of 88 places in 1169 ms of which 2 ms to minimize.
[2024-05-28 15:58:41] [INFO ] Deduced a trap composed of 195 places in 1132 ms of which 1 ms to minimize.
[2024-05-28 15:58:42] [INFO ] Deduced a trap composed of 195 places in 1169 ms of which 1 ms to minimize.
[2024-05-28 15:58:43] [INFO ] Deduced a trap composed of 177 places in 1186 ms of which 2 ms to minimize.
[2024-05-28 15:58:45] [INFO ] Deduced a trap composed of 207 places in 1209 ms of which 1 ms to minimize.
[2024-05-28 15:58:46] [INFO ] Deduced a trap composed of 214 places in 1647 ms of which 2 ms to minimize.
[2024-05-28 15:58:47] [INFO ] Deduced a trap composed of 30 places in 803 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-28 15:58:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-28 15:58:47] [INFO ] After 25485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 474 ms.
Support contains 37 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 573 transitions
Trivial Post-agglo rules discarded 573 transitions
Performed 573 trivial Post agglomeration. Transition count delta: 573
Iterating post reduction 0 with 573 rules applied. Total rules applied 573 place count 1330 transition count 1457
Reduce places removed 573 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 577 rules applied. Total rules applied 1150 place count 757 transition count 1453
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1154 place count 753 transition count 1453
Performed 284 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 284 Pre rules applied. Total rules applied 1154 place count 753 transition count 1169
Deduced a syphon composed of 284 places in 3 ms
Reduce places removed 284 places and 0 transitions.
Iterating global reduction 3 with 568 rules applied. Total rules applied 1722 place count 469 transition count 1169
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1806 place count 427 transition count 1127
Applied a total of 1806 rules in 292 ms. Remains 427 /1330 variables (removed 903) and now considering 1127/2030 (removed 903) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 294 ms. Remains : 427/1330 places, 1127/2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-28 15:58:49] [INFO ] Flow matrix only has 917 transitions (discarded 210 similar events)
// Phase 1: matrix 917 rows 427 cols
[2024-05-28 15:58:49] [INFO ] Computed 27 invariants in 5 ms
[2024-05-28 15:58:49] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2024-05-28 15:58:49] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2024-05-28 15:58:50] [INFO ] After 816ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-28 15:58:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2024-05-28 15:58:50] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-28 15:58:50] [INFO ] After 581ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-28 15:58:51] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 15:58:51] [INFO ] After 323ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-28 15:58:51] [INFO ] Deduced a trap composed of 10 places in 331 ms of which 2 ms to minimize.
[2024-05-28 15:58:52] [INFO ] Deduced a trap composed of 44 places in 304 ms of which 2 ms to minimize.
[2024-05-28 15:58:52] [INFO ] Deduced a trap composed of 32 places in 348 ms of which 1 ms to minimize.
[2024-05-28 15:58:53] [INFO ] Deduced a trap composed of 18 places in 662 ms of which 2 ms to minimize.
[2024-05-28 15:58:53] [INFO ] Deduced a trap composed of 53 places in 275 ms of which 1 ms to minimize.
[2024-05-28 15:58:53] [INFO ] Deduced a trap composed of 41 places in 257 ms of which 1 ms to minimize.
[2024-05-28 15:58:54] [INFO ] Deduced a trap composed of 19 places in 442 ms of which 1 ms to minimize.
[2024-05-28 15:58:54] [INFO ] Deduced a trap composed of 28 places in 258 ms of which 1 ms to minimize.
[2024-05-28 15:58:54] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 1 ms to minimize.
[2024-05-28 15:58:55] [INFO ] Deduced a trap composed of 29 places in 259 ms of which 1 ms to minimize.
[2024-05-28 15:58:55] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 1 ms to minimize.
[2024-05-28 15:58:55] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 1 ms to minimize.
[2024-05-28 15:58:55] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 1 ms to minimize.
[2024-05-28 15:58:56] [INFO ] Deduced a trap composed of 50 places in 257 ms of which 1 ms to minimize.
[2024-05-28 15:58:56] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 2 ms to minimize.
[2024-05-28 15:58:56] [INFO ] Deduced a trap composed of 39 places in 264 ms of which 0 ms to minimize.
[2024-05-28 15:58:57] [INFO ] Deduced a trap composed of 26 places in 267 ms of which 1 ms to minimize.
[2024-05-28 15:58:57] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 1 ms to minimize.
[2024-05-28 15:58:57] [INFO ] Deduced a trap composed of 10 places in 269 ms of which 0 ms to minimize.
[2024-05-28 15:58:57] [INFO ] Deduced a trap composed of 18 places in 243 ms of which 0 ms to minimize.
[2024-05-28 15:58:58] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 0 ms to minimize.
[2024-05-28 15:58:58] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 1 ms to minimize.
[2024-05-28 15:58:58] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 0 ms to minimize.
[2024-05-28 15:58:59] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 1 ms to minimize.
[2024-05-28 15:58:59] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 7733 ms
[2024-05-28 15:58:59] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 0 ms to minimize.
[2024-05-28 15:58:59] [INFO ] Deduced a trap composed of 28 places in 239 ms of which 1 ms to minimize.
[2024-05-28 15:58:59] [INFO ] Deduced a trap composed of 52 places in 223 ms of which 1 ms to minimize.
[2024-05-28 15:59:00] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 1 ms to minimize.
[2024-05-28 15:59:00] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 0 ms to minimize.
[2024-05-28 15:59:00] [INFO ] Deduced a trap composed of 96 places in 173 ms of which 1 ms to minimize.
[2024-05-28 15:59:00] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 1 ms to minimize.
[2024-05-28 15:59:00] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 1 ms to minimize.
[2024-05-28 15:59:01] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 1 ms to minimize.
[2024-05-28 15:59:01] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 0 ms to minimize.
[2024-05-28 15:59:01] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 1 ms to minimize.
[2024-05-28 15:59:01] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 1 ms to minimize.
[2024-05-28 15:59:01] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 0 ms to minimize.
[2024-05-28 15:59:02] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 1 ms to minimize.
[2024-05-28 15:59:02] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 1 ms to minimize.
[2024-05-28 15:59:02] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 1 ms to minimize.
[2024-05-28 15:59:02] [INFO ] Deduced a trap composed of 48 places in 155 ms of which 2 ms to minimize.
[2024-05-28 15:59:02] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3704 ms
[2024-05-28 15:59:03] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 1 ms to minimize.
[2024-05-28 15:59:03] [INFO ] Deduced a trap composed of 27 places in 257 ms of which 1 ms to minimize.
[2024-05-28 15:59:03] [INFO ] Deduced a trap composed of 18 places in 266 ms of which 8 ms to minimize.
[2024-05-28 15:59:03] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 2 ms to minimize.
[2024-05-28 15:59:04] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 0 ms to minimize.
[2024-05-28 15:59:04] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 0 ms to minimize.
[2024-05-28 15:59:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1590 ms
[2024-05-28 15:59:04] [INFO ] Deduced a trap composed of 56 places in 160 ms of which 1 ms to minimize.
[2024-05-28 15:59:04] [INFO ] Deduced a trap composed of 55 places in 162 ms of which 0 ms to minimize.
[2024-05-28 15:59:05] [INFO ] Deduced a trap composed of 55 places in 162 ms of which 1 ms to minimize.
[2024-05-28 15:59:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 616 ms
[2024-05-28 15:59:05] [INFO ] Deduced a trap composed of 41 places in 247 ms of which 1 ms to minimize.
[2024-05-28 15:59:05] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 1 ms to minimize.
[2024-05-28 15:59:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 607 ms
[2024-05-28 15:59:05] [INFO ] After 14881ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 278 ms.
[2024-05-28 15:59:06] [INFO ] After 16048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 34 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 1127/1127 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 427 transition count 1126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 426 transition count 1126
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 426 transition count 1123
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 423 transition count 1123
Applied a total of 8 rules in 46 ms. Remains 423 /427 variables (removed 4) and now considering 1123/1127 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 423/427 places, 1123/1127 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 404672 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 404672 steps, saw 58483 distinct states, run finished after 3002 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 7 properties.
[2024-05-28 15:59:09] [INFO ] Flow matrix only has 913 transitions (discarded 210 similar events)
// Phase 1: matrix 913 rows 423 cols
[2024-05-28 15:59:10] [INFO ] Computed 27 invariants in 6 ms
[2024-05-28 15:59:10] [INFO ] [Real]Absence check using 20 positive place invariants in 17 ms returned sat
[2024-05-28 15:59:10] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-28 15:59:10] [INFO ] After 541ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:3
[2024-05-28 15:59:10] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 15:59:11] [INFO ] After 190ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-28 15:59:11] [INFO ] After 1062ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-28 15:59:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 17 ms returned sat
[2024-05-28 15:59:11] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-28 15:59:11] [INFO ] After 497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-28 15:59:12] [INFO ] After 276ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-28 15:59:12] [INFO ] Deduced a trap composed of 22 places in 272 ms of which 0 ms to minimize.
[2024-05-28 15:59:12] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 0 ms to minimize.
[2024-05-28 15:59:13] [INFO ] Deduced a trap composed of 10 places in 267 ms of which 0 ms to minimize.
[2024-05-28 15:59:13] [INFO ] Deduced a trap composed of 53 places in 282 ms of which 1 ms to minimize.
[2024-05-28 15:59:13] [INFO ] Deduced a trap composed of 13 places in 277 ms of which 0 ms to minimize.
[2024-05-28 15:59:14] [INFO ] Deduced a trap composed of 61 places in 270 ms of which 1 ms to minimize.
[2024-05-28 15:59:14] [INFO ] Deduced a trap composed of 53 places in 279 ms of which 1 ms to minimize.
[2024-05-28 15:59:14] [INFO ] Deduced a trap composed of 39 places in 263 ms of which 1 ms to minimize.
[2024-05-28 15:59:14] [INFO ] Deduced a trap composed of 27 places in 252 ms of which 1 ms to minimize.
[2024-05-28 15:59:15] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 1 ms to minimize.
[2024-05-28 15:59:15] [INFO ] Deduced a trap composed of 27 places in 262 ms of which 1 ms to minimize.
[2024-05-28 15:59:15] [INFO ] Deduced a trap composed of 61 places in 262 ms of which 0 ms to minimize.
[2024-05-28 15:59:16] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 1 ms to minimize.
[2024-05-28 15:59:16] [INFO ] Deduced a trap composed of 19 places in 268 ms of which 1 ms to minimize.
[2024-05-28 15:59:16] [INFO ] Deduced a trap composed of 23 places in 262 ms of which 0 ms to minimize.
[2024-05-28 15:59:17] [INFO ] Deduced a trap composed of 12 places in 284 ms of which 0 ms to minimize.
[2024-05-28 15:59:17] [INFO ] Deduced a trap composed of 64 places in 294 ms of which 0 ms to minimize.
[2024-05-28 15:59:17] [INFO ] Deduced a trap composed of 66 places in 283 ms of which 1 ms to minimize.
[2024-05-28 15:59:18] [INFO ] Deduced a trap composed of 11 places in 297 ms of which 0 ms to minimize.
[2024-05-28 15:59:18] [INFO ] Deduced a trap composed of 55 places in 263 ms of which 0 ms to minimize.
[2024-05-28 15:59:18] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 0 ms to minimize.
[2024-05-28 15:59:18] [INFO ] Deduced a trap composed of 47 places in 217 ms of which 0 ms to minimize.
[2024-05-28 15:59:19] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 1 ms to minimize.
[2024-05-28 15:59:19] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 0 ms to minimize.
[2024-05-28 15:59:19] [INFO ] Deduced a trap composed of 31 places in 263 ms of which 1 ms to minimize.
[2024-05-28 15:59:20] [INFO ] Deduced a trap composed of 31 places in 247 ms of which 0 ms to minimize.
[2024-05-28 15:59:20] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 1 ms to minimize.
[2024-05-28 15:59:20] [INFO ] Deduced a trap composed of 42 places in 325 ms of which 1 ms to minimize.
[2024-05-28 15:59:21] [INFO ] Deduced a trap composed of 39 places in 280 ms of which 1 ms to minimize.
[2024-05-28 15:59:21] [INFO ] Deduced a trap composed of 50 places in 253 ms of which 0 ms to minimize.
[2024-05-28 15:59:21] [INFO ] Deduced a trap composed of 46 places in 281 ms of which 1 ms to minimize.
[2024-05-28 15:59:22] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 1 ms to minimize.
[2024-05-28 15:59:22] [INFO ] Deduced a trap composed of 59 places in 271 ms of which 1 ms to minimize.
[2024-05-28 15:59:22] [INFO ] Deduced a trap composed of 55 places in 277 ms of which 0 ms to minimize.
[2024-05-28 15:59:22] [INFO ] Deduced a trap composed of 64 places in 280 ms of which 1 ms to minimize.
[2024-05-28 15:59:23] [INFO ] Deduced a trap composed of 77 places in 296 ms of which 1 ms to minimize.
[2024-05-28 15:59:23] [INFO ] Deduced a trap composed of 52 places in 299 ms of which 2 ms to minimize.
[2024-05-28 15:59:23] [INFO ] Deduced a trap composed of 40 places in 286 ms of which 1 ms to minimize.
[2024-05-28 15:59:24] [INFO ] Deduced a trap composed of 69 places in 289 ms of which 1 ms to minimize.
[2024-05-28 15:59:24] [INFO ] Deduced a trap composed of 47 places in 226 ms of which 0 ms to minimize.
[2024-05-28 15:59:24] [INFO ] Deduced a trap composed of 34 places in 261 ms of which 1 ms to minimize.
[2024-05-28 15:59:25] [INFO ] Deduced a trap composed of 26 places in 286 ms of which 1 ms to minimize.
[2024-05-28 15:59:25] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 1 ms to minimize.
[2024-05-28 15:59:25] [INFO ] Deduced a trap composed of 93 places in 271 ms of which 0 ms to minimize.
[2024-05-28 15:59:26] [INFO ] Deduced a trap composed of 60 places in 163 ms of which 1 ms to minimize.
[2024-05-28 15:59:26] [INFO ] Deduced a trap composed of 53 places in 200 ms of which 1 ms to minimize.
[2024-05-28 15:59:26] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 1 ms to minimize.
[2024-05-28 15:59:26] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 0 ms to minimize.
[2024-05-28 15:59:27] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 1 ms to minimize.
[2024-05-28 15:59:27] [INFO ] Deduced a trap composed of 37 places in 328 ms of which 1 ms to minimize.
[2024-05-28 15:59:27] [INFO ] Deduced a trap composed of 57 places in 163 ms of which 0 ms to minimize.
[2024-05-28 15:59:27] [INFO ] Deduced a trap composed of 47 places in 184 ms of which 0 ms to minimize.
[2024-05-28 15:59:28] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 0 ms to minimize.
[2024-05-28 15:59:28] [INFO ] Deduced a trap composed of 49 places in 281 ms of which 0 ms to minimize.
[2024-05-28 15:59:28] [INFO ] Deduced a trap composed of 55 places in 201 ms of which 0 ms to minimize.
[2024-05-28 15:59:28] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 0 ms to minimize.
[2024-05-28 15:59:28] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 1 ms to minimize.
[2024-05-28 15:59:29] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 1 ms to minimize.
[2024-05-28 15:59:29] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2024-05-28 15:59:29] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 1 ms to minimize.
[2024-05-28 15:59:29] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 1 ms to minimize.
[2024-05-28 15:59:30] [INFO ] Deduced a trap composed of 47 places in 270 ms of which 1 ms to minimize.
[2024-05-28 15:59:30] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2024-05-28 15:59:30] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 1 ms to minimize.
[2024-05-28 15:59:30] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 2 ms to minimize.
[2024-05-28 15:59:30] [INFO ] Deduced a trap composed of 67 places in 169 ms of which 0 ms to minimize.
[2024-05-28 15:59:31] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 0 ms to minimize.
[2024-05-28 15:59:31] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 1 ms to minimize.
[2024-05-28 15:59:31] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 1 ms to minimize.
[2024-05-28 15:59:31] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 0 ms to minimize.
[2024-05-28 15:59:31] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 1 ms to minimize.
[2024-05-28 15:59:32] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 0 ms to minimize.
[2024-05-28 15:59:32] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 0 ms to minimize.
[2024-05-28 15:59:32] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 0 ms to minimize.
[2024-05-28 15:59:32] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 1 ms to minimize.
[2024-05-28 15:59:32] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 0 ms to minimize.
[2024-05-28 15:59:33] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 0 ms to minimize.
[2024-05-28 15:59:33] [INFO ] Trap strengthening (SAT) tested/added 78/77 trap constraints in 20976 ms
[2024-05-28 15:59:33] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 0 ms to minimize.
[2024-05-28 15:59:33] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 0 ms to minimize.
[2024-05-28 15:59:33] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 1 ms to minimize.
[2024-05-28 15:59:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 451 ms
[2024-05-28 15:59:33] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 0 ms to minimize.
[2024-05-28 15:59:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2024-05-28 15:59:34] [INFO ] Deduced a trap composed of 45 places in 219 ms of which 0 ms to minimize.
[2024-05-28 15:59:34] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 0 ms to minimize.
[2024-05-28 15:59:34] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 0 ms to minimize.
[2024-05-28 15:59:34] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 0 ms to minimize.
[2024-05-28 15:59:35] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:59:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1054 ms
[2024-05-28 15:59:35] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 1 ms to minimize.
[2024-05-28 15:59:35] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 1 ms to minimize.
[2024-05-28 15:59:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 415 ms
[2024-05-28 15:59:35] [INFO ] Deduced a trap composed of 55 places in 207 ms of which 0 ms to minimize.
[2024-05-28 15:59:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2024-05-28 15:59:35] [INFO ] After 24002ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 194 ms.
[2024-05-28 15:59:36] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 20 ms.
Support contains 34 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1123/1123 transitions.
Applied a total of 0 rules in 28 ms. Remains 423 /423 variables (removed 0) and now considering 1123/1123 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 423/423 places, 1123/1123 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1123/1123 transitions.
Applied a total of 0 rules in 26 ms. Remains 423 /423 variables (removed 0) and now considering 1123/1123 (removed 0) transitions.
[2024-05-28 15:59:36] [INFO ] Flow matrix only has 913 transitions (discarded 210 similar events)
[2024-05-28 15:59:36] [INFO ] Invariant cache hit.
[2024-05-28 15:59:36] [INFO ] Implicit Places using invariants in 544 ms returned []
[2024-05-28 15:59:36] [INFO ] Flow matrix only has 913 transitions (discarded 210 similar events)
[2024-05-28 15:59:36] [INFO ] Invariant cache hit.
[2024-05-28 15:59:37] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 15:59:38] [INFO ] Implicit Places using invariants and state equation in 2113 ms returned []
Implicit Place search using SMT with State Equation took 2662 ms to find 0 implicit places.
[2024-05-28 15:59:38] [INFO ] Redundant transitions in 114 ms returned []
[2024-05-28 15:59:38] [INFO ] Flow matrix only has 913 transitions (discarded 210 similar events)
[2024-05-28 15:59:38] [INFO ] Invariant cache hit.
[2024-05-28 15:59:40] [INFO ] Dead Transitions using invariants and state equation in 1149 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3965 ms. Remains : 423/423 places, 1123/1123 transitions.
Graph (trivial) has 836 edges and 423 vertex of which 280 / 423 are part of one of the 42 SCC in 8 ms
Free SCC test removed 238 places
Drop transitions removed 476 transitions
Ensure Unique test removed 246 transitions
Reduce isomorphic transitions removed 722 transitions.
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 36 Pre rules applied. Total rules applied 1 place count 185 transition count 365
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 73 place count 149 transition count 365
Performed 12 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 97 place count 137 transition count 347
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 99 place count 137 transition count 345
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 111 place count 131 transition count 381
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 117 place count 131 transition count 375
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 130 place count 131 transition count 375
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 134 place count 131 transition count 371
Applied a total of 134 rules in 62 ms. Remains 131 /423 variables (removed 292) and now considering 371/1123 (removed 752) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 371 rows 131 cols
[2024-05-28 15:59:40] [INFO ] Computed 27 invariants in 2 ms
[2024-05-28 15:59:40] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2024-05-28 15:59:40] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 15:59:40] [INFO ] After 304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-28 15:59:40] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-28 15:59:40] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 15:59:40] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-28 15:59:40] [INFO ] After 374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 86 ms.
[2024-05-28 15:59:41] [INFO ] After 554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Computed a total of 0 stabilizing places and 0 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' '!((p0 U (!X(X(G(X(p1)))) U p2)))'
Support contains 392 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 88 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-28 15:59:41] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-28 15:59:41] [INFO ] Computed 27 invariants in 16 ms
[2024-05-28 15:59:42] [INFO ] Implicit Places using invariants in 586 ms returned []
[2024-05-28 15:59:42] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 15:59:42] [INFO ] Invariant cache hit.
[2024-05-28 15:59:43] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 15:59:44] [INFO ] Implicit Places using invariants and state equation in 2361 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 2952 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 53 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3094 ms. Remains : 1323/1330 places, 2030/2030 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 421 ms :[(NOT p2), p1, p1, (OR (NOT p2) p1)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=p2, acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (EQ s603 1) (EQ s1305 1)) (AND (EQ s602 1) (EQ s1304 1)) (AND (EQ s597 1) (EQ s1303 1)) (AND (EQ s601 1) (EQ s1306 1)) (AND (EQ s598 1) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 397 reset in 654 ms.
Stack based approach found an accepted trace after 192 steps with 0 reset with depth 193 and stack size 193 in 3 ms.
FORMULA Peterson-PT-6-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-00 finished in 4261 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)&&X(X(X(F(p1))))))'
Support contains 266 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 70 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-28 15:59:45] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 15:59:45] [INFO ] Invariant cache hit.
[2024-05-28 15:59:46] [INFO ] Implicit Places using invariants in 612 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 615 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 37 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 724 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (EQ s602 0) (EQ s875 0)) (OR (EQ s602 0) (EQ s883 0)) (OR (EQ s599 0) (EQ s646 0)) (OR (EQ s598 0) (EQ s746 0)) (OR (EQ s603 0) (EQ s767 0)) (...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1463 ms.
Product exploration explored 100000 steps with 25000 reset in 1385 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 256 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=128 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 7 out of 1323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 35 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-28 15:59:50] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-05-28 15:59:50] [INFO ] Computed 20 invariants in 15 ms
[2024-05-28 15:59:50] [INFO ] Implicit Places using invariants in 537 ms returned []
[2024-05-28 15:59:50] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 15:59:50] [INFO ] Invariant cache hit.
[2024-05-28 15:59:51] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 15:59:54] [INFO ] Implicit Places using invariants and state equation in 4056 ms returned []
Implicit Place search using SMT with State Equation took 4595 ms to find 0 implicit places.
[2024-05-28 15:59:54] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 15:59:54] [INFO ] Invariant cache hit.
[2024-05-28 15:59:56] [INFO ] Dead Transitions using invariants and state equation in 1809 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6441 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 226 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=45 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 911 ms.
Product exploration explored 100000 steps with 25000 reset in 926 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 7 out of 1323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Performed 335 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 335 rules applied. Total rules applied 335 place count 1323 transition count 2030
Performed 253 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 253 Pre rules applied. Total rules applied 335 place count 1323 transition count 2210
Deduced a syphon composed of 588 places in 1 ms
Iterating global reduction 1 with 253 rules applied. Total rules applied 588 place count 1323 transition count 2210
Discarding 150 places :
Symmetric choice reduction at 1 with 150 rule applications. Total rules 738 place count 1173 transition count 2060
Deduced a syphon composed of 438 places in 1 ms
Iterating global reduction 1 with 150 rules applied. Total rules applied 888 place count 1173 transition count 2060
Performed 322 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 760 places in 1 ms
Iterating global reduction 1 with 322 rules applied. Total rules applied 1210 place count 1173 transition count 2060
Discarding 292 places :
Symmetric choice reduction at 1 with 292 rule applications. Total rules 1502 place count 881 transition count 1768
Deduced a syphon composed of 468 places in 1 ms
Iterating global reduction 1 with 292 rules applied. Total rules applied 1794 place count 881 transition count 1768
Deduced a syphon composed of 468 places in 1 ms
Applied a total of 1794 rules in 494 ms. Remains 881 /1323 variables (removed 442) and now considering 1768/2030 (removed 262) transitions.
[2024-05-28 16:00:00] [INFO ] Redundant transitions in 144 ms returned []
[2024-05-28 16:00:00] [INFO ] Flow matrix only has 1558 transitions (discarded 210 similar events)
// Phase 1: matrix 1558 rows 881 cols
[2024-05-28 16:00:00] [INFO ] Computed 20 invariants in 11 ms
[2024-05-28 16:00:01] [INFO ] Dead Transitions using invariants and state equation in 1086 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 881/1323 places, 1768/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1734 ms. Remains : 881/1323 places, 1768/2030 transitions.
Built C files in :
/tmp/ltsmin1608004745304275634
[2024-05-28 16:00:01] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1608004745304275634
Running compilation step : cd /tmp/ltsmin1608004745304275634;'/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/ltsmin1608004745304275634;'/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/ltsmin1608004745304275634;'/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 7 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 45 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-28 16:00:04] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-05-28 16:00:04] [INFO ] Computed 20 invariants in 8 ms
[2024-05-28 16:00:05] [INFO ] Implicit Places using invariants in 816 ms returned []
[2024-05-28 16:00:05] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:00:05] [INFO ] Invariant cache hit.
[2024-05-28 16:00:06] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:00:14] [INFO ] Implicit Places using invariants and state equation in 8883 ms returned []
Implicit Place search using SMT with State Equation took 9702 ms to find 0 implicit places.
[2024-05-28 16:00:14] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:00:14] [INFO ] Invariant cache hit.
[2024-05-28 16:00:16] [INFO ] Dead Transitions using invariants and state equation in 1881 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11631 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Built C files in :
/tmp/ltsmin2983256808633180257
[2024-05-28 16:00:16] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2983256808633180257
Running compilation step : cd /tmp/ltsmin2983256808633180257;'/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/ltsmin2983256808633180257;'/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/ltsmin2983256808633180257;'/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-28 16:00:19] [INFO ] Flatten gal took : 84 ms
[2024-05-28 16:00:19] [INFO ] Flatten gal took : 85 ms
[2024-05-28 16:00:19] [INFO ] Time to serialize gal into /tmp/LTL17067387090261494157.gal : 19 ms
[2024-05-28 16:00:19] [INFO ] Time to serialize properties into /tmp/LTL8886053956061472258.prop : 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/LTL17067387090261494157.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17907096414107266329.hoa' '-atoms' '/tmp/LTL8886053956061472258.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/LTL8886053956061472258.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17907096414107266329.hoa
Detected timeout of ITS tools.
[2024-05-28 16:00:35] [INFO ] Flatten gal took : 76 ms
[2024-05-28 16:00:35] [INFO ] Flatten gal took : 72 ms
[2024-05-28 16:00:35] [INFO ] Time to serialize gal into /tmp/LTL6783289273880821679.gal : 12 ms
[2024-05-28 16:00:35] [INFO ] Time to serialize properties into /tmp/LTL4961155758975827814.ltl : 8 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/LTL6783289273880821679.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4961155758975827814.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("(((((((((((WantSection_5_T==0)||(TestAlone_4_5_5==0))&&((WantSection_5_T==0)||(TestAlone_3_1_5==0)))&&(((WantSection_0_T==0)||(...12419
Formula 0 simplified : G!"(((((((((((WantSection_5_T==0)||(TestAlone_4_5_5==0))&&((WantSection_5_T==0)||(TestAlone_3_1_5==0)))&&(((WantSection_0_T==0)||(Te...12405
Detected timeout of ITS tools.
[2024-05-28 16:00:50] [INFO ] Flatten gal took : 65 ms
[2024-05-28 16:00:50] [INFO ] Applying decomposition
[2024-05-28 16:00:50] [INFO ] Flatten gal took : 66 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/graph4103903261524986438.txt' '-o' '/tmp/graph4103903261524986438.bin' '-w' '/tmp/graph4103903261524986438.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4103903261524986438.bin' '-l' '-1' '-v' '-w' '/tmp/graph4103903261524986438.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:00:50] [INFO ] Decomposing Gal with order
[2024-05-28 16:00:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:00:50] [INFO ] Removed a total of 1792 redundant transitions.
[2024-05-28 16:00:51] [INFO ] Flatten gal took : 225 ms
[2024-05-28 16:00:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2024-05-28 16:00:51] [INFO ] Time to serialize gal into /tmp/LTL5135948307222481239.gal : 23 ms
[2024-05-28 16:00:51] [INFO ] Time to serialize properties into /tmp/LTL17327427795017555391.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5135948307222481239.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17327427795017555391.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((i10.u290.WantSection_5_T==0)||(i1.u299.TestAlone_4_5_5==0))&&((i10.u290.WantSection_5_T==0)||(i13.u248.TestAlone_3_1...17312
Formula 0 simplified : G!"(((((((((((i10.u290.WantSection_5_T==0)||(i1.u299.TestAlone_4_5_5==0))&&((i10.u290.WantSection_5_T==0)||(i13.u248.TestAlone_3_1_5...17298
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5069887598389731062
[2024-05-28 16:01:06] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5069887598389731062
Running compilation step : cd /tmp/ltsmin5069887598389731062;'/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/ltsmin5069887598389731062;'/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/ltsmin5069887598389731062;'/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 Peterson-PT-6-LTLFireability-01 finished in 83637 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(F(p1))))'
Support contains 28 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 41 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-28 16:01:09] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-28 16:01:09] [INFO ] Computed 27 invariants in 9 ms
[2024-05-28 16:01:10] [INFO ] Implicit Places using invariants in 754 ms returned []
[2024-05-28 16:01:10] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:01:10] [INFO ] Invariant cache hit.
[2024-05-28 16:01:11] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:01:16] [INFO ] Implicit Places using invariants and state equation in 6690 ms returned []
Implicit Place search using SMT with State Equation took 7448 ms to find 0 implicit places.
[2024-05-28 16:01:16] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:01:16] [INFO ] Invariant cache hit.
[2024-05-28 16:01:19] [INFO ] Dead Transitions using invariants and state equation in 2284 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9775 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (OR (AND (EQ s683 1) (EQ s1303 1)) (AND (EQ s682 1) (EQ s1208 1)) (AND (EQ s678 1) (EQ s1304 1)) (AND (EQ s677 1) (EQ s1301 1)) (AND (EQ s680 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][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 295 ms.
Stack based approach found an accepted trace after 1127 steps with 0 reset with depth 1128 and stack size 1128 in 4 ms.
FORMULA Peterson-PT-6-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-02 finished in 10208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 14 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 1330 transition count 1442
Reduce places removed 588 places and 0 transitions.
Iterating post reduction 1 with 588 rules applied. Total rules applied 1176 place count 742 transition count 1442
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1176 place count 742 transition count 1148
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1764 place count 448 transition count 1148
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1848 place count 406 transition count 1106
Applied a total of 1848 rules in 88 ms. Remains 406 /1330 variables (removed 924) and now considering 1106/2030 (removed 924) transitions.
[2024-05-28 16:01:19] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 406 cols
[2024-05-28 16:01:19] [INFO ] Computed 27 invariants in 4 ms
[2024-05-28 16:01:20] [INFO ] Implicit Places using invariants in 549 ms returned []
[2024-05-28 16:01:20] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-05-28 16:01:20] [INFO ] Invariant cache hit.
[2024-05-28 16:01:20] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:01:22] [INFO ] Implicit Places using invariants and state equation in 2014 ms returned []
Implicit Place search using SMT with State Equation took 2566 ms to find 0 implicit places.
[2024-05-28 16:01:22] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-28 16:01:22] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-05-28 16:01:22] [INFO ] Invariant cache hit.
[2024-05-28 16:01:23] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 406/1330 places, 1106/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3539 ms. Remains : 406/1330 places, 1106/2030 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (NEQ s306 1) (NEQ s400 1)) (OR (NEQ s305 1) (NEQ s390 1)) (OR (NEQ s302 1) (NEQ s401 1)) (OR (NEQ s301 1) (NEQ s398 1)) (OR (NEQ s303 1) (NEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 308 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 1 ms.
FORMULA Peterson-PT-6-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-03 finished in 3900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 84 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 44 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-28 16:01:23] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-28 16:01:23] [INFO ] Computed 27 invariants in 13 ms
[2024-05-28 16:01:24] [INFO ] Implicit Places using invariants in 698 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 701 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 43 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 790 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, p0, p0, p0]
Running random walk in product with property : Peterson-PT-6-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (EQ s1172 1) (EQ s1298 1)) (AND (EQ s1205 1) (EQ s1309 1)) (AND (EQ s1197 1) (EQ s1307 1)) (AND (EQ s1166 1) (EQ s1283 1)) (AND (EQ s1199 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-04 finished in 938 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((G(p1)||p0)))))'
Support contains 511 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 29 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-28 16:01:24] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:01:24] [INFO ] Invariant cache hit.
[2024-05-28 16:01:24] [INFO ] Implicit Places using invariants in 559 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 561 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 24 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 616 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-06 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}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (EQ s911 1) (EQ s1106 1) (EQ s1033 1) (EQ s968 1) (EQ s1233 1) (EQ s903 1) (EQ s1114 1) (EQ s1241 1) (EQ s1025 1) (EQ s1155 1) (EQ s1090 1) (EQ s98...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4079 reset in 4066 ms.
Product exploration explored 100000 steps with 4095 reset in 4107 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 14 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 246 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 16:01:33] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-05-28 16:01:34] [INFO ] Computed 20 invariants in 12 ms
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 511 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 24 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-28 16:01:49] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:01:49] [INFO ] Invariant cache hit.
[2024-05-28 16:01:50] [INFO ] Implicit Places using invariants in 701 ms returned []
[2024-05-28 16:01:50] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:01:50] [INFO ] Invariant cache hit.
[2024-05-28 16:01:50] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
[2024-05-28 16:01:50] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:01:50] [INFO ] Invariant cache hit.
[2024-05-28 16:01:53] [INFO ] Dead Transitions using invariants and state equation in 2209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3586 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 24 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 16:01:53] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:01:54] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4096 reset in 6325 ms.
Product exploration explored 100000 steps with 4077 reset in 6119 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 511 out of 1323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1323 transition count 2030
Performed 259 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 259 Pre rules applied. Total rules applied 84 place count 1323 transition count 2030
Deduced a syphon composed of 343 places in 1 ms
Iterating global reduction 1 with 259 rules applied. Total rules applied 343 place count 1323 transition count 2030
Discarding 114 places :
Symmetric choice reduction at 1 with 114 rule applications. Total rules 457 place count 1209 transition count 1916
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 1 with 114 rules applied. Total rules applied 571 place count 1209 transition count 1916
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 306 places in 1 ms
Iterating global reduction 1 with 77 rules applied. Total rules applied 648 place count 1209 transition count 1916
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 689 place count 1168 transition count 1875
Deduced a syphon composed of 265 places in 1 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 730 place count 1168 transition count 1875
Deduced a syphon composed of 265 places in 0 ms
Applied a total of 730 rules in 212 ms. Remains 1168 /1323 variables (removed 155) and now considering 1875/2030 (removed 155) transitions.
[2024-05-28 16:02:22] [INFO ] Redundant transitions in 45 ms returned []
[2024-05-28 16:02:22] [INFO ] Flow matrix only has 1665 transitions (discarded 210 similar events)
// Phase 1: matrix 1665 rows 1168 cols
[2024-05-28 16:02:22] [INFO ] Computed 20 invariants in 6 ms
[2024-05-28 16:02:23] [INFO ] Dead Transitions using invariants and state equation in 1639 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1168/1323 places, 1875/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1906 ms. Remains : 1168/1323 places, 1875/2030 transitions.
Built C files in :
/tmp/ltsmin10869145152707279081
[2024-05-28 16:02:23] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10869145152707279081
Running compilation step : cd /tmp/ltsmin10869145152707279081;'/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/ltsmin10869145152707279081;'/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/ltsmin10869145152707279081;'/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 511 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 26 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-28 16:02:26] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-05-28 16:02:26] [INFO ] Computed 20 invariants in 8 ms
[2024-05-28 16:02:27] [INFO ] Implicit Places using invariants in 516 ms returned []
[2024-05-28 16:02:27] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:02:27] [INFO ] Invariant cache hit.
[2024-05-28 16:02:28] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:02:31] [INFO ] Implicit Places using invariants and state equation in 4331 ms returned []
Implicit Place search using SMT with State Equation took 4849 ms to find 0 implicit places.
[2024-05-28 16:02:31] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:02:31] [INFO ] Invariant cache hit.
[2024-05-28 16:02:34] [INFO ] Dead Transitions using invariants and state equation in 2483 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7360 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Built C files in :
/tmp/ltsmin1783958287918977467
[2024-05-28 16:02:34] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1783958287918977467
Running compilation step : cd /tmp/ltsmin1783958287918977467;'/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/ltsmin1783958287918977467;'/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/ltsmin1783958287918977467;'/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-28 16:02:37] [INFO ] Flatten gal took : 107 ms
[2024-05-28 16:02:37] [INFO ] Flatten gal took : 109 ms
[2024-05-28 16:02:37] [INFO ] Time to serialize gal into /tmp/LTL14485155736436512829.gal : 15 ms
[2024-05-28 16:02:37] [INFO ] Time to serialize properties into /tmp/LTL63072726172782026.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14485155736436512829.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15508200892149102752.hoa' '-atoms' '/tmp/LTL63072726172782026.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/LTL63072726172782026.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15508200892149102752.hoa
Detected timeout of ITS tools.
[2024-05-28 16:02:52] [INFO ] Flatten gal took : 96 ms
[2024-05-28 16:02:52] [INFO ] Flatten gal took : 93 ms
[2024-05-28 16:02:52] [INFO ] Time to serialize gal into /tmp/LTL9519332635747788235.gal : 16 ms
[2024-05-28 16:02:52] [INFO ] Time to serialize properties into /tmp/LTL11617662799141021857.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9519332635747788235.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11617662799141021857.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(((((((((G("(((((((((TestIdentity_2_0_0==1)||(TestIdentity_6_3_2==1))||((TestIdentity_0_3_3==1)||(TestIdentity_0_4_1==1)))||((...18968
Formula 0 simplified : XXG(!"(((((((((WantSection_2_T==1)&&(TestAlone_5_5_2==1))||((WantSection_0_T==1)&&(TestAlone_2_3_0==1)))||(((WantSection_5_T==1)&&(T...18944
Detected timeout of ITS tools.
[2024-05-28 16:03:08] [INFO ] Flatten gal took : 52 ms
[2024-05-28 16:03:08] [INFO ] Applying decomposition
[2024-05-28 16:03:08] [INFO ] Flatten gal took : 55 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/graph10732247382040386373.txt' '-o' '/tmp/graph10732247382040386373.bin' '-w' '/tmp/graph10732247382040386373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10732247382040386373.bin' '-l' '-1' '-v' '-w' '/tmp/graph10732247382040386373.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:03:08] [INFO ] Decomposing Gal with order
[2024-05-28 16:03:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:03:08] [INFO ] Removed a total of 1792 redundant transitions.
[2024-05-28 16:03:08] [INFO ] Flatten gal took : 176 ms
[2024-05-28 16:03:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2024-05-28 16:03:09] [INFO ] Time to serialize gal into /tmp/LTL16819211734828263286.gal : 21 ms
[2024-05-28 16:03:09] [INFO ] Time to serialize properties into /tmp/LTL13939650358724511593.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16819211734828263286.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13939650358724511593.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(F(((((((((G("(((((((((i7.u122.TestIdentity_2_0_0==1)||(i36.i0.i0.u465.TestIdentity_6_3_2==1))||((i9.i1.i2.u349.TestIdentity_0_3...28494
Formula 0 simplified : XXG(!"(((((((((i29.i0.i1.u278.WantSection_2_T==1)&&(i15.i0.i0.u320.TestAlone_5_5_2==1))||((i7.u279.WantSection_0_T==1)&&(i9.i0.i1.u4...28470
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2288700586698612073
[2024-05-28 16:03:24] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2288700586698612073
Running compilation step : cd /tmp/ltsmin2288700586698612073;'/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/ltsmin2288700586698612073;'/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/ltsmin2288700586698612073;'/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 Peterson-PT-6-LTLFireability-06 finished in 122930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!p0)) U (X(p2)||p1)))'
Support contains 378 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 25 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-28 16:03:27] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-28 16:03:27] [INFO ] Computed 27 invariants in 7 ms
[2024-05-28 16:03:28] [INFO ] Implicit Places using invariants in 830 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 836 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 39 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 904 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), true, p0]
Running random walk in product with property : Peterson-PT-6-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s391 1) (EQ s521 1) (EQ s326 1) (EQ s586 1) (EQ s513 1) (EQ s448 1) (EQ s399 1) (EQ s578 1) (EQ s456 1) (EQ s407 1) (EQ s537 1) (EQ s464 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-6-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-07 finished in 1130 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((F(G(p1))&&F((G(!p2)||(!p2&&F(p3)))))))))'
Support contains 7 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 585 rules applied. Total rules applied 585 place count 1330 transition count 1445
Reduce places removed 585 places and 0 transitions.
Iterating post reduction 1 with 585 rules applied. Total rules applied 1170 place count 745 transition count 1445
Performed 293 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 293 Pre rules applied. Total rules applied 1170 place count 745 transition count 1152
Deduced a syphon composed of 293 places in 0 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 2 with 586 rules applied. Total rules applied 1756 place count 452 transition count 1152
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1840 place count 410 transition count 1110
Applied a total of 1840 rules in 109 ms. Remains 410 /1330 variables (removed 920) and now considering 1110/2030 (removed 920) transitions.
[2024-05-28 16:03:28] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
// Phase 1: matrix 900 rows 410 cols
[2024-05-28 16:03:28] [INFO ] Computed 27 invariants in 26 ms
[2024-05-28 16:03:29] [INFO ] Implicit Places using invariants in 751 ms returned [390, 391, 393, 402, 403, 404, 405]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 752 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/1330 places, 1110/2030 transitions.
Applied a total of 0 rules in 19 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 882 ms. Remains : 403/1330 places, 1110/2030 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s393 1) (EQ s398 1)), p1:(AND (EQ s323 1) (EQ s392 1)), p2:(AND (EQ s297 1) (EQ s351 1)), p3:(NEQ s352 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 337 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-08 finished in 1448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&X(X(G(p1))))))'
Support contains 3 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 74 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-28 16:03:29] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-28 16:03:29] [INFO ] Computed 27 invariants in 9 ms
[2024-05-28 16:03:31] [INFO ] Implicit Places using invariants in 1262 ms returned []
[2024-05-28 16:03:31] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:03:31] [INFO ] Invariant cache hit.
[2024-05-28 16:03:32] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned []
Implicit Place search using SMT with State Equation took 2514 ms to find 0 implicit places.
[2024-05-28 16:03:32] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:03:32] [INFO ] Invariant cache hit.
[2024-05-28 16:03:34] [INFO ] Dead Transitions using invariants and state equation in 2304 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4894 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : Peterson-PT-6-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s323 1), p1:(OR (EQ s677 0) (EQ s1301 0))], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-09 finished in 5218 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((X(F(!p0)) U p1))||p2)))))'
Support contains 6 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 48 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-28 16:03:35] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:03:35] [INFO ] Invariant cache hit.
[2024-05-28 16:03:36] [INFO ] Implicit Places using invariants in 1012 ms returned []
[2024-05-28 16:03:36] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:03:36] [INFO ] Invariant cache hit.
[2024-05-28 16:03:37] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 2016 ms to find 0 implicit places.
[2024-05-28 16:03:37] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:03:37] [INFO ] Invariant cache hit.
[2024-05-28 16:03:39] [INFO ] Dead Transitions using invariants and state equation in 2792 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4857 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s947 1) (EQ s1198 1)), p1:(AND (EQ s1172 1) (EQ s1296 1)), p0:(AND (EQ s1172 1) (EQ s1296 1) (NOT (AND (EQ s677 1) (EQ s890 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 439 ms.
Stack based approach found an accepted trace after 858 steps with 3 reset with depth 142 and stack size 142 in 5 ms.
FORMULA Peterson-PT-6-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-10 finished in 5635 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||G(p1))) U G((X(p0)||p2)))))'
Support contains 3 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 74 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-28 16:03:40] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:03:40] [INFO ] Invariant cache hit.
[2024-05-28 16:03:42] [INFO ] Implicit Places using invariants in 1189 ms returned []
[2024-05-28 16:03:42] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:03:42] [INFO ] Invariant cache hit.
[2024-05-28 16:03:43] [INFO ] Implicit Places using invariants and state equation in 1244 ms returned []
Implicit Place search using SMT with State Equation took 2434 ms to find 0 implicit places.
[2024-05-28 16:03:43] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:03:43] [INFO ] Invariant cache hit.
[2024-05-28 16:03:45] [INFO ] Dead Transitions using invariants and state equation in 2229 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4739 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 448 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), false, true, (NOT p1)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s1256 1), p1:(NEQ s426 1), p2:(OR (EQ s206 1) (EQ s426 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 391 ms.
Product exploration explored 100000 steps with 1 reset in 484 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (OR p0 p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (OR p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 340 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 431 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), false, true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 579 ms. (steps per millisecond=17 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 90304 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90304 steps, saw 58936 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 12 properties.
[2024-05-28 16:03:51] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:03:51] [INFO ] Invariant cache hit.
[2024-05-28 16:03:52] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned sat
[2024-05-28 16:03:52] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 25 ms returned sat
[2024-05-28 16:03:54] [INFO ] After 2436ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:10
[2024-05-28 16:03:55] [INFO ] [Nat]Absence check using 20 positive place invariants in 22 ms returned sat
[2024-05-28 16:03:55] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-28 16:03:57] [INFO ] After 1819ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :10
[2024-05-28 16:03:57] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:03:58] [INFO ] After 1489ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :2 sat :10
[2024-05-28 16:04:00] [INFO ] Deduced a trap composed of 42 places in 1188 ms of which 2 ms to minimize.
[2024-05-28 16:04:01] [INFO ] Deduced a trap composed of 87 places in 968 ms of which 2 ms to minimize.
[2024-05-28 16:04:02] [INFO ] Deduced a trap composed of 109 places in 1290 ms of which 2 ms to minimize.
[2024-05-28 16:04:04] [INFO ] Deduced a trap composed of 16 places in 1470 ms of which 1 ms to minimize.
[2024-05-28 16:04:05] [INFO ] Deduced a trap composed of 45 places in 1114 ms of which 2 ms to minimize.
[2024-05-28 16:04:06] [INFO ] Deduced a trap composed of 29 places in 1062 ms of which 1 ms to minimize.
[2024-05-28 16:04:07] [INFO ] Deduced a trap composed of 29 places in 894 ms of which 1 ms to minimize.
[2024-05-28 16:04:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 9263 ms
[2024-05-28 16:04:10] [INFO ] Deduced a trap composed of 60 places in 1391 ms of which 2 ms to minimize.
[2024-05-28 16:04:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1671 ms
[2024-05-28 16:04:11] [INFO ] After 14515ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :10
Attempting to minimize the solution found.
Minimization took 1434 ms.
[2024-05-28 16:04:13] [INFO ] After 18846ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :10
Fused 12 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 3 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 583 transitions
Trivial Post-agglo rules discarded 583 transitions
Performed 583 trivial Post agglomeration. Transition count delta: 583
Iterating post reduction 0 with 583 rules applied. Total rules applied 583 place count 1330 transition count 1447
Reduce places removed 583 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 585 rules applied. Total rules applied 1168 place count 747 transition count 1445
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1170 place count 745 transition count 1445
Performed 292 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 292 Pre rules applied. Total rules applied 1170 place count 745 transition count 1153
Deduced a syphon composed of 292 places in 1 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 3 with 584 rules applied. Total rules applied 1754 place count 453 transition count 1153
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 6 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1838 place count 411 transition count 1111
Applied a total of 1838 rules in 127 ms. Remains 411 /1330 variables (removed 919) and now considering 1111/2030 (removed 919) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 411/1330 places, 1111/2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-28 16:04:13] [INFO ] Flow matrix only has 901 transitions (discarded 210 similar events)
// Phase 1: matrix 901 rows 411 cols
[2024-05-28 16:04:13] [INFO ] Computed 27 invariants in 3 ms
[2024-05-28 16:04:14] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2024-05-28 16:04:14] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-28 16:04:14] [INFO ] After 381ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-28 16:04:14] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:04:14] [INFO ] After 156ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 16:04:14] [INFO ] After 795ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 16:04:14] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2024-05-28 16:04:14] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-28 16:04:15] [INFO ] After 534ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 16:04:15] [INFO ] After 227ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-28 16:04:16] [INFO ] Deduced a trap composed of 10 places in 426 ms of which 1 ms to minimize.
[2024-05-28 16:04:16] [INFO ] Deduced a trap composed of 18 places in 442 ms of which 1 ms to minimize.
[2024-05-28 16:04:17] [INFO ] Deduced a trap composed of 26 places in 450 ms of which 1 ms to minimize.
[2024-05-28 16:04:17] [INFO ] Deduced a trap composed of 23 places in 408 ms of which 1 ms to minimize.
[2024-05-28 16:04:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1981 ms
[2024-05-28 16:04:18] [INFO ] Deduced a trap composed of 18 places in 434 ms of which 1 ms to minimize.
[2024-05-28 16:04:18] [INFO ] Deduced a trap composed of 10 places in 416 ms of which 1 ms to minimize.
[2024-05-28 16:04:19] [INFO ] Deduced a trap composed of 10 places in 410 ms of which 1 ms to minimize.
[2024-05-28 16:04:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1468 ms
[2024-05-28 16:04:19] [INFO ] After 3867ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 149 ms.
[2024-05-28 16:04:19] [INFO ] After 4778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1111/1111 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 411 transition count 1110
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 410 transition count 1110
Applied a total of 2 rules in 32 ms. Remains 410 /411 variables (removed 1) and now considering 1110/1111 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 410/411 places, 1110/1111 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) 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 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 533072 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 533072 steps, saw 72076 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-28 16:04:22] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
// Phase 1: matrix 900 rows 410 cols
[2024-05-28 16:04:22] [INFO ] Computed 27 invariants in 1 ms
[2024-05-28 16:04:22] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2024-05-28 16:04:22] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 16:04:23] [INFO ] After 587ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 16:04:23] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2024-05-28 16:04:23] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-28 16:04:24] [INFO ] After 557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 16:04:24] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:04:24] [INFO ] After 246ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-28 16:04:24] [INFO ] Deduced a trap composed of 26 places in 254 ms of which 1 ms to minimize.
[2024-05-28 16:04:25] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 0 ms to minimize.
[2024-05-28 16:04:25] [INFO ] Deduced a trap composed of 10 places in 326 ms of which 1 ms to minimize.
[2024-05-28 16:04:25] [INFO ] Deduced a trap composed of 35 places in 353 ms of which 1 ms to minimize.
[2024-05-28 16:04:26] [INFO ] Deduced a trap composed of 23 places in 338 ms of which 1 ms to minimize.
[2024-05-28 16:04:26] [INFO ] Deduced a trap composed of 62 places in 316 ms of which 1 ms to minimize.
[2024-05-28 16:04:27] [INFO ] Deduced a trap composed of 62 places in 373 ms of which 1 ms to minimize.
[2024-05-28 16:04:27] [INFO ] Deduced a trap composed of 10 places in 294 ms of which 1 ms to minimize.
[2024-05-28 16:04:27] [INFO ] Deduced a trap composed of 12 places in 417 ms of which 1 ms to minimize.
[2024-05-28 16:04:28] [INFO ] Deduced a trap composed of 47 places in 221 ms of which 1 ms to minimize.
[2024-05-28 16:04:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3657 ms
[2024-05-28 16:04:28] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 0 ms to minimize.
[2024-05-28 16:04:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2024-05-28 16:04:28] [INFO ] After 4298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 157 ms.
[2024-05-28 16:04:28] [INFO ] After 5280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1110/1110 transitions.
Applied a total of 0 rules in 27 ms. Remains 410 /410 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 410/410 places, 1110/1110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1110/1110 transitions.
Applied a total of 0 rules in 26 ms. Remains 410 /410 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
[2024-05-28 16:04:28] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2024-05-28 16:04:28] [INFO ] Invariant cache hit.
[2024-05-28 16:04:29] [INFO ] Implicit Places using invariants in 834 ms returned [390, 391, 393, 402, 403, 404, 405]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 837 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 403/410 places, 1110/1110 transitions.
Applied a total of 0 rules in 29 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 893 ms. Remains : 403/410 places, 1110/1110 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 476056 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :{}
Probabilistic random walk after 476056 steps, saw 66083 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-28 16:04:33] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
// Phase 1: matrix 900 rows 403 cols
[2024-05-28 16:04:33] [INFO ] Computed 20 invariants in 2 ms
[2024-05-28 16:04:33] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2024-05-28 16:04:33] [INFO ] After 346ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-28 16:04:33] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:04:33] [INFO ] After 153ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 16:04:33] [INFO ] After 670ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 16:04:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2024-05-28 16:04:34] [INFO ] After 471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 16:04:34] [INFO ] After 225ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-28 16:04:35] [INFO ] Deduced a trap composed of 10 places in 397 ms of which 1 ms to minimize.
[2024-05-28 16:04:35] [INFO ] Deduced a trap composed of 15 places in 388 ms of which 1 ms to minimize.
[2024-05-28 16:04:35] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 0 ms to minimize.
[2024-05-28 16:04:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1211 ms
[2024-05-28 16:04:36] [INFO ] Deduced a trap composed of 31 places in 421 ms of which 1 ms to minimize.
[2024-05-28 16:04:36] [INFO ] Deduced a trap composed of 10 places in 399 ms of which 1 ms to minimize.
[2024-05-28 16:04:37] [INFO ] Deduced a trap composed of 18 places in 365 ms of which 1 ms to minimize.
[2024-05-28 16:04:37] [INFO ] Deduced a trap composed of 26 places in 389 ms of which 1 ms to minimize.
[2024-05-28 16:04:38] [INFO ] Deduced a trap composed of 23 places in 348 ms of which 1 ms to minimize.
[2024-05-28 16:04:38] [INFO ] Deduced a trap composed of 39 places in 373 ms of which 1 ms to minimize.
[2024-05-28 16:04:39] [INFO ] Deduced a trap composed of 31 places in 396 ms of which 1 ms to minimize.
[2024-05-28 16:04:39] [INFO ] Deduced a trap composed of 23 places in 334 ms of which 1 ms to minimize.
[2024-05-28 16:04:39] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 0 ms to minimize.
[2024-05-28 16:04:39] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3782 ms
[2024-05-28 16:04:40] [INFO ] Deduced a trap composed of 26 places in 392 ms of which 1 ms to minimize.
[2024-05-28 16:04:40] [INFO ] Deduced a trap composed of 54 places in 402 ms of which 1 ms to minimize.
[2024-05-28 16:04:41] [INFO ] Deduced a trap composed of 55 places in 372 ms of which 1 ms to minimize.
[2024-05-28 16:04:41] [INFO ] Deduced a trap composed of 38 places in 292 ms of which 0 ms to minimize.
[2024-05-28 16:04:41] [INFO ] Deduced a trap composed of 22 places in 383 ms of which 1 ms to minimize.
[2024-05-28 16:04:42] [INFO ] Deduced a trap composed of 12 places in 370 ms of which 0 ms to minimize.
[2024-05-28 16:04:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2580 ms
[2024-05-28 16:04:42] [INFO ] After 7943ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 168 ms.
[2024-05-28 16:04:42] [INFO ] After 8736ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 1110/1110 transitions.
Applied a total of 0 rules in 28 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 403/403 places, 1110/1110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 1110/1110 transitions.
Applied a total of 0 rules in 28 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
[2024-05-28 16:04:42] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2024-05-28 16:04:42] [INFO ] Invariant cache hit.
[2024-05-28 16:04:43] [INFO ] Implicit Places using invariants in 912 ms returned []
[2024-05-28 16:04:43] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2024-05-28 16:04:43] [INFO ] Invariant cache hit.
[2024-05-28 16:04:44] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:04:46] [INFO ] Implicit Places using invariants and state equation in 2462 ms returned []
Implicit Place search using SMT with State Equation took 3376 ms to find 0 implicit places.
[2024-05-28 16:04:46] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-28 16:04:46] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2024-05-28 16:04:46] [INFO ] Invariant cache hit.
[2024-05-28 16:04:47] [INFO ] Dead Transitions using invariants and state equation in 1246 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4675 ms. Remains : 403/403 places, 1110/1110 transitions.
Graph (trivial) has 840 edges and 403 vertex of which 288 / 403 are part of one of the 42 SCC in 2 ms
Free SCC test removed 246 places
Drop transitions removed 492 transitions
Ensure Unique test removed 250 transitions
Reduce isomorphic transitions removed 742 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 1 place count 157 transition count 328
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 81 place count 117 transition count 328
Performed 6 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 93 place count 111 transition count 318
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 25 rules applied. Total rules applied 118 place count 95 transition count 323
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 51 edges and 95 vertex of which 49 / 95 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 121 place count 53 transition count 321
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 284 edges and 48 vertex of which 20 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Graph (trivial) has 110 edges and 20 vertex of which 10 / 20 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 56 rules applied. Total rules applied 177 place count 12 transition count 152
Drop transitions removed 88 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 305 place count 12 transition count 24
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 311 place count 12 transition count 18
Graph (complete) has 22 edges and 12 vertex of which 6 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 312 place count 6 transition count 14
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 320 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 320 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 324 place count 4 transition count 4
Applied a total of 324 rules in 29 ms. Remains 4 /403 variables (removed 399) and now considering 4/1110 (removed 1106) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 4 rows 4 cols
[2024-05-28 16:04:47] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 16:04:47] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-28 16:04:47] [INFO ] After 6ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-28 16:04:47] [INFO ] After 12ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-28 16:04:47] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:1
[2024-05-28 16:04:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 16:04:47] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 16:04:47] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-28 16:04:47] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (OR p0 p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (OR p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (F p2), (F (NOT (OR p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1 (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 20 factoid took 761 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-6-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-6-LTLFireability-11 finished in 67538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&G(p1)) U (F(p3)&&p2))))'
Support contains 4 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 75 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-28 16:04:48] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-28 16:04:48] [INFO ] Computed 27 invariants in 8 ms
[2024-05-28 16:04:49] [INFO ] Implicit Places using invariants in 1158 ms returned []
[2024-05-28 16:04:49] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:04:49] [INFO ] Invariant cache hit.
[2024-05-28 16:04:50] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:05:00] [INFO ] Implicit Places using invariants and state equation in 10632 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 11796 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 45 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11916 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s598 1) (EQ s666 1)), p0:(EQ s1018 1), p1:(OR (EQ s1041 1) (NOT (AND (EQ s598 1) (EQ s666 1)))), p3:(EQ s1041 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-12 finished in 12140 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)))'
Support contains 2 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 45 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-28 16:05:00] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:05:00] [INFO ] Invariant cache hit.
[2024-05-28 16:05:01] [INFO ] Implicit Places using invariants in 1141 ms returned []
[2024-05-28 16:05:01] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-28 16:05:01] [INFO ] Invariant cache hit.
[2024-05-28 16:05:02] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:05:10] [INFO ] Implicit Places using invariants and state equation in 9004 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 10147 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 44 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10247 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s683 1) (NEQ s827 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 378 ms.
Product exploration explored 100000 steps with 0 reset in 506 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 266664 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 266664 steps, saw 167476 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 16:05:15] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-05-28 16:05:15] [INFO ] Computed 20 invariants in 7 ms
[2024-05-28 16:05:15] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2024-05-28 16:05:16] [INFO ] After 1570ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 16:05:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 19 ms returned sat
[2024-05-28 16:05:17] [INFO ] After 908ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 16:05:17] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:05:18] [INFO ] After 376ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 16:05:19] [INFO ] Deduced a trap composed of 164 places in 1285 ms of which 2 ms to minimize.
[2024-05-28 16:05:21] [INFO ] Deduced a trap composed of 82 places in 1314 ms of which 2 ms to minimize.
[2024-05-28 16:05:22] [INFO ] Deduced a trap composed of 117 places in 1386 ms of which 2 ms to minimize.
[2024-05-28 16:05:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4548 ms
[2024-05-28 16:05:22] [INFO ] After 5025ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 130 ms.
[2024-05-28 16:05:23] [INFO ] After 6455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Drop transitions removed 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 587 rules applied. Total rules applied 587 place count 1323 transition count 1443
Reduce places removed 587 places and 0 transitions.
Iterating post reduction 1 with 587 rules applied. Total rules applied 1174 place count 736 transition count 1443
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1174 place count 736 transition count 1149
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1762 place count 442 transition count 1149
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1846 place count 400 transition count 1107
Applied a total of 1846 rules in 99 ms. Remains 400 /1323 variables (removed 923) and now considering 1107/2030 (removed 923) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 400/1323 places, 1107/2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 634008 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 634008 steps, saw 85829 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 16:05:26] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2024-05-28 16:05:26] [INFO ] Computed 20 invariants in 2 ms
[2024-05-28 16:05:26] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2024-05-28 16:05:26] [INFO ] After 277ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 16:05:26] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:05:26] [INFO ] After 76ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 16:05:26] [INFO ] After 476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 16:05:26] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2024-05-28 16:05:27] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 16:05:27] [INFO ] After 84ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 16:05:27] [INFO ] Deduced a trap composed of 47 places in 258 ms of which 1 ms to minimize.
[2024-05-28 16:05:27] [INFO ] Deduced a trap composed of 50 places in 276 ms of which 1 ms to minimize.
[2024-05-28 16:05:28] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 1 ms to minimize.
[2024-05-28 16:05:28] [INFO ] Deduced a trap composed of 35 places in 396 ms of which 1 ms to minimize.
[2024-05-28 16:05:29] [INFO ] Deduced a trap composed of 43 places in 392 ms of which 1 ms to minimize.
[2024-05-28 16:05:29] [INFO ] Deduced a trap composed of 37 places in 380 ms of which 1 ms to minimize.
[2024-05-28 16:05:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2314 ms
[2024-05-28 16:05:29] [INFO ] After 2436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-28 16:05:29] [INFO ] After 2945ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 27 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 400/400 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 26 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-05-28 16:05:29] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:05:29] [INFO ] Invariant cache hit.
[2024-05-28 16:05:30] [INFO ] Implicit Places using invariants in 823 ms returned []
[2024-05-28 16:05:30] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:05:30] [INFO ] Invariant cache hit.
[2024-05-28 16:05:31] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:05:33] [INFO ] Implicit Places using invariants and state equation in 2644 ms returned []
Implicit Place search using SMT with State Equation took 3482 ms to find 0 implicit places.
[2024-05-28 16:05:33] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-28 16:05:33] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:05:33] [INFO ] Invariant cache hit.
[2024-05-28 16:05:34] [INFO ] Dead Transitions using invariants and state equation in 1222 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4767 ms. Remains : 400/400 places, 1107/1107 transitions.
Graph (trivial) has 838 edges and 400 vertex of which 291 / 400 are part of one of the 42 SCC in 0 ms
Free SCC test removed 249 places
Drop transitions removed 498 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 749 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 317
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 317
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 87 place count 108 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 89 place count 108 transition count 313
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 109 place count 95 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 49 edges and 95 vertex of which 42 / 95 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 59 transition count 312
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Graph (trivial) has 187 edges and 54 vertex of which 30 / 54 are part of one of the 6 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 2 with 48 rules applied. Total rules applied 159 place count 30 transition count 270
Drop transitions removed 120 transitions
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 220 transitions.
Iterating post reduction 3 with 220 rules applied. Total rules applied 379 place count 30 transition count 50
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 382 place count 30 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 383 place count 30 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 29 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 385 place count 29 transition count 46
Applied a total of 385 rules in 27 ms. Remains 29 /400 variables (removed 371) and now considering 46/1107 (removed 1061) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 29 cols
[2024-05-28 16:05:34] [INFO ] Computed 9 invariants in 1 ms
[2024-05-28 16:05:34] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-28 16:05:34] [INFO ] After 28ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 16:05:34] [INFO ] After 36ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-28 16:05:34] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0)]
Support contains 2 out of 1323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Drop transitions removed 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 587 rules applied. Total rules applied 587 place count 1323 transition count 1443
Reduce places removed 587 places and 0 transitions.
Iterating post reduction 1 with 587 rules applied. Total rules applied 1174 place count 736 transition count 1443
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1174 place count 736 transition count 1149
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1762 place count 442 transition count 1149
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1846 place count 400 transition count 1107
Applied a total of 1846 rules in 103 ms. Remains 400 /1323 variables (removed 923) and now considering 1107/2030 (removed 923) transitions.
[2024-05-28 16:05:34] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2024-05-28 16:05:34] [INFO ] Computed 20 invariants in 2 ms
[2024-05-28 16:05:35] [INFO ] Implicit Places using invariants in 731 ms returned []
[2024-05-28 16:05:35] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:05:35] [INFO ] Invariant cache hit.
[2024-05-28 16:05:36] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:05:38] [INFO ] Implicit Places using invariants and state equation in 2928 ms returned []
Implicit Place search using SMT with State Equation took 3662 ms to find 0 implicit places.
[2024-05-28 16:05:38] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-28 16:05:38] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:05:38] [INFO ] Invariant cache hit.
[2024-05-28 16:05:39] [INFO ] Dead Transitions using invariants and state equation in 1108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/1323 places, 1107/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4917 ms. Remains : 400/1323 places, 1107/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 707512 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :{}
Probabilistic random walk after 707512 steps, saw 92864 distinct states, run finished after 3001 ms. (steps per millisecond=235 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 16:05:43] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:05:43] [INFO ] Invariant cache hit.
[2024-05-28 16:05:43] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-05-28 16:05:43] [INFO ] After 393ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 16:05:43] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:05:43] [INFO ] After 104ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 16:05:43] [INFO ] After 626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 16:05:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2024-05-28 16:05:44] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 16:05:44] [INFO ] After 127ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 16:05:44] [INFO ] Deduced a trap composed of 66 places in 398 ms of which 1 ms to minimize.
[2024-05-28 16:05:45] [INFO ] Deduced a trap composed of 13 places in 366 ms of which 1 ms to minimize.
[2024-05-28 16:05:45] [INFO ] Deduced a trap composed of 13 places in 334 ms of which 1 ms to minimize.
[2024-05-28 16:05:46] [INFO ] Deduced a trap composed of 92 places in 365 ms of which 1 ms to minimize.
[2024-05-28 16:05:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1719 ms
[2024-05-28 16:05:46] [INFO ] After 1885ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2024-05-28 16:05:46] [INFO ] After 2524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 18 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 400/400 places, 1107/1107 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 718208 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :{}
Probabilistic random walk after 718208 steps, saw 95226 distinct states, run finished after 3001 ms. (steps per millisecond=239 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 16:05:49] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:05:49] [INFO ] Invariant cache hit.
[2024-05-28 16:05:49] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2024-05-28 16:05:49] [INFO ] After 287ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 16:05:49] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:05:49] [INFO ] After 89ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 16:05:49] [INFO ] After 497ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 16:05:49] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2024-05-28 16:05:50] [INFO ] After 438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 16:05:50] [INFO ] After 123ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 16:05:50] [INFO ] Deduced a trap composed of 66 places in 315 ms of which 1 ms to minimize.
[2024-05-28 16:05:51] [INFO ] Deduced a trap composed of 13 places in 334 ms of which 0 ms to minimize.
[2024-05-28 16:05:51] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 1 ms to minimize.
[2024-05-28 16:05:51] [INFO ] Deduced a trap composed of 92 places in 231 ms of which 1 ms to minimize.
[2024-05-28 16:05:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1313 ms
[2024-05-28 16:05:51] [INFO ] After 1473ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-28 16:05:51] [INFO ] After 2142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 23 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 400/400 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 23 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-05-28 16:05:51] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:05:51] [INFO ] Invariant cache hit.
[2024-05-28 16:05:52] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-05-28 16:05:52] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:05:52] [INFO ] Invariant cache hit.
[2024-05-28 16:05:52] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:05:55] [INFO ] Implicit Places using invariants and state equation in 3169 ms returned []
Implicit Place search using SMT with State Equation took 3764 ms to find 0 implicit places.
[2024-05-28 16:05:55] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-28 16:05:55] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:05:55] [INFO ] Invariant cache hit.
[2024-05-28 16:05:56] [INFO ] Dead Transitions using invariants and state equation in 1182 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4999 ms. Remains : 400/400 places, 1107/1107 transitions.
Graph (trivial) has 838 edges and 400 vertex of which 291 / 400 are part of one of the 42 SCC in 1 ms
Free SCC test removed 249 places
Drop transitions removed 498 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 749 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 317
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 317
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 87 place count 108 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 89 place count 108 transition count 313
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 109 place count 95 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 49 edges and 95 vertex of which 42 / 95 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 59 transition count 312
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Graph (trivial) has 187 edges and 54 vertex of which 30 / 54 are part of one of the 6 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 2 with 48 rules applied. Total rules applied 159 place count 30 transition count 270
Drop transitions removed 120 transitions
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 220 transitions.
Iterating post reduction 3 with 220 rules applied. Total rules applied 379 place count 30 transition count 50
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 382 place count 30 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 383 place count 30 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 29 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 385 place count 29 transition count 46
Applied a total of 385 rules in 16 ms. Remains 29 /400 variables (removed 371) and now considering 46/1107 (removed 1061) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 29 cols
[2024-05-28 16:05:56] [INFO ] Computed 9 invariants in 0 ms
[2024-05-28 16:05:56] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-28 16:05:56] [INFO ] After 21ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 16:05:56] [INFO ] After 28ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-28 16:05:56] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 326 ms.
Product exploration explored 100000 steps with 0 reset in 384 ms.
Built C files in :
/tmp/ltsmin5380589798353842628
[2024-05-28 16:05:57] [INFO ] Computing symmetric may disable matrix : 1107 transitions.
[2024-05-28 16:05:57] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:05:57] [INFO ] Computing symmetric may enable matrix : 1107 transitions.
[2024-05-28 16:05:58] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:05:58] [INFO ] Computing Do-Not-Accords matrix : 1107 transitions.
[2024-05-28 16:05:58] [INFO ] Computation of Completed DNA matrix. took 71 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:05:58] [INFO ] Built C files in 412ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5380589798353842628
Running compilation step : cd /tmp/ltsmin5380589798353842628;'/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/ltsmin5380589798353842628;'/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/ltsmin5380589798353842628;'/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 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 16 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-05-28 16:06:01] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2024-05-28 16:06:01] [INFO ] Computed 20 invariants in 2 ms
[2024-05-28 16:06:01] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-05-28 16:06:01] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:06:01] [INFO ] Invariant cache hit.
[2024-05-28 16:06:02] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:06:04] [INFO ] Implicit Places using invariants and state equation in 2333 ms returned []
Implicit Place search using SMT with State Equation took 2778 ms to find 0 implicit places.
[2024-05-28 16:06:04] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-28 16:06:04] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:06:04] [INFO ] Invariant cache hit.
[2024-05-28 16:06:05] [INFO ] Dead Transitions using invariants and state equation in 1197 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4042 ms. Remains : 400/400 places, 1107/1107 transitions.
Built C files in :
/tmp/ltsmin5661406739128838065
[2024-05-28 16:06:05] [INFO ] Computing symmetric may disable matrix : 1107 transitions.
[2024-05-28 16:06:05] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:06:05] [INFO ] Computing symmetric may enable matrix : 1107 transitions.
[2024-05-28 16:06:05] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:06:05] [INFO ] Computing Do-Not-Accords matrix : 1107 transitions.
[2024-05-28 16:06:05] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:06:05] [INFO ] Built C files in 267ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5661406739128838065
Running compilation step : cd /tmp/ltsmin5661406739128838065;'/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/ltsmin5661406739128838065;'/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/ltsmin5661406739128838065;'/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-28 16:06:08] [INFO ] Flatten gal took : 48 ms
[2024-05-28 16:06:08] [INFO ] Flatten gal took : 48 ms
[2024-05-28 16:06:08] [INFO ] Time to serialize gal into /tmp/LTL15474342465866902648.gal : 10 ms
[2024-05-28 16:06:08] [INFO ] Time to serialize properties into /tmp/LTL15844967414842278898.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/LTL15474342465866902648.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10897067012165311830.hoa' '-atoms' '/tmp/LTL15844967414842278898.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/LTL15844967414842278898.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10897067012165311830.hoa
Detected timeout of ITS tools.
[2024-05-28 16:06:24] [INFO ] Flatten gal took : 52 ms
[2024-05-28 16:06:24] [INFO ] Flatten gal took : 50 ms
[2024-05-28 16:06:24] [INFO ] Time to serialize gal into /tmp/LTL9890167827461398076.gal : 13 ms
[2024-05-28 16:06:24] [INFO ] Time to serialize properties into /tmp/LTL15077471538394559592.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/LTL9890167827461398076.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15077471538394559592.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("((WantSection_3_F==0)||(TestAlone_4_3_3==0))"))))
Formula 0 simplified : XF!"((WantSection_3_F==0)||(TestAlone_4_3_3==0))"
Detected timeout of ITS tools.
[2024-05-28 16:06:39] [INFO ] Flatten gal took : 45 ms
[2024-05-28 16:06:39] [INFO ] Applying decomposition
[2024-05-28 16:06:39] [INFO ] Flatten gal took : 44 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/graph1048223324948835294.txt' '-o' '/tmp/graph1048223324948835294.bin' '-w' '/tmp/graph1048223324948835294.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1048223324948835294.bin' '-l' '-1' '-v' '-w' '/tmp/graph1048223324948835294.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:06:39] [INFO ] Decomposing Gal with order
[2024-05-28 16:06:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:06:39] [INFO ] Removed a total of 1577 redundant transitions.
[2024-05-28 16:06:39] [INFO ] Flatten gal took : 102 ms
[2024-05-28 16:06:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 678 labels/synchronizations in 91 ms.
[2024-05-28 16:06:39] [INFO ] Time to serialize gal into /tmp/LTL6463179835015248540.gal : 15 ms
[2024-05-28 16:06:39] [INFO ] Time to serialize properties into /tmp/LTL627736011967482431.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/LTL6463179835015248540.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL627736011967482431.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(G("((i6.i0.u28.WantSection_3_F==0)||(i4.u0.TestAlone_4_3_3==0))"))))
Formula 0 simplified : XF!"((i6.i0.u28.WantSection_3_F==0)||(i4.u0.TestAlone_4_3_3==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15723795821788449126
[2024-05-28 16:06:54] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15723795821788449126
Running compilation step : cd /tmp/ltsmin15723795821788449126;'/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'
Compilation finished in 2928 ms.
Running link step : cd /tmp/ltsmin15723795821788449126;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin15723795821788449126;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Peterson-PT-6-LTLFireability-13 finished in 129416 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))))'
Support contains 1 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 44 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-28 16:07:09] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-28 16:07:09] [INFO ] Computed 27 invariants in 6 ms
[2024-05-28 16:07:10] [INFO ] Implicit Places using invariants in 866 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 867 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 43 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 954 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-15 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}]], initial=2, aps=[p0:(EQ s455 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][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 235 ms.
Stack based approach found an accepted trace after 472 steps with 0 reset with depth 473 and stack size 473 in 2 ms.
FORMULA Peterson-PT-6-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-15 finished in 1318 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)&&X(X(X(F(p1))))))'
Found a Shortening insensitive property : Peterson-PT-6-LTLFireability-01
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Support contains 266 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 0 with 335 rules applied. Total rules applied 335 place count 1330 transition count 1695
Reduce places removed 335 places and 0 transitions.
Iterating post reduction 1 with 335 rules applied. Total rules applied 670 place count 995 transition count 1695
Performed 288 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 288 Pre rules applied. Total rules applied 670 place count 995 transition count 1407
Deduced a syphon composed of 288 places in 1 ms
Reduce places removed 288 places and 0 transitions.
Iterating global reduction 2 with 576 rules applied. Total rules applied 1246 place count 707 transition count 1407
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 1316 place count 672 transition count 1372
Applied a total of 1316 rules in 97 ms. Remains 672 /1330 variables (removed 658) and now considering 1372/2030 (removed 658) transitions.
[2024-05-28 16:07:11] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
// Phase 1: matrix 1162 rows 672 cols
[2024-05-28 16:07:11] [INFO ] Computed 27 invariants in 4 ms
[2024-05-28 16:07:12] [INFO ] Implicit Places using invariants in 553 ms returned [646, 647, 649, 657, 658, 659, 660]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 555 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 665/1330 places, 1372/2030 transitions.
Applied a total of 0 rules in 19 ms. Remains 665 /665 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 671 ms. Remains : 665/1330 places, 1372/2030 transitions.
Running random walk in product with property : Peterson-PT-6-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (EQ s305 0) (EQ s546 0)) (OR (EQ s305 0) (EQ s554 0)) (OR (EQ s303 0) (EQ s317 0)) (OR (EQ s302 0) (EQ s417 0)) (OR (EQ s306 0) (EQ s438 0)) (...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 25000 reset in 1186 ms.
Product exploration explored 100000 steps with 25000 reset in 1143 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 173 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=173 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 7 out of 665 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 1372/1372 transitions.
Applied a total of 0 rules in 11 ms. Remains 665 /665 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
[2024-05-28 16:07:15] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
// Phase 1: matrix 1162 rows 665 cols
[2024-05-28 16:07:15] [INFO ] Computed 20 invariants in 4 ms
[2024-05-28 16:07:15] [INFO ] Implicit Places using invariants in 544 ms returned []
[2024-05-28 16:07:15] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
[2024-05-28 16:07:15] [INFO ] Invariant cache hit.
[2024-05-28 16:07:16] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:07:18] [INFO ] Implicit Places using invariants and state equation in 2406 ms returned []
Implicit Place search using SMT with State Equation took 2953 ms to find 0 implicit places.
[2024-05-28 16:07:18] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
[2024-05-28 16:07:18] [INFO ] Invariant cache hit.
[2024-05-28 16:07:19] [INFO ] Dead Transitions using invariants and state equation in 1657 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4624 ms. Remains : 665/665 places, 1372/1372 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 116 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=58 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 1031 ms.
Product exploration explored 100000 steps with 25000 reset in 673 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 7 out of 665 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 665/665 places, 1372/1372 transitions.
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 252 Pre rules applied. Total rules applied 0 place count 665 transition count 1624
Deduced a syphon composed of 252 places in 0 ms
Iterating global reduction 0 with 252 rules applied. Total rules applied 252 place count 665 transition count 1624
Deduced a syphon composed of 252 places in 1 ms
Applied a total of 252 rules in 47 ms. Remains 665 /665 variables (removed 0) and now considering 1624/1372 (removed -252) transitions.
[2024-05-28 16:07:23] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-28 16:07:23] [INFO ] Flow matrix only has 1414 transitions (discarded 210 similar events)
// Phase 1: matrix 1414 rows 665 cols
[2024-05-28 16:07:23] [INFO ] Computed 20 invariants in 3 ms
[2024-05-28 16:07:24] [INFO ] Dead Transitions using invariants and state equation in 1813 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 665/665 places, 1624/1372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1903 ms. Remains : 665/665 places, 1624/1372 transitions.
Built C files in :
/tmp/ltsmin17719870048955532788
[2024-05-28 16:07:24] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17719870048955532788
Running compilation step : cd /tmp/ltsmin17719870048955532788;'/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/ltsmin17719870048955532788;'/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/ltsmin17719870048955532788;'/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 7 out of 665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 1372/1372 transitions.
Applied a total of 0 rules in 10 ms. Remains 665 /665 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
[2024-05-28 16:07:27] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
// Phase 1: matrix 1162 rows 665 cols
[2024-05-28 16:07:27] [INFO ] Computed 20 invariants in 8 ms
[2024-05-28 16:07:28] [INFO ] Implicit Places using invariants in 606 ms returned []
[2024-05-28 16:07:28] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
[2024-05-28 16:07:28] [INFO ] Invariant cache hit.
[2024-05-28 16:07:29] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:07:32] [INFO ] Implicit Places using invariants and state equation in 4281 ms returned []
Implicit Place search using SMT with State Equation took 4892 ms to find 0 implicit places.
[2024-05-28 16:07:32] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
[2024-05-28 16:07:32] [INFO ] Invariant cache hit.
[2024-05-28 16:07:34] [INFO ] Dead Transitions using invariants and state equation in 1817 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6724 ms. Remains : 665/665 places, 1372/1372 transitions.
Built C files in :
/tmp/ltsmin5963659068195994855
[2024-05-28 16:07:34] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5963659068195994855
Running compilation step : cd /tmp/ltsmin5963659068195994855;'/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/ltsmin5963659068195994855;'/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/ltsmin5963659068195994855;'/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-28 16:07:37] [INFO ] Flatten gal took : 32 ms
[2024-05-28 16:07:37] [INFO ] Flatten gal took : 33 ms
[2024-05-28 16:07:37] [INFO ] Time to serialize gal into /tmp/LTL8952657028179624711.gal : 6 ms
[2024-05-28 16:07:37] [INFO ] Time to serialize properties into /tmp/LTL11756733344977772580.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/LTL8952657028179624711.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7810312720360298716.hoa' '-atoms' '/tmp/LTL11756733344977772580.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/LTL11756733344977772580.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7810312720360298716.hoa
Detected timeout of ITS tools.
[2024-05-28 16:07:52] [INFO ] Flatten gal took : 33 ms
[2024-05-28 16:07:53] [INFO ] Flatten gal took : 34 ms
[2024-05-28 16:07:53] [INFO ] Time to serialize gal into /tmp/LTL5821182124699515336.gal : 5 ms
[2024-05-28 16:07:53] [INFO ] Time to serialize properties into /tmp/LTL17563693739095094654.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/LTL5821182124699515336.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17563693739095094654.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((WantSection_5_T==0)||(TestAlone_4_5_5==0))&&((WantSection_5_T==0)||(TestAlone_3_1_5==0)))&&(((WantSection_0_T==0)||(...12419
Formula 0 simplified : G!"(((((((((((WantSection_5_T==0)||(TestAlone_4_5_5==0))&&((WantSection_5_T==0)||(TestAlone_3_1_5==0)))&&(((WantSection_0_T==0)||(Te...12405
Detected timeout of ITS tools.
[2024-05-28 16:08:08] [INFO ] Flatten gal took : 33 ms
[2024-05-28 16:08:08] [INFO ] Applying decomposition
[2024-05-28 16:08:08] [INFO ] Flatten gal took : 34 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/graph7290747410351940820.txt' '-o' '/tmp/graph7290747410351940820.bin' '-w' '/tmp/graph7290747410351940820.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7290747410351940820.bin' '-l' '-1' '-v' '-w' '/tmp/graph7290747410351940820.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:08:08] [INFO ] Decomposing Gal with order
[2024-05-28 16:08:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:08:08] [INFO ] Removed a total of 2072 redundant transitions.
[2024-05-28 16:08:08] [INFO ] Flatten gal took : 76 ms
[2024-05-28 16:08:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-28 16:08:08] [INFO ] Time to serialize gal into /tmp/LTL12316380418768717463.gal : 12 ms
[2024-05-28 16:08:08] [INFO ] Time to serialize properties into /tmp/LTL9509992889923710351.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/LTL12316380418768717463.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9509992889923710351.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((i8.u176.WantSection_5_T==0)||(i18.u76.TestAlone_4_5_5==0))&&((i8.u176.WantSection_5_T==0)||(i5.u275.TestAlone_3_1_5=...17363
Formula 0 simplified : G!"(((((((((((i8.u176.WantSection_5_T==0)||(i18.u76.TestAlone_4_5_5==0))&&((i8.u176.WantSection_5_T==0)||(i5.u275.TestAlone_3_1_5==0...17349
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8162878840472649856
[2024-05-28 16:08:23] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8162878840472649856
Running compilation step : cd /tmp/ltsmin8162878840472649856;'/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/ltsmin8162878840472649856;'/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/ltsmin8162878840472649856;'/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 Peterson-PT-6-LTLFireability-01 finished in 75380 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((G(p1)||p0)))))'
Found a Shortening insensitive property : Peterson-PT-6-LTLFireability-06
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 511 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 1330 transition count 1910
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 1210 transition count 1910
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 258 Pre rules applied. Total rules applied 240 place count 1210 transition count 1652
Deduced a syphon composed of 258 places in 1 ms
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 2 with 516 rules applied. Total rules applied 756 place count 952 transition count 1652
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 840 place count 910 transition count 1610
Applied a total of 840 rules in 107 ms. Remains 910 /1330 variables (removed 420) and now considering 1610/2030 (removed 420) transitions.
[2024-05-28 16:08:26] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
// Phase 1: matrix 1400 rows 910 cols
[2024-05-28 16:08:26] [INFO ] Computed 27 invariants in 4 ms
[2024-05-28 16:08:27] [INFO ] Implicit Places using invariants in 507 ms returned [836, 837, 839, 902, 903, 904, 905]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 513 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 903/1330 places, 1610/2030 transitions.
Applied a total of 0 rules in 23 ms. Remains 903 /903 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 647 ms. Remains : 903/1330 places, 1610/2030 transitions.
Running random walk in product with property : Peterson-PT-6-LTLFireability-06 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}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (EQ s572 1) (EQ s746 1) (EQ s684 1) (EQ s628 1) (EQ s861 1) (EQ s565 1) (EQ s752 1) (EQ s868 1) (EQ s677 1) (EQ s788 1) (EQ s732 1) (EQ s642 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4475 reset in 4575 ms.
Product exploration explored 100000 steps with 4482 reset in 4404 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 20 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 16:08:37] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
// Phase 1: matrix 1400 rows 903 cols
[2024-05-28 16:08:37] [INFO ] Computed 20 invariants in 6 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:879)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-28 16:08:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 511 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1610/1610 transitions.
Applied a total of 0 rules in 7 ms. Remains 903 /903 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
[2024-05-28 16:08:53] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-05-28 16:08:53] [INFO ] Invariant cache hit.
[2024-05-28 16:08:53] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-28 16:08:53] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-05-28 16:08:53] [INFO ] Invariant cache hit.
[2024-05-28 16:08:54] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:08:56] [INFO ] Implicit Places using invariants and state equation in 3009 ms returned []
Implicit Place search using SMT with State Equation took 3418 ms to find 0 implicit places.
[2024-05-28 16:08:56] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-05-28 16:08:56] [INFO ] Invariant cache hit.
[2024-05-28 16:08:58] [INFO ] Dead Transitions using invariants and state equation in 1600 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5027 ms. Remains : 903/903 places, 1610/1610 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 16 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 16:08:59] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-05-28 16:08:59] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:879)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-28 16:09:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4452 reset in 6456 ms.
Product exploration explored 100000 steps with 4440 reset in 6299 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 511 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1610/1610 transitions.
Applied a total of 0 rules in 22 ms. Remains 903 /903 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
[2024-05-28 16:09:28] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-28 16:09:28] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-05-28 16:09:28] [INFO ] Invariant cache hit.
[2024-05-28 16:09:30] [INFO ] Dead Transitions using invariants and state equation in 1922 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1983 ms. Remains : 903/903 places, 1610/1610 transitions.
Built C files in :
/tmp/ltsmin2335667066075768196
[2024-05-28 16:09:30] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2335667066075768196
Running compilation step : cd /tmp/ltsmin2335667066075768196;'/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/ltsmin2335667066075768196;'/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/ltsmin2335667066075768196;'/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 511 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1610/1610 transitions.
Applied a total of 0 rules in 9 ms. Remains 903 /903 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
[2024-05-28 16:09:33] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-05-28 16:09:33] [INFO ] Invariant cache hit.
[2024-05-28 16:09:34] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-28 16:09:34] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-05-28 16:09:34] [INFO ] Invariant cache hit.
[2024-05-28 16:09:34] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:09:36] [INFO ] Implicit Places using invariants and state equation in 2531 ms returned []
Implicit Place search using SMT with State Equation took 2947 ms to find 0 implicit places.
[2024-05-28 16:09:36] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-05-28 16:09:36] [INFO ] Invariant cache hit.
[2024-05-28 16:09:38] [INFO ] Dead Transitions using invariants and state equation in 1611 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4579 ms. Remains : 903/903 places, 1610/1610 transitions.
Built C files in :
/tmp/ltsmin2095008039690447736
[2024-05-28 16:09:38] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2095008039690447736
Running compilation step : cd /tmp/ltsmin2095008039690447736;'/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/ltsmin2095008039690447736;'/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/ltsmin2095008039690447736;'/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-28 16:09:41] [INFO ] Flatten gal took : 36 ms
[2024-05-28 16:09:41] [INFO ] Flatten gal took : 40 ms
[2024-05-28 16:09:41] [INFO ] Time to serialize gal into /tmp/LTL2616133160185339304.gal : 7 ms
[2024-05-28 16:09:41] [INFO ] Time to serialize properties into /tmp/LTL14249296226451614591.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/LTL2616133160185339304.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16045699624081796305.hoa' '-atoms' '/tmp/LTL14249296226451614591.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/LTL14249296226451614591.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16045699624081796305.hoa
Detected timeout of ITS tools.
[2024-05-28 16:09:56] [INFO ] Flatten gal took : 38 ms
[2024-05-28 16:09:56] [INFO ] Flatten gal took : 40 ms
[2024-05-28 16:09:56] [INFO ] Time to serialize gal into /tmp/LTL16577485049401595742.gal : 13 ms
[2024-05-28 16:09:56] [INFO ] Time to serialize properties into /tmp/LTL2862849442312253800.ltl : 6 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/LTL16577485049401595742.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2862849442312253800.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(((((((((G("(((((((((TestIdentity_2_0_0==1)||(TestIdentity_6_3_2==1))||((TestIdentity_0_3_3==1)||(TestIdentity_0_4_1==1)))||((...18968
Formula 0 simplified : XXG(!"(((((((((WantSection_2_T==1)&&(TestAlone_5_5_2==1))||((WantSection_0_T==1)&&(TestAlone_2_3_0==1)))||(((WantSection_5_T==1)&&(T...18944
Detected timeout of ITS tools.
[2024-05-28 16:10:11] [INFO ] Flatten gal took : 40 ms
[2024-05-28 16:10:11] [INFO ] Applying decomposition
[2024-05-28 16:10:11] [INFO ] Flatten gal took : 37 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/graph5253008706178197667.txt' '-o' '/tmp/graph5253008706178197667.bin' '-w' '/tmp/graph5253008706178197667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5253008706178197667.bin' '-l' '-1' '-v' '-w' '/tmp/graph5253008706178197667.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:10:11] [INFO ] Decomposing Gal with order
[2024-05-28 16:10:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:10:11] [INFO ] Removed a total of 2072 redundant transitions.
[2024-05-28 16:10:11] [INFO ] Flatten gal took : 83 ms
[2024-05-28 16:10:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 19 ms.
[2024-05-28 16:10:12] [INFO ] Time to serialize gal into /tmp/LTL3196281675307730532.gal : 13 ms
[2024-05-28 16:10:12] [INFO ] Time to serialize properties into /tmp/LTL2567477732210254938.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3196281675307730532.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2567477732210254938.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(X(F(((((((((G("(((((((((i20.u84.TestIdentity_2_0_0==1)||(i14.u233.TestIdentity_6_3_2==1))||((i8.i1.u189.TestIdentity_0_3_3==1)||(...26130
Formula 0 simplified : XXG(!"(((((((((i14.u115.WantSection_2_T==1)&&(i10.u239.TestAlone_5_5_2==1))||((i15.u110.WantSection_0_T==1)&&(i15.u180.TestAlone_2_3...26106
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5137255105740992336
[2024-05-28 16:10:27] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5137255105740992336
Running compilation step : cd /tmp/ltsmin5137255105740992336;'/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/ltsmin5137255105740992336;'/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/ltsmin5137255105740992336;'/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 Peterson-PT-6-LTLFireability-06 finished in 123628 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)))'
Found a Lengthening insensitive property : Peterson-PT-6-LTLFireability-13
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 587 rules applied. Total rules applied 587 place count 1330 transition count 1443
Reduce places removed 587 places and 0 transitions.
Iterating post reduction 1 with 587 rules applied. Total rules applied 1174 place count 743 transition count 1443
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1174 place count 743 transition count 1149
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1762 place count 449 transition count 1149
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1846 place count 407 transition count 1107
Applied a total of 1846 rules in 60 ms. Remains 407 /1330 variables (removed 923) and now considering 1107/2030 (removed 923) transitions.
[2024-05-28 16:10:30] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 407 cols
[2024-05-28 16:10:30] [INFO ] Computed 27 invariants in 2 ms
[2024-05-28 16:10:31] [INFO ] Implicit Places using invariants in 597 ms returned [388, 389, 391, 399, 400, 401, 402]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 599 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 400/1330 places, 1107/2030 transitions.
Applied a total of 0 rules in 13 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 673 ms. Remains : 400/1330 places, 1107/2030 transitions.
Running random walk in product with property : Peterson-PT-6-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s306 1) (NEQ s308 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 273 ms.
Product exploration explored 100000 steps with 0 reset in 376 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 739880 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :{}
Probabilistic random walk after 739880 steps, saw 100046 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 16:10:34] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2024-05-28 16:10:34] [INFO ] Computed 20 invariants in 2 ms
[2024-05-28 16:10:35] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2024-05-28 16:10:35] [INFO ] After 392ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 16:10:35] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:10:35] [INFO ] After 95ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 16:10:35] [INFO ] After 658ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 16:10:35] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-05-28 16:10:36] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 16:10:36] [INFO ] After 75ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 16:10:36] [INFO ] Deduced a trap composed of 47 places in 357 ms of which 1 ms to minimize.
[2024-05-28 16:10:36] [INFO ] Deduced a trap composed of 50 places in 327 ms of which 1 ms to minimize.
[2024-05-28 16:10:37] [INFO ] Deduced a trap composed of 66 places in 184 ms of which 1 ms to minimize.
[2024-05-28 16:10:37] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 1 ms to minimize.
[2024-05-28 16:10:37] [INFO ] Deduced a trap composed of 43 places in 235 ms of which 3 ms to minimize.
[2024-05-28 16:10:37] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 2 ms to minimize.
[2024-05-28 16:10:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1816 ms
[2024-05-28 16:10:37] [INFO ] After 1917ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-28 16:10:37] [INFO ] After 2355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 15 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 400/400 places, 1107/1107 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 776384 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :{}
Probabilistic random walk after 776384 steps, saw 103834 distinct states, run finished after 3004 ms. (steps per millisecond=258 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 16:10:41] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:10:41] [INFO ] Invariant cache hit.
[2024-05-28 16:10:41] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2024-05-28 16:10:41] [INFO ] After 287ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 16:10:41] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:10:41] [INFO ] After 70ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 16:10:41] [INFO ] After 482ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 16:10:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2024-05-28 16:10:42] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 16:10:42] [INFO ] After 113ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 16:10:42] [INFO ] Deduced a trap composed of 66 places in 195 ms of which 0 ms to minimize.
[2024-05-28 16:10:42] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 0 ms to minimize.
[2024-05-28 16:10:42] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 0 ms to minimize.
[2024-05-28 16:10:43] [INFO ] Deduced a trap composed of 92 places in 214 ms of which 1 ms to minimize.
[2024-05-28 16:10:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1066 ms
[2024-05-28 16:10:43] [INFO ] After 1213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-28 16:10:43] [INFO ] After 1811ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 15 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 400/400 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 14 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-05-28 16:10:43] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:10:43] [INFO ] Invariant cache hit.
[2024-05-28 16:10:43] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-05-28 16:10:43] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:10:43] [INFO ] Invariant cache hit.
[2024-05-28 16:10:44] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:10:46] [INFO ] Implicit Places using invariants and state equation in 2288 ms returned []
Implicit Place search using SMT with State Equation took 2826 ms to find 0 implicit places.
[2024-05-28 16:10:46] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-28 16:10:46] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:10:46] [INFO ] Invariant cache hit.
[2024-05-28 16:10:46] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3599 ms. Remains : 400/400 places, 1107/1107 transitions.
Graph (trivial) has 838 edges and 400 vertex of which 291 / 400 are part of one of the 42 SCC in 0 ms
Free SCC test removed 249 places
Drop transitions removed 498 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 749 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 317
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 317
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 87 place count 108 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 89 place count 108 transition count 313
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 109 place count 95 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 49 edges and 95 vertex of which 42 / 95 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 59 transition count 312
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Graph (trivial) has 187 edges and 54 vertex of which 30 / 54 are part of one of the 6 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 2 with 48 rules applied. Total rules applied 159 place count 30 transition count 270
Drop transitions removed 120 transitions
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 220 transitions.
Iterating post reduction 3 with 220 rules applied. Total rules applied 379 place count 30 transition count 50
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 382 place count 30 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 383 place count 30 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 29 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 385 place count 29 transition count 46
Applied a total of 385 rules in 24 ms. Remains 29 /400 variables (removed 371) and now considering 46/1107 (removed 1061) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 29 cols
[2024-05-28 16:10:46] [INFO ] Computed 9 invariants in 0 ms
[2024-05-28 16:10:47] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-28 16:10:47] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 16:10:47] [INFO ] After 30ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-28 16:10:47] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 25 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-05-28 16:10:47] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2024-05-28 16:10:47] [INFO ] Computed 20 invariants in 2 ms
[2024-05-28 16:10:47] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-05-28 16:10:47] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:10:47] [INFO ] Invariant cache hit.
[2024-05-28 16:10:48] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:10:49] [INFO ] Implicit Places using invariants and state equation in 2122 ms returned []
Implicit Place search using SMT with State Equation took 2717 ms to find 0 implicit places.
[2024-05-28 16:10:50] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-28 16:10:50] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:10:50] [INFO ] Invariant cache hit.
[2024-05-28 16:10:50] [INFO ] Dead Transitions using invariants and state equation in 760 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3521 ms. Remains : 400/400 places, 1107/1107 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 667832 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 667832 steps, saw 89156 distinct states, run finished after 3004 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 16:10:53] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:10:53] [INFO ] Invariant cache hit.
[2024-05-28 16:10:54] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-05-28 16:10:54] [INFO ] After 286ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 16:10:54] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:10:54] [INFO ] After 71ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 16:10:54] [INFO ] After 479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 16:10:54] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2024-05-28 16:10:54] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 16:10:54] [INFO ] After 80ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 16:10:55] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 4 ms to minimize.
[2024-05-28 16:10:55] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 3 ms to minimize.
[2024-05-28 16:10:55] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 1 ms to minimize.
[2024-05-28 16:10:56] [INFO ] Deduced a trap composed of 92 places in 290 ms of which 1 ms to minimize.
[2024-05-28 16:10:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1126 ms
[2024-05-28 16:10:56] [INFO ] After 1237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-28 16:10:56] [INFO ] After 1679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 26 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 400/400 places, 1107/1107 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 702040 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :{}
Probabilistic random walk after 702040 steps, saw 92347 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 16:10:59] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:10:59] [INFO ] Invariant cache hit.
[2024-05-28 16:10:59] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-05-28 16:10:59] [INFO ] After 286ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 16:10:59] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:10:59] [INFO ] After 85ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 16:10:59] [INFO ] After 499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 16:10:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2024-05-28 16:11:00] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 16:11:00] [INFO ] After 95ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 16:11:00] [INFO ] Deduced a trap composed of 66 places in 307 ms of which 2 ms to minimize.
[2024-05-28 16:11:00] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 0 ms to minimize.
[2024-05-28 16:11:01] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 1 ms to minimize.
[2024-05-28 16:11:01] [INFO ] Deduced a trap composed of 92 places in 211 ms of which 1 ms to minimize.
[2024-05-28 16:11:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1100 ms
[2024-05-28 16:11:01] [INFO ] After 1221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-28 16:11:01] [INFO ] After 1744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 14 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 400/400 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 14 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-05-28 16:11:01] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:11:01] [INFO ] Invariant cache hit.
[2024-05-28 16:11:01] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-28 16:11:01] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:11:01] [INFO ] Invariant cache hit.
[2024-05-28 16:11:02] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:11:04] [INFO ] Implicit Places using invariants and state equation in 2091 ms returned []
Implicit Place search using SMT with State Equation took 2509 ms to find 0 implicit places.
[2024-05-28 16:11:04] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-28 16:11:04] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:11:04] [INFO ] Invariant cache hit.
[2024-05-28 16:11:04] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3320 ms. Remains : 400/400 places, 1107/1107 transitions.
Graph (trivial) has 838 edges and 400 vertex of which 291 / 400 are part of one of the 42 SCC in 1 ms
Free SCC test removed 249 places
Drop transitions removed 498 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 749 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 317
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 317
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 87 place count 108 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 89 place count 108 transition count 313
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 109 place count 95 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 49 edges and 95 vertex of which 42 / 95 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 59 transition count 312
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Graph (trivial) has 187 edges and 54 vertex of which 30 / 54 are part of one of the 6 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 2 with 48 rules applied. Total rules applied 159 place count 30 transition count 270
Drop transitions removed 120 transitions
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 220 transitions.
Iterating post reduction 3 with 220 rules applied. Total rules applied 379 place count 30 transition count 50
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 382 place count 30 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 383 place count 30 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 29 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 385 place count 29 transition count 46
Applied a total of 385 rules in 16 ms. Remains 29 /400 variables (removed 371) and now considering 46/1107 (removed 1061) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 29 cols
[2024-05-28 16:11:04] [INFO ] Computed 9 invariants in 0 ms
[2024-05-28 16:11:04] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-28 16:11:04] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 16:11:04] [INFO ] After 24ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-28 16:11:04] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 404 ms.
Product exploration explored 100000 steps with 0 reset in 338 ms.
Built C files in :
/tmp/ltsmin4805154686232063682
[2024-05-28 16:11:05] [INFO ] Computing symmetric may disable matrix : 1107 transitions.
[2024-05-28 16:11:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:11:05] [INFO ] Computing symmetric may enable matrix : 1107 transitions.
[2024-05-28 16:11:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:11:06] [INFO ] Computing Do-Not-Accords matrix : 1107 transitions.
[2024-05-28 16:11:06] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:11:06] [INFO ] Built C files in 199ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4805154686232063682
Running compilation step : cd /tmp/ltsmin4805154686232063682;'/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/ltsmin4805154686232063682;'/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/ltsmin4805154686232063682;'/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 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 16 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-05-28 16:11:09] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2024-05-28 16:11:09] [INFO ] Computed 20 invariants in 3 ms
[2024-05-28 16:11:10] [INFO ] Implicit Places using invariants in 990 ms returned []
[2024-05-28 16:11:10] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:11:10] [INFO ] Invariant cache hit.
[2024-05-28 16:11:10] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-28 16:11:12] [INFO ] Implicit Places using invariants and state equation in 2112 ms returned []
Implicit Place search using SMT with State Equation took 3117 ms to find 0 implicit places.
[2024-05-28 16:11:12] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-28 16:11:12] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-28 16:11:12] [INFO ] Invariant cache hit.
[2024-05-28 16:11:13] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3871 ms. Remains : 400/400 places, 1107/1107 transitions.
Built C files in :
/tmp/ltsmin13629914315746162591
[2024-05-28 16:11:13] [INFO ] Computing symmetric may disable matrix : 1107 transitions.
[2024-05-28 16:11:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:11:13] [INFO ] Computing symmetric may enable matrix : 1107 transitions.
[2024-05-28 16:11:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:11:13] [INFO ] Computing Do-Not-Accords matrix : 1107 transitions.
[2024-05-28 16:11:13] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:11:13] [INFO ] Built C files in 198ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13629914315746162591
Running compilation step : cd /tmp/ltsmin13629914315746162591;'/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/ltsmin13629914315746162591;'/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/ltsmin13629914315746162591;'/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-28 16:11:16] [INFO ] Flatten gal took : 30 ms
[2024-05-28 16:11:16] [INFO ] Flatten gal took : 29 ms
[2024-05-28 16:11:16] [INFO ] Time to serialize gal into /tmp/LTL7795375210372118604.gal : 4 ms
[2024-05-28 16:11:16] [INFO ] Time to serialize properties into /tmp/LTL10518723024656208254.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/LTL7795375210372118604.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6409230411633335310.hoa' '-atoms' '/tmp/LTL10518723024656208254.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/LTL10518723024656208254.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6409230411633335310.hoa
Detected timeout of ITS tools.
[2024-05-28 16:11:31] [INFO ] Flatten gal took : 44 ms
[2024-05-28 16:11:31] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:11:31] [INFO ] Time to serialize gal into /tmp/LTL14534052359796832885.gal : 7 ms
[2024-05-28 16:11:31] [INFO ] Time to serialize properties into /tmp/LTL18090018851863936370.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/LTL14534052359796832885.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18090018851863936370.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(G("((WantSection_3_F==0)||(TestAlone_4_3_3==0))"))))
Formula 0 simplified : XF!"((WantSection_3_F==0)||(TestAlone_4_3_3==0))"
Detected timeout of ITS tools.
[2024-05-28 16:11:46] [INFO ] Flatten gal took : 44 ms
[2024-05-28 16:11:46] [INFO ] Applying decomposition
[2024-05-28 16:11:46] [INFO ] Flatten gal took : 44 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/graph17335022468123254765.txt' '-o' '/tmp/graph17335022468123254765.bin' '-w' '/tmp/graph17335022468123254765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17335022468123254765.bin' '-l' '-1' '-v' '-w' '/tmp/graph17335022468123254765.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:11:46] [INFO ] Decomposing Gal with order
[2024-05-28 16:11:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:11:46] [INFO ] Removed a total of 1577 redundant transitions.
[2024-05-28 16:11:46] [INFO ] Flatten gal took : 97 ms
[2024-05-28 16:11:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 427 labels/synchronizations in 29 ms.
[2024-05-28 16:11:46] [INFO ] Time to serialize gal into /tmp/LTL17152949024637189778.gal : 13 ms
[2024-05-28 16:11:46] [INFO ] Time to serialize properties into /tmp/LTL2195318343298324551.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/LTL17152949024637189778.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2195318343298324551.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G("((i8.u30.WantSection_3_F==0)||(i13.u0.TestAlone_4_3_3==0))"))))
Formula 0 simplified : XF!"((i8.u30.WantSection_3_F==0)||(i13.u0.TestAlone_4_3_3==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4019900047947030957
[2024-05-28 16:12:02] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4019900047947030957
Running compilation step : cd /tmp/ltsmin4019900047947030957;'/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'
Compilation finished in 2874 ms.
Running link step : cd /tmp/ltsmin4019900047947030957;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4019900047947030957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Peterson-PT-6-LTLFireability-13 finished in 106974 ms.
[2024-05-28 16:12:17] [INFO ] Flatten gal took : 55 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14711191053236243072
[2024-05-28 16:12:17] [INFO ] Too many transitions (2030) to apply POR reductions. Disabling POR matrices.
[2024-05-28 16:12:17] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14711191053236243072
Running compilation step : cd /tmp/ltsmin14711191053236243072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 16:12:17] [INFO ] Applying decomposition
[2024-05-28 16:12:17] [INFO ] Flatten gal took : 80 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/graph18375119019879604864.txt' '-o' '/tmp/graph18375119019879604864.bin' '-w' '/tmp/graph18375119019879604864.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18375119019879604864.bin' '-l' '-1' '-v' '-w' '/tmp/graph18375119019879604864.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:12:17] [INFO ] Decomposing Gal with order
[2024-05-28 16:12:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:12:17] [INFO ] Removed a total of 1788 redundant transitions.
[2024-05-28 16:12:17] [INFO ] Flatten gal took : 124 ms
[2024-05-28 16:12:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-28 16:12:18] [INFO ] Time to serialize gal into /tmp/LTLFireability1390979287930660009.gal : 21 ms
[2024-05-28 16:12:18] [INFO ] Time to serialize properties into /tmp/LTLFireability9288587221745744256.ltl : 7 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/LTLFireability1390979287930660009.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9288587221745744256.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !(((F("(((((((((((i12.u176.WantSection_5_T==0)||(i4.u409.TestAlone_4_5_5==0))&&((i12.u176.WantSection_5_T==0)||(i0.u243.TestAlone_3_1_...17303
Formula 0 simplified : G!"(((((((((((i12.u176.WantSection_5_T==0)||(i4.u409.TestAlone_4_5_5==0))&&((i12.u176.WantSection_5_T==0)||(i0.u243.TestAlone_3_1_5=...17289
Compilation finished in 7267 ms.
Running link step : cd /tmp/ltsmin14711191053236243072;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin14711191053236243072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&X(X(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
LTSmin run took 1267 ms.
FORMULA Peterson-PT-6-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin14711191053236243072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([]((LTLAPp3==true))||(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin14711191053236243072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([]((LTLAPp3==true))||(LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14711191053236243072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp4==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 16:37:01] [INFO ] Applying decomposition
[2024-05-28 16:37:01] [INFO ] Flatten gal took : 67 ms
[2024-05-28 16:37:01] [INFO ] Decomposing Gal with order
[2024-05-28 16:37:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:37:02] [INFO ] Removed a total of 1330 redundant transitions.
[2024-05-28 16:37:02] [INFO ] Flatten gal took : 356 ms
[2024-05-28 16:37:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 624 labels/synchronizations in 46 ms.
[2024-05-28 16:37:02] [INFO ] Time to serialize gal into /tmp/LTLFireability16242785711300345612.gal : 12 ms
[2024-05-28 16:37:02] [INFO ] Time to serialize properties into /tmp/LTLFireability7955930571363218765.ltl : 11 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/LTLFireability16242785711300345612.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7955930571363218765.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 2 LTL properties
Checking formula 0 : !((X(X(F(("(((((((((u22.WantSection_5_T==1)&&(u4.TestAlone_4_5_5==1))||((u22.WantSection_5_T==1)&&(u1.TestAlone_3_1_5==1)))||(((u19.Wa...21480
Formula 0 simplified : XXG(!"(((((((((u22.WantSection_5_T==1)&&(u4.TestAlone_4_5_5==1))||((u22.WantSection_5_T==1)&&(u1.TestAlone_3_1_5==1)))||(((u19.WantS...21460
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin14711191053236243072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp4==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin14711191053236243072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([]((LTLAPp3==true))||(LTLAPp2==true)))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 1266200 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16158448 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-6"
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 Peterson-PT-6, 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 r285-smll-171654422100178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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