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.r034-tall-177946842000524.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 BusinessProcesses-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000524
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.0K Mar 5 17:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 5 17:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 17:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 5 17:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 17:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Mar 5 17:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 5 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 5 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 131K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779616791593

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 09:59:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 09:59:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 09:59:52] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2026-05-24 09:59:52] [INFO ] Transformed 518 places.
[2026-05-24 09:59:52] [INFO ] Transformed 471 transitions.
[2026-05-24 09:59:52] [INFO ] Found NUPN structural information;
[2026-05-24 09:59:52] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA BusinessProcesses-PT-10-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 471/471 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 471
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 71 place count 447 transition count 401
Iterating global reduction 1 with 70 rules applied. Total rules applied 141 place count 447 transition count 401
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 172 place count 416 transition count 370
Iterating global reduction 1 with 31 rules applied. Total rules applied 203 place count 416 transition count 370
Applied a total of 203 rules in 102 ms. Remains 416 /518 variables (removed 102) and now considering 370/471 (removed 101) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1936758157638415043.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11792144863534043768.kers'
[2026-05-24 09:59:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1936758157638415043.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11792144863534043768.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 370 rows 416 cols 1212 entries
Finished phase 1 with 269 SingleSign rule and 63 generalized
[2026-05-24 09:59:53] [INFO ] Computed 84 invariants in 2 ms
Computed 84 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11792144863534043768.kers
Total runtime 3 ms.
[2026-05-24 09:59:53] [INFO ] Implicit Places using invariants in 429 ms returned []
[2026-05-24 09:59:53] [INFO ] Invariant cache hit.
[2026-05-24 09:59:54] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 1030 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2026-05-24 09:59:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/416 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Problem TDEAD282 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 20/104 constraints. Problems are: Problem set: 6 solved, 363 unsolved
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 20/124 constraints. Problems are: Problem set: 8 solved, 361 unsolved
Problem TDEAD279 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD324 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 20/144 constraints. Problems are: Problem set: 11 solved, 358 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 20/164 constraints. Problems are: Problem set: 11 solved, 358 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 20/184 constraints. Problems are: Problem set: 11 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/786 variables, and 184 constraints, problems are : Problem set: 11 solved, 358 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/416 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 358 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 18/18 constraints. Problems are: Problem set: 11 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 0/18 constraints. Problems are: Problem set: 11 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/416 variables, 62/80 constraints. Problems are: Problem set: 11 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 4/84 constraints. Problems are: Problem set: 11 solved, 358 unsolved
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 100/184 constraints. Problems are: Problem set: 21 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 20/204 constraints. Problems are: Problem set: 21 solved, 348 unsolved
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD323 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 20/224 constraints. Problems are: Problem set: 30 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 20/244 constraints. Problems are: Problem set: 30 solved, 339 unsolved
Problem TDEAD287 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 20/264 constraints. Problems are: Problem set: 31 solved, 338 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 20/284 constraints. Problems are: Problem set: 31 solved, 338 unsolved
SMT process timed out in 60216ms, After SMT, problems are : Problem set: 31 solved, 338 unsolved
Search for dead transitions found 31 dead transitions in 60229ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in LTL mode, iteration 1 : 416/518 places, 339/471 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 415 transition count 339
Applied a total of 1 rules in 17 ms. Remains 415 /416 variables (removed 1) and now considering 339/339 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1438806939751557463.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6352786552535437280.kers'
[2026-05-24 10:00:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1438806939751557463.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6352786552535437280.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 339 rows 415 cols 1024 entries
Finished phase 1 with 268 SingleSign rule and 59 generalized
[2026-05-24 10:00:54] [INFO ] Computed 88 invariants in 1 ms
Computed 88 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6352786552535437280.kers
Total runtime 2 ms.
[2026-05-24 10:00:54] [INFO ] Implicit Places using invariants in 192 ms returned []
[2026-05-24 10:00:54] [INFO ] Invariant cache hit.
[2026-05-24 10:00:55] [INFO ] Implicit Places using invariants and state equation in 370 ms returned [366]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 567 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 414/518 places, 339/471 transitions.
Applied a total of 0 rules in 10 ms. Remains 414 /414 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62002 ms. Remains : 414/518 places, 339/471 transitions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 339/339 transitions.
Applied a total of 0 rules in 8 ms. Remains 414 /414 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10361975371520469299.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3576102628386305205.kers'
[2026-05-24 10:00:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10361975371520469299.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3576102628386305205.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 339 rows 414 cols 1022 entries
Finished phase 1 with 269 SingleSign rule and 58 generalized
[2026-05-24 10:00:55] [INFO ] Computed 87 invariants in 1 ms
Computed 87 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3576102628386305205.kers
Total runtime 3 ms.
[2026-05-24 10:00:55] [INFO ] Implicit Places using invariants in 187 ms returned []
[2026-05-24 10:00:55] [INFO ] Invariant cache hit.
[2026-05-24 10:00:55] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2026-05-24 10:00:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 1/414 variables, 62/83 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Problem TDEAD274 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 20/127 constraints. Problems are: Problem set: 1 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 20/147 constraints. Problems are: Problem set: 1 solved, 337 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 20/167 constraints. Problems are: Problem set: 1 solved, 337 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 20/187 constraints. Problems are: Problem set: 1 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/753 variables, and 193 constraints, problems are : Problem set: 1 solved, 337 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/414 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 106/106 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 337 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 21/21 constraints. Problems are: Problem set: 1 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 1/414 variables, 62/83 constraints. Problems are: Problem set: 1 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 4/87 constraints. Problems are: Problem set: 1 solved, 337 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 106/193 constraints. Problems are: Problem set: 1 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 20/213 constraints. Problems are: Problem set: 1 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 20/233 constraints. Problems are: Problem set: 1 solved, 337 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 20/253 constraints. Problems are: Problem set: 1 solved, 337 unsolved
Problem TDEAD291 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 20/273 constraints. Problems are: Problem set: 2 solved, 336 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 20/293 constraints. Problems are: Problem set: 2 solved, 336 unsolved
Problem TDEAD294 is UNSAT
Problem TDEAD294 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 20/313 constraints. Problems are: Problem set: 3 solved, 335 unsolved
SMT process timed out in 60092ms, After SMT, problems are : Problem set: 3 solved, 335 unsolved
Search for dead transitions found 3 dead transitions in 60097ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 414/414 places, 336/339 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 413 transition count 336
Applied a total of 1 rules in 13 ms. Remains 413 /414 variables (removed 1) and now considering 336/336 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17906376861332009893.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4649157458340689734.kers'
[2026-05-24 10:01:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17906376861332009893.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4649157458340689734.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 336 rows 413 cols 1002 entries
Finished phase 1 with 270 SingleSign rule and 55 generalized
[2026-05-24 10:01:55] [INFO ] Computed 88 invariants in 3 ms
Computed 88 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4649157458340689734.kers
Total runtime 5 ms.
[2026-05-24 10:01:55] [INFO ] Implicit Places using invariants in 184 ms returned []
[2026-05-24 10:01:56] [INFO ] Invariant cache hit.
[2026-05-24 10:01:56] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 413/414 places, 336/339 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61318 ms. Remains : 413/414 places, 336/339 transitions.
Support contains 40 out of 413 places after structural reductions.
[2026-05-24 10:01:56] [INFO ] Flatten gal took : 49 ms
[2026-05-24 10:01:56] [INFO ] Flatten gal took : 21 ms
[2026-05-24 10:01:56] [INFO ] Input system was already deterministic with 336 transitions.
Support contains 39 out of 413 places (down from 40) after GAL structural reductions.
RANDOM walk for 40000 steps (327 resets) in 1510 ms. (26 steps per ms) remains 5/29 properties
BEST_FIRST walk for 40004 steps (53 resets) in 156 ms. (254 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (58 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (55 resets) in 78 ms. (506 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (58 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (56 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
[2026-05-24 10:01:57] [INFO ] Invariant cache hit.
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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 54/58 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 270/328 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 82/410 variables, 27/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 334/744 variables, 410/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/744 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 5/749 variables, 3/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/749 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/749 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 749/749 variables, and 501 constraints, problems are : Problem set: 0 solved, 4 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 54/58 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 270/328 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 82/410 variables, 27/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 334/744 variables, 410/504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/744 variables, 4/508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/744 variables, 2/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/744 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/749 variables, 3/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/749 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/749 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 749/749 variables, and 513 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1215 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1584ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1285 ms.
Support contains 4 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 336/336 transitions.
Graph (trivial) has 189 edges and 413 vertex of which 6 / 413 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 856 edges and 408 vertex of which 407 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 407 transition count 288
Reduce places removed 40 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 367 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 366 transition count 287
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 84 place count 366 transition count 202
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 183 rules applied. Total rules applied 267 place count 268 transition count 202
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 277 place count 258 transition count 192
Iterating global reduction 3 with 10 rules applied. Total rules applied 287 place count 258 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 287 place count 258 transition count 191
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 289 place count 257 transition count 191
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 507 place count 142 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 509 place count 141 transition count 91
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 511 place count 141 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 513 place count 139 transition count 89
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 514 place count 139 transition count 89
Applied a total of 514 rules in 72 ms. Remains 139 /413 variables (removed 274) and now considering 89/336 (removed 247) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 139/413 places, 89/336 transitions.
RANDOM walk for 1013 steps (41 resets) in 55 ms. (18 steps per ms) remains 0/4 properties
Computed a total of 204 stabilizing places and 178 stable transitions
Graph (complete) has 863 edges and 413 vertex of which 412 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(F(X(((p0 U F(p0))||p1))) U !p1)))'
Support contains 5 out of 413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 336/336 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 400 transition count 323
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 400 transition count 323
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 397 transition count 320
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 397 transition count 320
Applied a total of 32 rules in 25 ms. Remains 397 /413 variables (removed 16) and now considering 320/336 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2208347744256459049.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9273170136539267294.kers'
[2026-05-24 10:02:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2208347744256459049.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9273170136539267294.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 320 rows 397 cols 970 entries
Finished phase 1 with 254 SingleSign rule and 55 generalized
[2026-05-24 10:02:00] [INFO ] Computed 88 invariants in 5 ms
Computed 88 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-9273170136539267294.kers
Total runtime 6 ms.
[2026-05-24 10:02:01] [INFO ] Implicit Places using invariants in 178 ms returned []
[2026-05-24 10:02:01] [INFO ] Invariant cache hit.
[2026-05-24 10:02:01] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2026-05-24 10:02:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 1/397 variables, 61/84 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 319 unsolved
SMT process timed out in 30110ms, After SMT, problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 30114ms
Starting structural reductions in LTL mode, iteration 1 : 397/413 places, 320/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30740 ms. Remains : 397/413 places, 320/336 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(!(F(X(((p0 U F(p0))||p1))) U !p1)))'
Stuttering acceptance computed with spot in 312 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) p0), (OR p0 p1)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-02 finished in 31124 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 U (p1||G(p0))))))'
Support contains 3 out of 413 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 413/413 places, 336/336 transitions.
Graph (trivial) has 191 edges and 413 vertex of which 6 / 413 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 857 edges and 408 vertex of which 407 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 406 transition count 287
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 365 transition count 287
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 84 place count 365 transition count 201
Deduced a syphon composed of 86 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 269 place count 266 transition count 201
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 281 place count 254 transition count 189
Iterating global reduction 2 with 12 rules applied. Total rules applied 293 place count 254 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 293 place count 254 transition count 188
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 295 place count 253 transition count 188
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 504 place count 143 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 506 place count 142 transition count 92
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 512 place count 142 transition count 92
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 513 place count 141 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 514 place count 140 transition count 91
Applied a total of 514 rules in 49 ms. Remains 140 /413 variables (removed 273) and now considering 91/336 (removed 245) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16139729525694522600.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7060699568061097670.kers'
[2026-05-24 10:02:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16139729525694522600.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7060699568061097670.kers]
Normalized transition count is 90 out of 91 initially.
Culling duplicate invariants (modulo rational): removing 42 columns.
Culled 42 columns in 0 ms.
// Phase 1: matrix 90 rows 98 cols 301 entries
Finished phase 1 with 63 SingleSign rule and 14 generalized
[2026-05-24 10:02:31] [INFO ] Computed 63 invariants in 1 ms
Computed 63 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7060699568061097670.kers
Total runtime 2 ms.
[2026-05-24 10:02:32] [INFO ] Implicit Places using invariants in 108 ms returned [0, 1, 2, 3, 4, 5, 6, 21, 22, 23, 24, 25, 26, 37, 42]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 110 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/413 places, 91/336 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 125/413 places, 91/336 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 U (G(p0)||p1)))))'
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-03
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-03 finished in 279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(X(!p0)) U ((p1&&X(X(!p0)))||X(X(G(!p0))))))||(F((X(p2)||G(!p3)))&&(X(X(!p0)) U ((p1&&X(X(!p0)))||X(X(G(!p0)))))))))'
Support contains 7 out of 413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 336/336 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 401 transition count 324
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 401 transition count 324
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 398 transition count 321
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 398 transition count 321
Applied a total of 30 rules in 28 ms. Remains 398 /413 variables (removed 15) and now considering 321/336 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3538174055878801040.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13190770479429466944.kers'
[2026-05-24 10:02:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3538174055878801040.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13190770479429466944.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 321 rows 398 cols 972 entries
Finished phase 1 with 255 SingleSign rule and 55 generalized
[2026-05-24 10:02:32] [INFO ] Computed 88 invariants in 1 ms
Computed 88 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13190770479429466944.kers
Total runtime 2 ms.
[2026-05-24 10:02:32] [INFO ] Implicit Places using invariants in 171 ms returned []
[2026-05-24 10:02:32] [INFO ] Invariant cache hit.
[2026-05-24 10:02:32] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2026-05-24 10:02:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/398 variables, 61/84 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 320 unsolved
SMT process timed out in 30053ms, After SMT, problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 30054ms
Starting structural reductions in LTL mode, iteration 1 : 398/413 places, 321/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30639 ms. Remains : 398/413 places, 321/336 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(X(!p0)) U ((p1&&X(X(!p0)))||X(X(G(!p0))))))||(F((X(p2)||G(p3)))&&(X(X(!p0)) U ((p1&&X(X(!p0)))||X(X(G(!p0)))))))))'
Stuttering acceptance computed with spot in 419 ms :[p0, p0, (AND p0 (NOT p2) (NOT p3)), p0, (AND (NOT p2) p0 (NOT p3)), p0, p0, (AND (NOT p2) p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), true, (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-04
Product exploration explored 100000 steps with 28548 reset in 255 ms.
Product exploration explored 100000 steps with 28551 reset in 156 ms.
Computed a total of 193 stabilizing places and 167 stable transitions
Graph (complete) has 845 edges and 398 vertex of which 397 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 193 stabilizing places and 167 stable transitions
Detected a total of 193/398 stabilizing places and 167/321 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge based reduction with 11 factoid took 108 ms. Reduced automaton from 11 states, 22 edges and 4 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (328 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
BEST_FIRST walk for 23413 steps (30 resets) in 45 ms. (508 steps per ms) remains 0/1 properties
Knowledge based reduction with 11 factoid took 83 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[p0, p0, p0, p0, true]
Knowledge-based reduction took 478 ms.
Stuttering acceptance computed with spot in 180 ms :[p0, p0, p0, p0, true]
Support contains 3 out of 398 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 398/398 places, 321/321 transitions.
Applied a total of 0 rules in 12 ms. Remains 398 /398 variables (removed 0) and now considering 321/321 (removed 0) transitions.
[2026-05-24 10:03:04] [INFO ] Invariant cache hit.
[2026-05-24 10:03:04] [INFO ] Implicit Places using invariants in 173 ms returned []
[2026-05-24 10:03:04] [INFO ] Invariant cache hit.
[2026-05-24 10:03:05] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 587 ms. Remains : 398/398 places, 321/321 transitions.
Computed a total of 193 stabilizing places and 167 stable transitions
Graph (complete) has 845 edges and 398 vertex of which 397 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 193 stabilizing places and 167 stable transitions
Detected a total of 193/398 stabilizing places and 167/321 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 38 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 36161 steps (295 resets) in 123 ms. (291 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 54 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[p0, p0, p0, p0, true]
Knowledge-based reduction took 327 ms.
Stuttering acceptance computed with spot in 168 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 174 ms :[p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 25000 reset in 113 ms.
Product exploration explored 100000 steps with 25000 reset in 112 ms.
Spot run failed in 75 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/ltsmin6333673709549292031
[2026-05-24 10:03:06] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6333673709549292031
Running compilation step : cd /tmp/ltsmin6333673709549292031;'/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'
Compilation finished in 612 ms.
Running link step : cd /tmp/ltsmin6333673709549292031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin6333673709549292031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased9528404028532218164.hoa' '--buchi-type=spotba'
LTSmin run took 52 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-10-LTLFireability-04 finished in 34596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X(p1)||F(p2)) U (p1&&X(X(!p2))))))'
Support contains 3 out of 413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 336/336 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 400 transition count 323
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 400 transition count 323
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 397 transition count 320
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 397 transition count 320
Applied a total of 32 rules in 26 ms. Remains 397 /413 variables (removed 16) and now considering 320/336 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15599071025021832.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14028465161712071398.kers'
[2026-05-24 10:03:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15599071025021832.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14028465161712071398.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 320 rows 397 cols 970 entries
Finished phase 1 with 254 SingleSign rule and 55 generalized
[2026-05-24 10:03:06] [INFO ] Computed 88 invariants in 5 ms
Computed 88 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14028465161712071398.kers
Total runtime 7 ms.
[2026-05-24 10:03:07] [INFO ] Implicit Places using invariants in 186 ms returned []
[2026-05-24 10:03:07] [INFO ] Invariant cache hit.
[2026-05-24 10:03:07] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2026-05-24 10:03:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 1/397 variables, 61/84 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 319 unsolved
SMT process timed out in 30057ms, After SMT, problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 30058ms
Starting structural reductions in LTL mode, iteration 1 : 397/413 places, 320/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30673 ms. Remains : 397/413 places, 320/336 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(((p0||X(p1)||F(p2)) U (p1&&X(X(!p2))))))'
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (AND (NOT p2) (NOT p1)), p2, (NOT p2), p2, p2]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-06
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-06 finished in 31044 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 413 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 413/413 places, 336/336 transitions.
Graph (trivial) has 192 edges and 413 vertex of which 6 / 413 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 857 edges and 408 vertex of which 407 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 406 transition count 287
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 365 transition count 287
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 87 Pre rules applied. Total rules applied 84 place count 365 transition count 200
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 187 rules applied. Total rules applied 271 place count 265 transition count 200
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 283 place count 253 transition count 188
Iterating global reduction 2 with 12 rules applied. Total rules applied 295 place count 253 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 295 place count 253 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 297 place count 252 transition count 187
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 511 place count 139 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 513 place count 138 transition count 89
Applied a total of 513 rules in 36 ms. Remains 138 /413 variables (removed 275) and now considering 89/336 (removed 247) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7629195368232365032.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6817125658848478490.kers'
[2026-05-24 10:03:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7629195368232365032.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6817125658848478490.kers]
Normalized transition count is 88 out of 89 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 88 rows 137 cols 494 entries
Finished phase 1 with 55 SingleSign rule and 20 generalized
[2026-05-24 10:03:37] [INFO ] Computed 63 invariants in 1 ms
Computed 63 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6817125658848478490.kers
Total runtime 2 ms.
[2026-05-24 10:03:37] [INFO ] Implicit Places using invariants in 106 ms returned [1, 2, 3, 4, 5, 6, 7, 20, 21, 22, 23, 24, 25, 39, 40]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 107 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/413 places, 89/336 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 148 ms. Remains : 123/413 places, 89/336 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 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-07 finished in 245 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((X(p0)||((F(p1) U p2) U (p3 U p0)))))'
Support contains 3 out of 413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 336/336 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 402 transition count 325
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 402 transition count 325
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 399 transition count 322
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 399 transition count 322
Applied a total of 28 rules in 25 ms. Remains 399 /413 variables (removed 14) and now considering 322/336 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16015962531174786972.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13316986803402921030.kers'
[2026-05-24 10:03:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16015962531174786972.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13316986803402921030.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 322 rows 399 cols 974 entries
Finished phase 1 with 256 SingleSign rule and 55 generalized
[2026-05-24 10:03:38] [INFO ] Computed 88 invariants in 5 ms
Computed 88 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-13316986803402921030.kers
Total runtime 7 ms.
[2026-05-24 10:03:38] [INFO ] Implicit Places using invariants in 184 ms returned []
[2026-05-24 10:03:38] [INFO ] Invariant cache hit.
[2026-05-24 10:03:38] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2026-05-24 10:03:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/399 variables, 61/84 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 9/177 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/721 variables, and 179 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/399 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 91/91 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/399 variables, 61/84 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 91/179 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 8/207 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 6/216 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
At refinement iteration 11 (OVERLAPS) 322/721 variables, 399/617 constraints. Problems are: Problem set: 2 solved, 319 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/721 variables, 319/936 constraints. Problems are: Problem set: 2 solved, 319 unsolved
SMT process timed out in 60056ms, After SMT, problems are : Problem set: 2 solved, 319 unsolved
Search for dead transitions found 2 dead transitions in 60057ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 399/413 places, 320/336 transitions.
Applied a total of 0 rules in 9 ms. Remains 399 /399 variables (removed 0) and now considering 320/320 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60628 ms. Remains : 399/413 places, 320/336 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((X(p0)||((F(p1) U p2) U (p3 U p0)))))'
Stuttering acceptance computed with spot in 326 ms :[(NOT p0), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p2) p3), (NOT p0), (AND (NOT p0) (NOT p1) p2), (NOT p1), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-08
Stuttering criterion allowed to conclude after 118 steps with 3 reset in 2 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-08 finished in 61021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1) U X(p2))))'
Support contains 3 out of 413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 336/336 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 401 transition count 324
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 401 transition count 324
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 398 transition count 321
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 398 transition count 321
Applied a total of 30 rules in 27 ms. Remains 398 /413 variables (removed 15) and now considering 321/336 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-214316405912090975.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13025627043242998916.kers'
[2026-05-24 10:04:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-214316405912090975.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13025627043242998916.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 321 rows 398 cols 972 entries
Finished phase 1 with 255 SingleSign rule and 55 generalized
[2026-05-24 10:04:39] [INFO ] Computed 88 invariants in 4 ms
Computed 88 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13025627043242998916.kers
Total runtime 5 ms.
[2026-05-24 10:04:39] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-24 10:04:39] [INFO ] Invariant cache hit.
[2026-05-24 10:04:39] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2026-05-24 10:04:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/398 variables, 61/84 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 320 unsolved
SMT process timed out in 30076ms, After SMT, problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 30079ms
Starting structural reductions in LTL mode, iteration 1 : 398/413 places, 321/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30658 ms. Remains : 398/413 places, 321/336 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1) U X(p2))))'
Stuttering acceptance computed with spot in 312 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-09 finished in 31002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(p1))))))'
Support contains 2 out of 413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 336/336 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 402 transition count 325
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 402 transition count 325
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 399 transition count 322
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 399 transition count 322
Applied a total of 28 rules in 26 ms. Remains 399 /413 variables (removed 14) and now considering 322/336 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11401985848781504415.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11253288117743321903.kers'
[2026-05-24 10:05:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11401985848781504415.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11253288117743321903.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 322 rows 399 cols 974 entries
Finished phase 1 with 256 SingleSign rule and 55 generalized
[2026-05-24 10:05:10] [INFO ] Computed 88 invariants in 5 ms
Computed 88 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11253288117743321903.kers
Total runtime 7 ms.
[2026-05-24 10:05:10] [INFO ] Implicit Places using invariants in 187 ms returned []
[2026-05-24 10:05:10] [INFO ] Invariant cache hit.
[2026-05-24 10:05:10] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2026-05-24 10:05:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/399 variables, 61/84 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/721 variables, and 208 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/399 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 120/120 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/399 variables, 61/84 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 120/208 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 12/260 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 19/279 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 11/290 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 7/297 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/721 variables, and 302 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/399 constraints, PredecessorRefiner: 0/321 constraints, Known Traps: 214/214 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60050ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Starting structural reductions in LTL mode, iteration 1 : 399/413 places, 322/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60649 ms. Remains : 399/413 places, 322/336 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(F((p0&&X(p1))))))'
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-11
Product exploration explored 100000 steps with 25000 reset in 109 ms.
Product exploration explored 100000 steps with 25000 reset in 123 ms.
Computed a total of 194 stabilizing places and 168 stable transitions
Graph (complete) has 846 edges and 399 vertex of which 398 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 194 stabilizing places and 168 stable transitions
Detected a total of 194/399 stabilizing places and 168/322 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 4 factoid took 57 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 2464 steps (18 resets) in 10 ms. (224 steps per ms) remains 0/4 properties
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Knowledge-based reduction took 304 ms.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Support contains 2 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 322/322 transitions.
Applied a total of 0 rules in 10 ms. Remains 399 /399 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2026-05-24 10:06:11] [INFO ] Invariant cache hit.
[2026-05-24 10:06:11] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-24 10:06:11] [INFO ] Invariant cache hit.
[2026-05-24 10:06:12] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 565 ms. Remains : 399/399 places, 322/322 transitions.
Computed a total of 194 stabilizing places and 168 stable transitions
Graph (complete) has 846 edges and 399 vertex of which 398 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 194 stabilizing places and 168 stable transitions
Detected a total of 194/399 stabilizing places and 168/322 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 4 factoid took 47 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 3155 steps (22 resets) in 14 ms. (210 steps per ms) remains 0/4 properties
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Knowledge-based reduction took 291 ms.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 109 ms.
Product exploration explored 100000 steps with 25000 reset in 114 ms.
Spot run failed in 48 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/ltsmin15590584885962252214
[2026-05-24 10:06:13] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15590584885962252214
Running compilation step : cd /tmp/ltsmin15590584885962252214;'/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'
Compilation finished in 497 ms.
Running link step : cd /tmp/ltsmin15590584885962252214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15590584885962252214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased6778639951614715836.hoa' '--buchi-type=spotba'
LTSmin run took 35 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-10-LTLFireability-11 finished in 63538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 413/413 places, 336/336 transitions.
Graph (trivial) has 192 edges and 413 vertex of which 6 / 413 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 857 edges and 408 vertex of which 407 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 406 transition count 287
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 365 transition count 287
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 87 Pre rules applied. Total rules applied 84 place count 365 transition count 200
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 187 rules applied. Total rules applied 271 place count 265 transition count 200
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 283 place count 253 transition count 188
Iterating global reduction 2 with 12 rules applied. Total rules applied 295 place count 253 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 295 place count 253 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 297 place count 252 transition count 187
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 511 place count 139 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 513 place count 138 transition count 89
Applied a total of 513 rules in 35 ms. Remains 138 /413 variables (removed 275) and now considering 89/336 (removed 247) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-982979927287172504.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9678874622569113971.kers'
[2026-05-24 10:06:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-982979927287172504.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9678874622569113971.kers]
Normalized transition count is 88 out of 89 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 88 rows 137 cols 494 entries
Finished phase 1 with 54 SingleSign rule and 21 generalized
[2026-05-24 10:06:13] [INFO ] Computed 63 invariants in 0 ms
Computed 63 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9678874622569113971.kers
Total runtime 2 ms.
[2026-05-24 10:06:13] [INFO ] Implicit Places using invariants in 103 ms returned [1, 2, 3, 4, 5, 6, 7, 20, 21, 22, 23, 24, 25, 39, 40]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 119 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/413 places, 89/336 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 158 ms. Remains : 123/413 places, 89/336 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 32 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-12 finished in 215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((!p0&&X((!p0 U (G(!p0)||X(p1)))))))) U ((X(X(X((!p0&&X((!p0 U (G(!p0)||X(p1))))))))&&(!p2||G(p3)))||X(X(X(G((!p0&&X((!p0 U (G(!p0)||X(p1))))))))))))'
Support contains 9 out of 413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 336/336 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 401 transition count 324
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 401 transition count 324
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 398 transition count 321
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 398 transition count 321
Applied a total of 30 rules in 26 ms. Remains 398 /413 variables (removed 15) and now considering 321/336 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4166903584623540116.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11657308480133063755.kers'
[2026-05-24 10:06:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4166903584623540116.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11657308480133063755.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 321 rows 398 cols 972 entries
Finished phase 1 with 255 SingleSign rule and 55 generalized
[2026-05-24 10:06:13] [INFO ] Computed 88 invariants in 2 ms
Computed 88 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11657308480133063755.kers
Total runtime 3 ms.
[2026-05-24 10:06:14] [INFO ] Implicit Places using invariants in 172 ms returned []
[2026-05-24 10:06:14] [INFO ] Invariant cache hit.
[2026-05-24 10:06:14] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2026-05-24 10:06:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/398 variables, 61/84 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 320 unsolved
SMT process timed out in 30065ms, After SMT, problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 30066ms
Starting structural reductions in LTL mode, iteration 1 : 398/413 places, 321/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30631 ms. Remains : 398/413 places, 321/336 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&&X((!p0 U (G(!p0)||X(p1)))))))) U (X(X(X(G((!p0&&X((!p0 U (G(!p0)||X(p1)))))))))||(X(X(X((!p0&&X((!p0 U (G(!p0)||X(p1))))))))&&(!p2||G(p3))))))'
Stuttering acceptance computed with spot in 1289 ms :[p0, p0, (AND p0 (NOT p3)), p0, p0, (AND p0 (NOT p3)), (AND p0 (NOT p3)), true, (AND (NOT p1) p0), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-14
Product exploration explored 100000 steps with 16666 reset in 117 ms.
Product exploration explored 100000 steps with 16666 reset in 117 ms.
Computed a total of 192 stabilizing places and 166 stable transitions
Graph (complete) has 847 edges and 398 vertex of which 397 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 192 stabilizing places and 166 stable transitions
Detected a total of 192/398 stabilizing places and 166/321 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 38 factoid took 736 ms. Reduced automaton from 32 states, 112 edges and 4 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (331 resets) in 173 ms. (229 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (56 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (55 resets) in 142 ms. (279 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (57 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
[2026-05-24 10:06:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 263/320 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 75/395 variables, 27/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 319/714 variables, 395/492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/714 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/714 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/714 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 5/719 variables, 3/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/719 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/719 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 719/719 variables, and 499 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1229 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 263/320 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 75/395 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 319/714 variables, 395/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/714 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/714 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/714 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/714 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/714 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 5/719 variables, 3/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/719 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/719 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 719/719 variables, and 505 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1003 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2236ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 412 ms.
Support contains 3 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 321/321 transitions.
Graph (trivial) has 176 edges and 398 vertex of which 6 / 398 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 840 edges and 393 vertex of which 392 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 392 transition count 278
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 357 transition count 278
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 72 place count 357 transition count 194
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 252 place count 261 transition count 194
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 478 place count 142 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 480 place count 141 transition count 90
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 482 place count 141 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 484 place count 139 transition count 88
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 489 place count 139 transition count 88
Applied a total of 489 rules in 22 ms. Remains 139 /398 variables (removed 259) and now considering 88/321 (removed 233) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 139/398 places, 88/321 transitions.
RANDOM walk for 40000 steps (1812 resets) in 167 ms. (238 steps per ms) remains 1/3 properties
BEST_FIRST walk for 17281 steps (314 resets) in 35 ms. (480 steps per ms) remains 0/1 properties
Knowledge based reduction with 38 factoid took 143 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), p0, p0, p0]
Knowledge-based reduction took 4096 ms.
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), p0, p0, p0]
Support contains 3 out of 398 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 398/398 places, 321/321 transitions.
Applied a total of 0 rules in 9 ms. Remains 398 /398 variables (removed 0) and now considering 321/321 (removed 0) transitions.
[2026-05-24 10:06:50] [INFO ] Invariant cache hit.
[2026-05-24 10:06:50] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-24 10:06:50] [INFO ] Invariant cache hit.
[2026-05-24 10:06:51] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 517 ms. Remains : 398/398 places, 321/321 transitions.
Computed a total of 192 stabilizing places and 166 stable transitions
Graph (complete) has 847 edges and 398 vertex of which 397 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 192 stabilizing places and 166 stable transitions
Detected a total of 192/398 stabilizing places and 166/321 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 2 factoid took 53 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (331 resets) in 190 ms. (209 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (57 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (55 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (57 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
[2026-05-24 10:06:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 263/320 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 75/395 variables, 27/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 319/714 variables, 395/492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/714 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/714 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/714 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 5/719 variables, 3/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/719 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/719 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 719/719 variables, and 499 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1247 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 263/320 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 75/395 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 319/714 variables, 395/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/714 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/714 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/714 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/714 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/714 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 5/719 variables, 3/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/719 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/719 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 719/719 variables, and 505 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1050 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2304ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 347 ms.
Support contains 3 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 321/321 transitions.
Graph (trivial) has 176 edges and 398 vertex of which 6 / 398 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 840 edges and 393 vertex of which 392 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 392 transition count 278
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 357 transition count 278
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 72 place count 357 transition count 194
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 252 place count 261 transition count 194
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 478 place count 142 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 480 place count 141 transition count 90
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 482 place count 141 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 484 place count 139 transition count 88
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 489 place count 139 transition count 88
Applied a total of 489 rules in 23 ms. Remains 139 /398 variables (removed 259) and now considering 88/321 (removed 233) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 139/398 places, 88/321 transitions.
RANDOM walk for 40000 steps (1764 resets) in 154 ms. (258 steps per ms) remains 1/3 properties
BEST_FIRST walk for 36377 steps (668 resets) in 71 ms. (505 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), p0, p0, p0]
Knowledge-based reduction took 3275 ms.
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), p0, p0, p0]
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), p0, p0, p0]
Product exploration explored 100000 steps with 16666 reset in 99 ms.
Product exploration explored 100000 steps with 16666 reset in 105 ms.
Spot run failed in 48 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/ltsmin2809007682482784559
[2026-05-24 10:06:55] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2809007682482784559
Running compilation step : cd /tmp/ltsmin2809007682482784559;'/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'
Compilation finished in 480 ms.
Running link step : cd /tmp/ltsmin2809007682482784559;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2809007682482784559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased11517777875542246944.hoa' '--buchi-type=spotba'
LTSmin run took 36 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-10-LTLFireability-14 finished in 41803 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&&X(X((p1||G(p2)))))||(X(X((p1||G(p2))))&&F(p3))))))'
Support contains 4 out of 413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 336/336 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 402 transition count 325
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 402 transition count 325
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 399 transition count 322
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 399 transition count 322
Applied a total of 28 rules in 26 ms. Remains 399 /413 variables (removed 14) and now considering 322/336 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5851034078072314024.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3023511235801219550.kers'
[2026-05-24 10:06:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5851034078072314024.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3023511235801219550.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 322 rows 399 cols 974 entries
Finished phase 1 with 256 SingleSign rule and 55 generalized
[2026-05-24 10:06:55] [INFO ] Computed 88 invariants in 1 ms
Computed 88 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3023511235801219550.kers
Total runtime 3 ms.
[2026-05-24 10:06:55] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-24 10:06:55] [INFO ] Invariant cache hit.
[2026-05-24 10:06:56] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2026-05-24 10:06:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/399 variables, 61/84 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/721 variables, and 208 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/399 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 120/120 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/399 variables, 61/84 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 120/208 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 20/288 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 20/308 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 20/328 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 20/348 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/721 variables, and 360 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/399 constraints, PredecessorRefiner: 0/321 constraints, Known Traps: 272/272 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Starting structural reductions in LTL mode, iteration 1 : 399/413 places, 322/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60630 ms. Remains : 399/413 places, 322/336 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&&X(X((p1||G(p2)))))||(X(X((p1||G(p2))))&&F(p3))))))'
Stuttering acceptance computed with spot in 368 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-15
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-15 finished in 61053 ms.
All properties solved by simple procedures.
Total runtime 484007 ms.

BK_STOP 1779617276752

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946842000524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-10.tgz
mv BusinessProcesses-PT-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;