fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r219-smll-171649597700018
Last Updated
July 7, 2024

About the Execution of 2023-gold for HexagonalGrid-PT-316

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1855.920 472003.00 833827.00 2369.60 FFFFFFFFFFTFFFFT normal

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.r219-smll-171649597700018.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 HexagonalGrid-PT-316, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r219-smll-171649597700018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 02:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 13 02:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 02:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Apr 13 02:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rwxr-xr-x 1 mcc users 294K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716626269012

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=HexagonalGrid-PT-316
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 08:37:52] [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-25 08:37:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 08:37:52] [INFO ] Load time of PNML (sax parser for PT used): 339 ms
[2024-05-25 08:37:52] [INFO ] Transformed 421 places.
[2024-05-25 08:37:52] [INFO ] Transformed 714 transitions.
[2024-05-25 08:37:52] [INFO ] Parsed PT model containing 421 places and 714 transitions and 2856 arcs in 543 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HexagonalGrid-PT-316-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-316-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-316-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 106 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
// Phase 1: matrix 714 rows 421 cols
[2024-05-25 08:37:53] [INFO ] Computed 164 invariants in 78 ms
[2024-05-25 08:37:54] [INFO ] Implicit Places using invariants in 1124 ms returned []
[2024-05-25 08:37:54] [INFO ] Invariant cache hit.
[2024-05-25 08:37:55] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned []
Implicit Place search using SMT with State Equation took 2345 ms to find 0 implicit places.
[2024-05-25 08:37:55] [INFO ] Invariant cache hit.
[2024-05-25 08:37:56] [INFO ] Dead Transitions using invariants and state equation in 912 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3367 ms. Remains : 421/421 places, 714/714 transitions.
Support contains 57 out of 421 places after structural reductions.
[2024-05-25 08:37:56] [INFO ] Flatten gal took : 205 ms
[2024-05-25 08:37:56] [INFO ] Flatten gal took : 111 ms
[2024-05-25 08:37:57] [INFO ] Input system was already deterministic with 714 transitions.
Finished random walk after 1173 steps, including 0 resets, run visited all 27 properties in 146 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
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' '!(G((X(p0)||F(p1))))'
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 24 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:37:57] [INFO ] Invariant cache hit.
[2024-05-25 08:37:58] [INFO ] Implicit Places using invariants in 655 ms returned []
[2024-05-25 08:37:58] [INFO ] Invariant cache hit.
[2024-05-25 08:37:59] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned []
Implicit Place search using SMT with State Equation took 1802 ms to find 0 implicit places.
[2024-05-25 08:37:59] [INFO ] Invariant cache hit.
[2024-05-25 08:38:00] [INFO ] Dead Transitions using invariants and state equation in 826 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2653 ms. Remains : 421/421 places, 714/714 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 373 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s20 1) (LT s369 1)), p0:(OR (LT s45 1) (LT s394 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 720 reset in 2989 ms.
Product exploration explored 100000 steps with 720 reset in 2676 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))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 173 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 120 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 183 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 232 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 130 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
[2024-05-25 08:38:07] [INFO ] Invariant cache hit.
[2024-05-25 08:38:08] [INFO ] [Real]Absence check using 163 positive place invariants in 96 ms returned sat
[2024-05-25 08:38:08] [INFO ] [Real]Absence check using 163 positive and 1 generalized place invariants in 89 ms returned sat
[2024-05-25 08:38:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:38:09] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2024-05-25 08:38:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:38:10] [INFO ] [Nat]Absence check using 163 positive place invariants in 143 ms returned sat
[2024-05-25 08:38:10] [INFO ] [Nat]Absence check using 163 positive and 1 generalized place invariants in 73 ms returned sat
[2024-05-25 08:38:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:38:11] [INFO ] [Nat]Absence check using state equation in 814 ms returned sat
[2024-05-25 08:38:11] [INFO ] Computed and/alt/rep : 600/600/600 causal constraints (skipped 0 transitions) in 106 ms.
[2024-05-25 08:38:13] [INFO ] Added : 140 causal constraints over 28 iterations in 2067 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 18 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:38:13] [INFO ] Invariant cache hit.
[2024-05-25 08:38:13] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-05-25 08:38:13] [INFO ] Invariant cache hit.
[2024-05-25 08:38:15] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
[2024-05-25 08:38:15] [INFO ] Invariant cache hit.
[2024-05-25 08:38:15] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2662 ms. Remains : 421/421 places, 714/714 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 p1) (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 160 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 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 118 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 287 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 153 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
[2024-05-25 08:38:16] [INFO ] Invariant cache hit.
[2024-05-25 08:38:17] [INFO ] [Real]Absence check using 163 positive place invariants in 151 ms returned sat
[2024-05-25 08:38:17] [INFO ] [Real]Absence check using 163 positive and 1 generalized place invariants in 98 ms returned sat
[2024-05-25 08:38:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:38:18] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2024-05-25 08:38:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:38:19] [INFO ] [Nat]Absence check using 163 positive place invariants in 116 ms returned sat
[2024-05-25 08:38:19] [INFO ] [Nat]Absence check using 163 positive and 1 generalized place invariants in 63 ms returned sat
[2024-05-25 08:38:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:38:19] [INFO ] [Nat]Absence check using state equation in 683 ms returned sat
[2024-05-25 08:38:19] [INFO ] Computed and/alt/rep : 600/600/600 causal constraints (skipped 0 transitions) in 51 ms.
[2024-05-25 08:38:21] [INFO ] Added : 140 causal constraints over 28 iterations in 1693 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 753 reset in 2885 ms.
Product exploration explored 100000 steps with 732 reset in 2592 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 59 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:38:27] [INFO ] Redundant transitions in 81 ms returned []
[2024-05-25 08:38:27] [INFO ] Invariant cache hit.
[2024-05-25 08:38:28] [INFO ] Dead Transitions using invariants and state equation in 906 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1059 ms. Remains : 421/421 places, 714/714 transitions.
Built C files in :
/tmp/ltsmin8596971863568835661
[2024-05-25 08:38:28] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8596971863568835661
Running compilation step : cd /tmp/ltsmin8596971863568835661;'/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 2687 ms.
Running link step : cd /tmp/ltsmin8596971863568835661;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin8596971863568835661;'/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' '--hoa' '/tmp/stateBased4892662536696582084.hoa' '--buchi-type=spotba'
LTSmin run took 11204 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HexagonalGrid-PT-316-LTLFireability-00 finished in 44986 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(G(p0))&&F(p1))))'
Support contains 6 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 35 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:38:42] [INFO ] Invariant cache hit.
[2024-05-25 08:38:43] [INFO ] Implicit Places using invariants in 544 ms returned []
[2024-05-25 08:38:43] [INFO ] Invariant cache hit.
[2024-05-25 08:38:44] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1595 ms to find 0 implicit places.
[2024-05-25 08:38:44] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-25 08:38:44] [INFO ] Invariant cache hit.
[2024-05-25 08:38:45] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2441 ms. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s73 1) (GEQ s408 1) (GEQ s13 1) (GEQ s362 1)), p1:(AND (GEQ s123 1) (GEQ s142 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 20680 steps with 63 reset in 523 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-316-LTLFireability-01 finished in 3131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))||X(F((G(F(p2))||(!p3&&F(p2)))))))'
Support contains 10 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 11 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:38:45] [INFO ] Invariant cache hit.
[2024-05-25 08:38:46] [INFO ] Implicit Places using invariants in 538 ms returned []
[2024-05-25 08:38:46] [INFO ] Invariant cache hit.
[2024-05-25 08:38:47] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 1745 ms to find 0 implicit places.
[2024-05-25 08:38:47] [INFO ] Invariant cache hit.
[2024-05-25 08:38:48] [INFO ] Dead Transitions using invariants and state equation in 939 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2703 ms. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 369 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=2 dest: 1}, { cond=(AND p0 p3), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p2) (NOT p3))), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p3), acceptance={} source=3 dest: 1}, { cond=(AND p1 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s124 1) (GEQ s320 1)), p0:(AND (GEQ s118 1) (GEQ s315 1) (GEQ s120 1) (GEQ s301 1)), p3:(AND (GEQ s131 1) (GEQ s188 1)), p2:(AND (GEQ s116 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 390 reset in 2700 ms.
Product exploration explored 100000 steps with 404 reset in 2535 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) (NOT p3) (NOT p2)), (X (NOT p3)), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p1) p3))), (X (NOT p2)), (X (NOT (AND p1 p3))), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p1) (NOT p0) p3))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p3))))]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) p3))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (AND p1 (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 1354 ms. Reduced automaton from 7 states, 22 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p2)]
Finished random walk after 618 steps, including 0 resets, run visited all 1 properties in 33 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT p3)), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p1) p3))), (X (NOT p2)), (X (NOT (AND p1 p3))), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p1) (NOT p0) p3))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p3))))]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) p3))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (AND p1 (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F p2)]
Knowledge based reduction with 13 factoid took 1695 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p2)]
[2024-05-25 08:38:57] [INFO ] Invariant cache hit.
[2024-05-25 08:38:58] [INFO ] [Real]Absence check using 163 positive place invariants in 197 ms returned sat
[2024-05-25 08:38:58] [INFO ] [Real]Absence check using 163 positive and 1 generalized place invariants in 22 ms returned sat
[2024-05-25 08:38:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:38:59] [INFO ] [Real]Absence check using state equation in 824 ms returned sat
[2024-05-25 08:38:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:39:00] [INFO ] [Nat]Absence check using 163 positive place invariants in 143 ms returned sat
[2024-05-25 08:39:00] [INFO ] [Nat]Absence check using 163 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-25 08:39:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:39:00] [INFO ] [Nat]Absence check using state equation in 686 ms returned sat
[2024-05-25 08:39:00] [INFO ] Computed and/alt/rep : 600/600/600 causal constraints (skipped 0 transitions) in 73 ms.
[2024-05-25 08:39:02] [INFO ] Added : 140 causal constraints over 28 iterations in 1871 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 421 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 32 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:39:02] [INFO ] Invariant cache hit.
[2024-05-25 08:39:03] [INFO ] Implicit Places using invariants in 703 ms returned []
[2024-05-25 08:39:03] [INFO ] Invariant cache hit.
[2024-05-25 08:39:04] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 1846 ms to find 0 implicit places.
[2024-05-25 08:39:04] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-25 08:39:04] [INFO ] Invariant cache hit.
[2024-05-25 08:39:05] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2739 ms. Remains : 421/421 places, 714/714 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 : [(NOT p2), (X (NOT p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
Finished random walk after 74 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p2), (X (NOT p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
[2024-05-25 08:39:05] [INFO ] Invariant cache hit.
[2024-05-25 08:39:06] [INFO ] [Real]Absence check using 163 positive place invariants in 126 ms returned sat
[2024-05-25 08:39:06] [INFO ] [Real]Absence check using 163 positive and 1 generalized place invariants in 11 ms returned sat
[2024-05-25 08:39:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:39:07] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2024-05-25 08:39:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:39:07] [INFO ] [Nat]Absence check using 163 positive place invariants in 159 ms returned sat
[2024-05-25 08:39:07] [INFO ] [Nat]Absence check using 163 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-25 08:39:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:39:08] [INFO ] [Nat]Absence check using state equation in 772 ms returned sat
[2024-05-25 08:39:08] [INFO ] Computed and/alt/rep : 600/600/600 causal constraints (skipped 0 transitions) in 81 ms.
[2024-05-25 08:39:10] [INFO ] Added : 140 causal constraints over 28 iterations in 1902 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 52 ms :[(NOT p2)]
Product exploration explored 100000 steps with 378 reset in 2892 ms.
Product exploration explored 100000 steps with 384 reset in 2538 ms.
Built C files in :
/tmp/ltsmin4966269196444365550
[2024-05-25 08:39:16] [INFO ] Computing symmetric may disable matrix : 714 transitions.
[2024-05-25 08:39:16] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:39:16] [INFO ] Computing symmetric may enable matrix : 714 transitions.
[2024-05-25 08:39:16] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:39:16] [INFO ] Computing Do-Not-Accords matrix : 714 transitions.
[2024-05-25 08:39:16] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:39:16] [INFO ] Built C files in 150ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4966269196444365550
Running compilation step : cd /tmp/ltsmin4966269196444365550;'/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 2998 ms.
Running link step : cd /tmp/ltsmin4966269196444365550;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin4966269196444365550;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15192578731686279087.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 17 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:39:31] [INFO ] Invariant cache hit.
[2024-05-25 08:39:31] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-05-25 08:39:31] [INFO ] Invariant cache hit.
[2024-05-25 08:39:32] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 1666 ms to find 0 implicit places.
[2024-05-25 08:39:32] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-25 08:39:32] [INFO ] Invariant cache hit.
[2024-05-25 08:39:33] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2523 ms. Remains : 421/421 places, 714/714 transitions.
Built C files in :
/tmp/ltsmin6026232971110811921
[2024-05-25 08:39:33] [INFO ] Computing symmetric may disable matrix : 714 transitions.
[2024-05-25 08:39:33] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:39:33] [INFO ] Computing symmetric may enable matrix : 714 transitions.
[2024-05-25 08:39:33] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:39:33] [INFO ] Computing Do-Not-Accords matrix : 714 transitions.
[2024-05-25 08:39:33] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:39:33] [INFO ] Built C files in 136ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6026232971110811921
Running compilation step : cd /tmp/ltsmin6026232971110811921;'/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 2800 ms.
Running link step : cd /tmp/ltsmin6026232971110811921;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin6026232971110811921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9569278955069148233.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 08:39:48] [INFO ] Flatten gal took : 58 ms
[2024-05-25 08:39:48] [INFO ] Flatten gal took : 56 ms
[2024-05-25 08:39:48] [INFO ] Time to serialize gal into /tmp/LTL7621212978407651644.gal : 9 ms
[2024-05-25 08:39:49] [INFO ] Time to serialize properties into /tmp/LTL13089484568108440577.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/LTL7621212978407651644.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13044913790397060715.hoa' '-atoms' '/tmp/LTL13089484568108440577.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/LTL13089484568108440577.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13044913790397060715.hoa
Detected timeout of ITS tools.
[2024-05-25 08:40:04] [INFO ] Flatten gal took : 45 ms
[2024-05-25 08:40:04] [INFO ] Flatten gal took : 41 ms
[2024-05-25 08:40:04] [INFO ] Time to serialize gal into /tmp/LTL18099218331688102833.gal : 5 ms
[2024-05-25 08:40:04] [INFO ] Time to serialize properties into /tmp/LTL3733209492677457060.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/LTL18099218331688102833.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3733209492677457060.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 : !(((("(((pbl_2_2>=1)&&(po3_1_1>=1))&&((pbl_2_4>=1)&&(po2_2_3>=1)))")U(G("((pbl_3_4>=1)&&(po3_2_3>=1))")))||(X(F((G(F("((pbl_1_3>=1)&&(...247
Formula 0 simplified : (!"(((pbl_2_2>=1)&&(po3_1_1>=1))&&((pbl_2_4>=1)&&(po2_2_3>=1)))" R F!"((pbl_3_4>=1)&&(po3_2_3>=1))") & XG(FG!"((pbl_1_3>=1)&&(pi2_1_...232
Detected timeout of ITS tools.
[2024-05-25 08:40:19] [INFO ] Flatten gal took : 36 ms
[2024-05-25 08:40:19] [INFO ] Applying decomposition
[2024-05-25 08:40:19] [INFO ] Flatten gal took : 32 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/graph8366983657771965399.txt' '-o' '/tmp/graph8366983657771965399.bin' '-w' '/tmp/graph8366983657771965399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8366983657771965399.bin' '-l' '-1' '-v' '-w' '/tmp/graph8366983657771965399.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:40:19] [INFO ] Decomposing Gal with order
[2024-05-25 08:40:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:40:19] [INFO ] Removed a total of 912 redundant transitions.
[2024-05-25 08:40:19] [INFO ] Flatten gal took : 150 ms
[2024-05-25 08:40:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2024-05-25 08:40:19] [INFO ] Time to serialize gal into /tmp/LTL9684749936924620605.gal : 22 ms
[2024-05-25 08:40:19] [INFO ] Time to serialize properties into /tmp/LTL12727357522212862751.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/LTL9684749936924620605.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12727357522212862751.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 : !(((("(((i3.u4.pbl_2_2>=1)&&(i3.u141.po3_1_1>=1))&&((i18.u6.pbl_2_4>=1)&&(i18.u135.po2_2_3>=1)))")U(G("((i8.u10.pbl_3_4>=1)&&(i8.u144....338
Formula 0 simplified : (!"(((i3.u4.pbl_2_2>=1)&&(i3.u141.po3_1_1>=1))&&((i18.u6.pbl_2_4>=1)&&(i18.u135.po2_2_3>=1)))" R F!"((i8.u10.pbl_3_4>=1)&&(i8.u144.p...323
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11293659396948990317
[2024-05-25 08:40:34] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11293659396948990317
Running compilation step : cd /tmp/ltsmin11293659396948990317;'/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 1910 ms.
Running link step : cd /tmp/ltsmin11293659396948990317;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11293659396948990317;'/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) U []((LTLAPp1==true)))||X(<>(([](<>((LTLAPp2==true)))||((LTLAPp3==true)&&<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
LTSmin run took 1464 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HexagonalGrid-PT-316-LTLFireability-02 finished in 112454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 17 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:40:38] [INFO ] Invariant cache hit.
[2024-05-25 08:40:38] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-05-25 08:40:38] [INFO ] Invariant cache hit.
[2024-05-25 08:40:39] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
[2024-05-25 08:40:39] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-25 08:40:39] [INFO ] Invariant cache hit.
[2024-05-25 08:40:40] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1954 ms. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s118 1) (LT s299 1)), p1:(AND (GEQ s114 1) (GEQ s200 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 403 reset in 2603 ms.
Product exploration explored 100000 steps with 398 reset in 2752 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 (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 311 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 233 steps, including 0 resets, run visited all 2 properties in 17 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 2 factoid took 365 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-25 08:40:47] [INFO ] Invariant cache hit.
[2024-05-25 08:40:48] [INFO ] [Real]Absence check using 163 positive place invariants in 162 ms returned sat
[2024-05-25 08:40:48] [INFO ] [Real]Absence check using 163 positive and 1 generalized place invariants in 26 ms returned sat
[2024-05-25 08:40:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:40:48] [INFO ] [Real]Absence check using state equation in 766 ms returned sat
[2024-05-25 08:40:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:40:49] [INFO ] [Nat]Absence check using 163 positive place invariants in 146 ms returned sat
[2024-05-25 08:40:49] [INFO ] [Nat]Absence check using 163 positive and 1 generalized place invariants in 68 ms returned sat
[2024-05-25 08:40:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:40:50] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2024-05-25 08:40:50] [INFO ] Computed and/alt/rep : 600/600/600 causal constraints (skipped 0 transitions) in 39 ms.
[2024-05-25 08:40:51] [INFO ] Added : 137 causal constraints over 28 iterations in 1632 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 24 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:40:51] [INFO ] Invariant cache hit.
[2024-05-25 08:40:52] [INFO ] Implicit Places using invariants in 533 ms returned []
[2024-05-25 08:40:52] [INFO ] Invariant cache hit.
[2024-05-25 08:40:53] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1476 ms to find 0 implicit places.
[2024-05-25 08:40:53] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-25 08:40:53] [INFO ] Invariant cache hit.
[2024-05-25 08:40:54] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2215 ms. Remains : 421/421 places, 714/714 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 p0 (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 309 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 75 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 2 factoid took 326 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-25 08:40:55] [INFO ] Invariant cache hit.
[2024-05-25 08:40:56] [INFO ] [Real]Absence check using 163 positive place invariants in 155 ms returned sat
[2024-05-25 08:40:56] [INFO ] [Real]Absence check using 163 positive and 1 generalized place invariants in 26 ms returned sat
[2024-05-25 08:40:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:40:56] [INFO ] [Real]Absence check using state equation in 817 ms returned sat
[2024-05-25 08:40:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:40:57] [INFO ] [Nat]Absence check using 163 positive place invariants in 96 ms returned sat
[2024-05-25 08:40:57] [INFO ] [Nat]Absence check using 163 positive and 1 generalized place invariants in 44 ms returned sat
[2024-05-25 08:40:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:40:58] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2024-05-25 08:40:58] [INFO ] Computed and/alt/rep : 600/600/600 causal constraints (skipped 0 transitions) in 48 ms.
[2024-05-25 08:41:00] [INFO ] Added : 137 causal constraints over 28 iterations in 1920 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 398 reset in 2619 ms.
Product exploration explored 100000 steps with 391 reset in 2523 ms.
Built C files in :
/tmp/ltsmin15282822982543620166
[2024-05-25 08:41:05] [INFO ] Computing symmetric may disable matrix : 714 transitions.
[2024-05-25 08:41:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:41:05] [INFO ] Computing symmetric may enable matrix : 714 transitions.
[2024-05-25 08:41:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:41:05] [INFO ] Computing Do-Not-Accords matrix : 714 transitions.
[2024-05-25 08:41:05] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:41:05] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15282822982543620166
Running compilation step : cd /tmp/ltsmin15282822982543620166;'/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 2891 ms.
Running link step : cd /tmp/ltsmin15282822982543620166;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin15282822982543620166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8891589406726594891.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 14 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:41:20] [INFO ] Invariant cache hit.
[2024-05-25 08:41:20] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-05-25 08:41:20] [INFO ] Invariant cache hit.
[2024-05-25 08:41:22] [INFO ] Implicit Places using invariants and state equation in 1143 ms returned []
Implicit Place search using SMT with State Equation took 1647 ms to find 0 implicit places.
[2024-05-25 08:41:22] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-25 08:41:22] [INFO ] Invariant cache hit.
[2024-05-25 08:41:22] [INFO ] Dead Transitions using invariants and state equation in 816 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2492 ms. Remains : 421/421 places, 714/714 transitions.
Built C files in :
/tmp/ltsmin4426384074515772636
[2024-05-25 08:41:22] [INFO ] Computing symmetric may disable matrix : 714 transitions.
[2024-05-25 08:41:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:41:22] [INFO ] Computing symmetric may enable matrix : 714 transitions.
[2024-05-25 08:41:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:41:23] [INFO ] Computing Do-Not-Accords matrix : 714 transitions.
[2024-05-25 08:41:23] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:41:23] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4426384074515772636
Running compilation step : cd /tmp/ltsmin4426384074515772636;'/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 2850 ms.
Running link step : cd /tmp/ltsmin4426384074515772636;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin4426384074515772636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4144398090613316669.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 08:41:38] [INFO ] Flatten gal took : 30 ms
[2024-05-25 08:41:38] [INFO ] Flatten gal took : 29 ms
[2024-05-25 08:41:38] [INFO ] Time to serialize gal into /tmp/LTL10181927223101080145.gal : 9 ms
[2024-05-25 08:41:38] [INFO ] Time to serialize properties into /tmp/LTL3880120819863619608.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/LTL10181927223101080145.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6407686101619242674.hoa' '-atoms' '/tmp/LTL3880120819863619608.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/LTL3880120819863619608.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6407686101619242674.hoa
Detected timeout of ITS tools.
[2024-05-25 08:41:53] [INFO ] Flatten gal took : 29 ms
[2024-05-25 08:41:53] [INFO ] Flatten gal took : 27 ms
[2024-05-25 08:41:53] [INFO ] Time to serialize gal into /tmp/LTL12142395546680023798.gal : 5 ms
[2024-05-25 08:41:53] [INFO ] Time to serialize properties into /tmp/LTL2265798087076264509.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/LTL12142395546680023798.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2265798087076264509.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 : !((G((F("((pbl_2_2<1)||(po2_2_1<1))"))&&(F("((pbl_1_1>=1)&&(pi6_1_1>=1))")))))
Formula 0 simplified : F(G!"((pbl_2_2<1)||(po2_2_1<1))" | G!"((pbl_1_1>=1)&&(pi6_1_1>=1))")
Detected timeout of ITS tools.
[2024-05-25 08:42:08] [INFO ] Flatten gal took : 26 ms
[2024-05-25 08:42:08] [INFO ] Applying decomposition
[2024-05-25 08:42:08] [INFO ] Flatten gal took : 25 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/graph11938262570082757952.txt' '-o' '/tmp/graph11938262570082757952.bin' '-w' '/tmp/graph11938262570082757952.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11938262570082757952.bin' '-l' '-1' '-v' '-w' '/tmp/graph11938262570082757952.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:42:08] [INFO ] Decomposing Gal with order
[2024-05-25 08:42:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:42:08] [INFO ] Removed a total of 912 redundant transitions.
[2024-05-25 08:42:08] [INFO ] Flatten gal took : 57 ms
[2024-05-25 08:42:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-25 08:42:08] [INFO ] Time to serialize gal into /tmp/LTL10518288586011031465.gal : 6 ms
[2024-05-25 08:42:08] [INFO ] Time to serialize properties into /tmp/LTL11339256744910763016.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/LTL10518288586011031465.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11339256744910763016.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 : !((G((F("((i11.u5.pbl_2_2<1)||(i11.u102.po2_2_1<1))"))&&(F("((i12.u0.pbl_1_1>=1)&&(i12.u46.pi6_1_1>=1))")))))
Formula 0 simplified : F(G!"((i11.u5.pbl_2_2<1)||(i11.u102.po2_2_1<1))" | G!"((i12.u0.pbl_1_1>=1)&&(i12.u46.pi6_1_1>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15929127553842350396
[2024-05-25 08:42:23] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15929127553842350396
Running compilation step : cd /tmp/ltsmin15929127553842350396;'/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 1922 ms.
Running link step : cd /tmp/ltsmin15929127553842350396;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15929127553842350396;'/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))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 10368 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HexagonalGrid-PT-316-LTLFireability-03 finished in 117519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 18 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:42:35] [INFO ] Invariant cache hit.
[2024-05-25 08:42:36] [INFO ] Implicit Places using invariants in 479 ms returned []
[2024-05-25 08:42:36] [INFO ] Invariant cache hit.
[2024-05-25 08:42:37] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
[2024-05-25 08:42:37] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-25 08:42:37] [INFO ] Invariant cache hit.
[2024-05-25 08:42:38] [INFO ] Dead Transitions using invariants and state equation in 735 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2230 ms. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 49 ms :[p0]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s131 1) (GEQ s188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5 reset in 1926 ms.
Product exploration explored 100000 steps with 6 reset in 2087 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[p0]
Finished random walk after 209 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 196 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[p0]
Stuttering acceptance computed with spot in 49 ms :[p0]
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 12 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:42:42] [INFO ] Invariant cache hit.
[2024-05-25 08:42:43] [INFO ] Implicit Places using invariants in 505 ms returned []
[2024-05-25 08:42:43] [INFO ] Invariant cache hit.
[2024-05-25 08:42:44] [INFO ] Implicit Places using invariants and state equation in 1214 ms returned []
Implicit Place search using SMT with State Equation took 1728 ms to find 0 implicit places.
[2024-05-25 08:42:44] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-25 08:42:44] [INFO ] Invariant cache hit.
[2024-05-25 08:42:45] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2462 ms. Remains : 421/421 places, 714/714 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[p0]
Finished random walk after 122 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[p0]
Stuttering acceptance computed with spot in 54 ms :[p0]
Stuttering acceptance computed with spot in 49 ms :[p0]
Product exploration explored 100000 steps with 5 reset in 2092 ms.
Stack based approach found an accepted trace after 12732 steps with 0 reset with depth 12733 and stack size 12709 in 255 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property HexagonalGrid-PT-316-LTLFireability-04 finished in 12577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((p1 U (G(p2) U p3)))))'
Support contains 8 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 6 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:42:48] [INFO ] Invariant cache hit.
[2024-05-25 08:42:49] [INFO ] Implicit Places using invariants in 550 ms returned []
[2024-05-25 08:42:49] [INFO ] Invariant cache hit.
[2024-05-25 08:42:50] [INFO ] Implicit Places using invariants and state equation in 1171 ms returned []
Implicit Place search using SMT with State Equation took 1723 ms to find 0 implicit places.
[2024-05-25 08:42:50] [INFO ] Invariant cache hit.
[2024-05-25 08:42:50] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2428 ms. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 500 ms :[(NOT p3), (NOT p3), (NOT p3), true, (NOT p2), (NOT p3), (NOT p0), (AND (NOT p2) (NOT p0)), (AND p2 (NOT p3) (NOT p0) p1)]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 7}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s362 1)), p3:(AND (GEQ s122 1) (GEQ s303 1)), p1:(AND (GEQ s0 1) (GEQ s349 1)), p2:(AND (GEQ s129 1) (GEQ s295 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-316-LTLFireability-05 finished in 2957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 20 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:42:51] [INFO ] Invariant cache hit.
[2024-05-25 08:42:51] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-05-25 08:42:51] [INFO ] Invariant cache hit.
[2024-05-25 08:42:52] [INFO ] Implicit Places using invariants and state equation in 1035 ms returned []
Implicit Place search using SMT with State Equation took 1463 ms to find 0 implicit places.
[2024-05-25 08:42:52] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-25 08:42:52] [INFO ] Invariant cache hit.
[2024-05-25 08:42:53] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2320 ms. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s123 1) (LT s319 1)), p1:(OR (LT s127 1) (LT s293 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7 reset in 2139 ms.
Product exploration explored 100000 steps with 7 reset in 2152 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 (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 2 factoid took 574 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 1026 steps, including 0 resets, run visited all 4 properties in 60 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 694 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 19 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:42:59] [INFO ] Invariant cache hit.
[2024-05-25 08:43:00] [INFO ] Implicit Places using invariants in 684 ms returned []
[2024-05-25 08:43:00] [INFO ] Invariant cache hit.
[2024-05-25 08:43:01] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned []
Implicit Place search using SMT with State Equation took 1780 ms to find 0 implicit places.
[2024-05-25 08:43:01] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-25 08:43:01] [INFO ] Invariant cache hit.
[2024-05-25 08:43:02] [INFO ] Dead Transitions using invariants and state equation in 794 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2614 ms. Remains : 421/421 places, 714/714 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 2 factoid took 412 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 470 steps, including 0 resets, run visited all 4 properties in 35 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 706 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4 reset in 2312 ms.
Product exploration explored 100000 steps with 7 reset in 2014 ms.
Built C files in :
/tmp/ltsmin12051829299704706508
[2024-05-25 08:43:08] [INFO ] Computing symmetric may disable matrix : 714 transitions.
[2024-05-25 08:43:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:43:08] [INFO ] Computing symmetric may enable matrix : 714 transitions.
[2024-05-25 08:43:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:43:08] [INFO ] Computing Do-Not-Accords matrix : 714 transitions.
[2024-05-25 08:43:08] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:43:08] [INFO ] Built C files in 139ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12051829299704706508
Running compilation step : cd /tmp/ltsmin12051829299704706508;'/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/ltsmin12051829299704706508;'/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/ltsmin12051829299704706508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 13 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:43:11] [INFO ] Invariant cache hit.
[2024-05-25 08:43:11] [INFO ] Implicit Places using invariants in 473 ms returned []
[2024-05-25 08:43:11] [INFO ] Invariant cache hit.
[2024-05-25 08:43:12] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
[2024-05-25 08:43:12] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-25 08:43:12] [INFO ] Invariant cache hit.
[2024-05-25 08:43:13] [INFO ] Dead Transitions using invariants and state equation in 871 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2416 ms. Remains : 421/421 places, 714/714 transitions.
Built C files in :
/tmp/ltsmin812771240171517731
[2024-05-25 08:43:13] [INFO ] Computing symmetric may disable matrix : 714 transitions.
[2024-05-25 08:43:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:43:13] [INFO ] Computing symmetric may enable matrix : 714 transitions.
[2024-05-25 08:43:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:43:13] [INFO ] Computing Do-Not-Accords matrix : 714 transitions.
[2024-05-25 08:43:13] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:43:13] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin812771240171517731
Running compilation step : cd /tmp/ltsmin812771240171517731;'/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 2993 ms.
Running link step : cd /tmp/ltsmin812771240171517731;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin812771240171517731;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5137291638685639184.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 08:43:28] [INFO ] Flatten gal took : 26 ms
[2024-05-25 08:43:28] [INFO ] Flatten gal took : 25 ms
[2024-05-25 08:43:28] [INFO ] Time to serialize gal into /tmp/LTL7253922865998546013.gal : 6 ms
[2024-05-25 08:43:28] [INFO ] Time to serialize properties into /tmp/LTL13761497735111492083.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/LTL7253922865998546013.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18160373802578358213.hoa' '-atoms' '/tmp/LTL13761497735111492083.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/LTL13761497735111492083.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18160373802578358213.hoa
Detected timeout of ITS tools.
[2024-05-25 08:43:43] [INFO ] Flatten gal took : 24 ms
[2024-05-25 08:43:44] [INFO ] Flatten gal took : 30 ms
[2024-05-25 08:43:44] [INFO ] Time to serialize gal into /tmp/LTL7486273542136193565.gal : 5 ms
[2024-05-25 08:43:44] [INFO ] Time to serialize properties into /tmp/LTL10992422615482802118.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/LTL7486273542136193565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10992422615482802118.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((pbl_3_3<1)||(po3_2_2<1))"))||(G("((pbl_4_2<1)||(po1_5_1<1))")))))
Formula 0 simplified : G(F!"((pbl_3_3<1)||(po3_2_2<1))" & F!"((pbl_4_2<1)||(po1_5_1<1))")
Detected timeout of ITS tools.
[2024-05-25 08:43:59] [INFO ] Flatten gal took : 25 ms
[2024-05-25 08:43:59] [INFO ] Applying decomposition
[2024-05-25 08:43:59] [INFO ] Flatten gal took : 24 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/graph3472727538353533986.txt' '-o' '/tmp/graph3472727538353533986.bin' '-w' '/tmp/graph3472727538353533986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3472727538353533986.bin' '-l' '-1' '-v' '-w' '/tmp/graph3472727538353533986.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:43:59] [INFO ] Decomposing Gal with order
[2024-05-25 08:43:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:43:59] [INFO ] Removed a total of 912 redundant transitions.
[2024-05-25 08:43:59] [INFO ] Flatten gal took : 55 ms
[2024-05-25 08:43:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-25 08:43:59] [INFO ] Time to serialize gal into /tmp/LTL17311343804906144868.gal : 6 ms
[2024-05-25 08:43:59] [INFO ] Time to serialize properties into /tmp/LTL16425978640569414738.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/LTL17311343804906144868.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16425978640569414738.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G("((i15.u11.pbl_3_3<1)||(i15.u111.po3_2_2<1))"))||(G("((i11.u15.pbl_4_2<1)||(i11.u101.po1_5_1<1))")))))
Formula 0 simplified : G(F!"((i15.u11.pbl_3_3<1)||(i15.u111.po3_2_2<1))" & F!"((i11.u15.pbl_4_2<1)||(i11.u101.po1_5_1<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6695454181280050064
[2024-05-25 08:44:14] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6695454181280050064
Running compilation step : cd /tmp/ltsmin6695454181280050064;'/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 1833 ms.
Running link step : cd /tmp/ltsmin6695454181280050064;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6695454181280050064;'/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))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 3321 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HexagonalGrid-PT-316-LTLFireability-07 finished in 88149 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)&&(p1||G(p2)))))'
Support contains 8 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 5 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:44:19] [INFO ] Invariant cache hit.
[2024-05-25 08:44:20] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-05-25 08:44:20] [INFO ] Invariant cache hit.
[2024-05-25 08:44:21] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 1622 ms to find 0 implicit places.
[2024-05-25 08:44:21] [INFO ] Invariant cache hit.
[2024-05-25 08:44:22] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2445 ms. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (OR (AND (GEQ s85 1) (GEQ s232 1)) (AND (GEQ s70 1) (GEQ s221 1))) (GEQ s85 1) (GEQ s232 1)), p1:(AND (GEQ s122 1) (GEQ s318 1)), p2:(AND (GEQ s34...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 42 steps with 0 reset in 1 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-316-LTLFireability-08 finished in 2635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G(p1)))))'
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 5 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:44:22] [INFO ] Invariant cache hit.
[2024-05-25 08:44:22] [INFO ] Implicit Places using invariants in 687 ms returned []
[2024-05-25 08:44:22] [INFO ] Invariant cache hit.
[2024-05-25 08:44:24] [INFO ] Implicit Places using invariants and state equation in 1213 ms returned []
Implicit Place search using SMT with State Equation took 1901 ms to find 0 implicit places.
[2024-05-25 08:44:24] [INFO ] Invariant cache hit.
[2024-05-25 08:44:24] [INFO ] Dead Transitions using invariants and state equation in 864 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2771 ms. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s126 1) (GEQ s164 1)), p1:(OR (LT s122 1) (LT s289 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 756 reset in 2745 ms.
Product exploration explored 100000 steps with 739 reset in 2694 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)]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 169 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 54 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 261 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 8 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:44:31] [INFO ] Invariant cache hit.
[2024-05-25 08:44:32] [INFO ] Implicit Places using invariants in 613 ms returned []
[2024-05-25 08:44:32] [INFO ] Invariant cache hit.
[2024-05-25 08:44:33] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1622 ms to find 0 implicit places.
[2024-05-25 08:44:33] [INFO ] Invariant cache hit.
[2024-05-25 08:44:34] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2411 ms. Remains : 421/421 places, 714/714 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) p1)]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 192 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 190 steps, including 0 resets, run visited all 3 properties in 14 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 339 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 730 reset in 3042 ms.
Product exploration explored 100000 steps with 797 reset in 2658 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 11 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:44:41] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-25 08:44:41] [INFO ] Invariant cache hit.
[2024-05-25 08:44:42] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 780 ms. Remains : 421/421 places, 714/714 transitions.
Built C files in :
/tmp/ltsmin2476239859208162735
[2024-05-25 08:44:42] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2476239859208162735
Running compilation step : cd /tmp/ltsmin2476239859208162735;'/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 1898 ms.
Running link step : cd /tmp/ltsmin2476239859208162735;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2476239859208162735;'/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' '--hoa' '/tmp/stateBased229909225946307939.hoa' '--buchi-type=spotba'
LTSmin run took 11078 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HexagonalGrid-PT-316-LTLFireability-09 finished in 33132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 5 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:44:55] [INFO ] Invariant cache hit.
[2024-05-25 08:44:56] [INFO ] Implicit Places using invariants in 644 ms returned []
[2024-05-25 08:44:56] [INFO ] Invariant cache hit.
[2024-05-25 08:44:56] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1522 ms to find 0 implicit places.
[2024-05-25 08:44:56] [INFO ] Invariant cache hit.
[2024-05-25 08:44:57] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2303 ms. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s130 1) (GEQ s199 1)), p0:(OR (LT s130 1) (LT s199 1) (AND (GEQ s121 1) (GEQ s190 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 232 steps with 0 reset in 12 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-316-LTLFireability-11 finished in 2500 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 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 19 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:44:57] [INFO ] Invariant cache hit.
[2024-05-25 08:44:58] [INFO ] Implicit Places using invariants in 681 ms returned []
[2024-05-25 08:44:58] [INFO ] Invariant cache hit.
[2024-05-25 08:44:59] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
[2024-05-25 08:44:59] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-25 08:44:59] [INFO ] Invariant cache hit.
[2024-05-25 08:45:00] [INFO ] Dead Transitions using invariants and state equation in 841 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2584 ms. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-13 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 (GEQ s120 1) (GEQ s317 1) (OR (LT s67 1) (LT s219 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9396 steps with 0 reset in 163 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-316-LTLFireability-13 finished in 2804 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(F(p1))))))'
Support contains 6 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 5 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:45:00] [INFO ] Invariant cache hit.
[2024-05-25 08:45:01] [INFO ] Implicit Places using invariants in 610 ms returned []
[2024-05-25 08:45:01] [INFO ] Invariant cache hit.
[2024-05-25 08:45:02] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1598 ms to find 0 implicit places.
[2024-05-25 08:45:02] [INFO ] Invariant cache hit.
[2024-05-25 08:45:03] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2376 ms. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HexagonalGrid-PT-316-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (GEQ s32 1) (GEQ s381 1) (OR (LT s116 1) (LT s282 1))), p0:(OR (LT s115 1) (LT s134 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 12944 reset in 2413 ms.
Product exploration explored 100000 steps with 12761 reset in 2773 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 p1 p0), (X p0), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 54 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 251 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 421 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 10 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:45:09] [INFO ] Invariant cache hit.
[2024-05-25 08:45:10] [INFO ] Implicit Places using invariants in 725 ms returned []
[2024-05-25 08:45:10] [INFO ] Invariant cache hit.
[2024-05-25 08:45:10] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1702 ms to find 0 implicit places.
[2024-05-25 08:45:10] [INFO ] Invariant cache hit.
[2024-05-25 08:45:11] [INFO ] Dead Transitions using invariants and state equation in 915 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2629 ms. Remains : 421/421 places, 714/714 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]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 11414 reset in 2251 ms.
Product exploration explored 100000 steps with 11823 reset in 2439 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 10 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:45:17] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-25 08:45:17] [INFO ] Invariant cache hit.
[2024-05-25 08:45:18] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 692 ms. Remains : 421/421 places, 714/714 transitions.
Built C files in :
/tmp/ltsmin5374501153852122222
[2024-05-25 08:45:18] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5374501153852122222
Running compilation step : cd /tmp/ltsmin5374501153852122222;'/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 2030 ms.
Running link step : cd /tmp/ltsmin5374501153852122222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin5374501153852122222;'/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' '--hoa' '/tmp/stateBased2791456424545677977.hoa' '--buchi-type=spotba'
LTSmin run took 12431 ms.
FORMULA HexagonalGrid-PT-316-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HexagonalGrid-PT-316-LTLFireability-14 finished in 32396 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 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 714/714 transitions.
Applied a total of 0 rules in 5 ms. Remains 421 /421 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2024-05-25 08:45:33] [INFO ] Invariant cache hit.
[2024-05-25 08:45:33] [INFO ] Implicit Places using invariants in 609 ms returned []
[2024-05-25 08:45:33] [INFO ] Invariant cache hit.
[2024-05-25 08:45:34] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1626 ms to find 0 implicit places.
[2024-05-25 08:45:34] [INFO ] Invariant cache hit.
[2024-05-25 08:45:35] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2099 ms. Remains : 421/421 places, 714/714 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-316-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:(OR (LT s132 1) (LT s170 1) (LT s131 1) (LT s169 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 33333 reset in 2012 ms.
Product exploration explored 100000 steps with 33333 reset in 2236 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 26 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HexagonalGrid-PT-316-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HexagonalGrid-PT-316-LTLFireability-15 finished in 6625 ms.
All properties solved by simple procedures.
Total runtime 467596 ms.

BK_STOP 1716626741015

--------------------
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="HexagonalGrid-PT-316"
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 HexagonalGrid-PT-316, 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 r219-smll-171649597700018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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