Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r240-tall-174915590600852.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 UtilityControlRoom-PT-Z4T3N08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915590600852
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 37K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 129K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 511K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 23K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 61K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 165K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 174K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 651K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 255K May 29 14:33 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 UtilityControlRoom-PT-Z4T3N08-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z4T3N08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749277164383

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z4T3N08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 06:19:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 06:19:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 06:19:26] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2025-06-07 06:19:26] [INFO ] Transformed 302 places.
[2025-06-07 06:19:26] [INFO ] Transformed 600 transitions.
[2025-06-07 06:19:26] [INFO ] Parsed PT model containing 302 places and 600 transitions and 1928 arcs in 240 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
[2025-06-07 06:19:26] [INFO ] Reduced 24 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 269 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 34 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2025-06-07 06:19:26] [INFO ] Computed 19 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:19:26] [INFO ] Implicit Places using invariants in 391 ms returned [245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 436 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/302 places, 472/472 transitions.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 504 ms. Remains : 301/302 places, 472/472 transitions.
Support contains 269 out of 301 places after structural reductions.
[2025-06-07 06:19:27] [INFO ] Flatten gal took : 70 ms
[2025-06-07 06:19:27] [INFO ] Flatten gal took : 48 ms
[2025-06-07 06:19:27] [INFO ] Input system was already deterministic with 472 transitions.
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 38165 steps (8 resets) in 1357 ms. (28 steps per ms) remains 0/23 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0)) U (p1&&X(p2))))'
Support contains 165 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 7 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 301 cols
[2025-06-07 06:19:28] [INFO ] Computed 18 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:19:28] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-06-07 06:19:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:19:28] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-06-07 06:19:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/301 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/773 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 773/773 variables, and 319 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/301 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/773 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 464/783 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/773 variables, and 783 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60459ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60607ms
Finished structural reductions in LTL mode , in 1 iterations and 61125 ms. Remains : 301/301 places, 472/472 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-02
Product exploration explored 100000 steps with 29078 reset in 811 ms.
Product exploration explored 100000 steps with 28894 reset in 708 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))))))]
Knowledge based reduction with 9 factoid took 328 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 773 ms. (51 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1431 ms. (27 steps per ms) remains 1/1 properties
[2025-06-07 06:20:32] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
After SMT solving in domain Real declared 37/773 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/301 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (G (OR (NOT p1) p2))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))))), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p0))))]
Knowledge based reduction with 10 factoid took 521 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2)]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2)]
[2025-06-07 06:20:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:20:33] [INFO ] [Real]Absence check using 18 positive place invariants in 135 ms returned sat
[2025-06-07 06:20:40] [INFO ] [Real]Absence check using state equation in 6369 ms returned sat
[2025-06-07 06:20:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:20:40] [INFO ] [Nat]Absence check using 18 positive place invariants in 81 ms returned sat
[2025-06-07 06:20:43] [INFO ] [Nat]Absence check using state equation in 2618 ms returned sat
[2025-06-07 06:20:43] [INFO ] Computed and/alt/rep : 464/712/464 causal constraints (skipped 0 transitions) in 27 ms.
[2025-06-07 06:20:45] [INFO ] Added : 240 causal constraints over 48 iterations in 1921 ms. Result :sat
Could not prove EG (NOT p1)
[2025-06-07 06:20:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:20:46] [INFO ] [Real]Absence check using 18 positive place invariants in 97 ms returned sat
[2025-06-07 06:20:49] [INFO ] [Real]Absence check using state equation in 2995 ms returned sat
[2025-06-07 06:20:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:20:50] [INFO ] [Nat]Absence check using 18 positive place invariants in 55 ms returned sat
[2025-06-07 06:20:52] [INFO ] [Nat]Absence check using state equation in 2307 ms returned sat
[2025-06-07 06:20:52] [INFO ] Computed and/alt/rep : 464/712/464 causal constraints (skipped 0 transitions) in 26 ms.
[2025-06-07 06:20:56] [INFO ] Added : 352 causal constraints over 71 iterations in 3858 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 165 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 12 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
[2025-06-07 06:20:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:20:56] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-07 06:20:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:20:56] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-06-07 06:20: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/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/301 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/773 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 773/773 variables, and 319 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/301 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/773 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 464/783 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/773 variables, and 783 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60260ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60264ms
Finished structural reductions in LTL mode , in 1 iterations and 60582 ms. Remains : 301/301 places, 472/472 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 5 factoid took 164 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2)]
RANDOM walk for 54 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (NOT p2))), (X (X p2)), (F p1), (F p0), (F p2)]
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2)]
[2025-06-07 06:21:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:21:58] [INFO ] [Real]Absence check using 18 positive place invariants in 134 ms returned sat
[2025-06-07 06:22:04] [INFO ] [Real]Absence check using state equation in 6221 ms returned sat
[2025-06-07 06:22:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:22:05] [INFO ] [Nat]Absence check using 18 positive place invariants in 78 ms returned sat
[2025-06-07 06:22:07] [INFO ] [Nat]Absence check using state equation in 2567 ms returned sat
[2025-06-07 06:22:07] [INFO ] Computed and/alt/rep : 464/712/464 causal constraints (skipped 0 transitions) in 27 ms.
[2025-06-07 06:22:09] [INFO ] Added : 240 causal constraints over 48 iterations in 1830 ms. Result :sat
Could not prove EG (NOT p1)
[2025-06-07 06:22:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:22:10] [INFO ] [Real]Absence check using 18 positive place invariants in 97 ms returned sat
[2025-06-07 06:22:13] [INFO ] [Real]Absence check using state equation in 2982 ms returned sat
[2025-06-07 06:22:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:22:14] [INFO ] [Nat]Absence check using 18 positive place invariants in 45 ms returned sat
[2025-06-07 06:22:16] [INFO ] [Nat]Absence check using state equation in 2317 ms returned sat
[2025-06-07 06:22:16] [INFO ] Computed and/alt/rep : 464/712/464 causal constraints (skipped 0 transitions) in 25 ms.
[2025-06-07 06:22:20] [INFO ] Added : 352 causal constraints over 71 iterations in 3845 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2)]
Product exploration explored 100000 steps with 29250 reset in 649 ms.
Product exploration explored 100000 steps with 28941 reset in 641 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2)]
Support contains 165 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 301 transition count 504
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 301 transition count 504
Deduced a syphon composed of 32 places in 1 ms
Applied a total of 32 rules in 45 ms. Remains 301 /301 variables (removed 0) and now considering 504/472 (removed -32) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:22:22] [INFO ] Redundant transitions in 43 ms returned []
Running 496 sub problems to find dead transitions.
// Phase 1: matrix 504 rows 301 cols
[2025-06-07 06:22:22] [INFO ] Computed 18 invariants in 4 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:22:28] [INFO ] Deduced a trap composed of 201 places in 179 ms of which 26 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (OVERLAPS) 8/301 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:22:39] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:22:39] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 2 ms to minimize.
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:22:39] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:22:39] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:22:39] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:22:39] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 2 ms to minimize.
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:22:39] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:22:39] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 8/27 constraints. Problems are: Problem set: 64 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/27 constraints. Problems are: Problem set: 64 solved, 432 unsolved
At refinement iteration 6 (OVERLAPS) 504/805 variables, 301/328 constraints. Problems are: Problem set: 64 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 805/805 variables, and 328 constraints, problems are : Problem set: 64 solved, 432 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 64 solved, 432 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 1/1 constraints. Problems are: Problem set: 64 solved, 432 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/261 variables, 0/1 constraints. Problems are: Problem set: 64 solved, 432 unsolved
At refinement iteration 2 (OVERLAPS) 40/301 variables, 18/19 constraints. Problems are: Problem set: 64 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 8/27 constraints. Problems are: Problem set: 64 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/27 constraints. Problems are: Problem set: 64 solved, 432 unsolved
At refinement iteration 5 (OVERLAPS) 504/805 variables, 301/328 constraints. Problems are: Problem set: 64 solved, 432 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 432/760 constraints. Problems are: Problem set: 64 solved, 432 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 805/805 variables, and 760 constraints, problems are : Problem set: 64 solved, 432 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 432/496 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60274ms problems are : Problem set: 64 solved, 432 unsolved
Search for dead transitions found 64 dead transitions in 60275ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 301/301 places, 440/472 transitions.
Graph (complete) has 840 edges and 301 vertex of which 269 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 269 /301 variables (removed 32) and now considering 440/440 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 269/301 places, 440/472 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60428 ms. Remains : 269/301 places, 440/472 transitions.
Built C files in :
/tmp/ltsmin15148388405354695322
[2025-06-07 06:23:22] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15148388405354695322
Running compilation step : cd /tmp/ltsmin15148388405354695322;'/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 906 ms.
Running link step : cd /tmp/ltsmin15148388405354695322;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15148388405354695322;'/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/stateBased8907143777546861020.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 165 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 13 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 301 cols
[2025-06-07 06:23:37] [INFO ] Computed 18 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:23:38] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-07 06:23:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:23:38] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-06-07 06:23:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/301 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/773 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 464 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 773/773 variables, and 319 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/301 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/773 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 464/783 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/773 variables, and 783 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60218ms
Finished structural reductions in LTL mode , in 1 iterations and 60633 ms. Remains : 301/301 places, 472/472 transitions.
Built C files in :
/tmp/ltsmin2829820186904250444
[2025-06-07 06:24:38] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2829820186904250444
Running compilation step : cd /tmp/ltsmin2829820186904250444;'/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 741 ms.
Running link step : cd /tmp/ltsmin2829820186904250444;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2829820186904250444;'/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/stateBased6486095362860316779.hoa' '--buchi-type=spotba'
LTSmin run took 4547 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-02 finished in 315471 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((X(G(p1))||p0)))'
Support contains 45 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 18 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2025-06-07 06:24:43] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:24:43] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-07 06:24:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:24:44] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 06:24:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 23441 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53641ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 53642ms
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53897 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-03
Entered a terminal (fully accepting) state of product in 46 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-03 finished in 54003 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((((p0&&G(F(p0))) U X(p1))||F(G(p1))))))'
Support contains 136 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 5 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 301 cols
[2025-06-07 06:25:37] [INFO ] Computed 18 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:25:38] [INFO ] Implicit Places using invariants in 396 ms returned []
[2025-06-07 06:25:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:25:38] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-06-07 06:25:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/301 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/773 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 773/773 variables, and 319 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/301 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/773 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 464/783 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/773 variables, and 783 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60239ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Finished structural reductions in LTL mode , in 1 iterations and 60954 ms. Remains : 301/301 places, 472/472 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-04
Product exploration explored 100000 steps with 2856 reset in 390 ms.
Product exploration explored 100000 steps with 2869 reset in 474 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
RANDOM walk for 163 steps (0 resets) in 6 ms. (23 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 2 factoid took 217 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
[2025-06-07 06:26:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:26:41] [INFO ] [Real]Absence check using 18 positive place invariants in 29 ms returned sat
[2025-06-07 06:26:42] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2025-06-07 06:26:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:26:42] [INFO ] [Nat]Absence check using 18 positive place invariants in 22 ms returned sat
[2025-06-07 06:26:43] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2025-06-07 06:26:43] [INFO ] Computed and/alt/rep : 464/712/464 causal constraints (skipped 0 transitions) in 26 ms.
[2025-06-07 06:26:43] [INFO ] Added : 72 causal constraints over 15 iterations in 487 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 136 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
[2025-06-07 06:26:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:26:44] [INFO ] Implicit Places using invariants in 438 ms returned []
[2025-06-07 06:26:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:26:44] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-06-07 06:26:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/301 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/773 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 3.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 773/773 variables, and 319 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/301 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/773 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 464/783 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/773 variables, and 783 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60259ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60260ms
Finished structural reductions in LTL mode , in 1 iterations and 61018 ms. Remains : 301/301 places, 472/472 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
RANDOM walk for 203 steps (0 resets) in 5 ms. (33 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 1 factoid took 173 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
[2025-06-07 06:27:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:27:46] [INFO ] [Real]Absence check using 18 positive place invariants in 29 ms returned sat
[2025-06-07 06:27:46] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2025-06-07 06:27:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:27:47] [INFO ] [Nat]Absence check using 18 positive place invariants in 22 ms returned sat
[2025-06-07 06:27:47] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2025-06-07 06:27:47] [INFO ] Computed and/alt/rep : 464/712/464 causal constraints (skipped 0 transitions) in 25 ms.
[2025-06-07 06:27:48] [INFO ] Added : 72 causal constraints over 15 iterations in 468 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2833 reset in 373 ms.
Product exploration explored 100000 steps with 2853 reset in 386 ms.
Applying partial POR strategy [false, true, false, true, true, true, false, false]
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
Support contains 136 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 301 transition count 504
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 301 transition count 504
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 72 place count 301 transition count 528
Deduced a syphon composed of 72 places in 0 ms
Applied a total of 72 rules in 35 ms. Remains 301 /301 variables (removed 0) and now considering 528/472 (removed -56) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:27:49] [INFO ] Redundant transitions in 10 ms returned []
Running 496 sub problems to find dead transitions.
// Phase 1: matrix 528 rows 301 cols
[2025-06-07 06:27:49] [INFO ] Computed 18 invariants in 4 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:27:55] [INFO ] Deduced a trap composed of 169 places in 142 ms of which 20 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (OVERLAPS) 8/301 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:28:04] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:28:04] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:28:04] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:28:04] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:28:04] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:28:04] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:28:04] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:28:04] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:28:04] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:28:05] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:28:05] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:28:05] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:28:05] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:28:05] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 2 ms to minimize.
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 14/33 constraints. Problems are: Problem set: 128 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/33 constraints. Problems are: Problem set: 128 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 528/829 variables, 301/334 constraints. Problems are: Problem set: 128 solved, 368 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 829/829 variables, and 334 constraints, problems are : Problem set: 128 solved, 368 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 128 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 1/1 constraints. Problems are: Problem set: 128 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/1 constraints. Problems are: Problem set: 128 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 80/301 variables, 18/19 constraints. Problems are: Problem set: 128 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 14/33 constraints. Problems are: Problem set: 128 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/33 constraints. Problems are: Problem set: 128 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 528/829 variables, 301/334 constraints. Problems are: Problem set: 128 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/829 variables, 368/702 constraints. Problems are: Problem set: 128 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 829/829 variables, and 702 constraints, problems are : Problem set: 128 solved, 368 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 368/496 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60299ms problems are : Problem set: 128 solved, 368 unsolved
Search for dead transitions found 128 dead transitions in 60300ms
Found 128 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 128 transitions
Dead transitions reduction (with SMT) removed 128 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 301/301 places, 400/472 transitions.
Graph (complete) has 816 edges and 301 vertex of which 229 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.2 ms
Discarding 72 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 229 /301 variables (removed 72) and now considering 400/400 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 229/301 places, 400/472 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60370 ms. Remains : 229/301 places, 400/472 transitions.
Built C files in :
/tmp/ltsmin6355275458602455784
[2025-06-07 06:28:50] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6355275458602455784
Running compilation step : cd /tmp/ltsmin6355275458602455784;'/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 706 ms.
Running link step : cd /tmp/ltsmin6355275458602455784;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6355275458602455784;'/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/stateBased3103756253513493279.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 136 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 6 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 301 cols
[2025-06-07 06:29:05] [INFO ] Computed 18 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:29:05] [INFO ] Implicit Places using invariants in 386 ms returned []
[2025-06-07 06:29:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:29:05] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-06-07 06:29:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/301 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/773 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 773/773 variables, and 319 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/301 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/773 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 464/783 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/773 variables, and 783 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60229ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60231ms
Finished structural reductions in LTL mode , in 1 iterations and 60943 ms. Remains : 301/301 places, 472/472 transitions.
Built C files in :
/tmp/ltsmin4035045840804838135
[2025-06-07 06:30:06] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4035045840804838135
Running compilation step : cd /tmp/ltsmin4035045840804838135;'/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 689 ms.
Running link step : cd /tmp/ltsmin4035045840804838135;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin4035045840804838135;'/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/stateBased13809006057536480960.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 06:30:21] [INFO ] Flatten gal took : 23 ms
[2025-06-07 06:30:21] [INFO ] Flatten gal took : 22 ms
[2025-06-07 06:30:21] [INFO ] Time to serialize gal into /tmp/LTL7986354346976835346.gal : 6 ms
[2025-06-07 06:30:21] [INFO ] Time to serialize properties into /tmp/LTL980094450704852101.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7986354346976835346.gal' '-t' 'CGAL' '-hoa' '/tmp/aut996606842341671591.hoa' '-atoms' '/tmp/LTL980094450704852101.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...315
Loading property file /tmp/LTL980094450704852101.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut996606842341671591.hoa
Detected timeout of ITS tools.
[2025-06-07 06:30:36] [INFO ] Flatten gal took : 22 ms
[2025-06-07 06:30:36] [INFO ] Flatten gal took : 20 ms
[2025-06-07 06:30:36] [INFO ] Time to serialize gal into /tmp/LTL181729432951304419.gal : 4 ms
[2025-06-07 06:30:36] [INFO ] Time to serialize properties into /tmp/LTL14374689709132075792.ltl : 16 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/LTL181729432951304419.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14374689709132075792.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(X(((("((((Clients_0>=1)||(Clients_1>=1))||((Clients_2>=1)||(Clients_3>=1)))||(((Clients_4>=1)||(Clients_5>=1))||((Clients_6>=1)||...5976
Formula 0 simplified : XX(((!"((((Clients_0>=1)||(Clients_1>=1))||((Clients_2>=1)||(Clients_3>=1)))||(((Clients_4>=1)||(Clients_5>=1))||((Clients_6>=1)||(C...5961
Detected timeout of ITS tools.
[2025-06-07 06:30:51] [INFO ] Flatten gal took : 22 ms
[2025-06-07 06:30:51] [INFO ] Applying decomposition
[2025-06-07 06:30:51] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16372647496651596808.txt' '-o' '/tmp/graph16372647496651596808.bin' '-w' '/tmp/graph16372647496651596808.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16372647496651596808.bin' '-l' '-1' '-v' '-w' '/tmp/graph16372647496651596808.weights' '-q' '0' '-e' '0.001'
[2025-06-07 06:30:51] [INFO ] Decomposing Gal with order
[2025-06-07 06:30:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 06:30:52] [INFO ] Removed a total of 382 redundant transitions.
[2025-06-07 06:30:52] [INFO ] Flatten gal took : 280 ms
[2025-06-07 06:30:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 264 labels/synchronizations in 29 ms.
[2025-06-07 06:30:52] [INFO ] Time to serialize gal into /tmp/LTL6235279870067276835.gal : 19 ms
[2025-06-07 06:30:52] [INFO ] Time to serialize properties into /tmp/LTL9154477757777792827.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6235279870067276835.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9154477757777792827.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(X(((("((((i5.u36.Clients_0>=1)||(i3.u37.Clients_1>=1))||((i4.u33.Clients_2>=1)||(i6.u38.Clients_3>=1)))||(((i0.u34.Clients_4>=1)|...7800
Formula 0 simplified : XX(((!"((((i5.u36.Clients_0>=1)||(i3.u37.Clients_1>=1))||((i4.u33.Clients_2>=1)||(i6.u38.Clients_3>=1)))||(((i0.u34.Clients_4>=1)||(...7785
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-04 finished in 329478 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((p0&&((p1 U p2)||(G(!p2)&&p3)))))'
Support contains 109 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 6 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2025-06-07 06:31:07] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:31:07] [INFO ] Implicit Places using invariants in 357 ms returned []
[2025-06-07 06:31:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:31:07] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 06:31: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/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 22954 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53152ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 53153ms
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53754 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p2), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), false, p2]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-05 finished in 54016 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((F((p0&&(G(!p1) U p2))) U p3))))'
Support contains 88 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 3 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2025-06-07 06:32:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:32:01] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-07 06:32:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:32:01] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 06:32:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 23422 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53598ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 53599ms
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53940 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-06
Product exploration explored 100000 steps with 7105 reset in 592 ms.
Product exploration explored 100000 steps with 7167 reset in 633 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) p1))))), (X (X (AND (NOT p3) p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 228 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (NOT p0) (NOT p2)), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (NOT p2)]
RANDOM walk for 138 steps (0 resets) in 7 ms. (17 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) p1))))), (X (X (AND (NOT p3) p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0))))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p3) (NOT p0))))), (F (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (F (NOT (OR p1 p2 p3 (NOT p0)))), (F p2), (F (NOT (AND (OR (NOT p1) p2) (OR (NOT p1) p0)))), (F p3), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 509 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (NOT p0) (NOT p2)), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (NOT p2)]
Stuttering acceptance computed with spot in 232 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (NOT p0) (NOT p2)), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (NOT p2)]
[2025-06-07 06:32:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:32:58] [INFO ] [Real]Absence check using 18 positive place invariants in 43 ms returned sat
[2025-06-07 06:32:58] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2025-06-07 06:32:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:32:58] [INFO ] [Nat]Absence check using 18 positive place invariants in 26 ms returned sat
[2025-06-07 06:32:59] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2025-06-07 06:32:59] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 19 ms.
[2025-06-07 06:33:00] [INFO ] Added : 236 causal constraints over 48 iterations in 1292 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 88 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Applied a total of 0 rules in 1 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2025-06-07 06:33:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:33:00] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-07 06:33:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:33:00] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 06:33:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 23305 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53525ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 53525ms
Finished structural reductions in LTL mode , in 1 iterations and 53870 ms. Remains : 205/205 places, 376/376 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p3) (NOT p0)))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 276 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (NOT p0) (NOT p2)), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (NOT p2)]
RANDOM walk for 137 steps (0 resets) in 7 ms. (17 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p3) (NOT p0)))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) p0)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0))))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p3) (NOT p0))))), (F (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (F (NOT (OR p1 p2 p3 (NOT p0)))), (F p2), (F (NOT (AND (OR (NOT p1) p2) (OR (NOT p1) p0)))), (F p3), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 607 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (NOT p0) (NOT p2)), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (NOT p2)]
Stuttering acceptance computed with spot in 280 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (NOT p0) (NOT p2)), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (NOT p2)]
[2025-06-07 06:33:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:33:56] [INFO ] [Real]Absence check using 18 positive place invariants in 45 ms returned sat
[2025-06-07 06:33:56] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2025-06-07 06:33:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:33:56] [INFO ] [Nat]Absence check using 18 positive place invariants in 27 ms returned sat
[2025-06-07 06:33:57] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2025-06-07 06:33:57] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 21 ms.
[2025-06-07 06:33:58] [INFO ] Added : 236 causal constraints over 48 iterations in 1239 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 268 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (NOT p0) (NOT p2)), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (NOT p2)]
Product exploration explored 100000 steps with 7085 reset in 672 ms.
Product exploration explored 100000 steps with 7158 reset in 655 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 292 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (NOT p0) (NOT p2)), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (NOT p2)]
Support contains 88 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 205 transition count 344
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 202 transition count 248
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 202 transition count 248
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 62 place count 178 transition count 224
Iterating global reduction 0 with 24 rules applied. Total rules applied 86 place count 178 transition count 224
Applied a total of 86 rules in 26 ms. Remains 178 /205 variables (removed 27) and now considering 224/376 (removed 152) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:34:00] [INFO ] Redundant transitions in 1 ms returned []
Running 216 sub problems to find dead transitions.
// Phase 1: matrix 224 rows 178 cols
[2025-06-07 06:34:00] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 8/178 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 224/402 variables, 178/196 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 0/402 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 196 constraints, problems are : Problem set: 0 solved, 216 unsolved in 10284 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 8/178 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 224/402 variables, 178/196 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 216/412 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/402 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 412 constraints, problems are : Problem set: 0 solved, 216 unsolved in 12523 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22845ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 22846ms
Starting structural reductions in SI_LTL mode, iteration 1 : 178/205 places, 224/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22882 ms. Remains : 178/205 places, 224/376 transitions.
Built C files in :
/tmp/ltsmin8387045711101813489
[2025-06-07 06:34:23] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8387045711101813489
Running compilation step : cd /tmp/ltsmin8387045711101813489;'/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 569 ms.
Running link step : cd /tmp/ltsmin8387045711101813489;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8387045711101813489;'/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/stateBased14725350582694424262.hoa' '--buchi-type=spotba'
LTSmin run took 148 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-06 finished in 142804 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)&&F(G(!p1)))))'
Support contains 168 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 253 transition count 424
Applied a total of 96 rules in 16 ms. Remains 253 /301 variables (removed 48) and now considering 424/472 (removed 48) transitions.
// Phase 1: matrix 424 rows 253 cols
[2025-06-07 06:34:24] [INFO ] Computed 18 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:34:24] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-07 06:34:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:34:24] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:34:24] [INFO ] Redundant transitions in 2 ms returned []
Running 392 sub problems to find dead transitions.
[2025-06-07 06:34: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/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 8/253 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 424/677 variables, 253/271 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/677 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (OVERLAPS) 0/677 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Real declared 677/677 variables, and 271 constraints, problems are : Problem set: 0 solved, 392 unsolved in 28195 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 8/253 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 424/677 variables, 253/271 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/677 variables, 392/663 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 677/677 variables, and 663 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58469ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 58470ms
Starting structural reductions in SI_LTL mode, iteration 1 : 253/301 places, 424/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58928 ms. Remains : 253/301 places, 424/472 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR p0 p1), p0, p1]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-07
Product exploration explored 100000 steps with 54 reset in 467 ms.
Stack based approach found an accepted trace after 10575 steps with 4 reset with depth 10491 and stack size 10491 in 50 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-07 finished in 59628 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' '!(((p0||F(p1)||(!p2 U (p3||G(!p2)))) U X(p0)))'
Support contains 5 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 95 place count 206 transition count 377
Iterating global reduction 0 with 95 rules applied. Total rules applied 190 place count 206 transition count 377
Applied a total of 190 rules in 11 ms. Remains 206 /301 variables (removed 95) and now considering 377/472 (removed 95) transitions.
// Phase 1: matrix 377 rows 206 cols
[2025-06-07 06:35:23] [INFO ] Computed 18 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:35:24] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-06-07 06:35:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:35:24] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2025-06-07 06:35: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/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 377/583 variables, 206/224 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (OVERLAPS) 0/583 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 369 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 224 constraints, problems are : Problem set: 0 solved, 369 unsolved in 23537 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 377/583 variables, 206/224 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 369/593 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/583 variables, and 593 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53739ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 53741ms
Starting structural reductions in LTL mode, iteration 1 : 206/301 places, 377/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54184 ms. Remains : 206/301 places, 377/472 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (AND (NOT p1) (NOT p3) p2 (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p3) p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-08
Product exploration explored 100000 steps with 377 reset in 310 ms.
Product exploration explored 100000 steps with 339 reset in 340 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 13 factoid took 383 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(NOT p0), (AND (NOT p1) p2 (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) p2 (NOT p3))]
RANDOM walk for 24332 steps (4 resets) in 235 ms. (103 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1 p2 p3))), (F p0), (F p2), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT p3)), (F (NOT p1)), (F (NOT (OR p1 p2 p3)))]
Knowledge based reduction with 13 factoid took 641 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (AND (NOT p1) p2 (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) p2 (NOT p3))]
Stuttering acceptance computed with spot in 276 ms :[(NOT p0), (AND (NOT p1) p2 (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) p2 (NOT p3))]
[2025-06-07 06:36:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1 p2 p3))), (F p0), (F p2), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT p3)), (F (NOT p1)), (F (NOT (OR p1 p2 p3))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 13 factoid took 693 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-08 finished in 57937 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(p1)||p0)))'
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 301 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 173 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 173 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 141 transition count 280
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 354 place count 139 transition count 216
Iterating global reduction 2 with 2 rules applied. Total rules applied 356 place count 139 transition count 216
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 372 place count 123 transition count 200
Iterating global reduction 2 with 16 rules applied. Total rules applied 388 place count 123 transition count 200
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 404 place count 107 transition count 168
Iterating global reduction 2 with 16 rules applied. Total rules applied 420 place count 107 transition count 168
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 435 place count 92 transition count 138
Iterating global reduction 2 with 15 rules applied. Total rules applied 450 place count 92 transition count 138
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 465 place count 92 transition count 123
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 495 place count 77 transition count 108
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 497 place count 77 transition count 108
Applied a total of 497 rules in 31 ms. Remains 77 /301 variables (removed 224) and now considering 108/472 (removed 364) transitions.
// Phase 1: matrix 108 rows 77 cols
[2025-06-07 06:36:21] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:36:21] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-07 06:36:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:36:21] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:36:21] [INFO ] Redundant transitions in 0 ms returned []
Running 91 sub problems to find dead transitions.
[2025-06-07 06:36: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/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 8/77 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 108/185 variables, 77/95 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 95 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2077 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 8/77 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 108/185 variables, 77/95 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 91/186 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 186 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3073 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5166ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 5166ms
Starting structural reductions in SI_LTL mode, iteration 1 : 77/301 places, 108/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5331 ms. Remains : 77/301 places, 108/472 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-09
Product exploration explored 100000 steps with 615 reset in 229 ms.
Stack based approach found an accepted trace after 3387 steps with 21 reset with depth 34 and stack size 34 in 14 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-09 finished in 5674 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(p0)))'
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 11 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2025-06-07 06:36:27] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:36:27] [INFO ] Implicit Places using invariants in 203 ms returned []
[2025-06-07 06:36:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:36:27] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 06:36: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/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 23478 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53675ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 53676ms
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54102 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-11 finished in 54205 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((F(p0)&&p1)) U X((!p0 U p2))))'
Support contains 3 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 95 place count 206 transition count 377
Iterating global reduction 0 with 95 rules applied. Total rules applied 190 place count 206 transition count 377
Applied a total of 190 rules in 7 ms. Remains 206 /301 variables (removed 95) and now considering 377/472 (removed 95) transitions.
// Phase 1: matrix 377 rows 206 cols
[2025-06-07 06:37:21] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:37:22] [INFO ] Implicit Places using invariants in 453 ms returned []
[2025-06-07 06:37:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:37:22] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2025-06-07 06:37:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 377/583 variables, 206/224 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (OVERLAPS) 0/583 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 369 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 224 constraints, problems are : Problem set: 0 solved, 369 unsolved in 23968 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 377/583 variables, 206/224 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 369/593 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/583 variables, and 593 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54158ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 54159ms
Starting structural reductions in LTL mode, iteration 1 : 206/301 places, 377/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54856 ms. Remains : 206/301 places, 377/472 transitions.
Stuttering acceptance computed with spot in 398 ms :[true, p2, (AND p1 p0 p2), (AND p0 p1), (AND p0 p2), p2, p2, (AND p0 p2), p0]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3810 steps with 0 reset in 13 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-14 finished in 55291 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(F((X(X(p2))&&p1))))))'
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 11 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2025-06-07 06:38:16] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:38:17] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-07 06:38:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:38:17] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 06:38:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 23507 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53690ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 53691ms
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54111 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N08-LTLFireability-15
Product exploration explored 100000 steps with 95 reset in 384 ms.
Stack based approach found an accepted trace after 45580 steps with 54 reset with depth 1401 and stack size 1401 in 206 ms.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N08-LTLFireability-15 finished in 55024 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((((p0&&G(F(p0))) U X(p1))||F(G(p1))))))'
[2025-06-07 06:39:12] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10713384543543360299
[2025-06-07 06:39:12] [INFO ] Computing symmetric may disable matrix : 472 transitions.
[2025-06-07 06:39:12] [INFO ] Applying decomposition
[2025-06-07 06:39:12] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:39:12] [INFO ] Flatten gal took : 16 ms
[2025-06-07 06:39:12] [INFO ] Computing symmetric may enable matrix : 472 transitions.
[2025-06-07 06:39:12] [INFO ] Computation of Complete enable matrix. took 5 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/graph14553434411374203180.txt' '-o' '/tmp/graph14553434411374203180.bin' '-w' '/tmp/graph14553434411374203180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14553434411374203180.bin' '-l' '-1' '-v' '-w' '/tmp/graph14553434411374203180.weights' '-q' '0' '-e' '0.001'
[2025-06-07 06:39:12] [INFO ] Decomposing Gal with order
[2025-06-07 06:39:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 06:39:12] [INFO ] Removed a total of 443 redundant transitions.
[2025-06-07 06:39:12] [INFO ] Flatten gal took : 30 ms
[2025-06-07 06:39:12] [INFO ] Computing Do-Not-Accords matrix : 472 transitions.
[2025-06-07 06:39:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 241 labels/synchronizations in 10 ms.
[2025-06-07 06:39:12] [INFO ] Time to serialize gal into /tmp/LTLFireability11853030811710318675.gal : 4 ms
[2025-06-07 06:39:12] [INFO ] Time to serialize properties into /tmp/LTLFireability2155461123815065316.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/LTLFireability11853030811710318675.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2155461123815065316.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
[2025-06-07 06:39:12] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:39:12] [INFO ] Built C files in 162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10713384543543360299
Running compilation step : cd /tmp/ltsmin10713384543543360299;'/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'
Checking formula 0 : !((X(X(((("((((i6.i1.u0.Clients_0>=1)||(i4.u45.Clients_1>=1))||((i7.u46.Clients_2>=1)||(i0.u1.Clients_3>=1)))||(((i3.u47.Clients_4>=1)...7932
Formula 0 simplified : XX(((!"((((i6.i1.u0.Clients_0>=1)||(i4.u45.Clients_1>=1))||((i7.u46.Clients_2>=1)||(i0.u1.Clients_3>=1)))||(((i3.u47.Clients_4>=1)||...7917
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 1116 ms.
Running link step : cd /tmp/ltsmin10713384543543360299;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10713384543543360299;'/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' 'X(X(((((LTLAPp0==true)&&[](<>((LTLAPp0==true)))) U X((LTLAPp1==true)))||<>([]((LTLAPp1==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.028: LTL layer: formula: X(X(((((LTLAPp0==true)&&[](<>((LTLAPp0==true)))) U X((LTLAPp1==true)))||<>([]((LTLAPp1==true))))))
pins2lts-mc-linux64( 4/ 8), 0.028: "X(X(((((LTLAPp0==true)&&[](<>((LTLAPp0==true)))) U X((LTLAPp1==true)))||<>([]((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.028: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.113: There are 475 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.113: State length is 302, there are 491 groups
pins2lts-mc-linux64( 0/ 8), 0.113: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.113: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.113: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.113: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.211: [Blue] ~120 levels ~960 states ~9632 transitions
pins2lts-mc-linux64( 5/ 8), 0.271: [Blue] ~157 levels ~1920 states ~14528 transitions
pins2lts-mc-linux64( 5/ 8), 0.313: [Blue] ~157 levels ~3840 states ~17800 transitions
pins2lts-mc-linux64( 3/ 8), 0.489: [Blue] ~203 levels ~7680 states ~31248 transitions
pins2lts-mc-linux64( 3/ 8), 0.665: [Blue] ~203 levels ~15360 states ~46424 transitions
pins2lts-mc-linux64( 4/ 8), 0.946: [Blue] ~278 levels ~30720 states ~78536 transitions
pins2lts-mc-linux64( 3/ 8), 1.512: [Blue] ~203 levels ~61440 states ~146592 transitions
pins2lts-mc-linux64( 4/ 8), 2.505: [Blue] ~355 levels ~122880 states ~345648 transitions
pins2lts-mc-linux64( 4/ 8), 4.253: [Blue] ~367 levels ~245760 states ~643056 transitions
pins2lts-mc-linux64( 4/ 8), 7.232: [Blue] ~367 levels ~491520 states ~1284576 transitions
pins2lts-mc-linux64( 4/ 8), 12.731: [Blue] ~820 levels ~983040 states ~2609040 transitions
pins2lts-mc-linux64( 5/ 8), 23.716: [Blue] ~16297 levels ~1966080 states ~6120240 transitions
pins2lts-mc-linux64( 5/ 8), 45.927: [Blue] ~26457 levels ~3932160 states ~12658856 transitions
pins2lts-mc-linux64( 5/ 8), 91.493: [Blue] ~44956 levels ~7864320 states ~25556384 transitions
pins2lts-mc-linux64( 6/ 8), 182.654: [Blue] ~91627 levels ~15728640 states ~52756464 transitions
pins2lts-mc-linux64( 2/ 8), 230.885: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 230.995:
pins2lts-mc-linux64( 0/ 8), 230.995: Explored 19211228 states 72123108 transitions, fanout: 3.754
pins2lts-mc-linux64( 0/ 8), 230.995: Total exploration time 230.860 sec (230.760 sec minimum, 230.798 sec on average)
pins2lts-mc-linux64( 0/ 8), 230.995: States per second: 83216, Transitions per second: 312411
pins2lts-mc-linux64( 0/ 8), 230.995:
pins2lts-mc-linux64( 0/ 8), 230.995: State space has 30067119 states, 12529871 are accepting
pins2lts-mc-linux64( 0/ 8), 230.995: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 230.995: blue states: 19211228 (63.89%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 230.995: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 230.995: all-red states: 17460115 (58.07%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 230.995:
pins2lts-mc-linux64( 0/ 8), 230.995: Total memory used for local state coloring: 26.7MB
pins2lts-mc-linux64( 0/ 8), 230.995:
pins2lts-mc-linux64( 0/ 8), 230.995: Queue width: 8B, total height: 1750824, memory: 13.36MB
pins2lts-mc-linux64( 0/ 8), 230.995: Tree memory: 485.4MB, 16.9 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 230.995: Tree fill ratio (roots/leafs): 22.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 230.995: Stored 499 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 230.995: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 230.995: Est. total memory use: 498.8MB (~1037.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10713384543543360299;'/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' 'X(X(((((LTLAPp0==true)&&[](<>((LTLAPp0==true)))) U X((LTLAPp1==true)))||<>([]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10713384543543360299;'/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' 'X(X(((((LTLAPp0==true)&&[](<>((LTLAPp0==true)))) U X((LTLAPp1==true)))||<>([]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 items max in DFS search stack
12741 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,127.461,1860288,1,0,2.46179e+06,3824,2645,9.29702e+06,373,42983,2662517
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA UtilityControlRoom-PT-Z4T3N08-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1456511 ms.

BK_STOP 1749278622424

--------------------
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="UtilityControlRoom-PT-Z4T3N08"
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 UtilityControlRoom-PT-Z4T3N08, 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 r240-tall-174915590600852"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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