Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008000500.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is GPUForwardProgress-PT-32b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008000500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 160K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748978550954

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-32b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 19:22:33] [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]
[2025-06-03 19:22:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 19:22:34] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2025-06-03 19:22:34] [INFO ] Transformed 644 places.
[2025-06-03 19:22:34] [INFO ] Transformed 677 transitions.
[2025-06-03 19:22:34] [INFO ] Found NUPN structural information;
[2025-06-03 19:22:34] [INFO ] Parsed PT model containing 644 places and 677 transitions and 1677 arcs in 498 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 644/644 places, 677/677 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 579 transition count 612
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 579 transition count 612
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 158 place count 551 transition count 584
Iterating global reduction 0 with 28 rules applied. Total rules applied 186 place count 551 transition count 584
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 211 place count 551 transition count 559
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 212 place count 550 transition count 558
Iterating global reduction 1 with 1 rules applied. Total rules applied 213 place count 550 transition count 558
Applied a total of 213 rules in 235 ms. Remains 550 /644 variables (removed 94) and now considering 558/677 (removed 119) transitions.
// Phase 1: matrix 558 rows 550 cols
[2025-06-03 19:22:34] [INFO ] Computed 34 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:22:35] [INFO ] Implicit Places using invariants in 531 ms returned []
[2025-06-03 19:22:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:22:36] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 1695 ms to find 0 implicit places.
Running 557 sub problems to find dead transitions.
[2025-06-03 19:22:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/549 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/549 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (OVERLAPS) 558/1107 variables, 549/583 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1107/1108 variables, and 583 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30063 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 549/550 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 557 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/549 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/549 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (OVERLAPS) 558/1107 variables, 549/583 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1107 variables, 557/1140 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1107/1108 variables, and 1140 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30046 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 549/550 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60569ms problems are : Problem set: 0 solved, 557 unsolved
Search for dead transitions found 0 dead transitions in 60604ms
Starting structural reductions in LTL mode, iteration 1 : 550/644 places, 558/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62576 ms. Remains : 550/644 places, 558/677 transitions.
Support contains 66 out of 550 places after structural reductions.
[2025-06-03 19:23:37] [INFO ] Flatten gal took : 142 ms
[2025-06-03 19:23:37] [INFO ] Flatten gal took : 72 ms
[2025-06-03 19:23:38] [INFO ] Input system was already deterministic with 558 transitions.
RANDOM walk for 40000 steps (142 resets) in 2852 ms. (14 steps per ms) remains 6/33 properties
BEST_FIRST walk for 40004 steps (16 resets) in 355 ms. (112 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (15 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (15 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 192 ms. (207 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (13 resets) in 101 ms. (392 steps per ms) remains 4/6 properties
[2025-06-03 19:23:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 501/538 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 11/549 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 558/1107 variables, 549/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1107 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1108 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1108 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1108 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1108/1108 variables, and 584 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2021 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 501/538 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 11/549 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 558/1107 variables, 549/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1107 variables, 4/587 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1107 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1108 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1108 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1108 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1108/1108 variables, and 588 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2418 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4454ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 4780 ms.
Support contains 36 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 558/558 transitions.
Graph (trivial) has 455 edges and 550 vertex of which 6 / 550 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 267 transitions
Trivial Post-agglo rules discarded 267 transitions
Performed 267 trivial Post agglomeration. Transition count delta: 267
Iterating post reduction 0 with 267 rules applied. Total rules applied 268 place count 545 transition count 284
Reduce places removed 267 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 273 rules applied. Total rules applied 541 place count 278 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 542 place count 277 transition count 278
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 542 place count 277 transition count 211
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 676 place count 210 transition count 211
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 677 place count 209 transition count 210
Iterating global reduction 3 with 1 rules applied. Total rules applied 678 place count 209 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 678 place count 209 transition count 209
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 680 place count 208 transition count 209
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 874 place count 111 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 875 place count 111 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 877 place count 110 transition count 110
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 907 place count 110 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 911 place count 108 transition count 80
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 912 place count 108 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 914 place count 108 transition count 77
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 916 place count 108 transition count 75
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 918 place count 106 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 919 place count 105 transition count 74
Applied a total of 919 rules in 182 ms. Remains 105 /550 variables (removed 445) and now considering 74/558 (removed 484) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 105/550 places, 74/558 transitions.
RANDOM walk for 40000 steps (2500 resets) in 722 ms. (55 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (535 resets) in 304 ms. (131 steps per ms) remains 1/1 properties
// Phase 1: matrix 74 rows 105 cols
[2025-06-03 19:23:48] [INFO ] Computed 34 invariants in 4 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 70/104 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/105 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 74/179 variables, 105/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 70/104 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/105 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 74/179 variables, 105/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/179 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 367 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 579ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 34 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 74/74 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 105 transition count 72
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 103 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 70
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 101 transition count 67
Applied a total of 11 rules in 15 ms. Remains 101 /105 variables (removed 4) and now considering 67/74 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 101/105 places, 67/74 transitions.
RANDOM walk for 40000 steps (2715 resets) in 312 ms. (127 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (568 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1741 steps, run visited all 1 properties in 20 ms. (steps per millisecond=87 )
Probabilistic random walk after 1741 steps, saw 1617 distinct states, run finished after 27 ms. (steps per millisecond=64 ) properties seen :1
FORMULA GPUForwardProgress-PT-32b-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 100 stabilizing places and 100 stable transitions
Graph (complete) has 857 edges and 550 vertex of which 513 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.31 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(p1))||(G(!p2) U X(X(p0))))))'
Support contains 36 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 558/558 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 542 transition count 550
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 542 transition count 550
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 542 transition count 548
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 537 transition count 543
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 537 transition count 543
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 33 place count 537 transition count 538
Applied a total of 33 rules in 123 ms. Remains 537 /550 variables (removed 13) and now considering 538/558 (removed 20) transitions.
// Phase 1: matrix 538 rows 537 cols
[2025-06-03 19:23:50] [INFO ] Computed 34 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:23:51] [INFO ] Implicit Places using invariants in 277 ms returned []
[2025-06-03 19:23:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:23:51] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1227 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2025-06-03 19:23:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1074 variables, 536/570 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1074/1075 variables, and 570 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 536/537 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1074 variables, 536/570 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1074 variables, 537/1107 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1074/1075 variables, and 1107 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 536/537 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60231ms
Starting structural reductions in LTL mode, iteration 1 : 537/550 places, 538/558 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61588 ms. Remains : 537/550 places, 538/558 transitions.
Stuttering acceptance computed with spot in 1099 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0)), p2, (NOT p1), (AND p2 p0 (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-00
Product exploration explored 100000 steps with 24910 reset in 676 ms.
Product exploration explored 100000 steps with 24994 reset in 441 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 837 edges and 537 vertex of which 500 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.17 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Detected a total of 99/537 stabilizing places and 99/538 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 338 ms. Reduced automaton from 15 states, 30 edges and 3 AP (stutter sensitive) to 15 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 606 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0)), p2, (NOT p1), (AND p2 p0 (NOT p1))]
RANDOM walk for 40000 steps (146 resets) in 816 ms. (48 steps per ms) remains 6/15 properties
BEST_FIRST walk for 40004 steps (15 resets) in 402 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 608 ms. (65 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (15 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (18 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
[2025-06-03 19:24:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 489/525 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 11/536 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 538/1074 variables, 536/570 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1074 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf8 is UNSAT
Problem apf13 is UNSAT
At refinement iteration 8 (OVERLAPS) 1/1075 variables, 1/571 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1075 variables, 0/571 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1075 variables, 0/571 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1075/1075 variables, and 571 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1947 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 489/525 variables, 32/33 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 11/536 variables, 1/34 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 538/1074 variables, 536/570 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1074 variables, 4/574 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1074 variables, 0/574 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1075 variables, 1/575 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1075 variables, 0/575 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1075 variables, 0/575 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1075/1075 variables, and 575 constraints, problems are : Problem set: 2 solved, 4 unsolved in 3429 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5411ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1580 ms.
Support contains 36 out of 537 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 537/537 places, 538/538 transitions.
Graph (trivial) has 437 edges and 537 vertex of which 6 / 537 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 257 transitions
Trivial Post-agglo rules discarded 257 transitions
Performed 257 trivial Post agglomeration. Transition count delta: 257
Iterating post reduction 0 with 257 rules applied. Total rules applied 258 place count 532 transition count 274
Reduce places removed 257 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 258 rules applied. Total rules applied 516 place count 275 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 517 place count 274 transition count 273
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 517 place count 274 transition count 206
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 651 place count 207 transition count 206
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 652 place count 206 transition count 205
Iterating global reduction 3 with 1 rules applied. Total rules applied 653 place count 206 transition count 205
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 653 place count 206 transition count 204
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 655 place count 205 transition count 204
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 847 place count 109 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 848 place count 109 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 850 place count 108 transition count 106
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 881 place count 108 transition count 75
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 883 place count 108 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 885 place count 106 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 886 place count 105 transition count 72
Applied a total of 886 rules in 59 ms. Remains 105 /537 variables (removed 432) and now considering 72/538 (removed 466) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 105/537 places, 72/538 transitions.
RANDOM walk for 40000 steps (2292 resets) in 289 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (563 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (588 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (577 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (576 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 1776 steps, run visited all 4 properties in 37 ms. (steps per millisecond=48 )
Probabilistic random walk after 1776 steps, saw 1585 distinct states, run finished after 37 ms. (steps per millisecond=48 ) properties seen :4
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 (NOT p2) p1)), (G (OR p0 (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 p2))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 23 factoid took 1084 ms. Reduced automaton from 15 states, 30 edges and 3 AP (stutter sensitive) to 14 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 733 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), p2, (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 723 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), p2, (NOT p1), (AND (NOT p1) p2)]
Support contains 36 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 538/538 transitions.
Applied a total of 0 rules in 21 ms. Remains 537 /537 variables (removed 0) and now considering 538/538 (removed 0) transitions.
[2025-06-03 19:25:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:25:06] [INFO ] Implicit Places using invariants in 297 ms returned []
[2025-06-03 19:25:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:25:07] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1494 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2025-06-03 19:25:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 537 unsolved
SMT process timed out in 30163ms, After SMT, problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 30166ms
Finished structural reductions in LTL mode , in 1 iterations and 31684 ms. Remains : 537/537 places, 538/538 transitions.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 837 edges and 537 vertex of which 500 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.9 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Detected a total of 99/537 stabilizing places and 99/538 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 368 ms. Reduced automaton from 14 states, 24 edges and 3 AP (stutter sensitive) to 14 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 724 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), p2, (NOT p1), (AND (NOT p1) p2)]
RANDOM walk for 40000 steps (143 resets) in 204 ms. (195 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (16 resets) in 136 ms. (292 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (15 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
[2025-06-03 19:25:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 490/525 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 11/536 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 538/1074 variables, 536/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1074 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1075 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1075 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1075 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1075/1075 variables, and 571 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1365 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 490/525 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 11/536 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 538/1074 variables, 536/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1074 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1074 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/1075 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1075 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1075 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1075/1075 variables, and 573 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2094 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3481ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1127 ms.
Support contains 35 out of 537 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 537/537 places, 538/538 transitions.
Graph (trivial) has 437 edges and 537 vertex of which 6 / 537 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 257 transitions
Trivial Post-agglo rules discarded 257 transitions
Performed 257 trivial Post agglomeration. Transition count delta: 257
Iterating post reduction 0 with 257 rules applied. Total rules applied 258 place count 532 transition count 274
Reduce places removed 257 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 258 rules applied. Total rules applied 516 place count 275 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 517 place count 274 transition count 273
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 517 place count 274 transition count 206
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 651 place count 207 transition count 206
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 652 place count 206 transition count 205
Iterating global reduction 3 with 1 rules applied. Total rules applied 653 place count 206 transition count 205
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 653 place count 206 transition count 204
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 655 place count 205 transition count 204
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 851 place count 107 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 852 place count 107 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 854 place count 106 transition count 104
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 885 place count 106 transition count 73
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 887 place count 106 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 889 place count 104 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 890 place count 103 transition count 70
Applied a total of 890 rules in 58 ms. Remains 103 /537 variables (removed 434) and now considering 70/538 (removed 468) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 103/537 places, 70/538 transitions.
RANDOM walk for 40000 steps (2458 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (539 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (544 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1870 steps, run visited all 2 properties in 23 ms. (steps per millisecond=81 )
Probabilistic random walk after 1870 steps, saw 1681 distinct states, run finished after 23 ms. (steps per millisecond=81 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 13 factoid took 941 ms. Reduced automaton from 14 states, 24 edges and 3 AP (stutter sensitive) to 14 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 720 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), p2, (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 738 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), p2, (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 707 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), p2, (NOT p1), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 25048 reset in 270 ms.
Product exploration explored 100000 steps with 25001 reset in 307 ms.
Applying partial POR strategy [false, false, false, false, true, true, false, false, true, false, false, true, true, true]
Stuttering acceptance computed with spot in 719 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), p2, (NOT p1), (AND (NOT p1) p2)]
Support contains 36 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 538/538 transitions.
Graph (trivial) has 437 edges and 537 vertex of which 6 / 537 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 258 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 258 rules applied. Total rules applied 259 place count 532 transition count 532
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 33 Pre rules applied. Total rules applied 259 place count 532 transition count 534
Deduced a syphon composed of 291 places in 1 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 292 place count 532 transition count 534
Discarding 158 places :
Symmetric choice reduction at 1 with 158 rule applications. Total rules 450 place count 374 transition count 376
Deduced a syphon composed of 133 places in 1 ms
Iterating global reduction 1 with 158 rules applied. Total rules applied 608 place count 374 transition count 376
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 232 places in 0 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 707 place count 374 transition count 376
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 709 place count 374 transition count 374
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 779 place count 304 transition count 304
Deduced a syphon composed of 162 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 849 place count 304 transition count 304
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 850 place count 304 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 851 place count 303 transition count 303
Deduced a syphon composed of 162 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 852 place count 303 transition count 303
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 194 places in 0 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 884 place count 303 transition count 398
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 916 place count 271 transition count 334
Deduced a syphon composed of 162 places in 1 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 948 place count 271 transition count 334
Deduced a syphon composed of 162 places in 0 ms
Applied a total of 948 rules in 236 ms. Remains 271 /537 variables (removed 266) and now considering 334/538 (removed 204) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:25:49] [INFO ] Redundant transitions in 42 ms returned []
Running 333 sub problems to find dead transitions.
[2025-06-03 19:25:49] [INFO ] Flow matrix only has 304 transitions (discarded 30 similar events)
// Phase 1: matrix 304 rows 271 cols
[2025-06-03 19:25:49] [INFO ] Computed 34 invariants in 8 ms
[2025-06-03 19:25:49] [INFO ] State equation strengthened by 129 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
At refinement iteration 2 (OVERLAPS) 303/573 variables, 270/304 constraints. Problems are: Problem set: 226 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/573 variables, 128/432 constraints. Problems are: Problem set: 226 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 0/432 constraints. Problems are: Problem set: 226 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 1/574 variables, 1/433 constraints. Problems are: Problem set: 226 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/433 constraints. Problems are: Problem set: 226 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 1/575 variables, 1/434 constraints. Problems are: Problem set: 226 solved, 107 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 575/575 variables, and 434 constraints, problems are : Problem set: 226 solved, 107 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 271/271 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 226 solved, 107 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 226 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 226 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 162/270 variables, 33/34 constraints. Problems are: Problem set: 226 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/34 constraints. Problems are: Problem set: 226 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 303/573 variables, 270/304 constraints. Problems are: Problem set: 226 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 128/432 constraints. Problems are: Problem set: 226 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 107/539 constraints. Problems are: Problem set: 226 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/539 constraints. Problems are: Problem set: 226 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 1/574 variables, 1/540 constraints. Problems are: Problem set: 226 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/540 constraints. Problems are: Problem set: 226 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 1/575 variables, 1/541 constraints. Problems are: Problem set: 226 solved, 107 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 575/575 variables, and 541 constraints, problems are : Problem set: 226 solved, 107 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 271/271 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 107/333 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60493ms problems are : Problem set: 226 solved, 107 unsolved
Search for dead transitions found 226 dead transitions in 60496ms
Found 226 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 226 transitions
Dead transitions reduction (with SMT) removed 226 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 271/537 places, 108/538 transitions.
Graph (complete) has 471 edges and 271 vertex of which 109 are kept as prefixes of interest. Removing 162 places using SCC suffix rule.1 ms
Discarding 162 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 109 /271 variables (removed 162) and now considering 108/108 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/537 places, 108/538 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60805 ms. Remains : 109/537 places, 108/538 transitions.
Built C files in :
/tmp/ltsmin6911850260686035916
[2025-06-03 19:26:49] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6911850260686035916
Running compilation step : cd /tmp/ltsmin6911850260686035916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1672 ms.
Running link step : cd /tmp/ltsmin6911850260686035916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin6911850260686035916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11381522957406355685.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 36 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 538/538 transitions.
Applied a total of 0 rules in 11 ms. Remains 537 /537 variables (removed 0) and now considering 538/538 (removed 0) transitions.
// Phase 1: matrix 538 rows 537 cols
[2025-06-03 19:27:04] [INFO ] Computed 34 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:27:05] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-03 19:27:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:27:06] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2025-06-03 19:27:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1074 variables, 536/570 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1074/1075 variables, and 570 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 536/537 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1074 variables, 536/570 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1074 variables, 537/1107 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1074/1075 variables, and 1107 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 536/537 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60212ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Finished structural reductions in LTL mode , in 1 iterations and 61382 ms. Remains : 537/537 places, 538/538 transitions.
Built C files in :
/tmp/ltsmin8483833389217144551
[2025-06-03 19:28:06] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8483833389217144551
Running compilation step : cd /tmp/ltsmin8483833389217144551;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1709 ms.
Running link step : cd /tmp/ltsmin8483833389217144551;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin8483833389217144551;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14772565682661970893.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 19:28:21] [INFO ] Flatten gal took : 55 ms
[2025-06-03 19:28:21] [INFO ] Flatten gal took : 59 ms
[2025-06-03 19:28:21] [INFO ] Time to serialize gal into /tmp/LTL7668191465954327260.gal : 15 ms
[2025-06-03 19:28:21] [INFO ] Time to serialize properties into /tmp/LTL15328804980760682013.prop : 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7668191465954327260.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16507463285642871341.hoa' '-atoms' '/tmp/LTL15328804980760682013.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15328804980760682013.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16507463285642871341.hoa
Detected timeout of ITS tools.
[2025-06-03 19:28:36] [INFO ] Flatten gal took : 30 ms
[2025-06-03 19:28:36] [INFO ] Flatten gal took : 26 ms
[2025-06-03 19:28:36] [INFO ] Time to serialize gal into /tmp/LTL14864184818599687953.gal : 8 ms
[2025-06-03 19:28:36] [INFO ] Time to serialize properties into /tmp/LTL11020358965591373436.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14864184818599687953.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11020358965591373436.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((("(p28!=1)")U(X("(p210==1)")))||((G(!("(((((((p37==1)&&(p55==1))&&((p73==1)&&(p91==1)))&&(((p109==1)&&(p127==1))&&((p145==1)&&(p...527
Formula 0 simplified : F((!"(p28!=1)" R X!"(p210==1)") & (F"(((((((p37==1)&&(p55==1))&&((p73==1)&&(p91==1)))&&(((p109==1)&&(p127==1))&&((p145==1)&&(p163==1...513
Detected timeout of ITS tools.
[2025-06-03 19:28:51] [INFO ] Flatten gal took : 26 ms
[2025-06-03 19:28:51] [INFO ] Applying decomposition
[2025-06-03 19:28:51] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17467203059372829159.txt' '-o' '/tmp/graph17467203059372829159.bin' '-w' '/tmp/graph17467203059372829159.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17467203059372829159.bin' '-l' '-1' '-v' '-w' '/tmp/graph17467203059372829159.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:28:52] [INFO ] Decomposing Gal with order
[2025-06-03 19:28:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:28:52] [INFO ] Removed a total of 161 redundant transitions.
[2025-06-03 19:28:52] [INFO ] Flatten gal took : 122 ms
[2025-06-03 19:28:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2025-06-03 19:28:52] [INFO ] Time to serialize gal into /tmp/LTL3577266498875176346.gal : 15 ms
[2025-06-03 19:28:52] [INFO ] Time to serialize properties into /tmp/LTL14197184684542898095.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3577266498875176346.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14197184684542898095.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((("(i1.i1.i1.u12.p28!=1)")U(X("(i11.u78.p210==1)")))||((G(!("(((((((i3.u16.p37==1)&&(i4.u23.p55==1))&&((i5.u31.p73==1)&&(i6.u36.p...851
Formula 0 simplified : F((!"(i1.i1.i1.u12.p28!=1)" R X!"(i11.u78.p210==1)") & (F"(((((((i3.u16.p37==1)&&(i4.u23.p55==1))&&((i5.u31.p73==1)&&(i6.u36.p91==1)...837
Reverse transition relation is NOT exact ! Due to transitions t492, i0.i1.t121, i0.i1.i1.u173.t111, i2.t415, i2.t406, i3.t487, i3.u20.t477, i4.t471, i4.t46...951
Computing Next relation with stutter on 3.70604e+15 deadlock states
Detected timeout of ITS tools.
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-00 finished in 316942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||G((F(p1)&&F(p2)))||(p3&&F((p2&&F(p1))))))))'
Support contains 3 out of 550 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 : 550/550 places, 558/558 transitions.
Graph (trivial) has 453 edges and 550 vertex of which 6 / 550 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 851 edges and 545 vertex of which 508 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.2 ms
Discarding 37 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 264 transitions
Trivial Post-agglo rules discarded 264 transitions
Performed 264 trivial Post agglomeration. Transition count delta: 264
Iterating post reduction 0 with 264 rules applied. Total rules applied 266 place count 507 transition count 284
Reduce places removed 264 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 271 rules applied. Total rules applied 537 place count 243 transition count 277
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 540 place count 241 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 541 place count 240 transition count 276
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 65 Pre rules applied. Total rules applied 541 place count 240 transition count 211
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 671 place count 175 transition count 211
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 702 place count 144 transition count 180
Iterating global reduction 4 with 31 rules applied. Total rules applied 733 place count 144 transition count 180
Performed 97 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 927 place count 47 transition count 82
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 956 place count 18 transition count 24
Iterating global reduction 4 with 29 rules applied. Total rules applied 985 place count 18 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 989 place count 16 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 991 place count 14 transition count 22
Applied a total of 991 rules in 37 ms. Remains 14 /550 variables (removed 536) and now considering 22/558 (removed 536) transitions.
[2025-06-03 19:29:07] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 14 cols
[2025-06-03 19:29:07] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:29:07] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-03 19:29:07] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2025-06-03 19:29:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:29:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 19:29:07] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:29:07] [INFO ] Redundant transitions in 24 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-03 19:29:07] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2025-06-03 19:29:07] [INFO ] Invariant cache hit.
[2025-06-03 19:29:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 19/29 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/33 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1/34 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/34 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 15 constraints, problems are : Problem set: 0 solved, 12 unsolved in 397 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 19/29 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 4/33 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/34 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/34 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 27 constraints, problems are : Problem set: 0 solved, 12 unsolved in 399 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 801ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 801ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/550 places, 22/558 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1002 ms. Remains : 14/550 places, 22/558 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-01
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-01 finished in 1196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0)) U ((!p0&&X(X(p0)))||X(X(G(p0)))))))'
Support contains 1 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 558/558 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 549 transition count 558
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 542 transition count 551
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 542 transition count 551
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 542 transition count 549
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 21 place count 538 transition count 545
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 538 transition count 545
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 29 place count 538 transition count 541
Applied a total of 29 rules in 78 ms. Remains 538 /550 variables (removed 12) and now considering 541/558 (removed 17) transitions.
// Phase 1: matrix 541 rows 538 cols
[2025-06-03 19:29:08] [INFO ] Computed 33 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:29:09] [INFO ] Implicit Places using invariants in 379 ms returned []
[2025-06-03 19:29:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:29:09] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2025-06-03 19:29:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1078/1079 variables, and 570 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 540/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 1)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 2)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 2)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 1)
(s109 0)
(s110 0)
(s111 1)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 1)
(s124 0)
(s125 0)
(s126 1)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 1)
(s138 1)
(s139 0)
(s140 0)
(s141 1)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 0)
(s151 0)
(s152 1)
(s153 1)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 0)
(s174 1)
(s175 1)
(s176 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 3)
(s198 1)
(s199 1)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 4)
(s213 2)
(s214 1)
(s215 1)
(s216 1)
(s217 0)
(s218 0)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 0)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 7)
(s246 1)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 1)
(s270 1)
(s271 8)
(s272 1)
(s273 1)
(s274 1)
(s275 9)
(s276 1)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 10)
(s304 1)
(s305 1)
(s306 1)
(s307 0)
(s308 1)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 11)
(s319 1)
(s320 1)
(s321 1)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 12)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 0)
(s341 1)
(s342 1)
(s343 1)
(s344 8)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 0)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 9)
(s364 1)
(s365 15)
(s366 1)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 0)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 11)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 0)
(s398 1)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 17)
(s409 1)
(s410 1)
(s411 1)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 1)
(s420 1)
(s421 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1078/1079 variables, and 1110 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LTL mode, iteration 1 : 538/550 places, 541/558 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61400 ms. Remains : 538/550 places, 541/558 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-02
Product exploration explored 100000 steps with 19933 reset in 335 ms.
Product exploration explored 100000 steps with 19990 reset in 393 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 838 edges and 538 vertex of which 502 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.5 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
RANDOM walk for 30900 steps (112 resets) in 69 ms. (441 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-32b-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-02 finished in 62670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 558/558 transitions.
Graph (trivial) has 457 edges and 550 vertex of which 6 / 550 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 851 edges and 545 vertex of which 508 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.2 ms
Discarding 37 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 268 transitions
Trivial Post-agglo rules discarded 268 transitions
Performed 268 trivial Post agglomeration. Transition count delta: 268
Iterating post reduction 0 with 268 rules applied. Total rules applied 270 place count 507 transition count 280
Reduce places removed 268 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 277 rules applied. Total rules applied 547 place count 239 transition count 271
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 549 place count 237 transition count 271
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 549 place count 237 transition count 203
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 685 place count 169 transition count 203
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 716 place count 138 transition count 172
Iterating global reduction 3 with 31 rules applied. Total rules applied 747 place count 138 transition count 172
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 941 place count 41 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 942 place count 41 transition count 74
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 974 place count 9 transition count 11
Iterating global reduction 4 with 32 rules applied. Total rules applied 1006 place count 9 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1008 place count 8 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1009 place count 7 transition count 9
Applied a total of 1009 rules in 27 ms. Remains 7 /550 variables (removed 543) and now considering 9/558 (removed 549) transitions.
// Phase 1: matrix 9 rows 7 cols
[2025-06-03 19:30:11] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:30:11] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-03 19:30:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:30:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 19:30:11] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:30:11] [INFO ] Redundant transitions in 21 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-03 19:30:11] [INFO ] Invariant cache hit.
[2025-06-03 19:30:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 8 constraints, problems are : Problem set: 0 solved, 5 unsolved in 98 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 13 constraints, problems are : Problem set: 0 solved, 5 unsolved in 112 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 213ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/550 places, 9/558 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 323 ms. Remains : 7/550 places, 9/558 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-03
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-03 finished in 381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&X(X(X(p1)))) U G(p2)))'
Support contains 3 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 558/558 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 549 transition count 558
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 542 transition count 551
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 542 transition count 551
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 542 transition count 550
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 537 transition count 545
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 537 transition count 545
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 31 place count 537 transition count 540
Applied a total of 31 rules in 59 ms. Remains 537 /550 variables (removed 13) and now considering 540/558 (removed 18) transitions.
// Phase 1: matrix 540 rows 537 cols
[2025-06-03 19:30:11] [INFO ] Computed 33 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:30:11] [INFO ] Implicit Places using invariants in 256 ms returned []
[2025-06-03 19:30:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:30:12] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
Running 539 sub problems to find dead transitions.
[2025-06-03 19:30:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (OVERLAPS) 540/1076 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1076/1077 variables, and 569 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/537 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 539 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (OVERLAPS) 540/1076 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1076 variables, 539/1108 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1076/1077 variables, and 1108 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/537 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60171ms problems are : Problem set: 0 solved, 539 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Starting structural reductions in LTL mode, iteration 1 : 537/550 places, 540/558 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61302 ms. Remains : 537/550 places, 540/558 transitions.
Stuttering acceptance computed with spot in 474 ms :[(NOT p2), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-04
Product exploration explored 100000 steps with 19946 reset in 221 ms.
Product exploration explored 100000 steps with 20015 reset in 501 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 837 edges and 537 vertex of which 501 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.4 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Detected a total of 99/537 stabilizing places and 99/540 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 158 ms. Reduced automaton from 10 states, 18 edges and 3 AP (stutter sensitive) to 10 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[(NOT p2), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
RANDOM walk for 40000 steps (141 resets) in 150 ms. (264 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (15 resets) in 112 ms. (354 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (13 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
[2025-06-03 19:31:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 466/536 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 540/1076 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1076 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/1077 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1077 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1077 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1077/1077 variables, and 570 constraints, problems are : Problem set: 0 solved, 1 unsolved in 606 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 466/536 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 540/1076 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1076 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1076 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1077 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1077 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1077 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1077/1077 variables, and 571 constraints, problems are : Problem set: 0 solved, 1 unsolved in 604 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1219ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 192 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=96 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p2))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 673 ms. Reduced automaton from 10 states, 18 edges and 3 AP (stutter sensitive) to 10 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 478 ms :[(NOT p2), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 475 ms :[(NOT p2), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
[2025-06-03 19:31:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 19:31:18] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 31 ms returned sat
[2025-06-03 19:31:18] [INFO ] [Real]Absence check using state equation in 180 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p2))), (F (NOT p0)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 8 factoid took 816 ms. Reduced automaton from 10 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-32b-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-04 finished in 67664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 558/558 transitions.
Graph (trivial) has 456 edges and 550 vertex of which 6 / 550 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 851 edges and 545 vertex of which 508 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.2 ms
Discarding 37 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 267 transitions
Trivial Post-agglo rules discarded 267 transitions
Performed 267 trivial Post agglomeration. Transition count delta: 267
Iterating post reduction 0 with 267 rules applied. Total rules applied 269 place count 507 transition count 281
Reduce places removed 267 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 276 rules applied. Total rules applied 545 place count 240 transition count 272
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 548 place count 238 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 549 place count 237 transition count 271
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 68 Pre rules applied. Total rules applied 549 place count 237 transition count 203
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 685 place count 169 transition count 203
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 716 place count 138 transition count 172
Iterating global reduction 4 with 31 rules applied. Total rules applied 747 place count 138 transition count 172
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 941 place count 41 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 942 place count 41 transition count 74
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 973 place count 10 transition count 13
Iterating global reduction 5 with 31 rules applied. Total rules applied 1004 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1006 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1007 place count 8 transition count 11
Applied a total of 1007 rules in 48 ms. Remains 8 /550 variables (removed 542) and now considering 11/558 (removed 547) transitions.
// Phase 1: matrix 11 rows 8 cols
[2025-06-03 19:31:19] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:31:19] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-03 19:31:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:31:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 19:31:19] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:31:19] [INFO ] Redundant transitions in 19 ms returned []
Running 7 sub problems to find dead transitions.
[2025-06-03 19:31:19] [INFO ] Invariant cache hit.
[2025-06-03 19:31:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 189 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 209 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 403ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 403ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/550 places, 11/558 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 550 ms. Remains : 8/550 places, 11/558 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-06
Stuttering criterion allowed to conclude after 35 steps with 3 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-06 finished in 669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p1&&F(p0)&&X(p1))))))'
Support contains 2 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 558/558 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 549 transition count 558
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 541 transition count 550
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 541 transition count 550
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 541 transition count 548
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 23 place count 537 transition count 544
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 537 transition count 544
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 31 place count 537 transition count 540
Applied a total of 31 rules in 73 ms. Remains 537 /550 variables (removed 13) and now considering 540/558 (removed 18) transitions.
// Phase 1: matrix 540 rows 537 cols
[2025-06-03 19:31:20] [INFO ] Computed 33 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:31:20] [INFO ] Implicit Places using invariants in 372 ms returned []
[2025-06-03 19:31:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:31:21] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 1339 ms to find 0 implicit places.
Running 539 sub problems to find dead transitions.
[2025-06-03 19:31:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (OVERLAPS) 540/1076 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1076/1077 variables, and 569 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/537 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 539 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (OVERLAPS) 540/1076 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1076 variables, 539/1108 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 3)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 3)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 3)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 3)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 3)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 1)
(s118 4)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 3)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 1)
(s138 1)
(s139 0)
(s140 0)
(s141 1)
(s142 1)
(s143 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1076/1077 variables, and 1108 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/537 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 539 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Starting structural reductions in LTL mode, iteration 1 : 537/550 places, 540/558 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61614 ms. Remains : 537/550 places, 540/558 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 293 ms.
Product exploration explored 100000 steps with 33333 reset in 282 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 837 edges and 537 vertex of which 501 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.5 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 197 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-32b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-07 finished in 62652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&F(p1)) U (p2&&X(p3))))'
Support contains 4 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 558/558 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 549 transition count 558
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 542 transition count 551
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 542 transition count 551
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 542 transition count 549
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 21 place count 538 transition count 545
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 538 transition count 545
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 29 place count 538 transition count 541
Applied a total of 29 rules in 68 ms. Remains 538 /550 variables (removed 12) and now considering 541/558 (removed 17) transitions.
// Phase 1: matrix 541 rows 538 cols
[2025-06-03 19:32:22] [INFO ] Computed 33 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:32:23] [INFO ] Implicit Places using invariants in 350 ms returned []
[2025-06-03 19:32:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:32:24] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1290 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2025-06-03 19:32:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1078/1079 variables, and 570 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 540/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1078/1079 variables, and 1110 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 538/550 places, 541/558 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61524 ms. Remains : 538/550 places, 541/558 transitions.
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 339 ms.
Product exploration explored 100000 steps with 50000 reset in 350 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 838 edges and 538 vertex of which 502 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.5 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Detected a total of 99/538 stabilizing places and 99/541 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1) p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X p3), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p3)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 30 factoid took 308 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-32b-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-08 finished in 62948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X((p1 U !p0)))))'
Support contains 2 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 558/558 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 549 transition count 558
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 542 transition count 551
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 542 transition count 551
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 542 transition count 550
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 537 transition count 545
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 537 transition count 545
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 31 place count 537 transition count 540
Applied a total of 31 rules in 78 ms. Remains 537 /550 variables (removed 13) and now considering 540/558 (removed 18) transitions.
// Phase 1: matrix 540 rows 537 cols
[2025-06-03 19:33:25] [INFO ] Computed 33 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:33:26] [INFO ] Implicit Places using invariants in 340 ms returned []
[2025-06-03 19:33:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:33:27] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
Running 539 sub problems to find dead transitions.
[2025-06-03 19:33:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (OVERLAPS) 540/1076 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1076/1077 variables, and 569 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/537 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 539 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (OVERLAPS) 540/1076 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1076 variables, 539/1108 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1076/1077 variables, and 1108 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/537 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 539 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in LTL mode, iteration 1 : 537/550 places, 540/558 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61574 ms. Remains : 537/550 places, 540/558 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, true, (NOT p0), p0, true]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-10
Product exploration explored 100000 steps with 2237 reset in 224 ms.
Product exploration explored 100000 steps with 2222 reset in 249 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 837 edges and 537 vertex of which 501 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.5 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 128 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 388 steps (0 resets) in 5 ms. (64 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 163 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 157 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-03 19:34:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 19:34:29] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 32 ms returned sat
[2025-06-03 19:34:29] [INFO ] [Real]Absence check using state equation in 657 ms returned sat
[2025-06-03 19:34:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 19:34:30] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 28 ms returned sat
[2025-06-03 19:34:31] [INFO ] [Nat]Absence check using state equation in 699 ms returned sat
[2025-06-03 19:34:31] [INFO ] Computed and/alt/rep : 534/701/534 causal constraints (skipped 5 transitions) in 44 ms.
[2025-06-03 19:34:40] [INFO ] Added : 520 causal constraints over 104 iterations in 9640 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 537 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 540/540 transitions.
Applied a total of 0 rules in 24 ms. Remains 537 /537 variables (removed 0) and now considering 540/540 (removed 0) transitions.
[2025-06-03 19:34:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:34:41] [INFO ] Implicit Places using invariants in 356 ms returned []
[2025-06-03 19:34:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:34:42] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
Running 539 sub problems to find dead transitions.
[2025-06-03 19:34:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (OVERLAPS) 540/1076 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1076/1077 variables, and 569 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/537 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 539 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (OVERLAPS) 540/1076 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1076 variables, 539/1108 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1076/1077 variables, and 1108 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/537 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 539 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Finished structural reductions in LTL mode , in 1 iterations and 61459 ms. Remains : 537/537 places, 540/540 transitions.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 837 edges and 537 vertex of which 501 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.5 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 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 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 390 steps (0 resets) in 5 ms. (65 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 130 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 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-03 19:35:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 19:35:43] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 28 ms returned sat
[2025-06-03 19:35:44] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2025-06-03 19:35:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 19:35:44] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 25 ms returned sat
[2025-06-03 19:35:45] [INFO ] [Nat]Absence check using state equation in 617 ms returned sat
[2025-06-03 19:35:45] [INFO ] Computed and/alt/rep : 534/701/534 causal constraints (skipped 5 transitions) in 41 ms.
[2025-06-03 19:35:54] [INFO ] Added : 520 causal constraints over 104 iterations in 9302 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1137 reset in 234 ms.
Product exploration explored 100000 steps with 1138 reset in 249 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 540/540 transitions.
Graph (trivial) has 439 edges and 537 vertex of which 6 / 537 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 831 edges and 532 vertex of which 496 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 256 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 256 rules applied. Total rules applied 258 place count 496 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 259 place count 496 transition count 530
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 259 place count 496 transition count 532
Deduced a syphon composed of 291 places in 1 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 294 place count 496 transition count 532
Discarding 190 places :
Symmetric choice reduction at 2 with 190 rule applications. Total rules 484 place count 306 transition count 342
Deduced a syphon composed of 132 places in 1 ms
Iterating global reduction 2 with 190 rules applied. Total rules applied 674 place count 306 transition count 342
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 705 place count 275 transition count 311
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 736 place count 275 transition count 311
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 203 places in 0 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 838 place count 275 transition count 312
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 840 place count 275 transition count 310
Discarding 71 places :
Symmetric choice reduction at 3 with 71 rule applications. Total rules 911 place count 204 transition count 238
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 3 with 71 rules applied. Total rules applied 982 place count 204 transition count 238
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 983 place count 204 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 984 place count 203 transition count 237
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 985 place count 203 transition count 237
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 3 with 32 rules applied. Total rules applied 1017 place count 203 transition count 332
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1079 place count 141 transition count 208
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 3 with 62 rules applied. Total rules applied 1141 place count 141 transition count 208
Discarding 90 places :
Symmetric choice reduction at 3 with 90 rule applications. Total rules 1231 place count 51 transition count 58
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 3 with 90 rules applied. Total rules applied 1321 place count 51 transition count 58
Deduced a syphon composed of 42 places in 0 ms
Applied a total of 1321 rules in 93 ms. Remains 51 /537 variables (removed 486) and now considering 58/540 (removed 482) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:35:55] [INFO ] Redundant transitions in 43 ms returned []
Running 57 sub problems to find dead transitions.
// Phase 1: matrix 58 rows 51 cols
[2025-06-03 19:35:55] [INFO ] Computed 0 invariants in 2 ms
[2025-06-03 19:35:55] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
At refinement iteration 1 (OVERLAPS) 57/107 variables, 50/50 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/58 constraints. Problems are: Problem set: 46 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/58 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 1/108 variables, 1/59 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/59 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1/109 variables, 1/60 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/60 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/60 constraints. Problems are: Problem set: 46 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 60 constraints, problems are : Problem set: 46 solved, 11 unsolved in 887 ms.
Refiners :[State Equation: 51/51 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 56/64 variables, 8/8 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 8/16 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 11/27 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/27 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 44/108 variables, 43/70 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/70 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/109 variables, 1/71 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/71 constraints. Problems are: Problem set: 46 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/71 constraints. Problems are: Problem set: 46 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 71 constraints, problems are : Problem set: 46 solved, 11 unsolved in 822 ms.
Refiners :[State Equation: 51/51 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 11/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1721ms problems are : Problem set: 46 solved, 11 unsolved
Search for dead transitions found 46 dead transitions in 1721ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 51/537 places, 12/540 transitions.
Graph (complete) has 30 edges and 51 vertex of which 9 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 9 /51 variables (removed 42) and now considering 12/12 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/537 places, 12/540 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1874 ms. Remains : 9/537 places, 12/540 transitions.
Built C files in :
/tmp/ltsmin7557299137808942731
[2025-06-03 19:35:57] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7557299137808942731
Running compilation step : cd /tmp/ltsmin7557299137808942731;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1581 ms.
Running link step : cd /tmp/ltsmin7557299137808942731;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7557299137808942731;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11845253225569066083.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 540/540 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 536 transition count 539
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 536 transition count 539
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 536 transition count 538
Applied a total of 3 rules in 28 ms. Remains 536 /537 variables (removed 1) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 536 cols
[2025-06-03 19:36:12] [INFO ] Computed 33 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:36:12] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-06-03 19:36:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:36:13] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1089 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2025-06-03 19:36:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1073/1074 variables, and 568 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 535/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 537/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1073/1074 variables, and 1105 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 535/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in LTL mode, iteration 1 : 536/537 places, 538/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61277 ms. Remains : 536/537 places, 538/540 transitions.
Built C files in :
/tmp/ltsmin53320745133097326
[2025-06-03 19:37:13] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin53320745133097326
Running compilation step : cd /tmp/ltsmin53320745133097326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1435 ms.
Running link step : cd /tmp/ltsmin53320745133097326;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin53320745133097326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10474633356113271140.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 19:37:29] [INFO ] Flatten gal took : 32 ms
[2025-06-03 19:37:29] [INFO ] Flatten gal took : 28 ms
[2025-06-03 19:37:29] [INFO ] Time to serialize gal into /tmp/LTL13408203916038944009.gal : 7 ms
[2025-06-03 19:37:29] [INFO ] Time to serialize properties into /tmp/LTL2164704913765772930.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13408203916038944009.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3905689871834819980.hoa' '-atoms' '/tmp/LTL2164704913765772930.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2164704913765772930.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3905689871834819980.hoa
Detected timeout of ITS tools.
[2025-06-03 19:37:44] [INFO ] Flatten gal took : 19 ms
[2025-06-03 19:37:44] [INFO ] Flatten gal took : 17 ms
[2025-06-03 19:37:44] [INFO ] Time to serialize gal into /tmp/LTL1953518649695217467.gal : 4 ms
[2025-06-03 19:37:44] [INFO ] Time to serialize properties into /tmp/LTL9303994787971377783.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1953518649695217467.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9303994787971377783.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((F("(p495==1)"))&&(X(("(p132==1)")U("(p495!=1)"))))))
Formula 0 simplified : X(G!"(p495==1)" | X(!"(p132==1)" R !"(p495!=1)"))
Detected timeout of ITS tools.
[2025-06-03 19:37:59] [INFO ] Flatten gal took : 15 ms
[2025-06-03 19:37:59] [INFO ] Applying decomposition
[2025-06-03 19:37:59] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5154003219762646245.txt' '-o' '/tmp/graph5154003219762646245.bin' '-w' '/tmp/graph5154003219762646245.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5154003219762646245.bin' '-l' '-1' '-v' '-w' '/tmp/graph5154003219762646245.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:37:59] [INFO ] Decomposing Gal with order
[2025-06-03 19:37:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:37:59] [INFO ] Removed a total of 163 redundant transitions.
[2025-06-03 19:37:59] [INFO ] Flatten gal took : 65 ms
[2025-06-03 19:37:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2025-06-03 19:37:59] [INFO ] Time to serialize gal into /tmp/LTL2363259905403560662.gal : 13 ms
[2025-06-03 19:37:59] [INFO ] Time to serialize properties into /tmp/LTL8386676028197478006.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2363259905403560662.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8386676028197478006.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((F("(i26.u171.p495==1)"))&&(X(("(i2.u46.p132==1)")U("(i26.u171.p495!=1)"))))))
Formula 0 simplified : X(G!"(i26.u171.p495==1)" | X(!"(i2.u46.p132==1)" R !"(i26.u171.p495!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t492, i0.i1.t76, i0.i1.i2.t69, i1.t295, i1.t288, i2.t415, i2.t406, i3.i1.t487, i3.i1.i1.u14.t...956
Computing Next relation with stutter on 3.70604e+15 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
474 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.84494,126008,1,0,245759,312,5531,264721,156,900,544250
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-10 finished in 279656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (G(p1) U (p2||X(F((p2&&F(p3)))))))))'
Support contains 4 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 558/558 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 549 transition count 558
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 542 transition count 551
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 542 transition count 551
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 542 transition count 549
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 21 place count 538 transition count 545
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 538 transition count 545
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 29 place count 538 transition count 541
Applied a total of 29 rules in 77 ms. Remains 538 /550 variables (removed 12) and now considering 541/558 (removed 17) transitions.
// Phase 1: matrix 541 rows 538 cols
[2025-06-03 19:38:05] [INFO ] Computed 33 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:38:05] [INFO ] Implicit Places using invariants in 345 ms returned []
[2025-06-03 19:38:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:38:06] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2025-06-03 19:38:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 2.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 3.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 4.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 5.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 6.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 7.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 8.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 9.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 10.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 11.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 12.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 13.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 14.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1078/1079 variables, and 570 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 540/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1078/1079 variables, and 1110 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 538/550 places, 541/558 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61531 ms. Remains : 538/550 places, 541/558 transitions.
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p2), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-12
Product exploration explored 100000 steps with 856 reset in 181 ms.
Stack based approach found an accepted trace after 76542 steps with 662 reset with depth 145 and stack size 145 in 236 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-12 finished in 62304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)&&F(G(p1))))||G(p2))))'
Support contains 3 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 558/558 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 549 transition count 558
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 543 transition count 552
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 543 transition count 552
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 543 transition count 550
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 539 transition count 546
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 539 transition count 546
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 539 transition count 542
Applied a total of 27 rules in 43 ms. Remains 539 /550 variables (removed 11) and now considering 542/558 (removed 16) transitions.
// Phase 1: matrix 542 rows 539 cols
[2025-06-03 19:39:07] [INFO ] Computed 33 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:39:07] [INFO ] Implicit Places using invariants in 305 ms returned []
[2025-06-03 19:39:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:39:08] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2025-06-03 19:39:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 542/1080 variables, 538/571 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1080/1081 variables, and 571 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/539 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 542/1080 variables, 538/571 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1080 variables, 541/1112 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 1)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 1)
(s70 0)
(s71 1)
(s72 1)
(s73 1)
(s74 0)
(s75 1)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 1)
(s81 1)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 1)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 1)
(s96 1)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 0)
(s116 1)
(s117 1)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 3)
(s140 1)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 4)
(s155 1)
(s156 1)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 5)
(s170 1)
(s171 1)
(s172 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1080/1081 variables, and 1112 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/539 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Starting structural reductions in LTL mode, iteration 1 : 539/550 places, 542/558 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61104 ms. Remains : 539/550 places, 542/558 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-14
Stuttering criterion allowed to conclude after 265 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-14 finished in 61410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((G(p0)||X(F(p1)))))))))'
Support contains 2 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 558/558 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 549 transition count 558
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 541 transition count 550
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 541 transition count 550
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 541 transition count 548
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 536 transition count 543
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 536 transition count 543
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 34 place count 536 transition count 538
Applied a total of 34 rules in 75 ms. Remains 536 /550 variables (removed 14) and now considering 538/558 (removed 20) transitions.
// Phase 1: matrix 538 rows 536 cols
[2025-06-03 19:40:09] [INFO ] Computed 33 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:40:09] [INFO ] Implicit Places using invariants in 281 ms returned []
[2025-06-03 19:40:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:40:10] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1233 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2025-06-03 19:40:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1073/1074 variables, and 568 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 535/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 537/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1073/1074 variables, and 1105 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 535/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in LTL mode, iteration 1 : 536/550 places, 538/558 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61490 ms. Remains : 536/550 places, 538/558 transitions.
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-15
Product exploration explored 100000 steps with 496 reset in 217 ms.
Product exploration explored 100000 steps with 493 reset in 207 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 835 edges and 536 vertex of which 500 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Detected a total of 99/536 stabilizing places and 99/538 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 766 steps (0 resets) in 7 ms. (95 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2025-06-03 19:41:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 19:41:12] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 29 ms returned sat
[2025-06-03 19:41:15] [INFO ] [Real]Absence check using state equation in 2264 ms returned sat
[2025-06-03 19:41:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 19:41:15] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 19 ms returned sat
[2025-06-03 19:41:15] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2025-06-03 19:41:16] [INFO ] Computed and/alt/rep : 532/698/532 causal constraints (skipped 5 transitions) in 41 ms.
[2025-06-03 19:41:22] [INFO ] Added : 445 causal constraints over 89 iterations in 6725 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 538/538 transitions.
Applied a total of 0 rules in 25 ms. Remains 536 /536 variables (removed 0) and now considering 538/538 (removed 0) transitions.
[2025-06-03 19:41:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:41:22] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-06-03 19:41:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:41:23] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2025-06-03 19:41:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1073/1074 variables, and 568 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 535/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 537/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Error getting values : (error "ParserException while parsing response: ((timeout
s1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1073/1074 variables, and 1105 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 535/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Finished structural reductions in LTL mode , in 1 iterations and 60995 ms. Remains : 536/536 places, 538/538 transitions.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 835 edges and 536 vertex of which 500 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.4 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Detected a total of 99/536 stabilizing places and 99/538 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 773 steps (0 resets) in 7 ms. (96 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 2 factoid took 193 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2025-06-03 19:42:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 19:42:25] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 20 ms returned sat
[2025-06-03 19:42:27] [INFO ] [Real]Absence check using state equation in 2228 ms returned sat
[2025-06-03 19:42:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 19:42:27] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 20 ms returned sat
[2025-06-03 19:42:28] [INFO ] [Nat]Absence check using state equation in 822 ms returned sat
[2025-06-03 19:42:28] [INFO ] Computed and/alt/rep : 532/698/532 causal constraints (skipped 5 transitions) in 59 ms.
[2025-06-03 19:42:36] [INFO ] Added : 445 causal constraints over 89 iterations in 8075 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 493 reset in 260 ms.
Product exploration explored 100000 steps with 492 reset in 303 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 536 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 536/536 places, 538/538 transitions.
Graph (trivial) has 436 edges and 536 vertex of which 6 / 536 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 829 edges and 531 vertex of which 495 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 257 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 257 rules applied. Total rules applied 259 place count 495 transition count 529
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 33 Pre rules applied. Total rules applied 259 place count 495 transition count 531
Deduced a syphon composed of 290 places in 1 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 292 place count 495 transition count 531
Discarding 189 places :
Symmetric choice reduction at 1 with 189 rule applications. Total rules 481 place count 306 transition count 342
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 1 with 189 rules applied. Total rules applied 670 place count 306 transition count 342
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 701 place count 275 transition count 311
Deduced a syphon composed of 101 places in 1 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 732 place count 275 transition count 311
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 201 places in 0 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 832 place count 275 transition count 312
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 834 place count 275 transition count 310
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 904 place count 205 transition count 239
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 974 place count 205 transition count 239
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 975 place count 205 transition count 239
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 976 place count 204 transition count 238
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 977 place count 204 transition count 238
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 1009 place count 204 transition count 333
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1071 place count 142 transition count 209
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 2 with 62 rules applied. Total rules applied 1133 place count 142 transition count 209
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 1223 place count 52 transition count 59
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 2 with 90 rules applied. Total rules applied 1313 place count 52 transition count 59
Deduced a syphon composed of 41 places in 0 ms
Applied a total of 1313 rules in 63 ms. Remains 52 /536 variables (removed 484) and now considering 59/538 (removed 479) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:42:38] [INFO ] Redundant transitions in 18 ms returned []
Running 58 sub problems to find dead transitions.
// Phase 1: matrix 59 rows 52 cols
[2025-06-03 19:42:38] [INFO ] Computed 0 invariants in 0 ms
[2025-06-03 19:42:38] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
At refinement iteration 1 (OVERLAPS) 58/109 variables, 51/51 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/59 constraints. Problems are: Problem set: 45 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/59 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1/110 variables, 1/60 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/60 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/111 variables, 1/61 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/61 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/61 constraints. Problems are: Problem set: 45 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 61 constraints, problems are : Problem set: 45 solved, 13 unsolved in 914 ms.
Refiners :[State Equation: 52/52 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 45 solved, 13 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 57/67 variables, 10/10 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 8/18 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 13/31 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/31 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 43/110 variables, 42/73 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/73 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/111 variables, 1/74 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/74 constraints. Problems are: Problem set: 45 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/74 constraints. Problems are: Problem set: 45 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 74 constraints, problems are : Problem set: 45 solved, 13 unsolved in 1123 ms.
Refiners :[State Equation: 52/52 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 13/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2054ms problems are : Problem set: 45 solved, 13 unsolved
Search for dead transitions found 45 dead transitions in 2054ms
Found 45 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 45 transitions
Dead transitions reduction (with SMT) removed 45 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 52/536 places, 14/538 transitions.
Graph (complete) has 34 edges and 52 vertex of which 11 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Discarding 41 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 11 /52 variables (removed 41) and now considering 14/14 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/536 places, 14/538 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2153 ms. Remains : 11/536 places, 14/538 transitions.
Built C files in :
/tmp/ltsmin12310717724822516328
[2025-06-03 19:42:40] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12310717724822516328
Running compilation step : cd /tmp/ltsmin12310717724822516328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1463 ms.
Running link step : cd /tmp/ltsmin12310717724822516328;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12310717724822516328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18359957532691169626.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 538/538 transitions.
Applied a total of 0 rules in 16 ms. Remains 536 /536 variables (removed 0) and now considering 538/538 (removed 0) transitions.
// Phase 1: matrix 538 rows 536 cols
[2025-06-03 19:42:55] [INFO ] Computed 33 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:42:55] [INFO ] Implicit Places using invariants in 230 ms returned []
[2025-06-03 19:42:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:42:56] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2025-06-03 19:42:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1073/1074 variables, and 568 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 535/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 537/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1073/1074 variables, and 1105 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 535/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Finished structural reductions in LTL mode , in 1 iterations and 61106 ms. Remains : 536/536 places, 538/538 transitions.
Built C files in :
/tmp/ltsmin6288941209116546509
[2025-06-03 19:43:56] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6288941209116546509
Running compilation step : cd /tmp/ltsmin6288941209116546509;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1221 ms.
Running link step : cd /tmp/ltsmin6288941209116546509;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6288941209116546509;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8387843324883860050.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 19:44:11] [INFO ] Flatten gal took : 13 ms
[2025-06-03 19:44:11] [INFO ] Flatten gal took : 21 ms
[2025-06-03 19:44:11] [INFO ] Time to serialize gal into /tmp/LTL14203398458881212395.gal : 3 ms
[2025-06-03 19:44:11] [INFO ] Time to serialize properties into /tmp/LTL3508423193158118076.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14203398458881212395.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7155778348799544542.hoa' '-atoms' '/tmp/LTL3508423193158118076.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3508423193158118076.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7155778348799544542.hoa
Detected timeout of ITS tools.
[2025-06-03 19:44:26] [INFO ] Flatten gal took : 13 ms
[2025-06-03 19:44:26] [INFO ] Flatten gal took : 13 ms
[2025-06-03 19:44:26] [INFO ] Time to serialize gal into /tmp/LTL15357639477375651344.gal : 2 ms
[2025-06-03 19:44:26] [INFO ] Time to serialize properties into /tmp/LTL7008246513764636537.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15357639477375651344.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7008246513764636537.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G((G("(p498==1)"))||(X(F("(p105==1)"))))))))))
Formula 0 simplified : XXXXF(F!"(p498==1)" & XG!"(p105==1)")
Detected timeout of ITS tools.
[2025-06-03 19:44:41] [INFO ] Flatten gal took : 13 ms
[2025-06-03 19:44:41] [INFO ] Applying decomposition
[2025-06-03 19:44:41] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3255458073134103597.txt' '-o' '/tmp/graph3255458073134103597.bin' '-w' '/tmp/graph3255458073134103597.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3255458073134103597.bin' '-l' '-1' '-v' '-w' '/tmp/graph3255458073134103597.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:44:41] [INFO ] Decomposing Gal with order
[2025-06-03 19:44:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:44:42] [INFO ] Removed a total of 79 redundant transitions.
[2025-06-03 19:44:42] [INFO ] Flatten gal took : 39 ms
[2025-06-03 19:44:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-03 19:44:42] [INFO ] Time to serialize gal into /tmp/LTL6911190921701948655.gal : 6 ms
[2025-06-03 19:44:42] [INFO ] Time to serialize properties into /tmp/LTL10242672208250965795.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6911190921701948655.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10242672208250965795.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G((G("(i25.u180.p498==1)"))||(X(F("(i4.u39.p105==1)"))))))))))
Formula 0 simplified : XXXXF(F!"(i25.u180.p498==1)" & XG!"(i4.u39.p105==1)")
Detected timeout of ITS tools.
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-15 finished in 288155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(p1))||(G(!p2) U X(X(p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((G(p0)||X(F(p1)))))))))'
Found a Lengthening insensitive property : GPUForwardProgress-PT-32b-LTLFireability-15
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 550 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 550/550 places, 558/558 transitions.
Graph (trivial) has 456 edges and 550 vertex of which 6 / 550 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 851 edges and 545 vertex of which 508 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.3 ms
Discarding 37 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 266 rules applied. Total rules applied 268 place count 507 transition count 282
Reduce places removed 266 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 275 rules applied. Total rules applied 543 place count 241 transition count 273
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 547 place count 239 transition count 271
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 549 place count 237 transition count 271
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 549 place count 237 transition count 204
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 683 place count 170 transition count 204
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 714 place count 139 transition count 173
Iterating global reduction 4 with 31 rules applied. Total rules applied 745 place count 139 transition count 173
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 937 place count 43 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 938 place count 43 transition count 76
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 969 place count 12 transition count 15
Iterating global reduction 5 with 31 rules applied. Total rules applied 1000 place count 12 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1002 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1003 place count 10 transition count 13
Applied a total of 1003 rules in 33 ms. Remains 10 /550 variables (removed 540) and now considering 13/558 (removed 545) transitions.
// Phase 1: matrix 13 rows 10 cols
[2025-06-03 19:44:57] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:44:57] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-03 19:44:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:44:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 19:44:57] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 8 sub problems to find dead transitions.
[2025-06-03 19:44:57] [INFO ] Invariant cache hit.
[2025-06-03 19:44:57] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 12/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 3/22 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/23 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 11 constraints, problems are : Problem set: 0 solved, 8 unsolved in 229 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 12/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/22 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/23 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/23 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 19 constraints, problems are : Problem set: 0 solved, 8 unsolved in 238 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 503ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 503ms
Starting structural reductions in LI_LTL mode, iteration 1 : 10/550 places, 13/558 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 628 ms. Remains : 10/550 places, 13/558 transitions.
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-15 finished in 1049 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2025-06-03 19:44:58] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1275769830062553011
[2025-06-03 19:44:58] [INFO ] Computing symmetric may disable matrix : 558 transitions.
[2025-06-03 19:44:58] [INFO ] Applying decomposition
[2025-06-03 19:44:58] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 19:44:58] [INFO ] Computing symmetric may enable matrix : 558 transitions.
[2025-06-03 19:44:58] [INFO ] Flatten gal took : 23 ms
[2025-06-03 19:44:58] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17668656471150016677.txt' '-o' '/tmp/graph17668656471150016677.bin' '-w' '/tmp/graph17668656471150016677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17668656471150016677.bin' '-l' '-1' '-v' '-w' '/tmp/graph17668656471150016677.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:44:58] [INFO ] Decomposing Gal with order
[2025-06-03 19:44:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:44:58] [INFO ] Computing Do-Not-Accords matrix : 558 transitions.
[2025-06-03 19:44:58] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 19:44:58] [INFO ] Removed a total of 169 redundant transitions.
[2025-06-03 19:44:58] [INFO ] Built C files in 182ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1275769830062553011
Running compilation step : cd /tmp/ltsmin1275769830062553011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-03 19:44:58] [INFO ] Flatten gal took : 36 ms
[2025-06-03 19:44:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-03 19:44:58] [INFO ] Time to serialize gal into /tmp/LTLFireability13200769470819947278.gal : 9 ms
[2025-06-03 19:44:58] [INFO ] Time to serialize properties into /tmp/LTLFireability3625255916717773894.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13200769470819947278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3625255916717773894.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((("(i0.i0.i1.u12.p28!=1)")U(X("(i10.u75.p210==1)")))||((G(!("(((((((i1.u18.p37==1)&&(i2.u24.p55==1))&&((i3.u31.p73==1)&&(i4.u37.p...845
Formula 0 simplified : F((!"(i0.i0.i1.u12.p28!=1)" R X!"(i10.u75.p210==1)") & (F"(((((((i1.u18.p37==1)&&(i2.u24.p55==1))&&((i3.u31.p73==1)&&(i4.u37.p91==1)...831
Reverse transition relation is NOT exact ! Due to transitions t492, i1.t487, i1.u15.t477, i2.t471, i2.t464, i3.t450, i3.u32.t457, i4.t443, i4.u35.t436, i5....926
Computing Next relation with stutter on 3.70604e+15 deadlock states
Compilation finished in 1960 ms.
Running link step : cd /tmp/ltsmin1275769830062553011;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin1275769830062553011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((((LTLAPp0==true) U X((LTLAPp1==true)))||([](!(LTLAPp2==true)) U X(X((LTLAPp0==true))))))' '--buchi-type=spotba'
269 unique states visited
269 strongly connected components in search stack
270 transitions explored
269 items max in DFS search stack
4266 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,42.75,826584,1,0,1.69988e+06,366,5676,2.12142e+06,191,1083,3310096
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1451660 ms.

BK_STOP 1748980005308

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="GPUForwardProgress-PT-32b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-32b, 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 r100-smll-174867008000500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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