fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r098-tall-177955695600532
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for DLCround-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1226.487 918815.00 1135621.00 20860.70 FFFTFTFFFFFFFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695600532.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is DLCround-PT-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695600532
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 940K
-rw-r--r-- 1 mcc users 8.4K Mar 6 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Mar 6 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 17:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 17:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Mar 6 17:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K Mar 6 17:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 6 17:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 6 17:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 547K Mar 3 18:30 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 DLCround-PT-04b-LTLFireability-00
FORMULA_NAME DLCround-PT-04b-LTLFireability-01
FORMULA_NAME DLCround-PT-04b-LTLFireability-02
FORMULA_NAME DLCround-PT-04b-LTLFireability-03
FORMULA_NAME DLCround-PT-04b-LTLFireability-04
FORMULA_NAME DLCround-PT-04b-LTLFireability-05
FORMULA_NAME DLCround-PT-04b-LTLFireability-06
FORMULA_NAME DLCround-PT-04b-LTLFireability-07
FORMULA_NAME DLCround-PT-04b-LTLFireability-08
FORMULA_NAME DLCround-PT-04b-LTLFireability-09
FORMULA_NAME DLCround-PT-04b-LTLFireability-10
FORMULA_NAME DLCround-PT-04b-LTLFireability-11
FORMULA_NAME DLCround-PT-04b-LTLFireability-12
FORMULA_NAME DLCround-PT-04b-LTLFireability-13
FORMULA_NAME DLCround-PT-04b-LTLFireability-14
FORMULA_NAME DLCround-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779629146895

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 13:25:48] [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]
[2026-05-24 13:25:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 13:25:48] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2026-05-24 13:25:48] [INFO ] Transformed 1680 places.
[2026-05-24 13:25:48] [INFO ] Transformed 2364 transitions.
[2026-05-24 13:25:48] [INFO ] Found NUPN structural information;
[2026-05-24 13:25:48] [INFO ] Parsed PT model containing 1680 places and 2364 transitions and 6156 arcs in 329 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Support contains 42 out of 1680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1680/1680 places, 2364/2364 transitions.
Discarding 282 places :
Symmetric choice reduction at 0 with 282 rule applications. Total rules 282 place count 1398 transition count 2082
Iterating global reduction 0 with 282 rules applied. Total rules applied 564 place count 1398 transition count 2082
Discarding 212 places :
Symmetric choice reduction at 0 with 212 rule applications. Total rules 776 place count 1186 transition count 1870
Iterating global reduction 0 with 212 rules applied. Total rules applied 988 place count 1186 transition count 1870
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 993 place count 1186 transition count 1865
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 1038 place count 1141 transition count 1789
Iterating global reduction 1 with 45 rules applied. Total rules applied 1083 place count 1141 transition count 1789
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 1113 place count 1111 transition count 1759
Iterating global reduction 1 with 30 rules applied. Total rules applied 1143 place count 1111 transition count 1759
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 1146 place count 1111 transition count 1756
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1161 place count 1096 transition count 1741
Iterating global reduction 2 with 15 rules applied. Total rules applied 1176 place count 1096 transition count 1741
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1191 place count 1081 transition count 1726
Iterating global reduction 2 with 15 rules applied. Total rules applied 1206 place count 1081 transition count 1726
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1220 place count 1067 transition count 1712
Iterating global reduction 2 with 14 rules applied. Total rules applied 1234 place count 1067 transition count 1712
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1244 place count 1057 transition count 1702
Iterating global reduction 2 with 10 rules applied. Total rules applied 1254 place count 1057 transition count 1702
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1261 place count 1050 transition count 1695
Iterating global reduction 2 with 7 rules applied. Total rules applied 1268 place count 1050 transition count 1695
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1275 place count 1043 transition count 1688
Iterating global reduction 2 with 7 rules applied. Total rules applied 1282 place count 1043 transition count 1688
Applied a total of 1282 rules in 748 ms. Remains 1043 /1680 variables (removed 637) and now considering 1688/2364 (removed 676) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-661411270171609293.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15571655114737310000.kers'
[2026-05-24 13:25:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-661411270171609293.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15571655114737310000.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1688 rows 1043 cols 4740 entries
Finished phase 1 with 974 SingleSign rule and 0 generalized
[2026-05-24 13:25:49] [INFO ] Computed 69 invariants in 5 ms
Computed 69 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-15571655114737310000.kers
Total runtime 8 ms.
[2026-05-24 13:25:50] [INFO ] Implicit Places using invariants in 918 ms returned []
[2026-05-24 13:25:50] [INFO ] Invariant cache hit.
[2026-05-24 13:25:51] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1810 ms to find 0 implicit places.
Running 1687 sub problems to find dead transitions.
[2026-05-24 13:25:51] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1042/2731 variables, and 0 constraints, problems are : Problem set: 0 solved, 1687 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1043 constraints, PredecessorRefiner: 1687/1687 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1687 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1042/2731 variables, and 0 constraints, problems are : Problem set: 0 solved, 1687 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1043 constraints, PredecessorRefiner: 0/1687 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60643ms problems are : Problem set: 0 solved, 1687 unsolved
Search for dead transitions found 0 dead transitions in 60663ms
Starting structural reductions in LTL mode, iteration 1 : 1043/1680 places, 1688/2364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63320 ms. Remains : 1043/1680 places, 1688/2364 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 1688/1688 transitions.
Applied a total of 0 rules in 22 ms. Remains 1043 /1043 variables (removed 0) and now considering 1688/1688 (removed 0) transitions.
[2026-05-24 13:26:52] [INFO ] Invariant cache hit.
[2026-05-24 13:26:52] [INFO ] Implicit Places using invariants in 495 ms returned []
[2026-05-24 13:26:52] [INFO ] Invariant cache hit.
[2026-05-24 13:26:53] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1312 ms. Remains : 1043/1043 places, 1688/1688 transitions.
Support contains 42 out of 1043 places after structural reductions.
[2026-05-24 13:26:53] [INFO ] Flatten gal took : 137 ms
[2026-05-24 13:26:53] [INFO ] Flatten gal took : 79 ms
[2026-05-24 13:26:53] [INFO ] Input system was already deterministic with 1688 transitions.
Reduction of identical properties reduced properties to check from 40 to 39
RANDOM walk for 40000 steps (8 resets) in 2303 ms. (17 steps per ms) remains 4/39 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
[2026-05-24 13:26:55] [INFO ] Invariant cache hit.
Problem AtomicPropp31 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (OVERLAPS) 373/380 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 663/1043 variables, 63/69 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1043 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1688/2731 variables, 1043/1112 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2731 variables, 0/1112 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2731 variables, 0/1112 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2731/2731 variables, and 1112 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2030 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 1043/1043 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 236/240 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 803/1043 variables, 65/69 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1043 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1688/2731 variables, 1043/1112 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2731 variables, 2/1114 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2731 variables, 0/1114 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2731 variables, 0/1114 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2731/2731 variables, and 1114 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1277 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 1043/1043 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3323ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 127 ms.
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 1688/1688 transitions.
Graph (trivial) has 967 edges and 1043 vertex of which 298 / 1043 are part of one of the 24 SCC in 16 ms
Free SCC test removed 274 places
Drop transitions (Empty/Sink Transition effects.) removed 312 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 322 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 182 transitions
Trivial Post-agglo rules discarded 182 transitions
Performed 182 trivial Post agglomeration. Transition count delta: 182
Iterating post reduction 0 with 182 rules applied. Total rules applied 183 place count 769 transition count 1184
Reduce places removed 182 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 211 rules applied. Total rules applied 394 place count 587 transition count 1155
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 413 place count 568 transition count 1155
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 413 place count 568 transition count 1084
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 555 place count 497 transition count 1084
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 599 place count 453 transition count 913
Iterating global reduction 3 with 44 rules applied. Total rules applied 643 place count 453 transition count 913
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 645 place count 453 transition count 911
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 645 place count 453 transition count 906
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 655 place count 448 transition count 906
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 656 place count 447 transition count 898
Iterating global reduction 4 with 1 rules applied. Total rules applied 657 place count 447 transition count 898
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 658 place count 447 transition count 897
Performed 165 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 165 places in 1 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 5 with 330 rules applied. Total rules applied 988 place count 282 transition count 727
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 993 place count 282 transition count 722
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1011 place count 264 transition count 596
Iterating global reduction 6 with 18 rules applied. Total rules applied 1029 place count 264 transition count 596
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1044 place count 264 transition count 581
Performed 30 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 1104 place count 234 transition count 761
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1117 place count 234 transition count 748
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1130 place count 221 transition count 559
Iterating global reduction 8 with 13 rules applied. Total rules applied 1143 place count 221 transition count 559
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 8 with 30 rules applied. Total rules applied 1173 place count 221 transition count 529
Drop transitions (Redundant composition of simpler transitions.) removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 9 with 60 rules applied. Total rules applied 1233 place count 221 transition count 469
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1238 place count 216 transition count 428
Iterating global reduction 9 with 5 rules applied. Total rules applied 1243 place count 216 transition count 428
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1248 place count 216 transition count 423
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1256 place count 212 transition count 450
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1261 place count 212 transition count 445
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 11 with 22 rules applied. Total rules applied 1283 place count 212 transition count 423
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 1291 place count 208 transition count 450
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1297 place count 208 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 1318 place count 208 transition count 423
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1326 place count 204 transition count 450
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1332 place count 204 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 1353 place count 204 transition count 423
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1361 place count 200 transition count 450
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1367 place count 200 transition count 444
Renaming transitions due to excessive name length > 1024 char.
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 1388 place count 200 transition count 423
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 1396 place count 196 transition count 450
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1402 place count 196 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 1423 place count 196 transition count 423
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 1431 place count 192 transition count 450
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1437 place count 192 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 1458 place count 192 transition count 423
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 1466 place count 188 transition count 450
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1472 place count 188 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 1493 place count 188 transition count 423
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 1501 place count 184 transition count 454
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 1507 place count 184 transition count 448
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 1528 place count 184 transition count 427
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 1536 place count 180 transition count 456
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 18 with 5 rules applied. Total rules applied 1541 place count 180 transition count 451
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 1562 place count 180 transition count 430
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 1570 place count 176 transition count 449
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 1574 place count 176 transition count 445
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 20 with 19 rules applied. Total rules applied 1593 place count 176 transition count 426
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 1601 place count 172 transition count 445
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 1605 place count 172 transition count 441
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 21 with 19 rules applied. Total rules applied 1624 place count 172 transition count 422
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 1632 place count 168 transition count 441
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 1636 place count 168 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 22 with 19 rules applied. Total rules applied 1655 place count 168 transition count 418
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 1663 place count 164 transition count 439
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 1667 place count 164 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 23 with 19 rules applied. Total rules applied 1686 place count 164 transition count 416
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 23 with 4 rules applied. Total rules applied 1690 place count 162 transition count 425
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 1692 place count 162 transition count 423
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 24 with 5 rules applied. Total rules applied 1697 place count 162 transition count 418
Free-agglomeration rule applied 24 times with reduction of 1 identical transitions.
Iterating global reduction 24 with 24 rules applied. Total rules applied 1721 place count 162 transition count 393
Reduce places removed 24 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 137 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 138 transitions.
Graph (complete) has 399 edges and 138 vertex of which 106 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 0 output transitions
Iterating post reduction 24 with 163 rules applied. Total rules applied 1884 place count 106 transition count 255
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 25 with 32 rules applied. Total rules applied 1916 place count 106 transition count 223
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 26 with 27 rules applied. Total rules applied 1943 place count 106 transition count 196
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 26 with 1 rules applied. Total rules applied 1944 place count 105 transition count 195
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 26 with 5 rules applied. Total rules applied 1949 place count 101 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 1950 place count 100 transition count 194
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 28 with 48 rules applied. Total rules applied 1998 place count 68 transition count 178
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 28 with 44 rules applied. Total rules applied 2042 place count 68 transition count 134
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 29 with 54 rules applied. Total rules applied 2096 place count 32 transition count 116
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (trivial) has 10 edges and 32 vertex of which 10 / 32 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 29 with 52 rules applied. Total rules applied 2148 place count 27 transition count 65
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 43 edges and 23 vertex of which 15 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 30 with 38 rules applied. Total rules applied 2186 place count 15 transition count 28
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 31 with 6 rules applied. Total rules applied 2192 place count 14 transition count 23
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 32 with 12 rules applied. Total rules applied 2204 place count 6 transition count 19
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 32 with 12 rules applied. Total rules applied 2216 place count 6 transition count 7
Applied a total of 2216 rules in 434 ms. Remains 6 /1043 variables (removed 1037) and now considering 7/1688 (removed 1681) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 434 ms. Remains : 6/1043 places, 7/1688 transitions.
RANDOM walk for 49 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
FORMULA DLCround-PT-04b-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DLCround-PT-04b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 135 stabilizing places and 135 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 1688/1688 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1026 transition count 1664
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1026 transition count 1664
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 1016 transition count 1654
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 1016 transition count 1654
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 1013 transition count 1651
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 1013 transition count 1651
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1012 transition count 1650
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1012 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1011 transition count 1649
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1011 transition count 1649
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1010 transition count 1648
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1010 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1009 transition count 1647
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1009 transition count 1647
Applied a total of 68 rules in 122 ms. Remains 1009 /1043 variables (removed 34) and now considering 1647/1688 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4674783825872951372.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9586907511842389459.kers'
[2026-05-24 13:26:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4674783825872951372.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9586907511842389459.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1647 rows 1009 cols 4642 entries
Finished phase 1 with 940 SingleSign rule and 0 generalized
[2026-05-24 13:26:59] [INFO ] Computed 69 invariants in 13 ms
Computed 69 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-9586907511842389459.kers
Total runtime 14 ms.
[2026-05-24 13:26:59] [INFO ] Implicit Places using invariants in 325 ms returned []
[2026-05-24 13:26:59] [INFO ] Invariant cache hit.
[2026-05-24 13:27:00] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
Running 1646 sub problems to find dead transitions.
[2026-05-24 13:27:00] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1008/2656 variables, and 0 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1009 constraints, PredecessorRefiner: 1646/1646 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1646 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1008/2656 variables, and 0 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1009 constraints, PredecessorRefiner: 0/1646 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60482ms problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 60487ms
Starting structural reductions in LTL mode, iteration 1 : 1009/1043 places, 1647/1688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61678 ms. Remains : 1009/1043 places, 1647/1688 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-00
Product exploration explored 100000 steps with 47 reset in 406 ms.
Stack based approach found an accepted trace after 6641 steps with 2 reset with depth 4687 and stack size 4687 in 26 ms.
FORMULA DLCround-PT-04b-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property DLCround-PT-04b-LTLFireability-00 finished in 62457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 1688/1688 transitions.
Graph (trivial) has 970 edges and 1043 vertex of which 292 / 1043 are part of one of the 23 SCC in 3 ms
Free SCC test removed 269 places
Ensure Unique test removed 293 transitions
Reduce isomorphic transitions removed 293 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 0 with 184 rules applied. Total rules applied 185 place count 773 transition count 1210
Reduce places removed 184 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 213 rules applied. Total rules applied 398 place count 589 transition count 1181
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 417 place count 570 transition count 1181
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 417 place count 570 transition count 1109
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 561 place count 498 transition count 1109
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 605 place count 454 transition count 938
Iterating global reduction 3 with 44 rules applied. Total rules applied 649 place count 454 transition count 938
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 651 place count 454 transition count 936
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 651 place count 454 transition count 931
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 661 place count 449 transition count 931
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 662 place count 448 transition count 923
Iterating global reduction 4 with 1 rules applied. Total rules applied 663 place count 448 transition count 923
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 664 place count 448 transition count 922
Performed 165 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 5 with 330 rules applied. Total rules applied 994 place count 283 transition count 752
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 999 place count 283 transition count 747
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1018 place count 264 transition count 613
Iterating global reduction 6 with 19 rules applied. Total rules applied 1037 place count 264 transition count 613
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1052 place count 264 transition count 598
Performed 16 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1084 place count 248 transition count 691
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1088 place count 244 transition count 645
Iterating global reduction 7 with 4 rules applied. Total rules applied 1092 place count 244 transition count 645
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 1113 place count 244 transition count 624
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 8 with 23 rules applied. Total rules applied 1136 place count 244 transition count 601
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1145 place count 235 transition count 583
Iterating global reduction 8 with 9 rules applied. Total rules applied 1154 place count 235 transition count 583
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1163 place count 226 transition count 509
Iterating global reduction 8 with 9 rules applied. Total rules applied 1172 place count 226 transition count 509
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1181 place count 226 transition count 500
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1182 place count 225 transition count 499
Applied a total of 1182 rules in 144 ms. Remains 225 /1043 variables (removed 818) and now considering 499/1688 (removed 1189) transitions.
[2026-05-24 13:28:01] [INFO ] Flow matrix only has 481 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1996740165338052146.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13595462195815218448.kers'
[2026-05-24 13:28:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1996740165338052146.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13595462195815218448.kers]
Normalized transition count is 480 out of 481 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 480 rows 225 cols 2350 entries
Finished phase 1 with 156 SingleSign rule and 0 generalized
[2026-05-24 13:28:01] [INFO ] Computed 69 invariants in 6 ms
Computed 69 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-13595462195815218448.kers
Total runtime 7 ms.
[2026-05-24 13:28:02] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-24 13:28:02] [INFO ] Flow matrix only has 481 transitions (discarded 18 similar events)
[2026-05-24 13:28:02] [INFO ] Invariant cache hit.
[2026-05-24 13:28:02] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-24 13:28:02] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2026-05-24 13:28:02] [INFO ] Redundant transitions in 27 ms returned []
Running 446 sub problems to find dead transitions.
[2026-05-24 13:28:02] [INFO ] Flow matrix only has 481 transitions (discarded 18 similar events)
[2026-05-24 13:28:02] [INFO ] Invariant cache hit.
[2026-05-24 13:28:02] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (OVERLAPS) 1/225 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (OVERLAPS) 480/705 variables, 225/294 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/705 variables, 32/326 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/705 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 7 (OVERLAPS) 0/705 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 446 unsolved
No progress, stopping.
After SMT solving in domain Real declared 705/706 variables, and 326 constraints, problems are : Problem set: 0 solved, 446 unsolved in 28669 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 225/225 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (OVERLAPS) 1/225 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (OVERLAPS) 480/705 variables, 225/294 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/705 variables, 32/326 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/705 variables, 446/772 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/705 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 705/706 variables, and 772 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 225/225 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58799ms problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 58800ms
Starting structural reductions in SI_LTL mode, iteration 1 : 225/1043 places, 499/1688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59274 ms. Remains : 225/1043 places, 499/1688 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-02
Stuttering criterion allowed to conclude after 238 steps with 0 reset in 9 ms.
FORMULA DLCround-PT-04b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-02 finished in 59389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||G(p1))))||(p1 U X(G(p2)))))'
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 1688/1688 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1025 transition count 1662
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1025 transition count 1662
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 1015 transition count 1652
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 1015 transition count 1652
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 1015 transition count 1651
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 1013 transition count 1649
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 1013 transition count 1649
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1012 transition count 1648
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1012 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1011 transition count 1647
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1011 transition count 1647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1010 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1010 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1009 transition count 1645
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1009 transition count 1645
Applied a total of 69 rules in 200 ms. Remains 1009 /1043 variables (removed 34) and now considering 1645/1688 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13105711605364850882.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13866770516019006413.kers'
[2026-05-24 13:29:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13105711605364850882.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13866770516019006413.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1645 rows 1009 cols 4638 entries
Finished phase 1 with 940 SingleSign rule and 0 generalized
[2026-05-24 13:29:01] [INFO ] Computed 69 invariants in 6 ms
Computed 69 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-13866770516019006413.kers
Total runtime 11 ms.
[2026-05-24 13:29:01] [INFO ] Implicit Places using invariants in 382 ms returned []
[2026-05-24 13:29:01] [INFO ] Invariant cache hit.
[2026-05-24 13:29:02] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
Running 1644 sub problems to find dead transitions.
[2026-05-24 13:29:02] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1008/2654 variables, and 0 constraints, problems are : Problem set: 0 solved, 1644 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1009 constraints, PredecessorRefiner: 1644/1644 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1008/2654 variables, and 0 constraints, problems are : Problem set: 0 solved, 1644 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1009 constraints, PredecessorRefiner: 0/1644 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60369ms problems are : Problem set: 0 solved, 1644 unsolved
Search for dead transitions found 0 dead transitions in 60373ms
Starting structural reductions in LTL mode, iteration 1 : 1009/1043 places, 1645/1688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61748 ms. Remains : 1009/1043 places, 1645/1688 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||G(p1))))||(p1 U X(G(p2)))))'
Stuttering acceptance computed with spot in 369 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 318 ms.
Product exploration explored 100000 steps with 33333 reset in 315 ms.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 12 factoid took 19 ms. Proved property starting from automaton with 11 states, 25 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 56 ms.
FORMULA DLCround-PT-04b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-04b-LTLFireability-03 finished in 62859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0) U p1)))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 1688/1688 transitions.
Graph (trivial) has 965 edges and 1043 vertex of which 298 / 1043 are part of one of the 24 SCC in 2 ms
Free SCC test removed 274 places
Ensure Unique test removed 298 transitions
Reduce isomorphic transitions removed 298 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 181 transitions
Trivial Post-agglo rules discarded 181 transitions
Performed 181 trivial Post agglomeration. Transition count delta: 181
Iterating post reduction 0 with 181 rules applied. Total rules applied 182 place count 768 transition count 1208
Reduce places removed 181 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 210 rules applied. Total rules applied 392 place count 587 transition count 1179
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 411 place count 568 transition count 1179
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 411 place count 568 transition count 1108
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 553 place count 497 transition count 1108
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 596 place count 454 transition count 938
Iterating global reduction 3 with 43 rules applied. Total rules applied 639 place count 454 transition count 938
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 641 place count 454 transition count 936
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 641 place count 454 transition count 932
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 649 place count 450 transition count 932
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 650 place count 449 transition count 924
Iterating global reduction 4 with 1 rules applied. Total rules applied 651 place count 449 transition count 924
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 652 place count 449 transition count 923
Performed 164 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 164 places in 0 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 5 with 328 rules applied. Total rules applied 980 place count 285 transition count 754
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 985 place count 285 transition count 749
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1003 place count 267 transition count 623
Iterating global reduction 6 with 18 rules applied. Total rules applied 1021 place count 267 transition count 623
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1036 place count 267 transition count 608
Performed 16 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1068 place count 251 transition count 703
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1072 place count 247 transition count 659
Iterating global reduction 7 with 4 rules applied. Total rules applied 1076 place count 247 transition count 659
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 1098 place count 247 transition count 637
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 8 with 24 rules applied. Total rules applied 1122 place count 247 transition count 613
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1131 place count 238 transition count 595
Iterating global reduction 8 with 9 rules applied. Total rules applied 1140 place count 238 transition count 595
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1149 place count 229 transition count 519
Iterating global reduction 8 with 9 rules applied. Total rules applied 1158 place count 229 transition count 519
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1167 place count 229 transition count 510
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1168 place count 228 transition count 509
Applied a total of 1168 rules in 116 ms. Remains 228 /1043 variables (removed 815) and now considering 509/1688 (removed 1179) transitions.
[2026-05-24 13:30:04] [INFO ] Flow matrix only has 490 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13895846977845763963.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1217035932979719335.kers'
[2026-05-24 13:30:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13895846977845763963.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1217035932979719335.kers]
Normalized transition count is 489 out of 490 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 489 rows 228 cols 2382 entries
Finished phase 1 with 159 SingleSign rule and 0 generalized
[2026-05-24 13:30:04] [INFO ] Computed 69 invariants in 1 ms
Computed 69 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1217035932979719335.kers
Total runtime 5 ms.
[2026-05-24 13:30:04] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-24 13:30:04] [INFO ] Flow matrix only has 490 transitions (discarded 19 similar events)
[2026-05-24 13:30:04] [INFO ] Invariant cache hit.
[2026-05-24 13:30:04] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-24 13:30:04] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2026-05-24 13:30:04] [INFO ] Redundant transitions in 9 ms returned []
Running 456 sub problems to find dead transitions.
[2026-05-24 13:30:04] [INFO ] Flow matrix only has 490 transitions (discarded 19 similar events)
[2026-05-24 13:30:04] [INFO ] Invariant cache hit.
[2026-05-24 13:30:04] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 4 (OVERLAPS) 489/717 variables, 228/297 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/717 variables, 33/330 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/717 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 7 (OVERLAPS) 0/717 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 456 unsolved
No progress, stopping.
After SMT solving in domain Real declared 717/718 variables, and 330 constraints, problems are : Problem set: 0 solved, 456 unsolved in 28942 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 228/228 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 4 (OVERLAPS) 489/717 variables, 228/297 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/717 variables, 33/330 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/717 variables, 456/786 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/717 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 717/718 variables, and 786 constraints, problems are : Problem set: 0 solved, 456 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 228/228 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59071ms problems are : Problem set: 0 solved, 456 unsolved
Search for dead transitions found 0 dead transitions in 59071ms
Starting structural reductions in SI_LTL mode, iteration 1 : 228/1043 places, 509/1688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59572 ms. Remains : 228/1043 places, 509/1688 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0) U p1)))'
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-04b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-04 finished in 59648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0||F(p1)))||G(F(p2))||(F(p2)&&X(!p3)))))'
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 1688/1688 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1026 transition count 1663
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1026 transition count 1663
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 1016 transition count 1653
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 1016 transition count 1653
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 1016 transition count 1652
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 1013 transition count 1649
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 1013 transition count 1649
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1012 transition count 1648
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1012 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1011 transition count 1647
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1011 transition count 1647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1010 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1010 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1009 transition count 1645
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1009 transition count 1645
Applied a total of 69 rules in 154 ms. Remains 1009 /1043 variables (removed 34) and now considering 1645/1688 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12547236680102560090.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4750001880844931964.kers'
[2026-05-24 13:31:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12547236680102560090.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4750001880844931964.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1645 rows 1009 cols 4638 entries
Finished phase 1 with 940 SingleSign rule and 0 generalized
[2026-05-24 13:31:03] [INFO ] Computed 69 invariants in 6 ms
Computed 69 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-4750001880844931964.kers
Total runtime 11 ms.
[2026-05-24 13:31:04] [INFO ] Implicit Places using invariants in 379 ms returned []
[2026-05-24 13:31:04] [INFO ] Invariant cache hit.
[2026-05-24 13:31:04] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
Running 1644 sub problems to find dead transitions.
[2026-05-24 13:31:04] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1008/2654 variables, and 0 constraints, problems are : Problem set: 0 solved, 1644 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1009 constraints, PredecessorRefiner: 1644/1644 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1644 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1008/2654 variables, and 0 constraints, problems are : Problem set: 0 solved, 1644 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1009 constraints, PredecessorRefiner: 0/1644 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60357ms problems are : Problem set: 0 solved, 1644 unsolved
Search for dead transitions found 0 dead transitions in 60361ms
Starting structural reductions in LTL mode, iteration 1 : 1009/1043 places, 1645/1688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61650 ms. Remains : 1009/1043 places, 1645/1688 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0||F(p1)))||G(F(p2))||(F(p2)&&X(p3)))))'
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 341 ms.
Product exploration explored 100000 steps with 50000 reset in 358 ms.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 17 factoid took 21 ms. Proved property starting from automaton with 4 states, 10 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 49 ms.
FORMULA DLCround-PT-04b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-04b-LTLFireability-05 finished in 62663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U (p1 U p2))&&X(X(p3)))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 1688/1688 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1025 transition count 1662
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1025 transition count 1662
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 1015 transition count 1652
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 1015 transition count 1652
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 1015 transition count 1651
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 1013 transition count 1649
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 1013 transition count 1649
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1012 transition count 1648
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1012 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1011 transition count 1647
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1011 transition count 1647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1010 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1010 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1009 transition count 1645
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1009 transition count 1645
Applied a total of 69 rules in 187 ms. Remains 1009 /1043 variables (removed 34) and now considering 1645/1688 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8057642954739273568.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5772087429986942976.kers'
[2026-05-24 13:32:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8057642954739273568.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5772087429986942976.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1645 rows 1009 cols 4638 entries
Finished phase 1 with 940 SingleSign rule and 0 generalized
[2026-05-24 13:32:06] [INFO ] Computed 69 invariants in 6 ms
Computed 69 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-5772087429986942976.kers
Total runtime 11 ms.
[2026-05-24 13:32:06] [INFO ] Implicit Places using invariants in 356 ms returned []
[2026-05-24 13:32:06] [INFO ] Invariant cache hit.
[2026-05-24 13:32:07] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 1009/1043 places, 1645/1688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1342 ms. Remains : 1009/1043 places, 1645/1688 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U (p1 U p2))&&X(X(p3)))))'
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (NOT p0), (NOT p2), (NOT p2), (NOT p3), (NOT p3)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 60 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-04b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-06 finished in 1738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 1688/1688 transitions.
Graph (trivial) has 968 edges and 1043 vertex of which 298 / 1043 are part of one of the 24 SCC in 3 ms
Free SCC test removed 274 places
Ensure Unique test removed 298 transitions
Reduce isomorphic transitions removed 298 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 183 transitions
Trivial Post-agglo rules discarded 183 transitions
Performed 183 trivial Post agglomeration. Transition count delta: 183
Iterating post reduction 0 with 183 rules applied. Total rules applied 184 place count 768 transition count 1206
Reduce places removed 183 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 212 rules applied. Total rules applied 396 place count 585 transition count 1177
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 415 place count 566 transition count 1177
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 415 place count 566 transition count 1106
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 557 place count 495 transition count 1106
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 601 place count 451 transition count 935
Iterating global reduction 3 with 44 rules applied. Total rules applied 645 place count 451 transition count 935
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 647 place count 451 transition count 933
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 647 place count 451 transition count 928
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 657 place count 446 transition count 928
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 658 place count 445 transition count 920
Iterating global reduction 4 with 1 rules applied. Total rules applied 659 place count 445 transition count 920
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 660 place count 445 transition count 919
Performed 163 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 163 places in 0 ms
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 5 with 326 rules applied. Total rules applied 986 place count 282 transition count 751
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 991 place count 282 transition count 746
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1009 place count 264 transition count 620
Iterating global reduction 6 with 18 rules applied. Total rules applied 1027 place count 264 transition count 620
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1042 place count 264 transition count 605
Performed 15 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 1072 place count 249 transition count 694
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1075 place count 246 transition count 660
Iterating global reduction 7 with 3 rules applied. Total rules applied 1078 place count 246 transition count 660
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 1094 place count 246 transition count 644
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 1122 place count 246 transition count 616
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1131 place count 237 transition count 598
Iterating global reduction 8 with 9 rules applied. Total rules applied 1140 place count 237 transition count 598
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1149 place count 228 transition count 524
Iterating global reduction 8 with 9 rules applied. Total rules applied 1158 place count 228 transition count 524
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1167 place count 228 transition count 515
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1168 place count 227 transition count 514
Applied a total of 1168 rules in 107 ms. Remains 227 /1043 variables (removed 816) and now considering 514/1688 (removed 1174) transitions.
[2026-05-24 13:32:08] [INFO ] Flow matrix only has 495 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8368694285170148473.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16122673990946247347.kers'
[2026-05-24 13:32:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8368694285170148473.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16122673990946247347.kers]
Normalized transition count is 494 out of 495 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 494 rows 227 cols 2404 entries
Finished phase 1 with 158 SingleSign rule and 0 generalized
[2026-05-24 13:32:08] [INFO ] Computed 69 invariants in 2 ms
Computed 69 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16122673990946247347.kers
Total runtime 5 ms.
[2026-05-24 13:32:08] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-24 13:32:08] [INFO ] Flow matrix only has 495 transitions (discarded 19 similar events)
[2026-05-24 13:32:08] [INFO ] Invariant cache hit.
[2026-05-24 13:32:08] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-24 13:32:08] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2026-05-24 13:32:08] [INFO ] Redundant transitions in 4 ms returned []
Running 461 sub problems to find dead transitions.
[2026-05-24 13:32:08] [INFO ] Flow matrix only has 495 transitions (discarded 19 similar events)
[2026-05-24 13:32:08] [INFO ] Invariant cache hit.
[2026-05-24 13:32:08] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 1/227 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 494/721 variables, 227/296 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/721 variables, 33/329 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/721 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (OVERLAPS) 0/721 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Real declared 721/722 variables, and 329 constraints, problems are : Problem set: 0 solved, 461 unsolved in 28658 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 227/227 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 1/227 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 494/721 variables, 227/296 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/721 variables, 33/329 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/721 variables, 461/790 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/721 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 721/722 variables, and 790 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 227/227 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58785ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 58785ms
Starting structural reductions in SI_LTL mode, iteration 1 : 227/1043 places, 514/1688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59213 ms. Remains : 227/1043 places, 514/1688 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-07 finished in 59384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G((p1&&X(G((G(p3)||p2))))))||p0))))'
Support contains 4 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 1688/1688 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1025 transition count 1669
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1025 transition count 1669
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 47 place count 1014 transition count 1658
Iterating global reduction 0 with 11 rules applied. Total rules applied 58 place count 1014 transition count 1658
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 1014 transition count 1657
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 1011 transition count 1654
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 1011 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1010 transition count 1653
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1010 transition count 1653
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1009 transition count 1652
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1009 transition count 1652
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1008 transition count 1651
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1008 transition count 1651
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 1007 transition count 1650
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 1007 transition count 1650
Applied a total of 73 rules in 169 ms. Remains 1007 /1043 variables (removed 36) and now considering 1650/1688 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5121687620330082621.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15982373602299380651.kers'
[2026-05-24 13:33:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5121687620330082621.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15982373602299380651.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1650 rows 1007 cols 4664 entries
Finished phase 1 with 938 SingleSign rule and 0 generalized
[2026-05-24 13:33:07] [INFO ] Computed 69 invariants in 15 ms
Computed 69 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-15982373602299380651.kers
Total runtime 20 ms.
[2026-05-24 13:33:07] [INFO ] Implicit Places using invariants in 357 ms returned []
[2026-05-24 13:33:07] [INFO ] Invariant cache hit.
[2026-05-24 13:33:08] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
Running 1649 sub problems to find dead transitions.
[2026-05-24 13:33:08] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2657 variables, and 0 constraints, problems are : Problem set: 0 solved, 1649 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1007 constraints, PredecessorRefiner: 1649/1649 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1649 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2657 variables, and 0 constraints, problems are : Problem set: 0 solved, 1649 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1007 constraints, PredecessorRefiner: 0/1649 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60385ms problems are : Problem set: 0 solved, 1649 unsolved
Search for dead transitions found 0 dead transitions in 60389ms
Starting structural reductions in LTL mode, iteration 1 : 1007/1043 places, 1650/1688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61701 ms. Remains : 1007/1043 places, 1650/1688 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G((p1&&X(G((G(p3)||p2))))))||p0))))'
Stuttering acceptance computed with spot in 182 ms :[true, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p3) (NOT p1)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 35156 steps with 1 reset in 113 ms.
FORMULA DLCround-PT-04b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-08 finished in 62038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&F(p1)&&F(p2)))'
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 1688/1688 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1026 transition count 1663
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1026 transition count 1663
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 1016 transition count 1653
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 1016 transition count 1653
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 1016 transition count 1652
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 1013 transition count 1649
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 1013 transition count 1649
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1012 transition count 1648
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1012 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1011 transition count 1647
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1011 transition count 1647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1010 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1010 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1009 transition count 1645
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1009 transition count 1645
Applied a total of 69 rules in 151 ms. Remains 1009 /1043 variables (removed 34) and now considering 1645/1688 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9141904668087462249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1899651130869879429.kers'
[2026-05-24 13:34:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9141904668087462249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1899651130869879429.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1645 rows 1009 cols 4638 entries
Finished phase 1 with 940 SingleSign rule and 0 generalized
[2026-05-24 13:34:09] [INFO ] Computed 69 invariants in 6 ms
Computed 69 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1899651130869879429.kers
Total runtime 10 ms.
[2026-05-24 13:34:09] [INFO ] Implicit Places using invariants in 328 ms returned []
[2026-05-24 13:34:10] [INFO ] Invariant cache hit.
[2026-05-24 13:34:10] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
Running 1644 sub problems to find dead transitions.
[2026-05-24 13:34:10] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1008/2654 variables, and 0 constraints, problems are : Problem set: 0 solved, 1644 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1009 constraints, PredecessorRefiner: 1644/1644 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1644 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1008/2654 variables, and 0 constraints, problems are : Problem set: 0 solved, 1644 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1009 constraints, PredecessorRefiner: 0/1644 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60361ms problems are : Problem set: 0 solved, 1644 unsolved
Search for dead transitions found 0 dead transitions in 60364ms
Starting structural reductions in LTL mode, iteration 1 : 1009/1043 places, 1645/1688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61583 ms. Remains : 1009/1043 places, 1645/1688 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&F(p1)&&F(p2)))'
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), (NOT p0), true]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-10
Product exploration explored 100000 steps with 77 reset in 317 ms.
Product exploration explored 100000 steps with 82 reset in 374 ms.
Computed a total of 134 stabilizing places and 134 stable transitions
Computed a total of 134 stabilizing places and 134 stable transitions
Detected a total of 134/1009 stabilizing places and 134/1645 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 7 factoid took 52 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 453 ms. (88 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
[2026-05-24 13:35:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 909/1009 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1009 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1645/2654 variables, 1009/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2654 variables, 1/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2654 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2654 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2654/2654 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 880 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 1009/1009 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 909/1009 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1009 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1645/2654 variables, 1009/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2654 variables, 1/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2654 variables, 1/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2654 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2654 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2654/2654 variables, and 1080 constraints, problems are : Problem set: 0 solved, 1 unsolved in 964 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 1009/1009 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1866ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 326 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=163 )
Parikh walk visited 1 properties in 5 ms.
Knowledge based reduction with 7 factoid took 155 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), false, false, false]
[2026-05-24 13:35:14] [INFO ] Invariant cache hit.
[2026-05-24 13:35:15] [INFO ] [Real]Absence check using 69 positive place invariants in 243 ms returned sat
[2026-05-24 13:35:20] [INFO ] [Real]Absence check using state equation in 5696 ms returned sat
[2026-05-24 13:35:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 13:35:21] [INFO ] [Nat]Absence check using 69 positive place invariants in 172 ms returned sat
[2026-05-24 13:35:25] [INFO ] [Nat]Absence check using state equation in 3829 ms returned sat
[2026-05-24 13:35:25] [INFO ] Computed and/alt/rep : 1599/3105/1599 causal constraints (skipped 45 transitions) in 70 ms.
[2026-05-24 13:35:36] [INFO ] Added : 500 causal constraints over 100 iterations in 10413 ms. Result :unknown
Could not prove EG (NOT p1)
[2026-05-24 13:35:36] [INFO ] Invariant cache hit.
[2026-05-24 13:35:36] [INFO ] [Real]Absence check using 69 positive place invariants in 255 ms returned sat
[2026-05-24 13:35:42] [INFO ] [Real]Absence check using state equation in 5786 ms returned sat
[2026-05-24 13:35:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 13:35:43] [INFO ] [Nat]Absence check using 69 positive place invariants in 223 ms returned sat
[2026-05-24 13:35:48] [INFO ] [Nat]Absence check using state equation in 4990 ms returned sat
[2026-05-24 13:35:48] [INFO ] Computed and/alt/rep : 1599/3105/1599 causal constraints (skipped 45 transitions) in 75 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:593)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeFacts.computeEGknowledge(KnowledgeFacts.java:231)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:52)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:248)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-24 13:35:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Knowledge-based reduction took 45642 ms.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), false, false, false]
Support contains 2 out of 1009 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1009/1009 places, 1645/1645 transitions.
Graph (trivial) has 933 edges and 1009 vertex of which 289 / 1009 are part of one of the 24 SCC in 1 ms
Free SCC test removed 265 places
Ensure Unique test removed 286 transitions
Reduce isomorphic transitions removed 286 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 167 rules applied. Total rules applied 168 place count 743 transition count 1191
Reduce places removed 167 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 194 rules applied. Total rules applied 362 place count 576 transition count 1164
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 380 place count 558 transition count 1164
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 73 Pre rules applied. Total rules applied 380 place count 558 transition count 1091
Deduced a syphon composed of 73 places in 2 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 526 place count 485 transition count 1091
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 562 place count 449 transition count 903
Iterating global reduction 3 with 36 rules applied. Total rules applied 598 place count 449 transition count 903
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 601 place count 449 transition count 900
Performed 165 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 4 with 330 rules applied. Total rules applied 931 place count 284 transition count 730
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 937 place count 284 transition count 724
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 951 place count 270 transition count 624
Iterating global reduction 5 with 14 rules applied. Total rules applied 965 place count 270 transition count 624
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 979 place count 270 transition count 610
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 981 place count 269 transition count 609
Performed 18 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 1017 place count 251 transition count 712
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1022 place count 246 transition count 654
Iterating global reduction 6 with 5 rules applied. Total rules applied 1027 place count 246 transition count 654
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1048 place count 246 transition count 633
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 7 with 26 rules applied. Total rules applied 1074 place count 246 transition count 607
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1084 place count 236 transition count 587
Iterating global reduction 7 with 10 rules applied. Total rules applied 1094 place count 236 transition count 587
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1104 place count 226 transition count 505
Iterating global reduction 7 with 10 rules applied. Total rules applied 1114 place count 226 transition count 505
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1124 place count 226 transition count 495
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1125 place count 225 transition count 494
Applied a total of 1125 rules in 101 ms. Remains 225 /1009 variables (removed 784) and now considering 494/1645 (removed 1151) transitions.
[2026-05-24 13:35:57] [INFO ] Flow matrix only has 473 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11385717522665483883.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7161287980375967459.kers'
[2026-05-24 13:35:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11385717522665483883.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7161287980375967459.kers]
Normalized transition count is 472 out of 473 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 472 rows 225 cols 2316 entries
Finished phase 1 with 156 SingleSign rule and 0 generalized
[2026-05-24 13:35:57] [INFO ] Computed 69 invariants in 1 ms
Computed 69 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7161287980375967459.kers
Total runtime 2 ms.
[2026-05-24 13:35:58] [INFO ] Implicit Places using invariants in 220 ms returned []
[2026-05-24 13:35:58] [INFO ] Flow matrix only has 473 transitions (discarded 21 similar events)
[2026-05-24 13:35:58] [INFO ] Invariant cache hit.
[2026-05-24 13:35:58] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-24 13:35:58] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
[2026-05-24 13:35:58] [INFO ] Redundant transitions in 3 ms returned []
Running 441 sub problems to find dead transitions.
[2026-05-24 13:35:58] [INFO ] Flow matrix only has 473 transitions (discarded 21 similar events)
[2026-05-24 13:35:58] [INFO ] Invariant cache hit.
[2026-05-24 13:35:58] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (OVERLAPS) 1/225 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 4 (OVERLAPS) 472/697 variables, 225/294 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 33/327 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 7 (OVERLAPS) 0/697 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 441 unsolved
No progress, stopping.
After SMT solving in domain Real declared 697/698 variables, and 327 constraints, problems are : Problem set: 0 solved, 441 unsolved in 27124 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 225/225 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (OVERLAPS) 1/225 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 4 (OVERLAPS) 472/697 variables, 225/294 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 33/327 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 441/768 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/697 variables, 1/769 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 697/698 variables, and 769 constraints, problems are : Problem set: 0 solved, 441 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 225/225 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 57270ms problems are : Problem set: 0 solved, 441 unsolved
Search for dead transitions found 0 dead transitions in 57271ms
Starting structural reductions in SI_LTL mode, iteration 1 : 225/1009 places, 494/1645 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58130 ms. Remains : 225/1009 places, 494/1645 transitions.
Computed a total of 3 stabilizing places and 19 stable transitions
Computed a total of 3 stabilizing places and 19 stable transitions
Detected a total of 3/225 stabilizing places and 19/494 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 8 factoid took 134 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
RANDOM walk for 30093 steps (9 resets) in 454 ms. (66 steps per ms) remains 0/5 properties
Knowledge based reduction with 8 factoid took 203 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), false, false, false]
[2026-05-24 13:36:56] [INFO ] Flow matrix only has 473 transitions (discarded 21 similar events)
[2026-05-24 13:36:56] [INFO ] Invariant cache hit.
[2026-05-24 13:36:56] [INFO ] [Real]Absence check using 69 positive place invariants in 15 ms returned sat
[2026-05-24 13:36:57] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2026-05-24 13:36:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 13:36:57] [INFO ] [Nat]Absence check using 69 positive place invariants in 15 ms returned sat
[2026-05-24 13:36:57] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2026-05-24 13:36:57] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-24 13:36:57] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2026-05-24 13:36:57] [INFO ] Computed and/alt/rep : 289/711/289 causal constraints (skipped 139 transitions) in 22 ms.
[2026-05-24 13:36:57] [INFO ] Added : 3 causal constraints over 1 iterations in 65 ms. Result :sat
Could not prove EG (NOT p1)
[2026-05-24 13:36:57] [INFO ] Flow matrix only has 473 transitions (discarded 21 similar events)
[2026-05-24 13:36:57] [INFO ] Invariant cache hit.
[2026-05-24 13:36:57] [INFO ] [Real]Absence check using 69 positive place invariants in 14 ms returned sat
[2026-05-24 13:36:57] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2026-05-24 13:36:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 13:36:57] [INFO ] [Nat]Absence check using 69 positive place invariants in 14 ms returned sat
[2026-05-24 13:36:58] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2026-05-24 13:36:58] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-24 13:36:58] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2026-05-24 13:36:58] [INFO ] Computed and/alt/rep : 289/711/289 causal constraints (skipped 139 transitions) in 21 ms.
[2026-05-24 13:36:58] [INFO ] Added : 0 causal constraints over 0 iterations in 47 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 2232 ms.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), false, false, false]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), false, false, false]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-10 finished in 169086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 1688/1688 transitions.
Graph (trivial) has 970 edges and 1043 vertex of which 298 / 1043 are part of one of the 24 SCC in 0 ms
Free SCC test removed 274 places
Ensure Unique test removed 298 transitions
Reduce isomorphic transitions removed 298 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 182 transitions
Trivial Post-agglo rules discarded 182 transitions
Performed 182 trivial Post agglomeration. Transition count delta: 182
Iterating post reduction 0 with 182 rules applied. Total rules applied 183 place count 768 transition count 1207
Reduce places removed 182 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 211 rules applied. Total rules applied 394 place count 586 transition count 1178
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 413 place count 567 transition count 1178
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 413 place count 567 transition count 1107
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 555 place count 496 transition count 1107
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 600 place count 451 transition count 928
Iterating global reduction 3 with 45 rules applied. Total rules applied 645 place count 451 transition count 928
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 647 place count 451 transition count 926
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 647 place count 451 transition count 921
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 657 place count 446 transition count 921
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 658 place count 445 transition count 913
Iterating global reduction 4 with 1 rules applied. Total rules applied 659 place count 445 transition count 913
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 660 place count 445 transition count 912
Performed 163 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 163 places in 0 ms
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 5 with 326 rules applied. Total rules applied 986 place count 282 transition count 744
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 991 place count 282 transition count 739
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1009 place count 264 transition count 613
Iterating global reduction 6 with 18 rules applied. Total rules applied 1027 place count 264 transition count 613
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1042 place count 264 transition count 598
Performed 16 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1074 place count 248 transition count 691
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1078 place count 244 transition count 645
Iterating global reduction 7 with 4 rules applied. Total rules applied 1082 place count 244 transition count 645
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 1103 place count 244 transition count 624
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 8 with 23 rules applied. Total rules applied 1126 place count 244 transition count 601
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1135 place count 235 transition count 583
Iterating global reduction 8 with 9 rules applied. Total rules applied 1144 place count 235 transition count 583
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1153 place count 226 transition count 509
Iterating global reduction 8 with 9 rules applied. Total rules applied 1162 place count 226 transition count 509
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1171 place count 226 transition count 500
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1172 place count 225 transition count 499
Applied a total of 1172 rules in 95 ms. Remains 225 /1043 variables (removed 818) and now considering 499/1688 (removed 1189) transitions.
[2026-05-24 13:36:58] [INFO ] Flow matrix only has 480 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5714064614093297734.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5583049080438181116.kers'
[2026-05-24 13:36:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5714064614093297734.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5583049080438181116.kers]
Normalized transition count is 479 out of 480 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 479 rows 225 cols 2348 entries
Finished phase 1 with 156 SingleSign rule and 0 generalized
[2026-05-24 13:36:58] [INFO ] Computed 69 invariants in 1 ms
Computed 69 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-5583049080438181116.kers
Total runtime 15 ms.
[2026-05-24 13:36:59] [INFO ] Implicit Places using invariants in 582 ms returned []
[2026-05-24 13:36:59] [INFO ] Flow matrix only has 480 transitions (discarded 19 similar events)
[2026-05-24 13:36:59] [INFO ] Invariant cache hit.
[2026-05-24 13:36:59] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-24 13:36:59] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2026-05-24 13:36:59] [INFO ] Redundant transitions in 3 ms returned []
Running 446 sub problems to find dead transitions.
[2026-05-24 13:36:59] [INFO ] Flow matrix only has 480 transitions (discarded 19 similar events)
[2026-05-24 13:36:59] [INFO ] Invariant cache hit.
[2026-05-24 13:36:59] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (OVERLAPS) 1/225 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (OVERLAPS) 479/704 variables, 225/294 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/704 variables, 32/326 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/704 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 7 (OVERLAPS) 0/704 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 446 unsolved
No progress, stopping.
After SMT solving in domain Real declared 704/705 variables, and 326 constraints, problems are : Problem set: 0 solved, 446 unsolved in 27802 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 225/225 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (OVERLAPS) 1/225 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (OVERLAPS) 479/704 variables, 225/294 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/704 variables, 32/326 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/704 variables, 446/772 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/704 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/705 variables, and 772 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 225/225 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57900ms problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 57901ms
Starting structural reductions in SI_LTL mode, iteration 1 : 225/1043 places, 499/1688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58819 ms. Remains : 225/1043 places, 499/1688 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-12
Stuttering criterion allowed to conclude after 440 steps with 0 reset in 11 ms.
FORMULA DLCround-PT-04b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-12 finished in 58906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F((p0&&X(X(X(F(p1)))))))))))'
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 1688/1688 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1025 transition count 1662
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1025 transition count 1662
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 47 place count 1014 transition count 1651
Iterating global reduction 0 with 11 rules applied. Total rules applied 58 place count 1014 transition count 1651
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 1014 transition count 1650
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 1011 transition count 1647
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 1011 transition count 1647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1010 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1010 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1009 transition count 1645
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1009 transition count 1645
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1008 transition count 1644
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1008 transition count 1644
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 1007 transition count 1643
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 1007 transition count 1643
Applied a total of 73 rules in 156 ms. Remains 1007 /1043 variables (removed 36) and now considering 1643/1688 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14468989026736220488.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4665766735997509498.kers'
[2026-05-24 13:37:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14468989026736220488.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4665766735997509498.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1643 rows 1007 cols 4634 entries
Finished phase 1 with 938 SingleSign rule and 0 generalized
[2026-05-24 13:37:57] [INFO ] Computed 69 invariants in 15 ms
Computed 69 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-4665766735997509498.kers
Total runtime 20 ms.
[2026-05-24 13:37:58] [INFO ] Implicit Places using invariants in 359 ms returned []
[2026-05-24 13:37:58] [INFO ] Invariant cache hit.
[2026-05-24 13:37:58] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
Running 1642 sub problems to find dead transitions.
[2026-05-24 13:37:58] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2650 variables, and 0 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1007 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2650 variables, and 0 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1007 constraints, PredecessorRefiner: 0/1642 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60367ms problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 60370ms
Starting structural reductions in LTL mode, iteration 1 : 1007/1043 places, 1643/1688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61680 ms. Remains : 1007/1043 places, 1643/1688 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F((p0&&X(X(X(F(p1)))))))))))'
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-13
Product exploration explored 100000 steps with 20 reset in 286 ms.
Product exploration explored 100000 steps with 17 reset in 352 ms.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 23175 steps (4 resets) in 141 ms. (163 steps per ms) remains 0/2 properties
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
[2026-05-24 13:39:00] [INFO ] Invariant cache hit.
[2026-05-24 13:39:01] [INFO ] [Real]Absence check using 69 positive place invariants in 11 ms returned unsat
Proved EG (NOT p0) asserting that LTL formula F !(NOT p0) is false.
Negative knowledge disproves property using: (F p0)
Knowledge-based reduction took 918 ms.
FORMULA DLCround-PT-04b-LTLFireability-13 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property DLCround-PT-04b-LTLFireability-13 finished in 63557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p0) U ((p1&&X(p0))||X(G(p0)))) U (G((X(p0) U ((p1&&X(p0))||X(G(p0)))))||((X(p0) U ((p1&&X(p0))||X(G(p0))))&&X((G(p1)||(p1&&F((p0 U (p2||G(p0))))))))))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 1688/1688 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1025 transition count 1662
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1025 transition count 1662
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 1015 transition count 1652
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 1015 transition count 1652
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 1015 transition count 1651
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 1012 transition count 1648
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 1012 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1011 transition count 1647
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1011 transition count 1647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1010 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1010 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1009 transition count 1645
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1009 transition count 1645
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1008 transition count 1644
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1008 transition count 1644
Applied a total of 71 rules in 158 ms. Remains 1008 /1043 variables (removed 35) and now considering 1644/1688 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8832870846082999909.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6754447095623409185.kers'
[2026-05-24 13:39:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8832870846082999909.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6754447095623409185.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1644 rows 1008 cols 4636 entries
Finished phase 1 with 939 SingleSign rule and 0 generalized
[2026-05-24 13:39:01] [INFO ] Computed 69 invariants in 16 ms
Computed 69 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-6754447095623409185.kers
Total runtime 21 ms.
[2026-05-24 13:39:01] [INFO ] Implicit Places using invariants in 367 ms returned []
[2026-05-24 13:39:01] [INFO ] Invariant cache hit.
[2026-05-24 13:39:02] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
Running 1643 sub problems to find dead transitions.
[2026-05-24 13:39:02] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/2652 variables, and 0 constraints, problems are : Problem set: 0 solved, 1643 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1008 constraints, PredecessorRefiner: 1643/1643 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1643 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/2652 variables, and 0 constraints, problems are : Problem set: 0 solved, 1643 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1008 constraints, PredecessorRefiner: 0/1643 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60373ms problems are : Problem set: 0 solved, 1643 unsolved
Search for dead transitions found 0 dead transitions in 60377ms
Starting structural reductions in LTL mode, iteration 1 : 1008/1043 places, 1644/1688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61656 ms. Remains : 1008/1043 places, 1644/1688 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p0) U (X(G(p0))||(p1&&X(p0)))) U (G((X(p0) U ((p1&&X(p0))||X(G(p0)))))||((X(p0) U ((p1&&X(p0))||X(G(p0))))&&X((G(p1)||(p1&&F((p0 U (p2||G(p0))))))))))))'
Stuttering acceptance computed with spot in 303 ms :[(NOT p0), false, (NOT p0), false, (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 317 ms.
Product exploration explored 100000 steps with 50000 reset in 347 ms.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 17 factoid took 10 ms. Proved property starting from automaton with 8 states, 33 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 28 ms.
FORMULA DLCround-PT-04b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-04b-LTLFireability-14 finished in 62707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(G(p1)))))'
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 1688/1688 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1026 transition count 1663
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1026 transition count 1663
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 1017 transition count 1654
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 1017 transition count 1654
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 1017 transition count 1653
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 1014 transition count 1650
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 1014 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1013 transition count 1649
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1013 transition count 1649
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1012 transition count 1648
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1012 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1011 transition count 1647
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1011 transition count 1647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1010 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1010 transition count 1646
Applied a total of 67 rules in 234 ms. Remains 1010 /1043 variables (removed 33) and now considering 1646/1688 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1519976773266370597.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12109206874031204623.kers'
[2026-05-24 13:40:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1519976773266370597.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12109206874031204623.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1646 rows 1010 cols 4640 entries
Finished phase 1 with 941 SingleSign rule and 0 generalized
[2026-05-24 13:40:04] [INFO ] Computed 69 invariants in 12 ms
Computed 69 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-12109206874031204623.kers
Total runtime 14 ms.
[2026-05-24 13:40:04] [INFO ] Implicit Places using invariants in 328 ms returned []
[2026-05-24 13:40:04] [INFO ] Invariant cache hit.
[2026-05-24 13:40:05] [INFO ] Implicit Places using invariants and state equation in 768 ms returned []
Implicit Place search using SMT with State Equation took 1121 ms to find 0 implicit places.
Running 1645 sub problems to find dead transitions.
[2026-05-24 13:40:05] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1009/2656 variables, and 0 constraints, problems are : Problem set: 0 solved, 1645 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 1645/1645 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1645 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/2656 variables, and 0 constraints, problems are : Problem set: 0 solved, 1645 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 0/1645 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60331ms problems are : Problem set: 0 solved, 1645 unsolved
Search for dead transitions found 0 dead transitions in 60334ms
Starting structural reductions in LTL mode, iteration 1 : 1010/1043 places, 1646/1688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61692 ms. Remains : 1010/1043 places, 1646/1688 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(G(p1)))))'
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-15 finished in 61903 ms.
All properties solved by simple procedures.
Total runtime 917570 ms.

BK_STOP 1779630065710

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="DLCround-PT-04b"
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-5973"
echo " Executing tool itstools"
echo " Input is DLCround-PT-04b, 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 r098-tall-177955695600532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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