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.r354-tall-178024402900219.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 SupplyChain-PT-00500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402900219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 7.0K May 27 07:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 27 07:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 07:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 27 07:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 27 10:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 11:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 11:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 07:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 27 07:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 27 07:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 27 07:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 11:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 11:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 6 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 2.1M May 26 18:17 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 SupplyChain-PT-00500-LTLCardinality-00
FORMULA_NAME SupplyChain-PT-00500-LTLCardinality-01
FORMULA_NAME SupplyChain-PT-00500-LTLCardinality-02
FORMULA_NAME SupplyChain-PT-00500-LTLCardinality-03
FORMULA_NAME SupplyChain-PT-00500-LTLCardinality-04
FORMULA_NAME SupplyChain-PT-00500-LTLCardinality-05
FORMULA_NAME SupplyChain-PT-00500-LTLCardinality-06
FORMULA_NAME SupplyChain-PT-00500-LTLCardinality-07
FORMULA_NAME SupplyChain-PT-00500-LTLCardinality-08
FORMULA_NAME SupplyChain-PT-00500-LTLCardinality-09
FORMULA_NAME SupplyChain-PT-00500-LTLCardinality-10
FORMULA_NAME SupplyChain-PT-00500-LTLCardinality-11
FORMULA_NAME SupplyChain-PT-00500-LTLCardinality-12
FORMULA_NAME SupplyChain-PT-00500-LTLCardinality-13
FORMULA_NAME SupplyChain-PT-00500-LTLCardinality-14
FORMULA_NAME SupplyChain-PT-00500-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1780258049444

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SupplyChain-PT-00500
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-31 20:07:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-31 20:07:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 20:07:31] [INFO ] Load time of PNML (sax parser for PT used): 248 ms
[2026-05-31 20:07:31] [INFO ] Transformed 6504 places.
[2026-05-31 20:07:31] [INFO ] Transformed 4003 transitions.
[2026-05-31 20:07:31] [INFO ] Parsed PT model containing 6504 places and 4003 transitions and 18006 arcs in 416 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA SupplyChain-PT-00500-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00500-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00500-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00500-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 6504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6504/6504 places, 4003/4003 transitions.
Ensure Unique test removed 1590 places
Iterating post reduction 0 with 1590 rules applied. Total rules applied 1590 place count 4914 transition count 4003
Applied a total of 1590 rules in 551 ms. Remains 4914 /6504 variables (removed 1590) and now considering 4003/4003 (removed 0) transitions.
Running 3503 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2818218788524941660.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3403333217164023686.kers'
[2026-05-31 20:07:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2818218788524941660.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3403333217164023686.kers]
Normalized transition count is 4002 out of 4003 initially.
Culled 0 columns in 3 ms.
// Phase 1: matrix 4002 rows 4914 cols 13004 entries
Finished phase 1 with 2912 SingleSign rule and 500 generalized
[2026-05-31 20:07:32] [INFO ] Computed 1502 invariants in 34 ms
Computed 1502 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-3403333217164023686.kers
Total runtime 40 ms.
[2026-05-31 20:07:32] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Problem TDEAD1024 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1964 is UNSAT
Problem TDEAD1971 is UNSAT
Problem TDEAD1975 is UNSAT
Problem TDEAD1980 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1988 is UNSAT
Problem TDEAD1993 is UNSAT
Problem TDEAD1997 is UNSAT
Problem TDEAD2003 is UNSAT
Problem TDEAD2010 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2027 is UNSAT
Problem TDEAD2031 is UNSAT
Problem TDEAD2036 is UNSAT
Problem TDEAD2040 is UNSAT
Problem TDEAD2044 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2053 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2066 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2077 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2091 is UNSAT
Problem TDEAD2095 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2131 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2149 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2164 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2184 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2219 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2234 is UNSAT
Problem TDEAD2239 is UNSAT
Problem TDEAD2243 is UNSAT
Problem TDEAD2248 is UNSAT
Problem TDEAD2252 is UNSAT
Problem TDEAD2258 is UNSAT
Problem TDEAD2263 is UNSAT
Problem TDEAD2270 is UNSAT
Problem TDEAD2274 is UNSAT
Problem TDEAD2278 is UNSAT
Problem TDEAD2283 is UNSAT
Problem TDEAD2287 is UNSAT
Problem TDEAD2292 is UNSAT
Problem TDEAD2296 is UNSAT
Problem TDEAD2300 is UNSAT
Problem TDEAD2306 is UNSAT
Problem TDEAD2311 is UNSAT
Problem TDEAD2318 is UNSAT
Problem TDEAD2322 is UNSAT
Problem TDEAD2327 is UNSAT
Problem TDEAD2331 is UNSAT
Problem TDEAD2337 is UNSAT
Problem TDEAD2341 is UNSAT
Problem TDEAD2345 is UNSAT
Problem TDEAD2350 is UNSAT
Problem TDEAD2355 is UNSAT
Problem TDEAD2361 is UNSAT
Problem TDEAD2367 is UNSAT
Problem TDEAD2372 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2389 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2429 is UNSAT
Problem TDEAD2433 is UNSAT
Problem TDEAD2438 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2459 is UNSAT
Problem TDEAD2465 is UNSAT
Problem TDEAD2470 is UNSAT
Problem TDEAD2474 is UNSAT
Problem TDEAD2478 is UNSAT
Problem TDEAD2483 is UNSAT
Problem TDEAD2487 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2496 is UNSAT
Problem TDEAD2504 is UNSAT
Problem TDEAD2509 is UNSAT
Problem TDEAD2516 is UNSAT
Problem TDEAD2520 is UNSAT
Problem TDEAD2525 is UNSAT
Problem TDEAD2529 is UNSAT
Problem TDEAD2533 is UNSAT
Problem TDEAD2538 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2554 is UNSAT
Problem TDEAD2561 is UNSAT
Problem TDEAD2567 is UNSAT
Problem TDEAD2572 is UNSAT
Problem TDEAD2576 is UNSAT
Problem TDEAD2581 is UNSAT
Problem TDEAD2585 is UNSAT
Problem TDEAD2589 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2598 is UNSAT
Problem TDEAD2604 is UNSAT
Problem TDEAD2609 is UNSAT
Problem TDEAD2616 is UNSAT
Problem TDEAD2620 is UNSAT
Problem TDEAD2625 is UNSAT
Problem TDEAD2629 is UNSAT
Problem TDEAD2633 is UNSAT
Problem TDEAD2638 is UNSAT
Problem TDEAD2642 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2670 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2692 is UNSAT
Problem TDEAD2696 is UNSAT
Problem TDEAD2702 is UNSAT
Problem TDEAD2707 is UNSAT
Problem TDEAD2714 is UNSAT
Problem TDEAD2718 is UNSAT
Problem TDEAD2722 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2750 is UNSAT
Problem TDEAD2755 is UNSAT
Problem TDEAD2762 is UNSAT
Problem TDEAD2766 is UNSAT
Problem TDEAD2771 is UNSAT
Problem TDEAD2775 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2785 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2799 is UNSAT
Problem TDEAD2805 is UNSAT
Problem TDEAD2811 is UNSAT
Problem TDEAD2816 is UNSAT
Problem TDEAD2820 is UNSAT
Problem TDEAD2825 is UNSAT
Problem TDEAD2829 is UNSAT
Problem TDEAD2833 is UNSAT
Problem TDEAD2838 is UNSAT
Problem TDEAD2842 is UNSAT
Problem TDEAD2848 is UNSAT
Problem TDEAD2853 is UNSAT
Problem TDEAD2860 is UNSAT
Problem TDEAD2864 is UNSAT
Problem TDEAD2869 is UNSAT
Problem TDEAD2873 is UNSAT
Problem TDEAD2877 is UNSAT
Problem TDEAD2882 is UNSAT
Problem TDEAD2886 is UNSAT
Problem TDEAD2892 is UNSAT
Problem TDEAD2897 is UNSAT
Problem TDEAD2903 is UNSAT
Problem TDEAD2909 is UNSAT
Problem TDEAD2914 is UNSAT
Problem TDEAD2918 is UNSAT
Problem TDEAD2922 is UNSAT
Problem TDEAD2927 is UNSAT
Problem TDEAD2931 is UNSAT
Problem TDEAD2936 is UNSAT
Problem TDEAD2940 is UNSAT
Problem TDEAD2946 is UNSAT
Problem TDEAD2951 is UNSAT
Problem TDEAD2958 is UNSAT
Problem TDEAD2962 is UNSAT
Problem TDEAD2966 is UNSAT
Problem TDEAD2971 is UNSAT
Problem TDEAD2975 is UNSAT
Problem TDEAD2980 is UNSAT
Problem TDEAD2984 is UNSAT
Problem TDEAD2988 is UNSAT
Problem TDEAD3290 is UNSAT
Problem TDEAD3295 is UNSAT
Problem TDEAD3302 is UNSAT
Problem TDEAD3306 is UNSAT
Problem TDEAD3310 is UNSAT
Problem TDEAD3315 is UNSAT
Problem TDEAD3319 is UNSAT
Problem TDEAD3324 is UNSAT
Problem TDEAD3328 is UNSAT
Problem TDEAD3332 is UNSAT
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/4414 variables, 2/2 constraints. Problems are: Problem set: 410 solved, 3093 unsolved
SMT process timed out in 22812ms, After SMT, problems are : Problem set: 410 solved, 3093 unsolved
Search for dead transitions found 410 dead transitions in 22858ms
Found 410 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 410 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 410 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7442892575152710304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17547560266226683141.kers'
[2026-05-31 20:07:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7442892575152710304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17547560266226683141.kers]
Normalized transition count is 3592 out of 3593 initially.
Culling trivial invariants: removing 320 columns.
Culled 320 columns in 3 ms.
// Phase 1: matrix 3592 rows 4594 cols 11454 entries
Finished phase 1 with 2592 SingleSign rule and 500 generalized
[2026-05-31 20:07:55] [INFO ] Computed 1822 invariants in 25 ms
Computed 1822 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-17547560266226683141.kers
Total runtime 29 ms.
[2026-05-31 20:08:02] [INFO ] Implicit Places using invariants in 7273 ms returned [505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 823, 824, 825, 826, 827, 828, 829, 830, 831, 832, 833, 834, 835, 836, 837, 838, 839, 840, 841, 842, 843, 844, 845, 846, 847, 848, 849, 850, 851, 852, 853, 854, 855, 856, 857, 858, 859, 860, 861, 862, 863, 864, 865, 866, 867, 868, 869, 870, 871, 872, 873, 874, 875, 876, 877, 878, 879, 880, 881, 882, 883, 884, 885, 886, 887, 888, 889, 890, 891, 892, 893, 894, 895, 896, 897, 898, 899, 900, 901, 902, 903, 904, 905, 906, 907, 908, 909, 910, 911, 912, 913, 914, 915, 916, 917, 918, 919, 920, 921, 922, 923, 924, 925, 926, 927, 928, 929, 930, 931, 932, 933, 934, 935, 936, 937, 938, 939, 940, 941, 942, 943, 944, 945, 946, 947, 948, 949, 950, 951, 952, 953, 954, 955, 956, 957, 958, 959, 960, 961, 962, 963, 964, 965, 966, 967, 968, 969, 970, 971, 972, 973, 974, 975, 976, 977, 978, 979, 980, 981, 982, 983, 984, 985, 986, 987, 988, 989, 990, 991, 992, 993, 994, 995, 996, 997, 998, 999, 1000, 1001, 1002, 1003, 1004, 1005, 1006, 2514, 2515, 2516, 2517, 2518, 2519, 2520, 2521, 2522, 2523, 2524, 2525, 2526, 2527, 2528, 2529, 2530, 2531, 2532, 2533, 2534, 2535, 2536, 2537, 2538, 2539, 2540, 2541, 2542, 2543, 2544, 2545, 2546, 2547, 2548, 2549, 2550, 2551, 2552, 2553, 2554, 2555, 2556, 2557, 2558, 2559, 2560, 2561, 2562, 2563, 2564, 2565, 2566, 2567, 2568, 2569, 2570, 2571, 2572, 2573, 2574, 2575, 2576, 2577, 2578, 2579, 2580, 2581, 2582, 2583, 2584, 2585, 2586, 2587, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2602, 2603, 2604, 2605, 2606, 2608, 2609, 2610, 2611, 2612, 2613, 2614, 2615, 2616, 2617, 2618, 2619, 2620, 2621, 2622, 2623, 2624, 2625, 2626, 2627, 2628, 2629, 2630, 2631, 2632, 2633, 2634, 2635, 2636, 2637, 2638, 2639, 2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2669, 2670, 2671, 2672, 2673, 2674, 2675, 2676, 2677, 2678, 2679, 2680, 2681, 2682, 2683, 2684, 2685, 2686, 2687, 2688, 2689, 2690, 2691, 2692, 2693, 2694, 2695, 2696, 2697, 2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726, 2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755, 2756, 2757, 2758, 2759, 2760, 2761, 2762, 2763, 2764, 2765, 2766, 2767, 2768, 2769, 2770, 2771, 2772, 2773, 2774, 2775, 2776, 2777, 2778, 2779, 2780, 2781, 2782, 2783, 2784, 2785, 2786, 2787, 2788, 2789, 2790, 2791, 2792, 2793, 2794, 2795, 2796, 2797, 2798, 2799, 2800, 2801, 2802, 2803, 2804, 2805, 2806, 2807, 2808, 2809, 2810, 2811, 2812, 2813, 2814, 2815, 2816, 2817, 2818, 2819, 2820, 2821, 2822, 2823, 2824, 2825, 2826, 2827, 2828, 2829, 2830, 2831, 2832, 2833, 2834, 2835, 2836, 2837, 2838, 2839, 2840, 2841, 2842, 2843, 2844, 2845, 2846, 2847, 2848, 2849, 2850, 2851, 2853, 2854, 2855, 2856, 2857, 2858, 2859, 2860, 2861, 2862, 2863, 2864, 2865, 2866, 2867, 2868, 2869, 2870, 2871, 2872, 2873, 2874, 2875, 2876, 2877, 2878, 2879, 2880, 2881, 2882, 2883, 2884, 2885, 2886, 2887, 2888, 2889, 2890, 2891, 2892, 2893, 2894, 2895, 2896, 2897, 2898, 2899, 2900, 2901, 2902, 2903, 2904, 2905, 2906, 2907, 2908, 2909, 2910, 2911, 2912, 2913, 2914, 2915, 2916, 2917, 2918, 2919, 2920, 2921, 2922, 2923, 2924, 2925, 2926, 2927, 2928, 2929, 2930, 2931, 2932, 2933, 2934, 2935, 2936, 2937, 2938, 2939, 2940, 2941, 2942, 2943, 2944, 2945, 2946, 2947, 2948, 2949, 2950, 2951, 2952, 2953, 2954, 2955, 2956, 2957, 2958, 2959, 2960, 2961, 2962, 2963, 2964, 2965, 2966, 2967, 2968, 2969, 2970, 2971, 2972, 2973, 2974, 2975, 2976, 2977, 2978, 2979, 2980, 2981, 2982, 2983, 2984, 2985, 2986, 2987, 2988, 2989, 2990, 2991, 2992, 2993, 2994, 2995, 2996, 2997, 2998, 2999, 3000, 3002, 3003, 3005, 3006, 3007, 3008, 3009, 3010, 3011, 3012, 3013, 3014, 3475]
Discarding 997 places :
Implicit Place search using SMT only with invariants took 7304 ms to find 997 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3917/6504 places, 3593/4003 transitions.
Reduce places removed 809 places and 90 transitions.
Iterating post reduction 0 with 809 rules applied. Total rules applied 809 place count 3108 transition count 3503
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 896 place count 3021 transition count 3503
Deduced a syphon composed of 5 places in 2 ms
Applied a total of 896 rules in 376 ms. Remains 3021 /3917 variables (removed 896) and now considering 3503/3593 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13375610191393128630.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15555757603613325410.kers'
[2026-05-31 20:08:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13375610191393128630.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15555757603613325410.kers]
Normalized transition count is 3502 out of 3503 initially.
Culling trivial invariants: removing 5 columns.
Culled 5 columns in 2 ms.
// Phase 1: matrix 3502 rows 3016 cols 7115 entries
Finished phase 1 with 2909 SingleSign rule and 93 generalized
[2026-05-31 20:08:02] [INFO ] Computed 19 invariants in 12 ms
Computed 19 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-15555757603613325410.kers
Total runtime 20 ms.
[2026-05-31 20:08:05] [INFO ] Implicit Places using invariants in 3031 ms returned []
[2026-05-31 20:08:05] [INFO ] Invariant cache hit.
[2026-05-31 20:08:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:08:18] [INFO ] Implicit Places using invariants and state equation in 12303 ms returned []
Implicit Place search using SMT with State Equation took 15360 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3021/6504 places, 3503/4003 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46536 ms. Remains : 3021/6504 places, 3503/4003 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3021/3021 places, 3503/3503 transitions.
Deduced a syphon composed of 5 places in 2 ms
Applied a total of 0 rules in 82 ms. Remains 3021 /3021 variables (removed 0) and now considering 3503/3503 (removed 0) transitions.
Running 3003 sub problems to find dead transitions.
[2026-05-31 20:08:18] [INFO ] Invariant cache hit.
[2026-05-31 20:08:18] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3003 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2507/6524 variables, and 4 constraints, problems are : Problem set: 0 solved, 3003 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 4/5 constraints, State Equation: 0/3021 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 3003/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3003 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3003 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2507/6524 variables, and 4 constraints, problems are : Problem set: 0 solved, 3003 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 4/5 constraints, State Equation: 0/3021 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41654ms problems are : Problem set: 0 solved, 3003 unsolved
Search for dead transitions found 0 dead transitions in 41661ms
[2026-05-31 20:08:59] [INFO ] Invariant cache hit.
[2026-05-31 20:09:02] [INFO ] Implicit Places using invariants in 3023 ms returned []
[2026-05-31 20:09:02] [INFO ] Invariant cache hit.
[2026-05-31 20:09:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:09:14] [INFO ] Implicit Places using invariants and state equation in 11396 ms returned []
Implicit Place search using SMT with State Equation took 14425 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 56179 ms. Remains : 3021/3021 places, 3503/3503 transitions.
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Support contains 40 out of 3016 places after structural reductions.
FORMULA SupplyChain-PT-00500-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00500-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-31 20:09:14] [INFO ] Flatten gal took : 244 ms
[2026-05-31 20:09:14] [INFO ] Flatten gal took : 130 ms
[2026-05-31 20:09:15] [INFO ] Input system was already deterministic with 3503 transitions.
Support contains 39 out of 3016 places (down from 40) after GAL structural reductions.
RANDOM walk for 40000 steps (16 resets) in 4287 ms. (9 steps per ms) remains 13/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 413 ms. (96 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 373 ms. (106 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 329 ms. (121 steps per ms) remains 13/13 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3474068733118810584.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7205331134983442748.kers'
[2026-05-31 20:09:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3474068733118810584.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7205331134983442748.kers]
Normalized transition count is 3502 out of 3503 initially.
Culled 0 columns in 2 ms.
// Phase 1: matrix 3502 rows 3016 cols 7115 entries
Finished phase 1 with 2909 SingleSign rule and 93 generalized
[2026-05-31 20:09:17] [INFO ] Computed 14 invariants in 13 ms
Computed 14 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-7205331134983442748.kers
Total runtime 16 ms.
[2026-05-31 20:09:17] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/43 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 35/78 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 533/611 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/611 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 7 (OVERLAPS) 702/1313 variables, 611/622 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1313 variables, 0/622 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 9 (OVERLAPS) 818/2131 variables, 406/1028 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2131 variables, 0/1028 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1212/3343 variables, 406/1434 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3343 variables, 0/1434 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 1/3344 variables, 1/1435 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3344 variables, 1/1436 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3344 variables, 0/1436 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 1205/4549 variables, 407/1843 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4549 variables, 0/1843 constraints. Problems are: Problem set: 5 solved, 8 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 18 (OVERLAPS) 1577/6126 variables, 793/2636 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/6126 variables, 2/2638 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/6126 variables, 0/2638 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 392/6518 variables, 392/3030 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/6518 variables, 0/3030 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 1/6519 variables, 1/3031 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/6519 variables, 0/3031 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/6519 variables, 0/3031 constraints. Problems are: Problem set: 9 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6519/6519 variables, and 3031 constraints, problems are : Problem set: 9 solved, 4 unsolved in 3841 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 3016/3016 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 20/28 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 1/4 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 42/70 variables, 6/10 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 533/603 variables, 1/11 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 0/11 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 693/1296 variables, 603/614 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1296 variables, 3/617 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1296 variables, 0/617 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 808/2104 variables, 403/1020 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2104 variables, 1/1021 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2104 variables, 0/1021 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1210/3314 variables, 404/1425 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3314 variables, 0/1425 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/3315 variables, 1/1426 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3315 variables, 1/1427 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3315 variables, 0/1427 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1207/4522 variables, 405/1832 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4522 variables, 0/1832 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 1598/6120 variables, 802/2634 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/6120 variables, 3/2637 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/6120 variables, 0/2637 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 398/6518 variables, 398/3035 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/6518 variables, 0/3035 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 1/6519 variables, 1/3036 constraints. Problems are: Problem set: 9 solved, 4 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6519/6519 variables, and 3036 constraints, problems are : Problem set: 9 solved, 4 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 3016/3016 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/13 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8918ms problems are : Problem set: 9 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 3016 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3016/3016 places, 3503/3503 transitions.
Graph (complete) has 4020 edges and 3016 vertex of which 3008 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.6 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 495 transitions
Reduce isomorphic transitions removed 495 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 497 transitions
Trivial Post-agglo rules discarded 497 transitions
Performed 497 trivial Post agglomeration. Transition count delta: 497
Iterating post reduction 0 with 992 rules applied. Total rules applied 993 place count 3008 transition count 2509
Reduce places removed 497 places and 0 transitions.
Ensure Unique test removed 497 transitions
Reduce isomorphic transitions removed 497 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 991 transitions
Trivial Post-agglo rules discarded 991 transitions
Performed 991 trivial Post agglomeration. Transition count delta: 991
Iterating post reduction 1 with 1985 rules applied. Total rules applied 2978 place count 2511 transition count 1021
Reduce places removed 991 places and 0 transitions.
Iterating post reduction 2 with 991 rules applied. Total rules applied 3969 place count 1520 transition count 1021
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 3969 place count 1520 transition count 521
Deduced a syphon composed of 500 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 3 with 1001 rules applied. Total rules applied 4970 place count 1019 transition count 521
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4970 place count 1019 transition count 520
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4972 place count 1018 transition count 520
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 4975 place count 1018 transition count 517
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 12 rules applied. Total rules applied 4987 place count 1012 transition count 511
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 4990 place count 1009 transition count 511
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 4990 place count 1009 transition count 508
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 4996 place count 1006 transition count 508
Applied a total of 4996 rules in 355 ms. Remains 1006 /3016 variables (removed 2010) and now considering 508/3503 (removed 2995) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 355 ms. Remains : 1006/3016 places, 508/3503 transitions.
RANDOM walk for 3606 steps (10 resets) in 476 ms. (7 steps per ms) remains 0/4 properties
Successfully simplified 9 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SupplyChain-PT-00500-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00500-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00500-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3016 stabilizing places and 3502 stable transitions
Graph (complete) has 4523 edges and 3016 vertex of which 3007 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.26 ms
FORMULA SupplyChain-PT-00500-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00500-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(X(p0)))&&G(p1)))'
Support contains 4 out of 3016 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3016/3016 places, 3503/3503 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 3009 transition count 3503
Applied a total of 7 rules in 110 ms. Remains 3009 /3016 variables (removed 7) and now considering 3503/3503 (removed 0) transitions.
Running 3003 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14533450128285662454.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17916157693454614562.kers'
[2026-05-31 20:09:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14533450128285662454.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17916157693454614562.kers]
Normalized transition count is 3502 out of 3503 initially.
Culled 0 columns in 2 ms.
// Phase 1: matrix 3502 rows 3009 cols 7108 entries
Finished phase 1 with 2909 SingleSign rule and 93 generalized
[2026-05-31 20:09:27] [INFO ] Computed 7 invariants in 17 ms
Computed 7 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-17916157693454614562.kers
Total runtime 20 ms.
[2026-05-31 20:09:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3003 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2507/6512 variables, and 4 constraints, problems are : Problem set: 0 solved, 3003 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 4/5 constraints, State Equation: 0/3009 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 3003/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3003 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3003 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2507/6512 variables, and 4 constraints, problems are : Problem set: 0 solved, 3003 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 4/5 constraints, State Equation: 0/3009 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41416ms problems are : Problem set: 0 solved, 3003 unsolved
Search for dead transitions found 0 dead transitions in 41422ms
[2026-05-31 20:10:08] [INFO ] Invariant cache hit.
[2026-05-31 20:10:11] [INFO ] Implicit Places using invariants in 3110 ms returned [506, 2013, 2015]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 3127 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3006/3016 places, 3503/3503 transitions.
Applied a total of 0 rules in 105 ms. Remains 3006 /3006 variables (removed 0) and now considering 3503/3503 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44773 ms. Remains : 3006/3016 places, 3503/3503 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(X(p0)))&&G(p1)))'
Stuttering acceptance computed with spot in 724 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SupplyChain-PT-00500-LTLCardinality-00
Product exploration explored 100000 steps with 46 reset in 3987 ms.
Entered a terminal (fully accepting) state of product in 76099 steps with 35 reset in 3154 ms.
FORMULA SupplyChain-PT-00500-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00500-LTLCardinality-00 finished in 52752 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 3016 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3016/3016 places, 3503/3503 transitions.
Graph (complete) has 4523 edges and 3016 vertex of which 3007 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.11 ms
Discarding 9 places :
Also discarding 0 output transitions
Reduce places removed 499 places and 499 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 496 rules applied. Total rules applied 497 place count 2508 transition count 2508
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 496 transitions
Reduce isomorphic transitions removed 496 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 495 transitions
Trivial Post-agglo rules discarded 495 transitions
Performed 495 trivial Post agglomeration. Transition count delta: 495
Iterating post reduction 1 with 1487 rules applied. Total rules applied 1984 place count 2012 transition count 1517
Reduce places removed 495 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 496 rules applied. Total rules applied 2480 place count 1517 transition count 1516
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 2483 place count 1516 transition count 1514
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2484 place count 1515 transition count 1514
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 499 Pre rules applied. Total rules applied 2484 place count 1515 transition count 1015
Deduced a syphon composed of 499 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 5 with 999 rules applied. Total rules applied 3483 place count 1015 transition count 1015
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3483 place count 1015 transition count 1014
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3485 place count 1014 transition count 1014
Applied a total of 3485 rules in 235 ms. Remains 1014 /3016 variables (removed 2002) and now considering 1014/3503 (removed 2489) transitions.
Running 15 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3161860872905933186.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4383917498912990397.kers'
[2026-05-31 20:10:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3161860872905933186.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4383917498912990397.kers]
Normalized transition count is 1013 out of 1014 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 1013 rows 1014 cols 2121 entries
Finished phase 1 with 917 SingleSign rule and 93 generalized
[2026-05-31 20:10:20] [INFO ] Computed 4 invariants in 5 ms
Computed 4 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4383917498912990397.kers
Total runtime 6 ms.
[2026-05-31 20:10:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 93/607 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 607/1214 variables, 607/611 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1214 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 813/2027 variables, 407/1018 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2027 variables, 0/1018 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/2028 variables, 1/1019 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2028 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/2028 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2028/2028 variables, and 1019 constraints, problems are : Problem set: 0 solved, 15 unsolved in 11530 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1014/1014 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 93/607 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 607/1214 variables, 607/611 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1214 variables, 14/625 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1214 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 813/2027 variables, 407/1032 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2027 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/2028 variables, 1/1033 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2028 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/2028 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2028/2028 variables, and 1033 constraints, problems are : Problem set: 0 solved, 15 unsolved in 7449 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1014/1014 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19004ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 19004ms
[2026-05-31 20:10:39] [INFO ] Invariant cache hit.
[2026-05-31 20:10:41] [INFO ] Implicit Places using invariants in 2737 ms returned [511, 512, 514]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 2742 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1011/3016 places, 1014/3503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1011 transition count 1011
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 1008 transition count 1008
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 1008 transition count 1005
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 1005 transition count 1005
Applied a total of 15 rules in 65 ms. Remains 1005 /1011 variables (removed 6) and now considering 1005/1014 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17870636319065421595.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3867968593911339175.kers'
[2026-05-31 20:10:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17870636319065421595.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3867968593911339175.kers]
Normalized transition count is 1004 out of 1005 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 1004 rows 1005 cols 2097 entries
Finished phase 1 with 914 SingleSign rule and 90 generalized
[2026-05-31 20:10:41] [INFO ] Computed 1 invariants in 3 ms
Computed 1 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3867968593911339175.kers
Total runtime 4 ms.
[2026-05-31 20:10:44] [INFO ] Implicit Places using invariants in 2642 ms returned []
[2026-05-31 20:10:44] [INFO ] Invariant cache hit.
[2026-05-31 20:10:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:10:48] [INFO ] Implicit Places using invariants and state equation in 4374 ms returned []
Implicit Place search using SMT with State Equation took 7020 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1005/3016 places, 1005/3503 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29068 ms. Remains : 1005/3016 places, 1005/3503 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 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SupplyChain-PT-00500-LTLCardinality-05
Product exploration explored 100000 steps with 318 reset in 2280 ms.
Product exploration explored 100000 steps with 320 reset in 2479 ms.
Computed a total of 1005 stabilizing places and 1004 stable transitions
Computed a total of 1005 stabilizing places and 1004 stable transitions
Detected a total of 1005/1005 stabilizing places and 1004/1005 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 622 steps (0 resets) in 32 ms. (18 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 6310 ms.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1005 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1005/1005 places, 1005/1005 transitions.
Applied a total of 0 rules in 48 ms. Remains 1005 /1005 variables (removed 0) and now considering 1005/1005 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2026-05-31 20:11:00] [INFO ] Invariant cache hit.
[2026-05-31 20:11:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 90/595 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/595 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 595/1190 variables, 595/596 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1190 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 819/2009 variables, 410/1006 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2009 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/2010 variables, 1/1007 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2010 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/2010 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2010/2010 variables, and 1007 constraints, problems are : Problem set: 0 solved, 6 unsolved in 8353 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 1005/1005 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 90/595 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/595 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 595/1190 variables, 595/596 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1190 variables, 5/601 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1190 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 819/2009 variables, 410/1011 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2009 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/2010 variables, 1/1012 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2010 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/2010 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2010/2010 variables, and 1012 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6975 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 1005/1005 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15339ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 15340ms
[2026-05-31 20:11:15] [INFO ] Invariant cache hit.
[2026-05-31 20:11:18] [INFO ] Implicit Places using invariants in 2842 ms returned []
[2026-05-31 20:11:18] [INFO ] Invariant cache hit.
[2026-05-31 20:11:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:11:22] [INFO ] Implicit Places using invariants and state equation in 4206 ms returned []
Implicit Place search using SMT with State Equation took 7054 ms to find 0 implicit places.
[2026-05-31 20:11:22] [INFO ] Redundant transitions in 65 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22521 ms. Remains : 1005/1005 places, 1005/1005 transitions.
Computed a total of 1005 stabilizing places and 1004 stable transitions
Computed a total of 1005 stabilizing places and 1004 stable transitions
Detected a total of 1005/1005 stabilizing places and 1004/1005 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 828 steps (0 resets) in 39 ms. (20 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 6191 ms.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 323 reset in 2301 ms.
Product exploration explored 100000 steps with 315 reset in 2453 ms.
Built C files in :
/tmp/ltsmin12793688936572633601
[2026-05-31 20:11:33] [INFO ] Computing symmetric may disable matrix : 1005 transitions.
[2026-05-31 20:11:33] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:11:33] [INFO ] Computing symmetric may enable matrix : 1005 transitions.
[2026-05-31 20:11:33] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:11:34] [INFO ] Computing Do-Not-Accords matrix : 1005 transitions.
[2026-05-31 20:11:34] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:11:34] [INFO ] Built C files in 284ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12793688936572633601
Running compilation step : cd /tmp/ltsmin12793688936572633601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12793688936572633601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12793688936572633601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1 out of 1005 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1005/1005 places, 1005/1005 transitions.
Applied a total of 0 rules in 50 ms. Remains 1005 /1005 variables (removed 0) and now considering 1005/1005 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 20:11:37] [INFO ] Invariant cache hit.
[2026-05-31 20:11:39] [INFO ] Implicit Places using invariants in 2712 ms returned []
[2026-05-31 20:11:39] [INFO ] Invariant cache hit.
[2026-05-31 20:11:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:11:44] [INFO ] Implicit Places using invariants and state equation in 4247 ms returned []
Implicit Place search using SMT with State Equation took 6965 ms to find 0 implicit places.
[2026-05-31 20:11:44] [INFO ] Redundant transitions in 59 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7086 ms. Remains : 1005/1005 places, 1005/1005 transitions.
Built C files in :
/tmp/ltsmin10549754323587731748
[2026-05-31 20:11:44] [INFO ] Computing symmetric may disable matrix : 1005 transitions.
[2026-05-31 20:11:44] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:11:44] [INFO ] Computing symmetric may enable matrix : 1005 transitions.
[2026-05-31 20:11:44] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:11:44] [INFO ] Computing Do-Not-Accords matrix : 1005 transitions.
[2026-05-31 20:11:44] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:11:44] [INFO ] Built C files in 231ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10549754323587731748
Running compilation step : cd /tmp/ltsmin10549754323587731748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10549754323587731748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10549754323587731748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-31 20:11:47] [INFO ] Flatten gal took : 46 ms
[2026-05-31 20:11:47] [INFO ] Flatten gal took : 66 ms
[2026-05-31 20:11:47] [INFO ] Time to serialize gal into /tmp/LTL6889776873714876393.gal : 10 ms
[2026-05-31 20:11:47] [INFO ] Time to serialize properties into /tmp/LTL5556750079001728630.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6889776873714876393.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4243444412719661091.hoa' '-atoms' '/tmp/LTL5556750079001728630.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5556750079001728630.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4243444412719661091.hoa
Detected timeout of ITS tools.
[2026-05-31 20:12:03] [INFO ] Flatten gal took : 39 ms
[2026-05-31 20:12:03] [INFO ] Flatten gal took : 40 ms
[2026-05-31 20:12:03] [INFO ] Time to serialize gal into /tmp/LTL15394372485126465759.gal : 6 ms
[2026-05-31 20:12:03] [INFO ] Time to serialize properties into /tmp/LTL10001928803883583316.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15394372485126465759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10001928803883583316.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(p4475<1)"))))
Formula 0 simplified : FG!"(p4475<1)"
Detected timeout of ITS tools.
[2026-05-31 20:12:18] [INFO ] Flatten gal took : 41 ms
[2026-05-31 20:12:18] [INFO ] Applying decomposition
[2026-05-31 20:12:18] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12181779217473532256.txt' '-o' '/tmp/graph12181779217473532256.bin' '-w' '/tmp/graph12181779217473532256.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12181779217473532256.bin' '-l' '-1' '-v' '-w' '/tmp/graph12181779217473532256.weights' '-q' '0' '-e' '0.001'
[2026-05-31 20:12:18] [INFO ] Decomposing Gal with order
[2026-05-31 20:12:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 20:12:18] [INFO ] Removed a total of 586 redundant transitions.
[2026-05-31 20:12:18] [INFO ] Flatten gal took : 112 ms
[2026-05-31 20:12:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 71 ms.
[2026-05-31 20:12:18] [INFO ] Time to serialize gal into /tmp/LTL5774198051863267033.gal : 16 ms
[2026-05-31 20:12:18] [INFO ] Time to serialize properties into /tmp/LTL8149069495375871302.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5774198051863267033.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8149069495375871302.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("(u499.p4475<1)"))))
Formula 0 simplified : FG!"(u499.p4475<1)"
Reverse transition relation is NOT exact ! Due to transitions t2839, t2363_t2212_t843_t2549, t2372_t2217_t844_t2551, t2382_t2221_t846_t2556, t2390_t2224_t8...12889
Computing Next relation with stutter on 1.47303e+152 deadlock states
Detected timeout of ITS tools.
Treatment of property SupplyChain-PT-00500-LTLCardinality-05 finished in 134035 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((p0||G(p1))))'
Support contains 4 out of 3016 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3016/3016 places, 3503/3503 transitions.
Graph (complete) has 4523 edges and 3016 vertex of which 3008 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 498 places and 498 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 496 rules applied. Total rules applied 497 place count 2510 transition count 2509
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 496 transitions
Reduce isomorphic transitions removed 496 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 494 transitions
Trivial Post-agglo rules discarded 494 transitions
Performed 494 trivial Post agglomeration. Transition count delta: 494
Iterating post reduction 1 with 1486 rules applied. Total rules applied 1983 place count 2014 transition count 1519
Reduce places removed 494 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 496 rules applied. Total rules applied 2479 place count 1520 transition count 1517
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 2483 place count 1518 transition count 1515
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2484 place count 1517 transition count 1515
Performed 498 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 498 Pre rules applied. Total rules applied 2484 place count 1517 transition count 1017
Deduced a syphon composed of 498 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 5 with 997 rules applied. Total rules applied 3481 place count 1018 transition count 1017
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3481 place count 1018 transition count 1016
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3483 place count 1017 transition count 1016
Applied a total of 3483 rules in 171 ms. Remains 1017 /3016 variables (removed 1999) and now considering 1016/3503 (removed 2487) transitions.
Running 19 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2487205834582057972.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6218084661563957995.kers'
[2026-05-31 20:12:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2487205834582057972.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6218084661563957995.kers]
Normalized transition count is 1015 out of 1016 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 1015 rows 1017 cols 2126 entries
Finished phase 1 with 919 SingleSign rule and 93 generalized
[2026-05-31 20:12:34] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6218084661563957995.kers
Total runtime 5 ms.
[2026-05-31 20:12:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 2/518 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 93/611 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/611 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 612/1223 variables, 611/616 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1223 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 809/2032 variables, 406/1022 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2032 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 1/2033 variables, 1/1023 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2033 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 0/2033 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2033/2033 variables, and 1023 constraints, problems are : Problem set: 0 solved, 19 unsolved in 7346 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1017/1017 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 2/518 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 93/611 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/611 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 612/1223 variables, 611/616 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1223 variables, 18/634 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1223 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 809/2032 variables, 406/1040 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2032 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 1/2033 variables, 1/1041 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2033 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 0/2033 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2033/2033 variables, and 1041 constraints, problems are : Problem set: 0 solved, 19 unsolved in 6673 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1017/1017 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14055ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 14055ms
[2026-05-31 20:12:48] [INFO ] Invariant cache hit.
[2026-05-31 20:12:50] [INFO ] Implicit Places using invariants in 2807 ms returned [513, 514, 516]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 2809 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1014/3016 places, 1016/3503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1014 transition count 1013
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 1011 transition count 1010
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 1011 transition count 1007
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 1008 transition count 1007
Applied a total of 15 rules in 56 ms. Remains 1008 /1014 variables (removed 6) and now considering 1007/1016 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16119994191349224615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1038638949382370532.kers'
[2026-05-31 20:12:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16119994191349224615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1038638949382370532.kers]
Normalized transition count is 1006 out of 1007 initially.
Culled 0 columns in 2 ms.
// Phase 1: matrix 1006 rows 1008 cols 2102 entries
Finished phase 1 with 916 SingleSign rule and 90 generalized
[2026-05-31 20:12:51] [INFO ] Computed 2 invariants in 9 ms
Computed 2 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-1038638949382370532.kers
Total runtime 11 ms.
[2026-05-31 20:12:53] [INFO ] Implicit Places using invariants in 2701 ms returned []
[2026-05-31 20:12:53] [INFO ] Invariant cache hit.
[2026-05-31 20:12:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:12:57] [INFO ] Implicit Places using invariants and state equation in 4228 ms returned []
Implicit Place search using SMT with State Equation took 6932 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1008/3016 places, 1007/3503 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 24025 ms. Remains : 1008/3016 places, 1007/3503 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((p0||G(p1))))'
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SupplyChain-PT-00500-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 237 steps with 0 reset in 10 ms.
FORMULA SupplyChain-PT-00500-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00500-LTLCardinality-06 finished in 24180 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 2 out of 3016 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3016/3016 places, 3503/3503 transitions.
Graph (complete) has 4523 edges and 3016 vertex of which 3008 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 500 places and 500 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 496 rules applied. Total rules applied 497 place count 2508 transition count 2507
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 496 transitions
Reduce isomorphic transitions removed 496 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 495 transitions
Trivial Post-agglo rules discarded 495 transitions
Performed 495 trivial Post agglomeration. Transition count delta: 495
Iterating post reduction 1 with 1487 rules applied. Total rules applied 1984 place count 2012 transition count 1516
Reduce places removed 495 places and 0 transitions.
Iterating post reduction 2 with 495 rules applied. Total rules applied 2479 place count 1517 transition count 1516
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 2479 place count 1517 transition count 1016
Deduced a syphon composed of 500 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 3 with 1001 rules applied. Total rules applied 3480 place count 1016 transition count 1016
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 3480 place count 1016 transition count 1015
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3482 place count 1015 transition count 1015
Applied a total of 3482 rules in 139 ms. Remains 1015 /3016 variables (removed 2001) and now considering 1015/3503 (removed 2488) transitions.
Running 15 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11799642687168933765.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13680779858571146353.kers'
[2026-05-31 20:12:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11799642687168933765.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13680779858571146353.kers]
Normalized transition count is 1014 out of 1015 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 1014 rows 1015 cols 2124 entries
Finished phase 1 with 917 SingleSign rule and 93 generalized
[2026-05-31 20:12:58] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13680779858571146353.kers
Total runtime 6 ms.
[2026-05-31 20:12:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 2/516 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/516 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 93/609 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/609 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 608/1217 variables, 609/614 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1217 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 812/2029 variables, 406/1020 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2029 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 1/2030 variables, 1/1021 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2030 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/2030 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2030/2030 variables, and 1021 constraints, problems are : Problem set: 0 solved, 15 unsolved in 6930 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1015/1015 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 2/516 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/516 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 93/609 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/609 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 608/1217 variables, 609/614 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1217 variables, 14/628 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1217 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 812/2029 variables, 406/1034 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2029 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 1/2030 variables, 1/1035 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2030 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/2030 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2030/2030 variables, and 1035 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5174 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1015/1015 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12126ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 12127ms
[2026-05-31 20:13:10] [INFO ] Invariant cache hit.
[2026-05-31 20:13:13] [INFO ] Implicit Places using invariants in 2869 ms returned [513, 514, 516]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 2872 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1012/3016 places, 1015/3503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1012 transition count 1012
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 1009 transition count 1009
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 1009 transition count 1006
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 1006 transition count 1006
Applied a total of 15 rules in 56 ms. Remains 1006 /1012 variables (removed 6) and now considering 1006/1015 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14335271257613703378.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1864162792111129172.kers'
[2026-05-31 20:13:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14335271257613703378.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1864162792111129172.kers]
Normalized transition count is 1005 out of 1006 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 1005 rows 1006 cols 2100 entries
Finished phase 1 with 914 SingleSign rule and 90 generalized
[2026-05-31 20:13:13] [INFO ] Computed 2 invariants in 9 ms
Computed 2 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-1864162792111129172.kers
Total runtime 11 ms.
[2026-05-31 20:13:16] [INFO ] Implicit Places using invariants in 2787 ms returned []
[2026-05-31 20:13:16] [INFO ] Invariant cache hit.
[2026-05-31 20:13:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:13:20] [INFO ] Implicit Places using invariants and state equation in 4340 ms returned []
Implicit Place search using SMT with State Equation took 7130 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1006/3016 places, 1006/3503 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22328 ms. Remains : 1006/3016 places, 1006/3503 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 43 ms :[(NOT p0)]
Running random walk in product with property : SupplyChain-PT-00500-LTLCardinality-10
Stuttering criterion allowed to conclude after 414 steps with 0 reset in 13 ms.
FORMULA SupplyChain-PT-00500-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00500-LTLCardinality-10 finished in 22424 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((p0||X(X((F(G(p1)) U p2))))))'
Support contains 5 out of 3016 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3016/3016 places, 3503/3503 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 3009 transition count 3503
Applied a total of 7 rules in 110 ms. Remains 3009 /3016 variables (removed 7) and now considering 3503/3503 (removed 0) transitions.
Running 3003 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11923719067981606056.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14714122464074630304.kers'
[2026-05-31 20:13:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11923719067981606056.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14714122464074630304.kers]
Normalized transition count is 3502 out of 3503 initially.
Culled 0 columns in 2 ms.
// Phase 1: matrix 3502 rows 3009 cols 7108 entries
Finished phase 1 with 2908 SingleSign rule and 94 generalized
[2026-05-31 20:13:20] [INFO ] Computed 7 invariants in 14 ms
Computed 7 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-14714122464074630304.kers
Total runtime 20 ms.
[2026-05-31 20:13:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3003 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2507/6512 variables, and 4 constraints, problems are : Problem set: 0 solved, 3003 unsolved in 20072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 4/5 constraints, State Equation: 0/3009 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 3003/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3003 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3003 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2507/6512 variables, and 4 constraints, problems are : Problem set: 0 solved, 3003 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 4/5 constraints, State Equation: 0/3009 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41352ms problems are : Problem set: 0 solved, 3003 unsolved
Search for dead transitions found 0 dead transitions in 41359ms
[2026-05-31 20:14:01] [INFO ] Invariant cache hit.
[2026-05-31 20:14:05] [INFO ] Implicit Places using invariants in 3028 ms returned [506, 2011, 2012, 2014]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3034 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3005/3016 places, 3503/3503 transitions.
Applied a total of 0 rules in 132 ms. Remains 3005 /3005 variables (removed 0) and now considering 3503/3503 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44645 ms. Remains : 3005/3016 places, 3503/3503 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((p0||X(X((F(G(p1)) U p2))))))'
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : SupplyChain-PT-00500-LTLCardinality-13
Product exploration explored 100000 steps with 64 reset in 4355 ms.
Product exploration explored 100000 steps with 60 reset in 4583 ms.
Computed a total of 3005 stabilizing places and 3502 stable transitions
Graph (complete) has 4505 edges and 3005 vertex of which 3003 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Computed a total of 3005 stabilizing places and 3502 stable transitions
Detected a total of 3005/3005 stabilizing places and 3502/3503 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (16 resets) in 1701 ms. (23 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 469 ms. (85 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 407 ms. (98 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8525224187395623057.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17540221514222328971.kers'
[2026-05-31 20:14:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8525224187395623057.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17540221514222328971.kers]
Normalized transition count is 3502 out of 3503 initially.
Culled 0 columns in 2 ms.
// Phase 1: matrix 3502 rows 3005 cols 7095 entries
Finished phase 1 with 2912 SingleSign rule and 90 generalized
[2026-05-31 20:14:16] [INFO ] Computed 3 invariants in 18 ms
Computed 3 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-17540221514222328971.kers
Total runtime 22 ms.
[2026-05-31 20:14:16] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 540/559 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 650/1209 variables, 559/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1209 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 819/2028 variables, 409/971 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2028 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1225/3253 variables, 409/1380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3253 variables, 0/1380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1223/4476 variables, 409/1789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4476 variables, 0/1789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1625/6101 variables, 813/2602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/6101 variables, 0/2602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 406/6507 variables, 406/3008 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/6507 variables, 0/3008 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/6508 variables, 1/3009 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/6508 variables, 0/3009 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/6508 variables, 0/3009 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6508/6508 variables, and 3009 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2065 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 3005/3005 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/19 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 540/559 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/559 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 650/1209 variables, 559/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1209 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1209 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 819/2028 variables, 409/973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2028 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2028 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1225/3253 variables, 409/1383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3253 variables, 0/1383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1223/4476 variables, 409/1792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4476 variables, 0/1792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1625/6101 variables, 813/2605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/6101 variables, 0/2605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 406/6507 variables, 406/3011 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/6507 variables, 0/3011 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/6508 variables, 1/3012 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/6508 variables, 0/3012 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/6508 variables, 0/3012 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6508/6508 variables, and 3012 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3638 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 3005/3005 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5755ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 399 steps, including 0 resets, run visited all 2 properties in 13 ms. (steps per millisecond=30 )
Parikh walk visited 2 properties in 19 ms.
Knowledge based reduction with 5 factoid took 251 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p1)]
Knowledge-based reduction took 8762 ms.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p1)]
Support contains 5 out of 3005 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3005/3005 places, 3503/3503 transitions.
Applied a total of 0 rules in 124 ms. Remains 3005 /3005 variables (removed 0) and now considering 3503/3503 (removed 0) transitions.
Running 3003 sub problems to find dead transitions.
[2026-05-31 20:14:23] [INFO ] Invariant cache hit.
[2026-05-31 20:14:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2503/6508 variables, and 0 constraints, problems are : Problem set: 0 solved, 3003 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/3005 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 3003/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3003 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2503/6508 variables, and 0 constraints, problems are : Problem set: 0 solved, 3003 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/3005 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41167ms problems are : Problem set: 0 solved, 3003 unsolved
Search for dead transitions found 0 dead transitions in 41172ms
[2026-05-31 20:15:04] [INFO ] Invariant cache hit.
[2026-05-31 20:15:07] [INFO ] Implicit Places using invariants in 3030 ms returned []
[2026-05-31 20:15:07] [INFO ] Invariant cache hit.
[2026-05-31 20:15:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:15:14] [INFO ] Implicit Places using invariants and state equation in 6916 ms returned []
Implicit Place search using SMT with State Equation took 9950 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 51256 ms. Remains : 3005/3005 places, 3503/3503 transitions.
Computed a total of 3005 stabilizing places and 3502 stable transitions
Graph (complete) has 4505 edges and 3005 vertex of which 3003 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 3005 stabilizing places and 3502 stable transitions
Detected a total of 3005/3005 stabilizing places and 3502/3503 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (16 resets) in 1739 ms. (22 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 2/2 properties
[2026-05-31 20:15:16] [INFO ] Invariant cache hit.
[2026-05-31 20:15:16] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 540/559 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 650/1209 variables, 559/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1209 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 819/2028 variables, 409/971 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2028 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1225/3253 variables, 409/1380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3253 variables, 0/1380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1223/4476 variables, 409/1789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4476 variables, 0/1789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1625/6101 variables, 813/2602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/6101 variables, 0/2602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 406/6507 variables, 406/3008 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/6507 variables, 0/3008 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/6508 variables, 1/3009 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/6508 variables, 0/3009 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/6508 variables, 0/3009 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6508/6508 variables, and 3009 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2084 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 3005/3005 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/19 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 540/559 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/559 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 650/1209 variables, 559/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1209 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1209 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 819/2028 variables, 409/973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2028 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2028 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1225/3253 variables, 409/1383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3253 variables, 0/1383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1223/4476 variables, 409/1792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4476 variables, 0/1792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1625/6101 variables, 813/2605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/6101 variables, 0/2605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 406/6507 variables, 406/3011 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/6507 variables, 0/3011 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/6508 variables, 1/3012 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/6508 variables, 0/3012 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/6508 variables, 0/3012 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6508/6508 variables, and 3012 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3651 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 3005/3005 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5749ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 303 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=30 )
Parikh walk visited 2 properties in 16 ms.
Knowledge based reduction with 5 factoid took 245 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p1)]
Knowledge-based reduction took 8597 ms.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 58 reset in 4336 ms.
Product exploration explored 100000 steps with 59 reset in 4692 ms.
Spot run failed in 105 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
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)
Built C files in :
/tmp/ltsmin6685799029281127131
[2026-05-31 20:15:32] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6685799029281127131
Running compilation step : cd /tmp/ltsmin6685799029281127131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6685799029281127131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6685799029281127131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 3005 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3005/3005 places, 3503/3503 transitions.
Applied a total of 0 rules in 108 ms. Remains 3005 /3005 variables (removed 0) and now considering 3503/3503 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 20:15:35] [INFO ] Invariant cache hit.
[2026-05-31 20:15:38] [INFO ] Implicit Places using invariants in 2976 ms returned []
[2026-05-31 20:15:38] [INFO ] Invariant cache hit.
[2026-05-31 20:15:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:15:45] [INFO ] Implicit Places using invariants and state equation in 6898 ms returned []
Implicit Place search using SMT with State Equation took 9892 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 10002 ms. Remains : 3005/3005 places, 3503/3503 transitions.
Built C files in :
/tmp/ltsmin4769233510096643437
[2026-05-31 20:15:45] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4769233510096643437
Running compilation step : cd /tmp/ltsmin4769233510096643437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4769233510096643437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4769233510096643437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-31 20:15:48] [INFO ] Flatten gal took : 124 ms
[2026-05-31 20:15:49] [INFO ] Flatten gal took : 90 ms
[2026-05-31 20:15:49] [INFO ] Time to serialize gal into /tmp/LTL10601576869564937670.gal : 16 ms
[2026-05-31 20:15:49] [INFO ] Time to serialize properties into /tmp/LTL4206772345187572154.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10601576869564937670.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17528115028681734207.hoa' '-atoms' '/tmp/LTL4206772345187572154.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4206772345187572154.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17528115028681734207.hoa
Detected timeout of ITS tools.
[2026-05-31 20:16:04] [INFO ] Flatten gal took : 62 ms
[2026-05-31 20:16:04] [INFO ] Flatten gal took : 63 ms
[2026-05-31 20:16:04] [INFO ] Time to serialize gal into /tmp/LTL3362656640386367704.gal : 12 ms
[2026-05-31 20:16:04] [INFO ] Time to serialize properties into /tmp/LTL10079968018340277319.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3362656640386367704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10079968018340277319.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(p3113<1)")||(X(X((F(G("(p362<=p5770)")))U("(p6228<=p2608)")))))))
Formula 0 simplified : F(!"(p3113<1)" & XX(GF!"(p362<=p5770)" R !"(p6228<=p2608)"))
Detected timeout of ITS tools.
[2026-05-31 20:16:19] [INFO ] Flatten gal took : 65 ms
[2026-05-31 20:16:19] [INFO ] Applying decomposition
[2026-05-31 20:16:19] [INFO ] Flatten gal took : 91 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10239097325327940189.txt' '-o' '/tmp/graph10239097325327940189.bin' '-w' '/tmp/graph10239097325327940189.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10239097325327940189.bin' '-l' '-1' '-v' '-w' '/tmp/graph10239097325327940189.weights' '-q' '0' '-e' '0.001'
[2026-05-31 20:16:19] [INFO ] Decomposing Gal with order
[2026-05-31 20:16:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 20:16:20] [INFO ] Removed a total of 588 redundant transitions.
[2026-05-31 20:16:20] [INFO ] Flatten gal took : 73 ms
[2026-05-31 20:16:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 64 ms.
[2026-05-31 20:16:20] [INFO ] Time to serialize gal into /tmp/LTL2485831929989462239.gal : 17 ms
[2026-05-31 20:16:20] [INFO ] Time to serialize properties into /tmp/LTL18078383478570286786.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2485831929989462239.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18078383478570286786.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(gi1.gi0.gu57.p3113<1)")||(X(X((F(G("(gu92.p362<=gu92.p5770)")))U("(gu401.p6228<=gu401.p2608)")))))))
Formula 0 simplified : F(!"(gi1.gi0.gu57.p3113<1)" & XX(GF!"(gu92.p362<=gu92.p5770)" R !"(gu401.p6228<=gu401.p2608)"))
Detected timeout of ITS tools.
Treatment of property SupplyChain-PT-00500-LTLCardinality-13 finished in 195361 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)))'
Spot run failed in 52 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
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((p0||X(X((F(G(p1)) U p2))))))'
Spot run failed in 44 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-31 20:16:36] [INFO ] Flatten gal took : 165 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8086824377276662644
[2026-05-31 20:16:36] [INFO ] Too many transitions (3503) to apply POR reductions. Disabling POR matrices.
[2026-05-31 20:16:36] [INFO ] Applying decomposition
[2026-05-31 20:16:36] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8086824377276662644
Running compilation step : cd /tmp/ltsmin8086824377276662644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-31 20:16:36] [INFO ] Flatten gal took : 109 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph428996672956315933.txt' '-o' '/tmp/graph428996672956315933.bin' '-w' '/tmp/graph428996672956315933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph428996672956315933.bin' '-l' '-1' '-v' '-w' '/tmp/graph428996672956315933.weights' '-q' '0' '-e' '0.001'
[2026-05-31 20:16:36] [INFO ] Decomposing Gal with order
[2026-05-31 20:16:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 20:16:36] [INFO ] Removed a total of 591 redundant transitions.
[2026-05-31 20:16:36] [INFO ] Flatten gal took : 111 ms
[2026-05-31 20:16:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 49 ms.
[2026-05-31 20:16:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality16896861947447845509.gal : 31 ms
[2026-05-31 20:16:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality8068380161169546618.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16896861947447845509.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8068380161169546618.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((G(F("(gi0.gi3.gu386.p4475<1)"))))
Formula 0 simplified : FG!"(gi0.gi3.gu386.p4475<1)"
Compilation finished in 9569 ms.
Running link step : cd /tmp/ltsmin8086824377276662644;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 107 ms.
Running LTSmin : cd /tmp/ltsmin8086824377276662644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8086824377276662644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8086824377276662644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](((LTLAPp1==true)||X(X((<>([]((LTLAPp2==true))) U (LTLAPp3==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-31 20:39:43] [INFO ] Flatten gal took : 1182 ms
[2026-05-31 20:39:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality16324799306830673002.gal : 102 ms
[2026-05-31 20:39:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality8184464544598928524.ltl : 19 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16324799306830673002.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8184464544598928524.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((G(F("(p4475<1)"))))
Formula 0 simplified : FG!"(p4475<1)"
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8086824377276662644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](((LTLAPp1==true)||X(X((<>([]((LTLAPp2==true))) U (LTLAPp3==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin8086824377276662644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-31 21:02:49] [INFO ] Flatten gal took : 1385 ms
[2026-05-31 21:02:53] [INFO ] Input system was already deterministic with 3503 transitions.
[2026-05-31 21:02:53] [INFO ] Transformed 3016 places.
[2026-05-31 21:02:53] [INFO ] Transformed 3503 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-31 21:02:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality15889432896278640410.gal : 35 ms
[2026-05-31 21:02:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality3808619253513995611.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15889432896278640410.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3808619253513995611.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(p4475<1)"))))
Formula 0 simplified : FG!"(p4475<1)"

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="SupplyChain-PT-00500"
export BK_EXAMINATION="LTLCardinality"
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 SupplyChain-PT-00500, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r354-tall-178024402900219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SupplyChain-PT-00500.tgz
mv SupplyChain-PT-00500 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;