MCC'2026- Execution of r194-tall-177969914300740

About the Execution of ITS-Tools for Peterson-PT-7

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16199.287	3600000.00	5253618.00	538002.50	FF?FFTF?FFFTF?FF	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r194-tall-177969914300740.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 Peterson-PT-7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914300740
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.8M
-rw-r--r-- 1 mcc users 303K Mar 8 07:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Mar 8 07:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 183K Mar 8 07:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 822K Mar 8 07:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 123K Mar 16 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 365K Mar 16 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 148K Mar 16 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 482K Mar 16 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 411K Mar 8 07:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.6M Mar 8 07:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 519K Mar 8 07:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.3M Mar 8 07:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 19K Mar 16 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 42K Mar 16 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 Peterson-PT-7-LTLFireability-00
FORMULA_NAME Peterson-PT-7-LTLFireability-01
FORMULA_NAME Peterson-PT-7-LTLFireability-02
FORMULA_NAME Peterson-PT-7-LTLFireability-03
FORMULA_NAME Peterson-PT-7-LTLFireability-04
FORMULA_NAME Peterson-PT-7-LTLFireability-05
FORMULA_NAME Peterson-PT-7-LTLFireability-06
FORMULA_NAME Peterson-PT-7-LTLFireability-07
FORMULA_NAME Peterson-PT-7-LTLFireability-08
FORMULA_NAME Peterson-PT-7-LTLFireability-09
FORMULA_NAME Peterson-PT-7-LTLFireability-10
FORMULA_NAME Peterson-PT-7-LTLFireability-11
FORMULA_NAME Peterson-PT-7-LTLFireability-12
FORMULA_NAME Peterson-PT-7-LTLFireability-13
FORMULA_NAME Peterson-PT-7-LTLFireability-14
FORMULA_NAME Peterson-PT-7-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779827644198

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-7
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 20:34:05] [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-26 20:34:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 20:34:05] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2026-05-26 20:34:05] [INFO ] Transformed 1992 places.
[2026-05-26 20:34:05] [INFO ] Transformed 3096 transitions.
[2026-05-26 20:34:05] [INFO ] Found NUPN structural information;
[2026-05-26 20:34:05] [INFO ] Parsed PT model containing 1992 places and 3096 transitions and 9584 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-PT-7-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1492 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 74 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2026-05-26 20:34:06] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1644602631468850872.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15947695757997502565.kers'
[2026-05-26 20:34:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1644602631468850872.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15947695757997502565.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 2 ms.
// Phase 1: matrix 2760 rows 1976 cols 6304 entries
Finished phase 1 with 1956 SingleSign rule and 5 generalized
[2026-05-26 20:34:06] [INFO ] Computed 31 invariants in 15 ms
Computed 31 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-15947695757997502565.kers
Total runtime 18 ms.
[2026-05-26 20:34:06] [INFO ] Implicit Places using invariants in 610 ms returned []
[2026-05-26 20:34:06] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2026-05-26 20:34:06] [INFO ] Invariant cache hit.
[2026-05-26 20:34:08] [INFO ] State equation strengthened by 497 read => feed constraints.
[2026-05-26 20:34:08] [INFO ] Implicit Places using invariants and state equation in 1279 ms returned []
Implicit Place search using SMT with State Equation took 1925 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2026-05-26 20:34:08] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2026-05-26 20:34:08] [INFO ] Invariant cache hit.
[2026-05-26 20:34:08] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 31203ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 31232ms
Finished structural reductions in LTL mode , in 1 iterations and 33290 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 62 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2026-05-26 20:34:39] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2026-05-26 20:34:39] [INFO ] Invariant cache hit.
[2026-05-26 20:34:39] [INFO ] Implicit Places using invariants in 474 ms returned []
[2026-05-26 20:34:39] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2026-05-26 20:34:39] [INFO ] Invariant cache hit.
[2026-05-26 20:34:41] [INFO ] State equation strengthened by 497 read => feed constraints.
[2026-05-26 20:34:41] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 1682 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1746 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Support contains 1492 out of 1992 places after structural reductions.
[2026-05-26 20:34:41] [INFO ] Flatten gal took : 228 ms
[2026-05-26 20:34:41] [INFO ] Flatten gal took : 141 ms
[2026-05-26 20:34:42] [INFO ] Input system was already deterministic with 3096 transitions.
Reduction of identical properties reduced properties to check from 34 to 32
RANDOM walk for 40000 steps (8 resets) in 2004 ms. (19 steps per ms) remains 9/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
[2026-05-26 20:34:43] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2026-05-26 20:34:43] [INFO ] Invariant cache hit.
[2026-05-26 20:34:43] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 475/485 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/485 variables, 475/488 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 3/488 variables, 3/491 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 3/494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 718/1206 variables, 5/499 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1206 variables, 718/1217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1206 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 4/1210 variables, 4/1221 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1210 variables, 4/1225 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SMT process timed out in 5176ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 880 transitions
Trivial Post-agglo rules discarded 880 transitions
Performed 880 trivial Post agglomeration. Transition count delta: 880
Iterating post reduction 0 with 880 rules applied. Total rules applied 880 place count 1992 transition count 2216
Reduce places removed 880 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 884 rules applied. Total rules applied 1764 place count 1112 transition count 2212
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1768 place count 1108 transition count 2212
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 446 Pre rules applied. Total rules applied 1768 place count 1108 transition count 1766
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 3 with 892 rules applied. Total rules applied 2660 place count 662 transition count 1766
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2770 place count 607 transition count 1711
Applied a total of 2770 rules in 411 ms. Remains 607 /1992 variables (removed 1385) and now considering 1711/3096 (removed 1385) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 412 ms. Remains : 607/1992 places, 1711/3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 356 ms. (112 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 450765 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :0 out of 9
Probabilistic random walk after 450765 steps, saw 63730 distinct states, run finished after 3006 ms. (steps per millisecond=149 ) properties seen :0
[2026-05-26 20:34:52] [INFO ] Flow matrix only has 1375 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6320843552181112534.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14493973383990749805.kers'
[2026-05-26 20:34:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6320843552181112534.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14493973383990749805.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 0 ms.
// Phase 1: matrix 1375 rows 591 cols 3534 entries
Finished phase 1 with 571 SingleSign rule and 5 generalized
[2026-05-26 20:34:52] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14493973383990749805.kers
Total runtime 5 ms.
[2026-05-26 20:34:52] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 135/145 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 135/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 3/148 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 198/346 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 198/357 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 4/350 variables, 4/361 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 4/365 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/350 variables, 5/370 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 865/1215 variables, 350/720 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1215 variables, 196/916 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1215 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 203/1418 variables, 56/972 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1418 variables, 56/1028 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1418 variables, 7/1035 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1418 variables, 7/1042 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1418 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 273/1691 variables, 42/1084 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1691 variables, 42/1126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1691 variables, 294/1420 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1691 variables, 0/1420 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 51/1742 variables, 1/1421 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1742 variables, 51/1472 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1742 variables, 0/1472 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (OVERLAPS) 1/1743 variables, 1/1473 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1743 variables, 1/1474 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1743 variables, 0/1474 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (OVERLAPS) 103/1846 variables, 3/1477 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1846 variables, 103/1580 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1846 variables, 0/1580 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (OVERLAPS) 4/1850 variables, 4/1584 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1850 variables, 4/1588 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1850 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (OVERLAPS) 132/1982 variables, 159/1747 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1982 variables, 0/1747 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (OVERLAPS) 0/1982 variables, 0/1747 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1982/1982 variables, and 1747 constraints, problems are : Problem set: 0 solved, 9 unsolved in 7147 ms.
Refiners :[Domain max(s): 607/607 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 607/607 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 135/145 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 135/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 3/148 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 198/346 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 198/357 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 4/350 variables, 4/361 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 4/365 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/350 variables, 5/370 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 865/1215 variables, 350/720 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1215 variables, 196/916 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1215 variables, 8/924 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1215 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 203/1418 variables, 56/980 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1418 variables, 56/1036 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1418 variables, 7/1043 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1418 variables, 7/1050 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1418 variables, 20/1070 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1418 variables, 20/1090 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1418 variables, 6/1096 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1418 variables, 6/1102 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1418 variables, 4/1106 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1418 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 273/1691 variables, 42/1148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1691 variables, 42/1190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1691 variables, 294/1484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1691 variables, 1/1485 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1691 variables, 0/1485 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (OVERLAPS) 51/1742 variables, 1/1486 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1742 variables, 51/1537 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1742 variables, 1/1538 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1742 variables, 6/1544 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1742 variables, 3/1547 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1742 variables, 0/1547 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (OVERLAPS) 1/1743 variables, 1/1548 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1743 variables, 1/1549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1743 variables, 5/1554 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1743 variables, 0/1554 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (OVERLAPS) 103/1846 variables, 3/1557 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1846 variables, 103/1660 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1846 variables, 7/1667 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1846 variables, 3/1670 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1846 variables, 0/1670 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 49 (OVERLAPS) 4/1850 variables, 4/1674 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1850 variables, 4/1678 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SMT process timed out in 52260ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1483 ms.
Support contains 10 out of 607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 607/607 places, 1711/1711 transitions.
Applied a total of 0 rules in 78 ms. Remains 607 /607 variables (removed 0) and now considering 1711/1711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 607/607 places, 1711/1711 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 607/607 places, 1711/1711 transitions.
Applied a total of 0 rules in 49 ms. Remains 607 /607 variables (removed 0) and now considering 1711/1711 (removed 0) transitions.
[2026-05-26 20:35:46] [INFO ] Flow matrix only has 1375 transitions (discarded 336 similar events)
[2026-05-26 20:35:46] [INFO ] Invariant cache hit.
[2026-05-26 20:35:47] [INFO ] Implicit Places using invariants in 969 ms returned [591, 592, 593, 594, 595, 604, 605, 606]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 978 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 599/607 places, 1711/1711 transitions.
Applied a total of 0 rules in 47 ms. Remains 599 /599 variables (removed 0) and now considering 1711/1711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1074 ms. Remains : 599/607 places, 1711/1711 transitions.
RANDOM walk for 40000 steps (8 resets) in 242 ms. (164 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 490554 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 9
Probabilistic random walk after 490554 steps, saw 70232 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
[2026-05-26 20:35:50] [INFO ] Flow matrix only has 1375 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14732290702671232682.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8677113509306588599.kers'
[2026-05-26 20:35:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14732290702671232682.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8677113509306588599.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 1375 rows 591 cols 3534 entries
Finished phase 1 with 571 SingleSign rule and 5 generalized
[2026-05-26 20:35:50] [INFO ] Computed 23 invariants in 4 ms
Computed 23 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8677113509306588599.kers
Total runtime 6 ms.
[2026-05-26 20:35:50] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 135/145 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 135/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/147 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 196/343 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 196/351 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 2/345 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 5/360 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/345 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 865/1210 variables, 345/705 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1210 variables, 196/901 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1210 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 203/1413 variables, 56/957 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1413 variables, 56/1013 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1413 variables, 7/1020 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1413 variables, 7/1027 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1413 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 273/1686 variables, 42/1069 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1686 variables, 42/1111 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1686 variables, 294/1405 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1686 variables, 0/1405 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 51/1737 variables, 1/1406 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1737 variables, 51/1457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1737 variables, 0/1457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (OVERLAPS) 1/1738 variables, 1/1458 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1738 variables, 1/1459 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1738 variables, 0/1459 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (OVERLAPS) 102/1840 variables, 2/1461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1840 variables, 102/1563 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1840 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (OVERLAPS) 2/1842 variables, 2/1565 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1842 variables, 2/1567 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1842 variables, 0/1567 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (OVERLAPS) 132/1974 variables, 156/1723 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1974 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (OVERLAPS) 0/1974 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1974/1974 variables, and 1723 constraints, problems are : Problem set: 0 solved, 9 unsolved in 7193 ms.
Refiners :[Domain max(s): 599/599 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 599/599 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 135/145 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 135/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/147 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 196/343 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 196/351 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 2/345 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 5/360 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/345 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 865/1210 variables, 345/705 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1210 variables, 196/901 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1210 variables, 8/909 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1210 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1210 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 203/1413 variables, 56/966 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1413 variables, 56/1022 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1413 variables, 7/1029 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1413 variables, 7/1036 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1413 variables, 20/1056 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1413 variables, 20/1076 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1413 variables, 9/1085 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1413 variables, 5/1090 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1413 variables, 2/1092 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1413 variables, 3/1095 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1413 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (OVERLAPS) 273/1686 variables, 42/1137 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1686 variables, 42/1179 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1686 variables, 294/1473 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1686 variables, 0/1473 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (OVERLAPS) 51/1737 variables, 1/1474 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1737 variables, 51/1525 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1737 variables, 1/1526 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1737 variables, 4/1530 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1737 variables, 0/1530 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (OVERLAPS) 1/1738 variables, 1/1531 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1738 variables, 1/1532 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1738 variables, 2/1534 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1738 variables, 2/1536 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1738 variables, 0/1536 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (OVERLAPS) 102/1840 variables, 2/1538 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1840 variables, 102/1640 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1840 variables, 7/1647 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1840 variables, 4/1651 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1840 variables, 1/1652 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1840 variables, 7/1659 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1840 variables, 4/1663 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1840 variables, 1/1664 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1840 variables, 0/1664 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 54 (OVERLAPS) 2/1842 variables, 2/1666 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1842 variables, 2/1668 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1842 variables, 12/1680 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1842 variables, 2/1682 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1842 variables, 1/1683 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1842 variables, 0/1683 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 60 (OVERLAPS) 132/1974 variables, 156/1839 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1974 variables, 2/1841 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1974 variables, 0/1841 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 63 (OVERLAPS) 0/1974 variables, 0/1841 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1974/1974 variables, and 1841 constraints, problems are : Problem set: 0 solved, 9 unsolved in 68849 ms.
Refiners :[Domain max(s): 599/599 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 599/599 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 114/114 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 76068ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 1 properties in 2493 ms.
Support contains 9 out of 599 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 1711/1711 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 599 transition count 1710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 598 transition count 1710
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 598 transition count 1709
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 4 place count 597 transition count 1709
Applied a total of 4 rules in 66 ms. Remains 597 /599 variables (removed 2) and now considering 1709/1711 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 597/599 places, 1709/1711 transitions.
FORMULA Peterson-PT-7-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p0)))||G(p1))))'
Support contains 32 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 62 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2026-05-26 20:37:09] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9803138972450335018.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12101088975101946770.kers'
[2026-05-26 20:37:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9803138972450335018.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12101088975101946770.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 3 ms.
// Phase 1: matrix 2760 rows 1976 cols 6304 entries
Finished phase 1 with 1956 SingleSign rule and 5 generalized
[2026-05-26 20:37:09] [INFO ] Computed 31 invariants in 17 ms
Computed 31 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-12101088975101946770.kers
Total runtime 19 ms.
[2026-05-26 20:37:14] [INFO ] Implicit Places using invariants in 4764 ms returned []
[2026-05-26 20:37:14] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2026-05-26 20:37:14] [INFO ] Invariant cache hit.
[2026-05-26 20:37:15] [INFO ] State equation strengthened by 497 read => feed constraints.
[2026-05-26 20:37:34] [INFO ] Implicit Places using invariants and state equation in 20130 ms returned []
Implicit Place search using SMT with State Equation took 24899 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 24967 ms. Remains : 1992/1992 places, 3096/3096 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(X(X(p0)))||G(p1))))'
Stuttering acceptance computed with spot in 1227 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-01
Product exploration explored 100000 steps with 20021 reset in 733 ms.
Product exploration explored 100000 steps with 19986 reset in 623 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 205 ms. (194 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 1/1 properties
[2026-05-26 20:37:37] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2026-05-26 20:37:37] [INFO ] Invariant cache hit.
[2026-05-26 20:37:37] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 13/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 714/746 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/746 variables, 714/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1190/1936 variables, 5/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1936 variables, 1190/1960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1936 variables, 0/1960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2760/4696 variables, 1936/3896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4696 variables, 497/4393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4696 variables, 0/4393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 56/4752 variables, 56/4449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4752 variables, 56/4505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4752 variables, 7/4512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4752 variables, 0/4512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4752 variables, 0/4512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4752/4752 variables, and 4512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1849 ms.
Refiners :[Domain max(s): 1992/1992 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 1992/1992 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 13/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 714/746 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/746 variables, 714/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1190/1936 variables, 5/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1936 variables, 1190/1960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1936 variables, 0/1960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2760/4696 variables, 1936/3896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4696/4752 variables, and 4393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2239 ms.
Refiners :[Domain max(s): 1936/1992 constraints, Positive P Invariants (semi-flows): 16/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 1936/1992 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4118ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 440 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 440 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1760
Deduced a syphon composed of 440 places in 1 ms
Reduce places removed 440 places and 0 transitions.
Iterating global reduction 2 with 880 rules applied. Total rules applied 2672 place count 656 transition count 1760
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2784 place count 600 transition count 1704
Applied a total of 2784 rules in 108 ms. Remains 600 /1992 variables (removed 1392) and now considering 1704/3096 (removed 1392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 600/1992 places, 1704/3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 711738 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :0 out of 1
Probabilistic random walk after 711738 steps, saw 99104 distinct states, run finished after 3001 ms. (steps per millisecond=237 ) properties seen :0
[2026-05-26 20:37:44] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14489058398779114052.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12264621201372750509.kers'
[2026-05-26 20:37:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14489058398779114052.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12264621201372750509.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 0 ms.
// Phase 1: matrix 1368 rows 584 cols 3520 entries
Finished phase 1 with 564 SingleSign rule and 5 generalized
[2026-05-26 20:37:44] [INFO ] Computed 31 invariants in 5 ms
Computed 31 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12264621201372750509.kers
Total runtime 8 ms.
[2026-05-26 20:37:44] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 13/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 192/224 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 192/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 320/544 variables, 5/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 320/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/544 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1368/1912 variables, 544/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1912 variables, 497/1609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1912 variables, 0/1609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 56/1968 variables, 56/1665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1968 variables, 56/1721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1968 variables, 7/1728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1968 variables, 0/1728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1968 variables, 0/1728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1968/1968 variables, and 1728 constraints, problems are : Problem set: 0 solved, 1 unsolved in 577 ms.
Refiners :[Domain max(s): 600/600 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 600/600 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 13/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 192/224 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 192/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 320/544 variables, 5/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 320/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/544 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1368/1912 variables, 544/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1912 variables, 497/1609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1912 variables, 1/1610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1912 variables, 0/1610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 56/1968 variables, 56/1666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1968 variables, 56/1722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1968 variables, 7/1729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1968 variables, 20/1749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1968 variables, 20/1769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1968 variables, 20/1789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1968 variables, 20/1809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1968 variables, 17/1826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1968 variables, 0/1826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1968 variables, 11/1837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1968 variables, 1/1838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1968 variables, 0/1838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1968 variables, 0/1838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1968/1968 variables, and 1838 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36736 ms.
Refiners :[Domain max(s): 600/600 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 600/600 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 109/109 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37348ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 32 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 1704/1704 transitions.
Applied a total of 0 rules in 27 ms. Remains 600 /600 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 600/600 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 1704/1704 transitions.
Applied a total of 0 rules in 32 ms. Remains 600 /600 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2026-05-26 20:38:22] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2026-05-26 20:38:22] [INFO ] Invariant cache hit.
[2026-05-26 20:38:22] [INFO ] Implicit Places using invariants in 775 ms returned []
[2026-05-26 20:38:22] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2026-05-26 20:38:22] [INFO ] Invariant cache hit.
[2026-05-26 20:38:23] [INFO ] State equation strengthened by 497 read => feed constraints.
[2026-05-26 20:38:28] [INFO ] Implicit Places using invariants and state equation in 5687 ms returned []
Implicit Place search using SMT with State Equation took 6465 ms to find 0 implicit places.
[2026-05-26 20:38:28] [INFO ] Redundant transitions in 87 ms returned []
Running 1696 sub problems to find dead transitions.
[2026-05-26 20:38:28] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2026-05-26 20:38:28] [INFO ] Invariant cache hit.
[2026-05-26 20:38:28] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 592/592 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 18/610 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 5/615 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 20/635 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/1968 variables, and 635 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30040 ms.
Refiners :[Domain max(s): 592/600 constraints, Positive P Invariants (semi-flows): 18/23 constraints, Generalized P Invariants (flows): 5/8 constraints, State Equation: 0/600 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1696/1696 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 592/592 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 18/610 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 5/615 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 20/635 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 20/655 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 20/675 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 20/695 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
SMT process timed out in 60509ms, After SMT, problems are : Problem set: 0 solved, 1696 unsolved
Search for dead transitions found 0 dead transitions in 60514ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67109 ms. Remains : 600/600 places, 1704/1704 transitions.
Negative knowledge disproves property using: (G (OR p0 p1))
Knowledge based reduction with 3 factoid took 40 ms. Proved property starting from automaton with 9 states, 15 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 112147 ms.
FORMULA Peterson-PT-7-LTLFireability-01 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property Peterson-PT-7-LTLFireability-01 finished in 139806 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(p0)&&(X((p1 U p2))||(p3 U X(p4)))) U p4))'
Support contains 1016 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 33 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2026-05-26 20:39:29] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10362130048897040747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1811983613254988724.kers'
[2026-05-26 20:39:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10362130048897040747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1811983613254988724.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 2 ms.
// Phase 1: matrix 2760 rows 1976 cols 6304 entries
Finished phase 1 with 1956 SingleSign rule and 5 generalized
[2026-05-26 20:39:29] [INFO ] Computed 31 invariants in 14 ms
Computed 31 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-1811983613254988724.kers
Total runtime 19 ms.
[2026-05-26 20:39:30] [INFO ] Implicit Places using invariants in 854 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 859 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 27 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 922 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&(X((p1 U p2))||(p3 U X(p4)))) U p4))'
Stuttering acceptance computed with spot in 286 ms :[(NOT p4), (NOT p0), (AND (NOT p2) (NOT p4)), false, true, (NOT p2), (OR (AND p2 (NOT p4)) (AND p1 (NOT p4))), (OR (AND p2 (NOT p4)) (AND p1 (NOT p4)))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-02
Product exploration explored 100000 steps with 9467 reset in 3615 ms.
Product exploration explored 100000 steps with 9665 reset in 3605 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 21 factoid took 308 ms. Reduced automaton from 8 states, 15 edges and 5 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 85 steps (0 resets) in 10 ms. (7 steps per ms) remains 0/1 properties
Knowledge based reduction with 21 factoid took 333 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
[2026-05-26 20:39:38] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6805032987563723480.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14383149184336305831.kers'
[2026-05-26 20:39:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6805032987563723480.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14383149184336305831.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 3 ms.
// Phase 1: matrix 2760 rows 1976 cols 6304 entries
Finished phase 1 with 1956 SingleSign rule and 5 generalized
[2026-05-26 20:39:39] [INFO ] Computed 23 invariants in 16 ms
Computed 23 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-14383149184336305831.kers
Total runtime 19 ms.
Could not prove EG (NOT p0)
Knowledge-based reduction took 16264 ms.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 400 out of 1984 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Performed 350 Post agglomeration using F-continuation condition.Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 1984 transition count 2746
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 1634 transition count 2746
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 700 place count 1634 transition count 2689
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 814 place count 1577 transition count 2689
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 912 place count 1528 transition count 2640
Applied a total of 912 rules in 168 ms. Remains 1528 /1984 variables (removed 456) and now considering 2640/3096 (removed 456) transitions.
[2026-05-26 20:39:54] [INFO ] Flow matrix only has 2304 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-101403207929027973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10709685184212923350.kers'
[2026-05-26 20:39:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-101403207929027973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10709685184212923350.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 1 ms.
// Phase 1: matrix 2304 rows 1520 cols 5392 entries
Finished phase 1 with 1500 SingleSign rule and 5 generalized
[2026-05-26 20:39:54] [INFO ] Computed 23 invariants in 15 ms
Computed 23 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-10709685184212923350.kers
Total runtime 18 ms.
[2026-05-26 20:39:54] [INFO ] Implicit Places using invariants in 325 ms returned []
[2026-05-26 20:39:54] [INFO ] Flow matrix only has 2304 transitions (discarded 336 similar events)
[2026-05-26 20:39:54] [INFO ] Invariant cache hit.
[2026-05-26 20:39:55] [INFO ] State equation strengthened by 497 read => feed constraints.
[2026-05-26 20:39:55] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 1310 ms to find 0 implicit places.
[2026-05-26 20:39:55] [INFO ] Redundant transitions in 149 ms returned []
Running 2632 sub problems to find dead transitions.
[2026-05-26 20:39:55] [INFO ] Flow matrix only has 2304 transitions (discarded 336 similar events)
[2026-05-26 20:39:55] [INFO ] Invariant cache hit.
[2026-05-26 20:39:55] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1528 variables, 1528/1528 constraints. Problems are: Problem set: 0 solved, 2632 unsolved
SMT process timed out in 30775ms, After SMT, problems are : Problem set: 0 solved, 2632 unsolved
Search for dead transitions found 0 dead transitions in 30789ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1528/1984 places, 2640/3096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32433 ms. Remains : 1528/1984 places, 2640/3096 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 85 steps (0 resets) in 12 ms. (6 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
[2026-05-26 20:40:26] [INFO ] Flow matrix only has 2304 transitions (discarded 336 similar events)
[2026-05-26 20:40:27] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Knowledge-based reduction took 15605 ms.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4671 reset in 2802 ms.
Product exploration explored 100000 steps with 4709 reset in 2777 ms.
Built C files in :
/tmp/ltsmin5578613164641303621
[2026-05-26 20:40:48] [INFO ] Too many transitions (2640) to apply POR reductions. Disabling POR matrices.
[2026-05-26 20:40:48] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5578613164641303621
Running compilation step : cd /tmp/ltsmin5578613164641303621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5578613164641303621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5578613164641303621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 400 out of 1528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1528/1528 places, 2640/2640 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 154 rules applied. Total rules applied 154 place count 1528 transition count 2486
Reduce places removed 154 places and 0 transitions.
Iterating post reduction 1 with 154 rules applied. Total rules applied 308 place count 1374 transition count 2486
Performed 391 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 391 Pre rules applied. Total rules applied 308 place count 1374 transition count 2095
Deduced a syphon composed of 391 places in 1 ms
Reduce places removed 391 places and 0 transitions.
Iterating global reduction 2 with 782 rules applied. Total rules applied 1090 place count 983 transition count 2095
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1104 place count 976 transition count 2088
Applied a total of 1104 rules in 131 ms. Remains 976 /1528 variables (removed 552) and now considering 2088/2640 (removed 552) transitions.
[2026-05-26 20:40:51] [INFO ] Flow matrix only has 1752 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8138414700327254482.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5820726372861565981.kers'
[2026-05-26 20:40:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8138414700327254482.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5820726372861565981.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 1 ms.
// Phase 1: matrix 1752 rows 968 cols 4288 entries
Finished phase 1 with 948 SingleSign rule and 5 generalized
[2026-05-26 20:40:51] [INFO ] Computed 23 invariants in 6 ms
Computed 23 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5820726372861565981.kers
Total runtime 9 ms.
[2026-05-26 20:40:52] [INFO ] Implicit Places using invariants in 969 ms returned []
[2026-05-26 20:40:52] [INFO ] Flow matrix only has 1752 transitions (discarded 336 similar events)
[2026-05-26 20:40:52] [INFO ] Invariant cache hit.
[2026-05-26 20:40:52] [INFO ] State equation strengthened by 497 read => feed constraints.
[2026-05-26 20:40:55] [INFO ] Implicit Places using invariants and state equation in 3473 ms returned []
Implicit Place search using SMT with State Equation took 4444 ms to find 0 implicit places.
[2026-05-26 20:40:55] [INFO ] Redundant transitions in 42 ms returned []
Running 2080 sub problems to find dead transitions.
[2026-05-26 20:40:55] [INFO ] Flow matrix only has 1752 transitions (discarded 336 similar events)
[2026-05-26 20:40:55] [INFO ] Invariant cache hit.
[2026-05-26 20:40:55] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 976/976 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/976 variables, 18/994 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/976 variables, 5/999 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 976/2728 variables, and 999 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30034 ms.
Refiners :[Domain max(s): 976/976 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/976 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 976/976 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/976 variables, 18/994 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/976 variables, 5/999 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/976 variables, 20/1019 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/976 variables, 20/1039 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 976/2728 variables, and 1039 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30046 ms.
Refiners :[Domain max(s): 976/976 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/976 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60533ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 60537ms
Starting structural reductions in SI_LTL mode, iteration 1 : 976/1528 places, 2088/2640 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65167 ms. Remains : 976/1528 places, 2088/2640 transitions.
Built C files in :
/tmp/ltsmin16849991379301478600
[2026-05-26 20:41:56] [INFO ] Too many transitions (2088) to apply POR reductions. Disabling POR matrices.
[2026-05-26 20:41:56] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16849991379301478600
Running compilation step : cd /tmp/ltsmin16849991379301478600;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16849991379301478600;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16849991379301478600;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-26 20:41:59] [INFO ] Flatten gal took : 49 ms
[2026-05-26 20:41:59] [INFO ] Flatten gal took : 45 ms
[2026-05-26 20:41:59] [INFO ] Time to serialize gal into /tmp/LTL10425333905562978246.gal : 19 ms
[2026-05-26 20:41:59] [INFO ] Time to serialize properties into /tmp/LTL4580347351312084295.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10425333905562978246.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15677164781962571422.hoa' '-atoms' '/tmp/LTL4580347351312084295.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4580347351312084295.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15677164781962571422.hoa
Detected timeout of ITS tools.
[2026-05-26 20:42:14] [INFO ] Flatten gal took : 55 ms
[2026-05-26 20:42:15] [INFO ] Flatten gal took : 53 ms
[2026-05-26 20:42:15] [INFO ] Time to serialize gal into /tmp/LTL10723649009804453753.gal : 12 ms
[2026-05-26 20:42:15] [INFO ] Time to serialize properties into /tmp/LTL15502829461081070193.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10723649009804453753.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15502829461081070193.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((((F("(((((((((((WantSection_2_T==1)&&(TestAlone_0_5_2==1))||((WantSection_4_T==1)&&(TestAlone_6_6_4==1)))||(((WantSection_6_T==1)&&...70442
Formula 0 simplified : (G!"(((((((((((WantSection_2_T==1)&&(TestAlone_0_5_2==1))||((WantSection_4_T==1)&&(TestAlone_6_6_4==1)))||(((WantSection_6_T==1)&&(T...70435
Detected timeout of ITS tools.
[2026-05-26 20:42:30] [INFO ] Flatten gal took : 48 ms
[2026-05-26 20:42:30] [INFO ] Applying decomposition
[2026-05-26 20:42:30] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5767228658902707383.txt' '-o' '/tmp/graph5767228658902707383.bin' '-w' '/tmp/graph5767228658902707383.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5767228658902707383.bin' '-l' '-1' '-v' '-w' '/tmp/graph5767228658902707383.weights' '-q' '0' '-e' '0.001'
[2026-05-26 20:42:30] [INFO ] Decomposing Gal with order
[2026-05-26 20:42:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 20:42:30] [INFO ] Removed a total of 2840 redundant transitions.
[2026-05-26 20:42:30] [INFO ] Flatten gal took : 222 ms
[2026-05-26 20:42:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2026-05-26 20:42:31] [INFO ] Time to serialize gal into /tmp/LTL13738977414386619848.gal : 30 ms
[2026-05-26 20:42:31] [INFO ] Time to serialize properties into /tmp/LTL4345590109012408787.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13738977414386619848.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4345590109012408787.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((F("(((((((((((i26.i1.i2.u241.WantSection_2_T==1)&&(i24.i0.i0.u39.TestAlone_0_5_2==1))||((i1.i1.i0.u243.WantSection_4_T==1)&&(i18....114202
Formula 0 simplified : (G!"(((((((((((i26.i1.i2.u241.WantSection_2_T==1)&&(i24.i0.i0.u39.TestAlone_0_5_2==1))||((i1.i1.i0.u243.WantSection_4_T==1)&&(i18.i0...114195
Detected timeout of ITS tools.
Treatment of property Peterson-PT-7-LTLFireability-02 finished in 197186 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 400 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 504 transitions
Trivial Post-agglo rules discarded 504 transitions
Performed 504 trivial Post agglomeration. Transition count delta: 504
Iterating post reduction 0 with 504 rules applied. Total rules applied 504 place count 1992 transition count 2592
Reduce places removed 504 places and 0 transitions.
Iterating post reduction 1 with 504 rules applied. Total rules applied 1008 place count 1488 transition count 2592
Performed 448 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 448 Pre rules applied. Total rules applied 1008 place count 1488 transition count 2144
Deduced a syphon composed of 448 places in 1 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 1904 place count 1040 transition count 2144
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2016 place count 984 transition count 2088
Applied a total of 2016 rules in 137 ms. Remains 984 /1992 variables (removed 1008) and now considering 2088/3096 (removed 1008) transitions.
[2026-05-26 20:42:46] [INFO ] Flow matrix only has 1752 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4346948821270168787.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4443748372061509721.kers'
[2026-05-26 20:42:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4346948821270168787.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4443748372061509721.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 1 ms.
// Phase 1: matrix 1752 rows 968 cols 4288 entries
Finished phase 1 with 948 SingleSign rule and 5 generalized
[2026-05-26 20:42:46] [INFO ] Computed 31 invariants in 8 ms
Computed 31 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4443748372061509721.kers
Total runtime 9 ms.
[2026-05-26 20:42:47] [INFO ] Implicit Places using invariants in 1032 ms returned [968, 969, 970, 971, 972, 981, 982, 983]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1036 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 976/1992 places, 2088/3096 transitions.
Applied a total of 0 rules in 24 ms. Remains 976 /976 variables (removed 0) and now considering 2088/2088 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1197 ms. Remains : 976/1992 places, 2088/3096 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 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-03
Product exploration explored 100000 steps with 187 reset in 1911 ms.
Stack based approach found an accepted trace after 146 steps with 0 reset with depth 147 and stack size 147 in 3 ms.
FORMULA Peterson-PT-7-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-03 finished in 3225 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(((G(F(p0)) U p1)||X(p2)))) U p2))'
Support contains 904 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 32 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2026-05-26 20:42:49] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16219070172315068519.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17315029692189101119.kers'
[2026-05-26 20:42:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16219070172315068519.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17315029692189101119.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 3 ms.
// Phase 1: matrix 2760 rows 1976 cols 6304 entries
Finished phase 1 with 1956 SingleSign rule and 5 generalized
[2026-05-26 20:42:49] [INFO ] Computed 31 invariants in 17 ms
Computed 31 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-17315029692189101119.kers
Total runtime 24 ms.
[2026-05-26 20:42:50] [INFO ] Implicit Places using invariants in 1085 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1089 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 33 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1155 ms. Remains : 1984/1992 places, 3096/3096 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(((G(F(p0)) U p1)||X(p2)))) U p2))'
Stuttering acceptance computed with spot in 297 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-04
Product exploration explored 100000 steps with 77 reset in 1871 ms.
Stack based approach found an accepted trace after 290 steps with 0 reset with depth 291 and stack size 291 in 6 ms.
FORMULA Peterson-PT-7-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-04 finished in 3399 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(p0)||G(p1))))'
Support contains 448 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 50 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2026-05-26 20:42:53] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2026-05-26 20:42:53] [INFO ] Invariant cache hit.
[2026-05-26 20:42:56] [INFO ] Implicit Places using invariants in 3163 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 3170 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 48 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3268 ms. Remains : 1984/1992 places, 3096/3096 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(p0)||G(p1))))'
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 727 ms.
Product exploration explored 100000 steps with 50000 reset in 749 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 19 ms. Proved property starting from automaton with 3 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 28 ms.
FORMULA Peterson-PT-7-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-7-LTLFireability-05 finished in 4965 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(G((((p1&&X(G(p2))) U p3)&&p0)))))'
Support contains 520 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 52 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2026-05-26 20:42:58] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2026-05-26 20:42:58] [INFO ] Invariant cache hit.
[2026-05-26 20:42:59] [INFO ] Implicit Places using invariants in 1005 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1010 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 49 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1112 ms. Remains : 1984/1992 places, 3096/3096 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(G((((p1&&X(G(p2))) U p3)&&p0)))))'
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-06
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-06 finished in 1421 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(p0))'
Support contains 112 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 448 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 448 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1752
Deduced a syphon composed of 448 places in 0 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2688 place count 648 transition count 1752
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2800 place count 592 transition count 1696
Applied a total of 2800 rules in 136 ms. Remains 592 /1992 variables (removed 1400) and now considering 1696/3096 (removed 1400) transitions.
[2026-05-26 20:42:59] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16278973366029880257.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8357903320718020740.kers'
[2026-05-26 20:42:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16278973366029880257.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8357903320718020740.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 2 ms.
// Phase 1: matrix 1360 rows 576 cols 3504 entries
Finished phase 1 with 556 SingleSign rule and 5 generalized
[2026-05-26 20:42:59] [INFO ] Computed 31 invariants in 7 ms
Computed 31 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-8357903320718020740.kers
Total runtime 9 ms.
[2026-05-26 20:43:00] [INFO ] Implicit Places using invariants in 639 ms returned [576, 577, 578, 579, 580, 589, 590, 591]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 642 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 584/1992 places, 1696/3096 transitions.
Applied a total of 0 rules in 22 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 801 ms. Remains : 584/1992 places, 1696/3096 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-07
Product exploration explored 100000 steps with 19042 reset in 450 ms.
Product exploration explored 100000 steps with 19083 reset in 467 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2026-05-26 20:43:01] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5868549680595431330.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9832169613834886478.kers'
[2026-05-26 20:43:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5868549680595431330.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9832169613834886478.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 1360 rows 576 cols 3504 entries
Finished phase 1 with 556 SingleSign rule and 5 generalized
[2026-05-26 20:43:01] [INFO ] Computed 23 invariants in 4 ms
Computed 23 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-9832169613834886478.kers
Total runtime 6 ms.
[2026-05-26 20:43:04] [INFO ] [Real]Absence check using 18 positive place invariants in 157 ms returned sat
[2026-05-26 20:43:04] [INFO ] [Real]Absence check using 18 positive and 5 generalized place invariants in 85 ms returned sat
[2026-05-26 20:43:11] [INFO ] [Real]Absence check using state equation in 7513 ms returned sat
[2026-05-26 20:43:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 20:43:14] [INFO ] [Nat]Absence check using 18 positive place invariants in 62 ms returned sat
[2026-05-26 20:43:14] [INFO ] [Nat]Absence check using 18 positive and 5 generalized place invariants in 70 ms returned sat
[2026-05-26 20:43:21] [INFO ] [Nat]Absence check using state equation in 6733 ms returned sat
[2026-05-26 20:43:21] [INFO ] State equation strengthened by 497 read => feed constraints.
[2026-05-26 20:43:21] [INFO ] [Nat]Added 497 Read/Feed constraints in 491 ms returned sat
[2026-05-26 20:43:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1575 ms
[2026-05-26 20:43:23] [INFO ] Computed and/alt/rep : 1240/4776/1240 causal constraints (skipped 112 transitions) in 88 ms.
[2026-05-26 20:43:26] [INFO ] Added : 125 causal constraints over 25 iterations in 3671 ms. Result :unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 25463 ms.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 112 out of 584 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 24 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2026-05-26 20:43:26] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2026-05-26 20:43:26] [INFO ] Invariant cache hit.
[2026-05-26 20:43:27] [INFO ] Implicit Places using invariants in 542 ms returned []
[2026-05-26 20:43:27] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2026-05-26 20:43:27] [INFO ] Invariant cache hit.
[2026-05-26 20:43:27] [INFO ] State equation strengthened by 497 read => feed constraints.
[2026-05-26 20:43:32] [INFO ] Implicit Places using invariants and state equation in 4689 ms returned []
Implicit Place search using SMT with State Equation took 5235 ms to find 0 implicit places.
[2026-05-26 20:43:32] [INFO ] Redundant transitions in 25 ms returned []
Running 1688 sub problems to find dead transitions.
[2026-05-26 20:43:32] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2026-05-26 20:43:32] [INFO ] Invariant cache hit.
[2026-05-26 20:43:32] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 18/602 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 5/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/1944 variables, and 627 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30031 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1688/1688 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1688 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 18/602 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 5/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 20/647 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 20/667 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 20/687 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 20/707 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 584/1944 variables, and 707 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30042 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/1688 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60410ms problems are : Problem set: 0 solved, 1688 unsolved
Search for dead transitions found 0 dead transitions in 60413ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65714 ms. Remains : 584/584 places, 1696/1696 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 26 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2026-05-26 20:44:32] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2026-05-26 20:44:32] [INFO ] Invariant cache hit.
[2026-05-26 20:44:35] [INFO ] [Real]Absence check using 18 positive place invariants in 154 ms returned sat
[2026-05-26 20:44:35] [INFO ] [Real]Absence check using 18 positive and 5 generalized place invariants in 80 ms returned sat
[2026-05-26 20:44:42] [INFO ] [Real]Absence check using state equation in 7260 ms returned sat
[2026-05-26 20:44:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 20:44:45] [INFO ] [Nat]Absence check using 18 positive place invariants in 61 ms returned sat
[2026-05-26 20:44:45] [INFO ] [Nat]Absence check using 18 positive and 5 generalized place invariants in 69 ms returned sat
[2026-05-26 20:44:51] [INFO ] [Nat]Absence check using state equation in 6598 ms returned sat
[2026-05-26 20:44:51] [INFO ] State equation strengthened by 497 read => feed constraints.
[2026-05-26 20:44:52] [INFO ] [Nat]Added 497 Read/Feed constraints in 477 ms returned sat
[2026-05-26 20:44:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1499 ms
[2026-05-26 20:44:53] [INFO ] Computed and/alt/rep : 1240/4776/1240 causal constraints (skipped 112 transitions) in 73 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:593)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeFacts.computeEGknowledge(KnowledgeFacts.java:240)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:52)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-26 20:44:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Knowledge-based reduction took 25316 ms.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19044 reset in 440 ms.
Product exploration explored 100000 steps with 19041 reset in 456 ms.
Built C files in :
/tmp/ltsmin5972780168630003350
[2026-05-26 20:44:58] [INFO ] Too many transitions (1696) to apply POR reductions. Disabling POR matrices.
[2026-05-26 20:44:58] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5972780168630003350
Running compilation step : cd /tmp/ltsmin5972780168630003350;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5972780168630003350;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5972780168630003350;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 112 out of 584 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 18 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2026-05-26 20:45:01] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2026-05-26 20:45:01] [INFO ] Invariant cache hit.
[2026-05-26 20:45:02] [INFO ] Implicit Places using invariants in 548 ms returned []
[2026-05-26 20:45:02] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2026-05-26 20:45:02] [INFO ] Invariant cache hit.
[2026-05-26 20:45:02] [INFO ] State equation strengthened by 497 read => feed constraints.
[2026-05-26 20:45:07] [INFO ] Implicit Places using invariants and state equation in 4829 ms returned []
Implicit Place search using SMT with State Equation took 5407 ms to find 0 implicit places.
[2026-05-26 20:45:07] [INFO ] Redundant transitions in 24 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5458 ms. Remains : 584/584 places, 1696/1696 transitions.
Built C files in :
/tmp/ltsmin577499380410583121
[2026-05-26 20:45:07] [INFO ] Too many transitions (1696) to apply POR reductions. Disabling POR matrices.
[2026-05-26 20:45:07] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin577499380410583121
Running compilation step : cd /tmp/ltsmin577499380410583121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin577499380410583121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin577499380410583121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-26 20:45:10] [INFO ] Flatten gal took : 31 ms
[2026-05-26 20:45:10] [INFO ] Flatten gal took : 33 ms
[2026-05-26 20:45:10] [INFO ] Time to serialize gal into /tmp/LTL7833863587441510852.gal : 7 ms
[2026-05-26 20:45:10] [INFO ] Time to serialize properties into /tmp/LTL6868935479304272873.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7833863587441510852.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11999531057510361291.hoa' '-atoms' '/tmp/LTL6868935479304272873.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F("((((((((TestTurn_1_1==1)&&(Turn_1_1==1))||((TestTurn_6_3==1)&&(Turn_3_6==1)))||(((TestTurn_7_2==1)&&(Turn_2_7==1))||((TestTurn_7...2155
Formula 0 simplified : G!"((((((((TestTurn_1_1==1)&&(Turn_1_1==1))||((TestTurn_6_3==1)&&(Turn_3_6==1)))||(((TestTurn_7_2==1)&&(Turn_2_7==1))||((TestTurn_7_...2151
Detected timeout of ITS tools.
[2026-05-26 20:45:40] [INFO ] Flatten gal took : 24 ms
[2026-05-26 20:45:40] [INFO ] Applying decomposition
[2026-05-26 20:45:40] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5772962612049022923.txt' '-o' '/tmp/graph5772962612049022923.bin' '-w' '/tmp/graph5772962612049022923.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5772962612049022923.bin' '-l' '-1' '-v' '-w' '/tmp/graph5772962612049022923.weights' '-q' '0' '-e' '0.001'
[2026-05-26 20:45:40] [INFO ] Decomposing Gal with order
[2026-05-26 20:45:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 20:45:41] [INFO ] Removed a total of 2496 redundant transitions.
[2026-05-26 20:45:41] [INFO ] Flatten gal took : 72 ms
[2026-05-26 20:45:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 866 labels/synchronizations in 64 ms.
[2026-05-26 20:45:41] [INFO ] Time to serialize gal into /tmp/LTL15740506787231800355.gal : 11 ms
[2026-05-26 20:45:41] [INFO ] Time to serialize properties into /tmp/LTL8032630550076098115.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15740506787231800355.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8032630550076098115.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F("((((((((i9.u32.TestTurn_1_1==1)&&(i2.u7.Turn_1_1==1))||((i11.i1.u45.TestTurn_6_3==1)&&(i1.u2.Turn_3_6==1)))||(((i14.u50.TestTurn...3041
Formula 0 simplified : G!"((((((((i9.u32.TestTurn_1_1==1)&&(i2.u7.Turn_1_1==1))||((i11.i1.u45.TestTurn_6_3==1)&&(i1.u2.Turn_3_6==1)))||(((i14.u50.TestTurn_...3037
Detected timeout of ITS tools.
Treatment of property Peterson-PT-7-LTLFireability-07 finished in 176698 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((p0&&(F(p1) U p2)))))'
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 55 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2026-05-26 20:45:56] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15347583929092168090.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-117563130107869582.kers'
[2026-05-26 20:45:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15347583929092168090.kers, --Pflows, --basisKERS=/tmp/petrispot-output-117563130107869582.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 1 ms.
// Phase 1: matrix 2760 rows 1976 cols 6304 entries
Finished phase 1 with 1956 SingleSign rule and 5 generalized
[2026-05-26 20:45:56] [INFO ] Computed 31 invariants in 11 ms
Computed 31 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-117563130107869582.kers
Total runtime 15 ms.
[2026-05-26 20:46:01] [INFO ] Implicit Places using invariants in 5704 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 5708 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 64 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5827 ms. Remains : 1984/1992 places, 3096/3096 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(((F(p0) U p1)&&p2))))'
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-08
Product exploration explored 100000 steps with 81 reset in 318 ms.
Stack based approach found an accepted trace after 335 steps with 0 reset with depth 336 and stack size 336 in 1 ms.
FORMULA Peterson-PT-7-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-08 finished in 6372 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(p1)&&p0))&&F((G(F(!p2))||(F(!p2)&&X(!p3))))))'
Support contains 7 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 54 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2026-05-26 20:46:02] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2026-05-26 20:46:02] [INFO ] Invariant cache hit.
[2026-05-26 20:46:08] [INFO ] Implicit Places using invariants in 5539 ms returned [1976, 1977, 1978, 1979, 1980, 1990, 1991]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 5544 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1985/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 59 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5658 ms. Remains : 1985/1992 places, 3096/3096 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(p1)&&p0))&&F((G(F(p2))||(F(p2)&&X(p3))))))'
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-09
Product exploration explored 100000 steps with 1 reset in 283 ms.
Stack based approach found an accepted trace after 111 steps with 0 reset with depth 112 and stack size 112 in 1 ms.
FORMULA Peterson-PT-7-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-09 finished in 6241 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(G(p0))&&G(p1))))'
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 63 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2026-05-26 20:46:08] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2026-05-26 20:46:08] [INFO ] Invariant cache hit.
[2026-05-26 20:46:14] [INFO ] Implicit Places using invariants in 5551 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 5556 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 54 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5673 ms. Remains : 1984/1992 places, 3096/3096 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(G(p0))&&G(p1))))'
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2430 steps with 0 reset in 11 ms.
FORMULA Peterson-PT-7-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-10 finished in 5881 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((p0||G((p1&&F(p2)))))&&G(p3)))'
Support contains 6 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 894 transitions
Trivial Post-agglo rules discarded 894 transitions
Performed 894 trivial Post agglomeration. Transition count delta: 894
Iterating post reduction 0 with 894 rules applied. Total rules applied 894 place count 1992 transition count 2202
Reduce places removed 894 places and 0 transitions.
Iterating post reduction 1 with 894 rules applied. Total rules applied 1788 place count 1098 transition count 2202
Performed 448 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 448 Pre rules applied. Total rules applied 1788 place count 1098 transition count 1754
Deduced a syphon composed of 448 places in 1 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2684 place count 650 transition count 1754
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 2794 place count 595 transition count 1699
Applied a total of 2794 rules in 101 ms. Remains 595 /1992 variables (removed 1397) and now considering 1699/3096 (removed 1397) transitions.
[2026-05-26 20:46:14] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10631663300465522021.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6761704011260336447.kers'
[2026-05-26 20:46:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10631663300465522021.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6761704011260336447.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 1 ms.
// Phase 1: matrix 1363 rows 579 cols 3510 entries
Finished phase 1 with 559 SingleSign rule and 5 generalized
[2026-05-26 20:46:14] [INFO ] Computed 31 invariants in 8 ms
Computed 31 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-6761704011260336447.kers
Total runtime 11 ms.
[2026-05-26 20:46:15] [INFO ] Implicit Places using invariants in 911 ms returned [579, 580, 581, 582, 593, 594]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 913 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 589/1992 places, 1699/3096 transitions.
Applied a total of 0 rules in 23 ms. Remains 589 /589 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1038 ms. Remains : 589/1992 places, 1699/3096 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G((p1&&F(p2)))))&&G(p3)))'
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p3), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 266 ms.
Product exploration explored 100000 steps with 0 reset in 313 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 7 factoid took 338 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 716211 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :0 out of 1
Probabilistic random walk after 716211 steps, saw 97328 distinct states, run finished after 3001 ms. (steps per millisecond=238 ) properties seen :0
[2026-05-26 20:46:19] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11906543507755441527.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1279991782327152370.kers'
[2026-05-26 20:46:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11906543507755441527.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1279991782327152370.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 1363 rows 579 cols 3510 entries
Finished phase 1 with 559 SingleSign rule and 5 generalized
[2026-05-26 20:46:20] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1279991782327152370.kers
Total runtime 7 ms.
[2026-05-26 20:46:20] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 66/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 102/1378 variables, 2/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1378 variables, 102/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1378 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/1380 variables, 2/1056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1380 variables, 2/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1380 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 257/1637 variables, 6/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1637 variables, 257/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1637 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/1643 variables, 6/1327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1643 variables, 6/1333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1643 variables, 0/1333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 309/1952 variables, 367/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1952 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/1952 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1952/1952 variables, and 1700 constraints, problems are : Problem set: 0 solved, 1 unsolved in 614 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 66/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 399/639 variables, 56/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 56/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 7/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/639 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 637/1276 variables, 98/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 98/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 483/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1276 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 102/1378 variables, 2/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1378 variables, 102/1055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1378 variables, 2/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1378 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/1380 variables, 2/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1380 variables, 2/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1380 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 257/1637 variables, 6/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1637 variables, 257/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1637 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 6/1643 variables, 6/1330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1643 variables, 6/1336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1643 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 309/1952 variables, 367/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1952 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/1952 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1952/1952 variables, and 1703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1241 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1887ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1699/1699 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 1698
Applied a total of 2 rules in 37 ms. Remains 588 /589 variables (removed 1) and now considering 1698/1699 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 588/589 places, 1698/1699 transitions.
RANDOM walk for 40000 steps (8 resets) in 230 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 706320 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :0 out of 1
Probabilistic random walk after 706320 steps, saw 96377 distinct states, run finished after 3004 ms. (steps per millisecond=235 ) properties seen :0
[2026-05-26 20:46:25] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9940470153718709381.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4945590923306319360.kers'
[2026-05-26 20:46:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9940470153718709381.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4945590923306319360.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 1362 rows 578 cols 3508 entries
Finished phase 1 with 558 SingleSign rule and 5 generalized
[2026-05-26 20:46:25] [INFO ] Computed 25 invariants in 7 ms
Computed 25 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-4945590923306319360.kers
Total runtime 8 ms.
[2026-05-26 20:46:25] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 66/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 102/1378 variables, 2/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1378 variables, 102/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1378 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/1380 variables, 2/1056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1380 variables, 2/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1380 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 256/1636 variables, 6/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1636 variables, 256/1320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1636 variables, 0/1320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/1642 variables, 6/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1642 variables, 6/1332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1642 variables, 0/1332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 308/1950 variables, 366/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1950 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/1950 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1950/1950 variables, and 1698 constraints, problems are : Problem set: 0 solved, 1 unsolved in 631 ms.
Refiners :[Domain max(s): 588/588 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 588/588 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 66/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 399/639 variables, 56/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 56/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 7/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/639 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 637/1276 variables, 98/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 98/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 483/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1276 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 102/1378 variables, 2/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1378 variables, 102/1055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1378 variables, 2/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1378 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/1380 variables, 2/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1380 variables, 2/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1380 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 256/1636 variables, 6/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1636 variables, 256/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1636 variables, 0/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 6/1642 variables, 6/1329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1642 variables, 6/1335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1642 variables, 0/1335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 308/1950 variables, 366/1701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1950 variables, 0/1701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/1950 variables, 0/1701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1950/1950 variables, and 1701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1184 ms.
Refiners :[Domain max(s): 588/588 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 588/588 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1836ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1698/1698 transitions.
Applied a total of 0 rules in 23 ms. Remains 588 /588 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 588/588 places, 1698/1698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1698/1698 transitions.
Applied a total of 0 rules in 18 ms. Remains 588 /588 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
[2026-05-26 20:46:26] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2026-05-26 20:46:26] [INFO ] Invariant cache hit.
[2026-05-26 20:46:27] [INFO ] Implicit Places using invariants in 846 ms returned [578, 587]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 850 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 586/588 places, 1698/1698 transitions.
Applied a total of 0 rules in 21 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 892 ms. Remains : 586/588 places, 1698/1698 transitions.
RANDOM walk for 40000 steps (8 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 710145 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :0 out of 1
Probabilistic random walk after 710145 steps, saw 96734 distinct states, run finished after 3008 ms. (steps per millisecond=236 ) properties seen :0
[2026-05-26 20:46:30] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10326361101761737922.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1287921534869014762.kers'
[2026-05-26 20:46:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10326361101761737922.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1287921534869014762.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 1362 rows 578 cols 3508 entries
Finished phase 1 with 558 SingleSign rule and 5 generalized
[2026-05-26 20:46:30] [INFO ] Computed 23 invariants in 4 ms
Computed 23 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1287921534869014762.kers
Total runtime 7 ms.
[2026-05-26 20:46:30] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 66/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 102/1378 variables, 2/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1378 variables, 102/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1378 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/1380 variables, 2/1056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1380 variables, 2/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1380 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 255/1635 variables, 5/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1635 variables, 255/1318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1635 variables, 0/1318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 5/1640 variables, 5/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1640 variables, 5/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1640 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 308/1948 variables, 364/1692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1948/1948 variables, and 1692 constraints, problems are : Problem set: 0 solved, 1 unsolved in 572 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 66/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 399/639 variables, 56/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 56/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 7/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/639 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 637/1276 variables, 98/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 98/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 483/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1276 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 102/1378 variables, 2/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1378 variables, 102/1055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1378 variables, 2/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1378 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/1380 variables, 2/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1380 variables, 2/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1380 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 255/1635 variables, 5/1066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1635 variables, 255/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1635 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 5/1640 variables, 5/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1640 variables, 5/1331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1640 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 308/1948 variables, 364/1695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1948 variables, 0/1695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/1948 variables, 0/1695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1948/1948 variables, and 1695 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1318 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1913ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Applied a total of 0 rules in 20 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 586/586 places, 1698/1698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Applied a total of 0 rules in 19 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
[2026-05-26 20:46:32] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2026-05-26 20:46:32] [INFO ] Invariant cache hit.
[2026-05-26 20:46:33] [INFO ] Implicit Places using invariants in 838 ms returned []
[2026-05-26 20:46:33] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2026-05-26 20:46:33] [INFO ] Invariant cache hit.
[2026-05-26 20:46:34] [INFO ] State equation strengthened by 497 read => feed constraints.
[2026-05-26 20:46:37] [INFO ] Implicit Places using invariants and state equation in 4137 ms returned []
Implicit Place search using SMT with State Equation took 4979 ms to find 0 implicit places.
[2026-05-26 20:46:37] [INFO ] Redundant transitions in 28 ms returned []
Running 1690 sub problems to find dead transitions.
[2026-05-26 20:46:37] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2026-05-26 20:46:37] [INFO ] Invariant cache hit.
[2026-05-26 20:46:37] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 586/586 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 18/604 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 5/609 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 20/629 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1948 variables, and 629 constraints, problems are : Problem set: 0 solved, 1690 unsolved in 30033 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/586 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1690/1690 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 586/586 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 18/604 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 5/609 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 20/629 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/586 variables, 20/649 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/586 variables, 20/669 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 20/689 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
SMT process timed out in 60607ms, After SMT, problems are : Problem set: 0 solved, 1690 unsolved
Search for dead transitions found 0 dead transitions in 60611ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65647 ms. Remains : 586/586 places, 1698/1698 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1288 edges and 586 vertex of which 443 / 586 are part of one of the 56 SCC in 2 ms
Free SCC test removed 387 places
Drop transitions (Empty/Sink Transition effects.) removed 774 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1165 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 199 transition count 478
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 144 transition count 478
Performed 5 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 121 place count 139 transition count 469
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 147 place count 122 transition count 468
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 65 edges and 122 vertex of which 64 / 122 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 149 place count 66 transition count 467
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Graph (complete) has 410 edges and 59 vertex of which 11 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 294 output transitions
Drop transitions (Output transitions of discarded places.) removed 294 transitions
Graph (trivial) has 92 edges and 11 vertex of which 7 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 1 with 73 rules applied. Total rules applied 222 place count 5 transition count 109
Drop transitions (Empty/Sink Transition effects.) removed 84 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 2 with 102 rules applied. Total rules applied 324 place count 5 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 327 place count 3 transition count 6
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 329 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 331 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 332 place count 2 transition count 2
Applied a total of 332 rules in 22 ms. Remains 2 /586 variables (removed 584) and now considering 2/1698 (removed 1696) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13200000764844594085.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1856478445577815334.kers'
[2026-05-26 20:47:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13200000764844594085.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1856478445577815334.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-26 20:47:38] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1856478445577815334.kers
Total runtime 0 ms.
[2026-05-26 20:47:38] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 20:47:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 20:47:38] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 20:47:38] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 20:47:38] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 78 ms.
Knowledge based reduction with 7 factoid took 316 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p3)]
Knowledge-based reduction took 82364 ms.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p3)]
Support contains 1 out of 589 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 589/589 places, 1699/1699 transitions.
Applied a total of 0 rules in 31 ms. Remains 589 /589 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2026-05-26 20:47:39] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4176881493636527013.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4538117066601811492.kers'
[2026-05-26 20:47:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4176881493636527013.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4538117066601811492.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 1363 rows 579 cols 3510 entries
Finished phase 1 with 559 SingleSign rule and 5 generalized
[2026-05-26 20:47:39] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4538117066601811492.kers
Total runtime 7 ms.
[2026-05-26 20:47:39] [INFO ] Implicit Places using invariants in 812 ms returned []
[2026-05-26 20:47:39] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2026-05-26 20:47:39] [INFO ] Invariant cache hit.
[2026-05-26 20:47:40] [INFO ] State equation strengthened by 497 read => feed constraints.
[2026-05-26 20:47:45] [INFO ] Implicit Places using invariants and state equation in 5186 ms returned []
Implicit Place search using SMT with State Equation took 6000 ms to find 0 implicit places.
[2026-05-26 20:47:45] [INFO ] Redundant transitions in 24 ms returned []
Running 1691 sub problems to find dead transitions.
[2026-05-26 20:47:45] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2026-05-26 20:47:45] [INFO ] Invariant cache hit.
[2026-05-26 20:47:45] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 587/587 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/587 variables, 18/605 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 5/610 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/587 variables, 20/630 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 587/1952 variables, and 630 constraints, problems are : Problem set: 0 solved, 1691 unsolved in 30034 ms.
Refiners :[Domain max(s): 587/589 constraints, Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/589 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1691/1691 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1691 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 587/587 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/587 variables, 18/605 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 5/610 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/587 variables, 20/630 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 20/650 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 20/670 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 20/690 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 20/710 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/1952 variables, and 710 constraints, problems are : Problem set: 0 solved, 1691 unsolved in 30052 ms.
Refiners :[Domain max(s): 587/589 constraints, Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/589 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/1691 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60400ms problems are : Problem set: 0 solved, 1691 unsolved
Search for dead transitions found 0 dead transitions in 60402ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66466 ms. Remains : 589/589 places, 1699/1699 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 43 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 699948 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :0 out of 1
Probabilistic random walk after 699948 steps, saw 95731 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
[2026-05-26 20:48:48] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2026-05-26 20:48:48] [INFO ] Invariant cache hit.
[2026-05-26 20:48:48] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 66/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 102/1378 variables, 2/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1378 variables, 102/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1378 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/1380 variables, 2/1056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1380 variables, 2/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1380 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 257/1637 variables, 6/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1637 variables, 257/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1637 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/1643 variables, 6/1327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1643 variables, 6/1333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1643 variables, 0/1333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 309/1952 variables, 367/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1952 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/1952 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1952/1952 variables, and 1700 constraints, problems are : Problem set: 0 solved, 1 unsolved in 569 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 66/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 399/639 variables, 56/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 56/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 7/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/639 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 637/1276 variables, 98/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 98/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 483/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1276 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 102/1378 variables, 2/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1378 variables, 102/1055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1378 variables, 2/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1378 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/1380 variables, 2/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1380 variables, 2/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1380 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 257/1637 variables, 6/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1637 variables, 257/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1637 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 6/1643 variables, 6/1330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1643 variables, 6/1336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1643 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 309/1952 variables, 367/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1952 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/1952 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1952/1952 variables, and 1703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1250 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1838ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1699/1699 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 1698
Applied a total of 2 rules in 48 ms. Remains 588 /589 variables (removed 1) and now considering 1698/1699 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 588/589 places, 1698/1699 transitions.
RANDOM walk for 40000 steps (8 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 700776 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :0 out of 1
Probabilistic random walk after 700776 steps, saw 95817 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
[2026-05-26 20:48:53] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13390252922521164200.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16077852053014048259.kers'
[2026-05-26 20:48:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13390252922521164200.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16077852053014048259.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 1 ms.
// Phase 1: matrix 1362 rows 578 cols 3508 entries
Finished phase 1 with 558 SingleSign rule and 5 generalized
[2026-05-26 20:48:53] [INFO ] Computed 25 invariants in 7 ms
Computed 25 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-16077852053014048259.kers
Total runtime 14 ms.
[2026-05-26 20:48:53] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 66/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 102/1378 variables, 2/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1378 variables, 102/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1378 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/1380 variables, 2/1056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1380 variables, 2/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1380 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 256/1636 variables, 6/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1636 variables, 256/1320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1636 variables, 0/1320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/1642 variables, 6/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1642 variables, 6/1332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1642 variables, 0/1332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 308/1950 variables, 366/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1950 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/1950 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1950/1950 variables, and 1698 constraints, problems are : Problem set: 0 solved, 1 unsolved in 613 ms.
Refiners :[Domain max(s): 588/588 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 588/588 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 66/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 399/639 variables, 56/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 56/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 7/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/639 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 637/1276 variables, 98/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 98/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 483/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1276 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 102/1378 variables, 2/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1378 variables, 102/1055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1378 variables, 2/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1378 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/1380 variables, 2/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1380 variables, 2/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1380 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 256/1636 variables, 6/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1636 variables, 256/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1636 variables, 0/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 6/1642 variables, 6/1329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1642 variables, 6/1335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1642 variables, 0/1335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 308/1950 variables, 366/1701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1950 variables, 0/1701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/1950 variables, 0/1701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1950/1950 variables, and 1701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1171 ms.
Refiners :[Domain max(s): 588/588 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 588/588 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1812ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1698/1698 transitions.
Applied a total of 0 rules in 24 ms. Remains 588 /588 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 588/588 places, 1698/1698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1698/1698 transitions.
Applied a total of 0 rules in 29 ms. Remains 588 /588 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
[2026-05-26 20:48:55] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2026-05-26 20:48:55] [INFO ] Invariant cache hit.
[2026-05-26 20:48:56] [INFO ] Implicit Places using invariants in 851 ms returned [578, 587]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 853 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 586/588 places, 1698/1698 transitions.
Applied a total of 0 rules in 23 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 907 ms. Remains : 586/588 places, 1698/1698 transitions.
RANDOM walk for 40000 steps (8 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 705159 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :0 out of 1
Probabilistic random walk after 705159 steps, saw 96271 distinct states, run finished after 3001 ms. (steps per millisecond=234 ) properties seen :0
[2026-05-26 20:48:59] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4041827139799888642.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11495274748000798431.kers'
[2026-05-26 20:48:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4041827139799888642.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11495274748000798431.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 1362 rows 578 cols 3508 entries
Finished phase 1 with 558 SingleSign rule and 5 generalized
[2026-05-26 20:48:59] [INFO ] Computed 23 invariants in 4 ms
Computed 23 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11495274748000798431.kers
Total runtime 8 ms.
[2026-05-26 20:48:59] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 66/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 102/1378 variables, 2/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1378 variables, 102/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1378 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/1380 variables, 2/1056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1380 variables, 2/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1380 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 255/1635 variables, 5/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1635 variables, 255/1318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1635 variables, 0/1318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 5/1640 variables, 5/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1640 variables, 5/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1640 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 308/1948 variables, 364/1692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1948/1948 variables, and 1692 constraints, problems are : Problem set: 0 solved, 1 unsolved in 619 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 66/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 399/639 variables, 56/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 56/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 7/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/639 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 637/1276 variables, 98/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 98/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 483/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1276 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 102/1378 variables, 2/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1378 variables, 102/1055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1378 variables, 2/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1378 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/1380 variables, 2/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1380 variables, 2/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1380 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 255/1635 variables, 5/1066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1635 variables, 255/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1635 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 5/1640 variables, 5/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1640 variables, 5/1331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1640 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 308/1948 variables, 364/1695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1948 variables, 0/1695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/1948 variables, 0/1695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1948/1948 variables, and 1695 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1234 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1893ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Applied a total of 0 rules in 19 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 586/586 places, 1698/1698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Applied a total of 0 rules in 22 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
[2026-05-26 20:49:01] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2026-05-26 20:49:01] [INFO ] Invariant cache hit.
[2026-05-26 20:49:02] [INFO ] Implicit Places using invariants in 793 ms returned []
[2026-05-26 20:49:02] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2026-05-26 20:49:02] [INFO ] Invariant cache hit.
[2026-05-26 20:49:02] [INFO ] State equation strengthened by 497 read => feed constraints.
[2026-05-26 20:49:06] [INFO ] Implicit Places using invariants and state equation in 4133 ms returned []
Implicit Place search using SMT with State Equation took 4930 ms to find 0 implicit places.
[2026-05-26 20:49:06] [INFO ] Redundant transitions in 30 ms returned []
Running 1690 sub problems to find dead transitions.
[2026-05-26 20:49:06] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2026-05-26 20:49:06] [INFO ] Invariant cache hit.
[2026-05-26 20:49:06] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 586/586 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 18/604 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 5/609 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 20/629 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1948 variables, and 629 constraints, problems are : Problem set: 0 solved, 1690 unsolved in 30037 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/586 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1690/1690 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 586/586 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 18/604 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 5/609 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 20/629 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/586 variables, 20/649 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/586 variables, 20/669 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 20/689 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1948 variables, and 696 constraints, problems are : Problem set: 0 solved, 1690 unsolved in 30032 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/586 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/1690 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60420ms problems are : Problem set: 0 solved, 1690 unsolved
Search for dead transitions found 0 dead transitions in 60423ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65413 ms. Remains : 586/586 places, 1698/1698 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1288 edges and 586 vertex of which 443 / 586 are part of one of the 56 SCC in 1 ms
Free SCC test removed 387 places
Drop transitions (Empty/Sink Transition effects.) removed 774 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1165 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 199 transition count 478
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 144 transition count 478
Performed 5 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 121 place count 139 transition count 469
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 147 place count 122 transition count 468
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 65 edges and 122 vertex of which 64 / 122 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 149 place count 66 transition count 467
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Graph (complete) has 410 edges and 59 vertex of which 11 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 294 output transitions
Drop transitions (Output transitions of discarded places.) removed 294 transitions
Graph (trivial) has 92 edges and 11 vertex of which 7 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 1 with 73 rules applied. Total rules applied 222 place count 5 transition count 109
Drop transitions (Empty/Sink Transition effects.) removed 84 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 2 with 102 rules applied. Total rules applied 324 place count 5 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 327 place count 3 transition count 6
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 329 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 331 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 332 place count 2 transition count 2
Applied a total of 332 rules in 16 ms. Remains 2 /586 variables (removed 584) and now considering 2/1698 (removed 1696) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3355523120472131640.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3512688809639243436.kers'
[2026-05-26 20:50:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3355523120472131640.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3512688809639243436.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-26 20:50:06] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3512688809639243436.kers
Total runtime 0 ms.
[2026-05-26 20:50:06] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 20:50:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-26 20:50:06] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 20:50:06] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 20:50:06] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 98 ms.
Knowledge based reduction with 3 factoid took 41 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p3)]
Knowledge-based reduction took 81407 ms.
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p3)]
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p3)]
Product exploration explored 100000 steps with 0 reset in 216 ms.
Product exploration explored 100000 steps with 0 reset in 281 ms.
Built C files in :
/tmp/ltsmin4456178526299447414
[2026-05-26 20:50:07] [INFO ] Too many transitions (1699) to apply POR reductions. Disabling POR matrices.
[2026-05-26 20:50:07] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4456178526299447414
Running compilation step : cd /tmp/ltsmin4456178526299447414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4456178526299447414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4456178526299447414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1 out of 589 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 589/589 places, 1699/1699 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 1698
Applied a total of 2 rules in 35 ms. Remains 588 /589 variables (removed 1) and now considering 1698/1699 (removed 1) transitions.
[2026-05-26 20:50:10] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5726287228512814565.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17033419547723440978.kers'
[2026-05-26 20:50:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5726287228512814565.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17033419547723440978.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 1362 rows 578 cols 3508 entries
Finished phase 1 with 558 SingleSign rule and 5 generalized
[2026-05-26 20:50:10] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17033419547723440978.kers
Total runtime 5 ms.
[2026-05-26 20:50:11] [INFO ] Implicit Places using invariants in 867 ms returned [578, 587]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 880 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/589 places, 1698/1699 transitions.
Applied a total of 0 rules in 19 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 934 ms. Remains : 586/589 places, 1698/1699 transitions.
Built C files in :
/tmp/ltsmin5322345731010193390
[2026-05-26 20:50:11] [INFO ] Too many transitions (1698) to apply POR reductions. Disabling POR matrices.
[2026-05-26 20:50:11] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5322345731010193390
Running compilation step : cd /tmp/ltsmin5322345731010193390;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5322345731010193390;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5322345731010193390;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-26 20:50:14] [INFO ] Flatten gal took : 47 ms
[2026-05-26 20:50:14] [INFO ] Flatten gal took : 36 ms
[2026-05-26 20:50:14] [INFO ] Time to serialize gal into /tmp/LTL2733581566314251757.gal : 5 ms
[2026-05-26 20:50:14] [INFO ] Time to serialize properties into /tmp/LTL17691185718374729938.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2733581566314251757.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15131228005205754327.hoa' '-atoms' '/tmp/LTL17691185718374729938.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17691185718374729938.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15131228005205754327.hoa
Detected timeout of ITS tools.
[2026-05-26 20:50:29] [INFO ] Flatten gal took : 22 ms
[2026-05-26 20:50:29] [INFO ] Flatten gal took : 23 ms
[2026-05-26 20:50:29] [INFO ] Time to serialize gal into /tmp/LTL2353456423518219455.gal : 5 ms
[2026-05-26 20:50:29] [INFO ] Time to serialize properties into /tmp/LTL3842433398102266494.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2353456423518219455.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3842433398102266494.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F(("((WantSection_7_F==1)&&(Idle_7==1))")||(G(("((WantSection_0_F==0)||(Idle_0==0))")&&(F("(IsEndLoop_0_6_7==1)"))))))&&(G("(TestI...177
Formula 0 simplified : G(!"((WantSection_7_F==1)&&(Idle_7==1))" & F(!"((WantSection_0_F==0)||(Idle_0==0))" | G!"(IsEndLoop_0_6_7==1)")) | F!"(TestIdentity_...165
Detected timeout of ITS tools.
[2026-05-26 20:50:44] [INFO ] Flatten gal took : 22 ms
[2026-05-26 20:50:44] [INFO ] Applying decomposition
[2026-05-26 20:50:44] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2839696852706667250.txt' '-o' '/tmp/graph2839696852706667250.bin' '-w' '/tmp/graph2839696852706667250.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2839696852706667250.bin' '-l' '-1' '-v' '-w' '/tmp/graph2839696852706667250.weights' '-q' '0' '-e' '0.001'
[2026-05-26 20:50:45] [INFO ] Decomposing Gal with order
[2026-05-26 20:50:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 20:50:45] [INFO ] Removed a total of 2498 redundant transitions.
[2026-05-26 20:50:45] [INFO ] Flatten gal took : 66 ms
[2026-05-26 20:50:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 920 labels/synchronizations in 123 ms.
[2026-05-26 20:50:45] [INFO ] Time to serialize gal into /tmp/LTL17178898553713574729.gal : 10 ms
[2026-05-26 20:50:45] [INFO ] Time to serialize properties into /tmp/LTL8387127576222215108.ltl : 24 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17178898553713574729.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8387127576222215108.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F(("((i7.u37.WantSection_7_F==1)&&(i7.u37.Idle_7==1))")||(G(("((i9.i0.u64.WantSection_0_F==0)||(i9.i0.u64.Idle_0==0))")&&(F("(i11....230
Formula 0 simplified : G(!"((i7.u37.WantSection_7_F==1)&&(i7.u37.Idle_7==1))" & F(!"((i9.i0.u64.WantSection_0_F==0)||(i9.i0.u64.Idle_0==0))" | G!"(i11.i0.u...218
Detected timeout of ITS tools.
Treatment of property Peterson-PT-7-LTLFireability-13 finished in 285682 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' '!((p0 U ((!p1||G(p2)) U X(p1))))'
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 55 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2026-05-26 20:51:00] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18189588695670396346.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10357631076544818422.kers'
[2026-05-26 20:51:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18189588695670396346.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10357631076544818422.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 2 ms.
// Phase 1: matrix 2760 rows 1976 cols 6304 entries
Finished phase 1 with 1956 SingleSign rule and 5 generalized
[2026-05-26 20:51:00] [INFO ] Computed 31 invariants in 18 ms
Computed 31 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-10357631076544818422.kers
Total runtime 22 ms.
[2026-05-26 20:51:06] [INFO ] Implicit Places using invariants in 5578 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 5582 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 79 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5717 ms. Remains : 1984/1992 places, 3096/3096 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' '!((p0 U ((!p1||G(p2)) U X(p1))))'
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-14
Product exploration explored 100000 steps with 85 reset in 261 ms.
Stack based approach found an accepted trace after 1442 steps with 0 reset with depth 1443 and stack size 1443 in 4 ms.
FORMULA Peterson-PT-7-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-14 finished in 6218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X((F(G(p1))&&F(!p1))))) U X(p2))))'
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 65 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2026-05-26 20:51:06] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2026-05-26 20:51:06] [INFO ] Invariant cache hit.
[2026-05-26 20:51:12] [INFO ] Implicit Places using invariants in 5679 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 5683 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 56 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5805 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X((F(G(p1))&&F(!p1))))) U X(p2))))'
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), p1, (NOT p1), true, (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 272 ms.
Stack based approach found an accepted trace after 671 steps with 0 reset with depth 672 and stack size 672 in 2 ms.
FORMULA Peterson-PT-7-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-15 finished in 6406 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(p0)&&(X((p1 U p2))||(p3 U X(p4)))) U p4))'
Spot run failed in 79 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Spot run failed in 36 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G((p1&&F(p2)))))&&G(p3)))'
Spot run failed in 35 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-26 20:51:13] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15133106245792895759
[2026-05-26 20:51:13] [INFO ] Too many transitions (3096) to apply POR reductions. Disabling POR matrices.
[2026-05-26 20:51:13] [INFO ] Applying decomposition
[2026-05-26 20:51:13] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15133106245792895759
Running compilation step : cd /tmp/ltsmin15133106245792895759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-26 20:51:13] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10308392554254050981.txt' '-o' '/tmp/graph10308392554254050981.bin' '-w' '/tmp/graph10308392554254050981.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10308392554254050981.bin' '-l' '-1' '-v' '-w' '/tmp/graph10308392554254050981.weights' '-q' '0' '-e' '0.001'
[2026-05-26 20:51:13] [INFO ] Decomposing Gal with order
[2026-05-26 20:51:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 20:51:14] [INFO ] Removed a total of 2835 redundant transitions.
[2026-05-26 20:51:14] [INFO ] Flatten gal took : 96 ms
[2026-05-26 20:51:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2026-05-26 20:51:14] [INFO ] Time to serialize gal into /tmp/LTLFireability7339922953488414378.gal : 18 ms
[2026-05-26 20:51:14] [INFO ] Time to serialize properties into /tmp/LTLFireability7637134811929230766.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7339922953488414378.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7637134811929230766.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((((F("(((((((((((i16.u363.WantSection_2_T==1)&&(i39.i0.i0.i2.u599.TestAlone_0_5_2==1))||((i14.u731.WantSection_4_T==1)&&(i42.u662.Te...101146
Formula 0 simplified : (G!"(((((((((((i16.u363.WantSection_2_T==1)&&(i39.i0.i0.i2.u599.TestAlone_0_5_2==1))||((i14.u731.WantSection_4_T==1)&&(i42.u662.Test...101139
Compilation finished in 8350 ms.
Running link step : cd /tmp/ltsmin15133106245792895759;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin15133106245792895759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '((<>((LTLAPp0==true))&&(X(((LTLAPp1==true) U (LTLAPp2==true)))||((LTLAPp3==true) U X((LTLAPp4==true))))) U (LTLAPp4==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin15133106245792895759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '((<>((LTLAPp0==true))&&(X(((LTLAPp1==true) U (LTLAPp2==true)))||((LTLAPp3==true) U X((LTLAPp4==true))))) U (LTLAPp4==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15133106245792895759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp1==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin15133106245792895759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp1==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15133106245792895759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '(<>(((LTLAPp5==true)||[](((LTLAPp6==true)&&<>((LTLAPp7==true))))))&&[]((LTLAPp8==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin15133106245792895759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '(<>(((LTLAPp5==true)||[](((LTLAPp6==true)&&<>((LTLAPp7==true))))))&&[]((LTLAPp8==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin15133106245792895759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '((<>((LTLAPp0==true))&&(X(((LTLAPp1==true) U (LTLAPp2==true)))||((LTLAPp3==true) U X((LTLAPp4==true))))) U (LTLAPp4==true))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-26 21:16:59] [INFO ] Applying decomposition
[2026-05-26 21:17:00] [INFO ] Flatten gal took : 584 ms
[2026-05-26 21:17:00] [INFO ] Decomposing Gal with order
[2026-05-26 21:17:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 21:17:02] [INFO ] Removed a total of 2070 redundant transitions.
[2026-05-26 21:17:02] [INFO ] Flatten gal took : 1037 ms
[2026-05-26 21:17:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 994 labels/synchronizations in 90 ms.
[2026-05-26 21:17:02] [INFO ] Time to serialize gal into /tmp/LTLFireability3965256984664173546.gal : 33 ms
[2026-05-26 21:17:02] [INFO ] Time to serialize properties into /tmp/LTLFireability18244172533420364739.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3965256984664173546.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18244172533420364739.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((((F("(((((((((((u20.WantSection_2_T==1)&&(u6.TestAlone_0_5_2==1))||((u21.WantSection_4_T==1)&&(u2.TestAlone_6_6_4==1)))||(((u24.Wan...81320
Formula 0 simplified : (G!"(((((((((((u20.WantSection_2_T==1)&&(u6.TestAlone_0_5_2==1))||((u21.WantSection_4_T==1)&&(u2.TestAlone_6_6_4==1)))||(((u24.WantS...81313

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="Peterson-PT-7"
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 Peterson-PT-7, 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 r194-tall-177969914300740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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