MCC'2026- Execution of r050-smll-177946901100140

About the Execution of ITS-Tools for Champagne-PT-H09T2O

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16205.203	3600000.00	6430213.00	16517.40	FFFFFTTTFTFF?FFF	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.r050-smll-177946901100140.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 Champagne-PT-H09T2O, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901100140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.6K Mar 6 10:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 6 10:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 6 10:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 6 10:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 10:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Mar 6 10:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 10:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Mar 6 10:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 579K 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 Champagne-PT-H09T2O-LTLFireability-00
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-01
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-02
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-03
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-04
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-05
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-06
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-07
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-08
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-09
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-10
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-11
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-12
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-13
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-14
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779536279825

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H09T2O
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 11:38:01] [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-23 11:38:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 11:38:02] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2026-05-23 11:38:02] [INFO ] Transformed 1861 places.
[2026-05-23 11:38:02] [INFO ] Transformed 2552 transitions.
[2026-05-23 11:38:02] [INFO ] Found NUPN structural information;
[2026-05-23 11:38:02] [INFO ] Parsed PT model containing 1861 places and 2552 transitions and 6380 arcs in 498 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Champagne-PT-H09T2O-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H09T2O-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H09T2O-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H09T2O-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 1861 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1861/1861 places, 2552/2552 transitions.
Discarding 333 places :
Symmetric choice reduction at 0 with 333 rule applications. Total rules 333 place count 1528 transition count 2219
Iterating global reduction 0 with 333 rules applied. Total rules applied 666 place count 1528 transition count 2219
Discarding 235 places :
Symmetric choice reduction at 0 with 235 rule applications. Total rules 901 place count 1293 transition count 1984
Iterating global reduction 0 with 235 rules applied. Total rules applied 1136 place count 1293 transition count 1984
Discarding 136 places :
Symmetric choice reduction at 0 with 136 rule applications. Total rules 1272 place count 1157 transition count 1848
Iterating global reduction 0 with 136 rules applied. Total rules applied 1408 place count 1157 transition count 1848
Applied a total of 1408 rules in 627 ms. Remains 1157 /1861 variables (removed 704) and now considering 1848/2552 (removed 704) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9208031206569023108.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3719276071765669298.kers'
[2026-05-23 11:38:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9208031206569023108.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3719276071765669298.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1848 rows 1157 cols 4972 entries
Finished phase 1 with 1108 SingleSign rule and 0 generalized
[2026-05-23 11:38:03] [INFO ] Computed 49 invariants in 10 ms
Computed 49 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-3719276071765669298.kers
Total runtime 13 ms.
[2026-05-23 11:38:04] [INFO ] Implicit Places using invariants in 861 ms returned []
[2026-05-23 11:38:04] [INFO ] Invariant cache hit.
[2026-05-23 11:38:05] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 2275 ms to find 0 implicit places.
Running 1847 sub problems to find dead transitions.
[2026-05-23 11:38:05] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1156/3005 variables, and 0 constraints, problems are : Problem set: 0 solved, 1847 unsolved in 30153 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1157 constraints, PredecessorRefiner: 1847/1847 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1847 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1156/3005 variables, and 0 constraints, problems are : Problem set: 0 solved, 1847 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1157 constraints, PredecessorRefiner: 0/1847 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61375ms problems are : Problem set: 0 solved, 1847 unsolved
Search for dead transitions found 0 dead transitions in 61430ms
Starting structural reductions in LTL mode, iteration 1 : 1157/1861 places, 1848/2552 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64422 ms. Remains : 1157/1861 places, 1848/2552 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1157/1157 places, 1848/1848 transitions.
Applied a total of 0 rules in 62 ms. Remains 1157 /1157 variables (removed 0) and now considering 1848/1848 (removed 0) transitions.
[2026-05-23 11:39:07] [INFO ] Invariant cache hit.
[2026-05-23 11:39:07] [INFO ] Implicit Places using invariants in 487 ms returned []
[2026-05-23 11:39:07] [INFO ] Invariant cache hit.
[2026-05-23 11:39:08] [INFO ] Implicit Places using invariants and state equation in 1322 ms returned []
Implicit Place search using SMT with State Equation took 1812 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1875 ms. Remains : 1157/1157 places, 1848/1848 transitions.
Support contains 36 out of 1157 places after structural reductions.
[2026-05-23 11:39:09] [INFO ] Flatten gal took : 224 ms
[2026-05-23 11:39:09] [INFO ] Flatten gal took : 117 ms
[2026-05-23 11:39:09] [INFO ] Input system was already deterministic with 1848 transitions.
RANDOM walk for 40000 steps (25 resets) in 3043 ms. (13 steps per ms) remains 3/31 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
[2026-05-23 11:39:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 106/110 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1047/1157 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1157 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1848/3005 variables, 1157/1206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3005 variables, 2/1208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3005 variables, 0/1208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/3005 variables, 0/1208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3005/3005 variables, and 1208 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3008 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1157/1157 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 106/110 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1047/1157 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1157 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1157 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1848/3005 variables, 1157/1208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3005 variables, 3/1211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3005 variables, 0/1211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/3005 variables, 0/1211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3005/3005 variables, and 1211 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2120 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1157/1157 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5147ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 343 ms.
Support contains 2 out of 1157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1157/1157 places, 1848/1848 transitions.
Graph (trivial) has 1229 edges and 1157 vertex of which 747 / 1157 are part of one of the 49 SCC in 18 ms
Free SCC test removed 698 places
Drop transitions (Empty/Sink Transition effects.) removed 823 transitions
Reduce isomorphic transitions removed 823 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 137 place count 459 transition count 889
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 1 with 227 rules applied. Total rules applied 364 place count 323 transition count 798
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 408 place count 279 transition count 798
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 408 place count 279 transition count 796
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 412 place count 277 transition count 796
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 450 place count 239 transition count 524
Iterating global reduction 3 with 38 rules applied. Total rules applied 488 place count 239 transition count 524
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 521 place count 239 transition count 491
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 711 place count 144 transition count 396
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 714 place count 141 transition count 382
Iterating global reduction 4 with 3 rules applied. Total rules applied 717 place count 141 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 720 place count 141 transition count 379
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 724 place count 139 transition count 392
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 728 place count 139 transition count 388
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 734 place count 139 transition count 382
Free-agglomeration rule applied 82 times.
Iterating global reduction 6 with 82 rules applied. Total rules applied 816 place count 139 transition count 300
Reduce places removed 82 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 277 transitions
Reduce isomorphic transitions removed 277 transitions.
Iterating post reduction 6 with 359 rules applied. Total rules applied 1175 place count 57 transition count 23
Ensure Unique test removed 40 places
Iterating post reduction 7 with 40 rules applied. Total rules applied 1215 place count 17 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1217 place count 17 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1218 place count 16 transition count 20
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 13 rules applied. Total rules applied 1231 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1233 place count 9 transition count 12
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 10 with 3 rules applied. Total rules applied 1236 place count 7 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1238 place count 6 transition count 11
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1242 place count 6 transition count 7
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1243 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1244 place count 5 transition count 6
Applied a total of 1244 rules in 342 ms. Remains 5 /1157 variables (removed 1152) and now considering 6/1848 (removed 1842) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 343 ms. Remains : 5/1157 places, 6/1848 transitions.
RANDOM walk for 36 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
Computed a total of 48 stabilizing places and 48 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&(p1 U (p2||G(p1))))) U G(p3)))'
Support contains 5 out of 1157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1157/1157 places, 1848/1848 transitions.
Graph (trivial) has 1224 edges and 1157 vertex of which 741 / 1157 are part of one of the 48 SCC in 6 ms
Free SCC test removed 693 places
Ensure Unique test removed 769 transitions
Reduce isomorphic transitions removed 769 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 137 place count 463 transition count 942
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 1 with 228 rules applied. Total rules applied 365 place count 327 transition count 850
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 410 place count 282 transition count 850
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 410 place count 282 transition count 847
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 416 place count 279 transition count 847
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 453 place count 242 transition count 582
Iterating global reduction 3 with 37 rules applied. Total rules applied 490 place count 242 transition count 582
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 521 place count 242 transition count 551
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 703 place count 151 transition count 460
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 706 place count 148 transition count 446
Iterating global reduction 4 with 3 rules applied. Total rules applied 709 place count 148 transition count 446
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 712 place count 148 transition count 443
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 716 place count 146 transition count 451
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 717 place count 146 transition count 450
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 718 place count 145 transition count 440
Iterating global reduction 6 with 1 rules applied. Total rules applied 719 place count 145 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 720 place count 145 transition count 439
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 725 place count 145 transition count 434
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 727 place count 143 transition count 432
Applied a total of 727 rules in 221 ms. Remains 143 /1157 variables (removed 1014) and now considering 432/1848 (removed 1416) transitions.
[2026-05-23 11:39:17] [INFO ] Flow matrix only has 151 transitions (discarded 281 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5658335622629438373.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1594492113227282801.kers'
[2026-05-23 11:39:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5658335622629438373.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1594492113227282801.kers]
Normalized transition count is 150 out of 151 initially.
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 150 rows 132 cols 410 entries
Finished phase 1 with 94 SingleSign rule and 0 generalized
[2026-05-23 11:39:17] [INFO ] Computed 49 invariants in 0 ms
Computed 49 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1594492113227282801.kers
Total runtime 1 ms.
[2026-05-23 11:39:17] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-05-23 11:39:17] [INFO ] Flow matrix only has 151 transitions (discarded 281 similar events)
[2026-05-23 11:39:17] [INFO ] Invariant cache hit.
[2026-05-23 11:39:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 11:39:18] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2026-05-23 11:39:18] [INFO ] Redundant transitions in 43 ms returned []
Running 317 sub problems to find dead transitions.
[2026-05-23 11:39:18] [INFO ] Flow matrix only has 151 transitions (discarded 281 similar events)
[2026-05-23 11:39:18] [INFO ] Invariant cache hit.
[2026-05-23 11:39:18] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (OVERLAPS) 2/143 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 150/293 variables, 143/192 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/294 variables, and 196 constraints, problems are : Problem set: 0 solved, 317 unsolved in 22422 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 143/143 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (OVERLAPS) 2/143 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 150/293 variables, 143/192 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 317/513 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/294 variables, and 513 constraints, problems are : Problem set: 0 solved, 317 unsolved in 20080 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 143/143 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42585ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 42588ms
Starting structural reductions in SI_LTL mode, iteration 1 : 143/1157 places, 432/1848 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43384 ms. Remains : 143/1157 places, 432/1848 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&&(p1 U (p2||G(p1))))) U G(p3)))'
Stuttering acceptance computed with spot in 370 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-00 finished in 43896 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((p0||X(X(X(p1)))||(p2 U (p3||G(p2))))))))'
Support contains 5 out of 1157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1157/1157 places, 1848/1848 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1142 transition count 1833
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1142 transition count 1833
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 1135 transition count 1826
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 1135 transition count 1826
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 1132 transition count 1823
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 1132 transition count 1823
Applied a total of 50 rules in 195 ms. Remains 1132 /1157 variables (removed 25) and now considering 1823/1848 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6062155176534120181.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12182375824617343898.kers'
[2026-05-23 11:40:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6062155176534120181.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12182375824617343898.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1823 rows 1132 cols 4922 entries
Finished phase 1 with 1083 SingleSign rule and 0 generalized
[2026-05-23 11:40:01] [INFO ] Computed 49 invariants in 8 ms
Computed 49 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-12182375824617343898.kers
Total runtime 11 ms.
[2026-05-23 11:40:01] [INFO ] Implicit Places using invariants in 503 ms returned []
[2026-05-23 11:40:01] [INFO ] Invariant cache hit.
[2026-05-23 11:40:03] [INFO ] Implicit Places using invariants and state equation in 1474 ms returned []
Implicit Place search using SMT with State Equation took 1980 ms to find 0 implicit places.
Running 1822 sub problems to find dead transitions.
[2026-05-23 11:40:03] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1131/2955 variables, and 0 constraints, problems are : Problem set: 0 solved, 1822 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1132 constraints, PredecessorRefiner: 1822/1822 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1822 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1131/2955 variables, and 0 constraints, problems are : Problem set: 0 solved, 1822 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1132 constraints, PredecessorRefiner: 0/1822 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60690ms problems are : Problem set: 0 solved, 1822 unsolved
Search for dead transitions found 0 dead transitions in 60696ms
Starting structural reductions in LTL mode, iteration 1 : 1132/1157 places, 1823/1848 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62881 ms. Remains : 1132/1157 places, 1823/1848 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((p0||X(X(X(p1)))||(p2 U (p3||G(p2))))))))'
Stuttering acceptance computed with spot in 507 ms :[(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-01
Product exploration explored 100000 steps with 68 reset in 596 ms.
Product exploration explored 100000 steps with 72 reset in 616 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge based reduction with 6 factoid took 137 ms. Reduced automaton from 11 states, 17 edges and 4 AP (stutter sensitive) to 11 states, 17 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (25 resets) in 1018 ms. (39 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
[2026-05-23 11:41:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 128/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 999/1132 variables, 44/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1132 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1823/2955 variables, 1132/1181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2955 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/2955 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2955/2955 variables, and 1181 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1250 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1132/1132 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 128/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 999/1132 variables, 44/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1132 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1823/2955 variables, 1132/1181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2955 variables, 4/1185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2955 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/2955 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2955/2955 variables, and 1185 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2406 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1132/1132 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3673ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 280 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=56 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 361 ms.
Knowledge based reduction with 6 factoid took 231 ms. Reduced automaton from 11 states, 17 edges and 4 AP (stutter sensitive) to 11 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 414 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3))]
Knowledge-based reduction took 5333 ms.
Stuttering acceptance computed with spot in 456 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3))]
Support contains 5 out of 1132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1132/1132 places, 1823/1823 transitions.
Applied a total of 0 rules in 50 ms. Remains 1132 /1132 variables (removed 0) and now considering 1823/1823 (removed 0) transitions.
[2026-05-23 11:41:11] [INFO ] Invariant cache hit.
[2026-05-23 11:41:12] [INFO ] Implicit Places using invariants in 531 ms returned []
[2026-05-23 11:41:12] [INFO ] Invariant cache hit.
[2026-05-23 11:41:13] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1757 ms. Remains : 1132/1132 places, 1823/1823 transitions.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge based reduction with 6 factoid took 109 ms. Reduced automaton from 11 states, 17 edges and 4 AP (stutter sensitive) to 11 states, 17 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (28 resets) in 431 ms. (92 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
[2026-05-23 11:41:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 128/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 999/1132 variables, 44/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1132 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1823/2955 variables, 1132/1181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2955 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/2955 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2955/2955 variables, and 1181 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1346 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1132/1132 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 128/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 999/1132 variables, 44/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1132 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1823/2955 variables, 1132/1181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2955 variables, 3/1184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2955 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/2955 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2955/2955 variables, and 1184 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1934 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1132/1132 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3292ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 5381 steps, including 15 resets, run visited all 3 properties in 35 ms. (steps per millisecond=153 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 37 ms.
Knowledge based reduction with 6 factoid took 299 ms. Reduced automaton from 11 states, 17 edges and 4 AP (stutter sensitive) to 11 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 528 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3))]
Knowledge-based reduction took 4552 ms.
Stuttering acceptance computed with spot in 469 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 555 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 71 reset in 457 ms.
Product exploration explored 100000 steps with 74 reset in 542 ms.
Spot run failed in 119 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin4962021535274531694
[2026-05-23 11:41:20] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4962021535274531694
Running compilation step : cd /tmp/ltsmin4962021535274531694;'/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/ltsmin4962021535274531694;'/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/ltsmin4962021535274531694;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 1132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1132/1132 places, 1823/1823 transitions.
Applied a total of 0 rules in 73 ms. Remains 1132 /1132 variables (removed 0) and now considering 1823/1823 (removed 0) transitions.
[2026-05-23 11:41:23] [INFO ] Invariant cache hit.
[2026-05-23 11:41:23] [INFO ] Implicit Places using invariants in 649 ms returned []
[2026-05-23 11:41:23] [INFO ] Invariant cache hit.
[2026-05-23 11:41:25] [INFO ] Implicit Places using invariants and state equation in 1368 ms returned []
Implicit Place search using SMT with State Equation took 2028 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2104 ms. Remains : 1132/1132 places, 1823/1823 transitions.
Built C files in :
/tmp/ltsmin762263381310630438
[2026-05-23 11:41:25] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin762263381310630438
Running compilation step : cd /tmp/ltsmin762263381310630438;'/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/ltsmin762263381310630438;'/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/ltsmin762263381310630438;'/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-23 11:41:28] [INFO ] Flatten gal took : 80 ms
[2026-05-23 11:41:28] [INFO ] Flatten gal took : 83 ms
[2026-05-23 11:41:28] [INFO ] Time to serialize gal into /tmp/LTL233929171704065836.gal : 27 ms
[2026-05-23 11:41:28] [INFO ] Time to serialize properties into /tmp/LTL15806474849228872766.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL233929171704065836.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7266219919677281757.hoa' '-atoms' '/tmp/LTL15806474849228872766.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL15806474849228872766.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7266219919677281757.hoa
Detected timeout of ITS tools.
[2026-05-23 11:41:43] [INFO ] Flatten gal took : 63 ms
[2026-05-23 11:41:43] [INFO ] Flatten gal took : 67 ms
[2026-05-23 11:41:43] [INFO ] Time to serialize gal into /tmp/LTL10928291979573996392.gal : 18 ms
[2026-05-23 11:41:43] [INFO ] Time to serialize properties into /tmp/LTL9239750395180648398.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10928291979573996392.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9239750395180648398.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((("(p1032==0)")||(X(X(X("((p1404==0)||(p1566==0))")))))||(("(p1682!=1)")U(("((p1147!=1)&&(p1682!=1))")||(G("(p1682!=1)"))))))...158
Formula 0 simplified : XXF(!"(p1032==0)" & XXX!"((p1404==0)||(p1566==0))" & (!"(p1682!=1)" M !"((p1147!=1)&&(p1682!=1))"))
Detected timeout of ITS tools.
[2026-05-23 11:41:59] [INFO ] Flatten gal took : 49 ms
[2026-05-23 11:41:59] [INFO ] Applying decomposition
[2026-05-23 11:41:59] [INFO ] Flatten gal took : 46 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/graph7433531643227172600.txt' '-o' '/tmp/graph7433531643227172600.bin' '-w' '/tmp/graph7433531643227172600.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7433531643227172600.bin' '-l' '-1' '-v' '-w' '/tmp/graph7433531643227172600.weights' '-q' '0' '-e' '0.001'
[2026-05-23 11:41:59] [INFO ] Decomposing Gal with order
[2026-05-23 11:41:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 11:41:59] [INFO ] Removed a total of 1357 redundant transitions.
[2026-05-23 11:41:59] [INFO ] Flatten gal took : 228 ms
[2026-05-23 11:41:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 44 ms.
[2026-05-23 11:41:59] [INFO ] Time to serialize gal into /tmp/LTL5173367790758190680.gal : 27 ms
[2026-05-23 11:42:00] [INFO ] Time to serialize properties into /tmp/LTL13417991047012659392.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/LTL5173367790758190680.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13417991047012659392.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 : !((X(X(G((("(i27.u255.p1032==0)")||(X(X(X("((i37.u342.p1404==0)||(i42.u378.p1566==0))")))))||(("(i43.u406.p1682!=1)")U(("((i31.u286.p1...221
Formula 0 simplified : XXF(!"(i27.u255.p1032==0)" & XXX!"((i37.u342.p1404==0)||(i42.u378.p1566==0))" & (!"(i43.u406.p1682!=1)" M !"((i31.u286.p1147!=1)&&(i...176
Detected timeout of ITS tools.
Treatment of property Champagne-PT-H09T2O-LTLFireability-01 finished in 133991 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||G(p1)))))'
Support contains 2 out of 1157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1157/1157 places, 1848/1848 transitions.
Graph (trivial) has 1230 edges and 1157 vertex of which 753 / 1157 are part of one of the 49 SCC in 2 ms
Free SCC test removed 704 places
Ensure Unique test removed 780 transitions
Reduce isomorphic transitions removed 780 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 134 place count 452 transition count 934
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 1 with 225 rules applied. Total rules applied 359 place count 319 transition count 842
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 404 place count 274 transition count 842
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 442 place count 236 transition count 569
Iterating global reduction 3 with 38 rules applied. Total rules applied 480 place count 236 transition count 569
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 514 place count 236 transition count 535
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 4 with 186 rules applied. Total rules applied 700 place count 143 transition count 442
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 703 place count 140 transition count 428
Iterating global reduction 4 with 3 rules applied. Total rules applied 706 place count 140 transition count 428
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 709 place count 140 transition count 425
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 711 place count 138 transition count 423
Applied a total of 711 rules in 70 ms. Remains 138 /1157 variables (removed 1019) and now considering 423/1848 (removed 1425) transitions.
[2026-05-23 11:42:15] [INFO ] Flow matrix only has 129 transitions (discarded 294 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13966029439705006236.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16750535639322051515.kers'
[2026-05-23 11:42:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13966029439705006236.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16750535639322051515.kers]
Normalized transition count is 128 out of 129 initially.
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 128 rows 127 cols 330 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-23 11:42:15] [INFO ] Computed 49 invariants in 1 ms
Computed 49 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16750535639322051515.kers
Total runtime 1 ms.
[2026-05-23 11:42:15] [INFO ] Implicit Places using invariants in 248 ms returned []
[2026-05-23 11:42:15] [INFO ] Flow matrix only has 129 transitions (discarded 294 similar events)
[2026-05-23 11:42:15] [INFO ] Invariant cache hit.
[2026-05-23 11:42:15] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2026-05-23 11:42:15] [INFO ] Redundant transitions in 7 ms returned []
Running 287 sub problems to find dead transitions.
[2026-05-23 11:42:15] [INFO ] Flow matrix only has 129 transitions (discarded 294 similar events)
[2026-05-23 11:42:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 2/138 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 128/266 variables, 138/187 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (OVERLAPS) 0/266 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/267 variables, and 187 constraints, problems are : Problem set: 0 solved, 287 unsolved in 17690 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 2/138 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 128/266 variables, 138/187 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 287/474 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 0/266 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/267 variables, and 474 constraints, problems are : Problem set: 0 solved, 287 unsolved in 17712 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35478ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 35480ms
Starting structural reductions in SI_LTL mode, iteration 1 : 138/1157 places, 423/1848 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36090 ms. Remains : 138/1157 places, 423/1848 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||G(p1)))))'
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-02 finished in 36224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1157/1157 places, 1848/1848 transitions.
Graph (trivial) has 1232 edges and 1157 vertex of which 755 / 1157 are part of one of the 49 SCC in 3 ms
Free SCC test removed 706 places
Ensure Unique test removed 783 transitions
Reduce isomorphic transitions removed 783 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 134 place count 450 transition count 931
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 1 with 225 rules applied. Total rules applied 359 place count 317 transition count 839
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 404 place count 272 transition count 839
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 442 place count 234 transition count 566
Iterating global reduction 3 with 38 rules applied. Total rules applied 480 place count 234 transition count 566
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 514 place count 234 transition count 532
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 4 with 186 rules applied. Total rules applied 700 place count 141 transition count 439
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 703 place count 138 transition count 425
Iterating global reduction 4 with 3 rules applied. Total rules applied 706 place count 138 transition count 425
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 709 place count 138 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 711 place count 136 transition count 420
Applied a total of 711 rules in 98 ms. Remains 136 /1157 variables (removed 1021) and now considering 420/1848 (removed 1428) transitions.
[2026-05-23 11:42:51] [INFO ] Flow matrix only has 126 transitions (discarded 294 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8155501787107704946.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14665813284744407414.kers'
[2026-05-23 11:42:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8155501787107704946.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14665813284744407414.kers]
Normalized transition count is 125 out of 126 initially.
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 125 rows 125 cols 324 entries
Finished phase 1 with 87 SingleSign rule and 0 generalized
[2026-05-23 11:42:51] [INFO ] Computed 49 invariants in 5 ms
Computed 49 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-14665813284744407414.kers
Total runtime 6 ms.
[2026-05-23 11:42:51] [INFO ] Implicit Places using invariants in 228 ms returned []
[2026-05-23 11:42:51] [INFO ] Flow matrix only has 126 transitions (discarded 294 similar events)
[2026-05-23 11:42:51] [INFO ] Invariant cache hit.
[2026-05-23 11:42:51] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2026-05-23 11:42:51] [INFO ] Redundant transitions in 6 ms returned []
Running 285 sub problems to find dead transitions.
[2026-05-23 11:42:51] [INFO ] Flow matrix only has 126 transitions (discarded 294 similar events)
[2026-05-23 11:42:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 2/136 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 125/261 variables, 136/185 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 0/261 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/262 variables, and 185 constraints, problems are : Problem set: 0 solved, 285 unsolved in 18579 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 2/136 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 125/261 variables, 136/185 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 285/470 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 0/261 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/262 variables, and 470 constraints, problems are : Problem set: 0 solved, 285 unsolved in 18417 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37049ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 37051ms
Starting structural reductions in SI_LTL mode, iteration 1 : 136/1157 places, 420/1848 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37715 ms. Remains : 136/1157 places, 420/1848 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-03 finished in 37802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||F(p2)||X(p3)))'
Support contains 4 out of 1157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1157/1157 places, 1848/1848 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1141 transition count 1832
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1141 transition count 1832
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1134 transition count 1825
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1134 transition count 1825
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 1131 transition count 1822
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 1131 transition count 1822
Applied a total of 52 rules in 336 ms. Remains 1131 /1157 variables (removed 26) and now considering 1822/1848 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7796970787760034510.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-549288157905162981.kers'
[2026-05-23 11:43:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7796970787760034510.kers, --Pflows, --basisKERS=/tmp/petrispot-output-549288157905162981.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1822 rows 1131 cols 4920 entries
Finished phase 1 with 1082 SingleSign rule and 0 generalized
[2026-05-23 11:43:29] [INFO ] Computed 49 invariants in 15 ms
Computed 49 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-549288157905162981.kers
Total runtime 18 ms.
[2026-05-23 11:43:30] [INFO ] Implicit Places using invariants in 793 ms returned []
[2026-05-23 11:43:30] [INFO ] Invariant cache hit.
[2026-05-23 11:43:31] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned []
Implicit Place search using SMT with State Equation took 2271 ms to find 0 implicit places.
Running 1821 sub problems to find dead transitions.
[2026-05-23 11:43:31] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1130/2953 variables, and 0 constraints, problems are : Problem set: 0 solved, 1821 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1131 constraints, PredecessorRefiner: 1821/1821 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1821 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1130/2953 variables, and 0 constraints, problems are : Problem set: 0 solved, 1821 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1131 constraints, PredecessorRefiner: 0/1821 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60794ms problems are : Problem set: 0 solved, 1821 unsolved
Search for dead transitions found 0 dead transitions in 60802ms
Starting structural reductions in LTL mode, iteration 1 : 1131/1157 places, 1822/1848 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63420 ms. Remains : 1131/1157 places, 1822/1848 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||F(p2)||X(p3)))'
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-04
Stuttering criterion allowed to conclude after 1448 steps with 0 reset in 16 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-04 finished in 63766 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)||X(X(F(p1))))))'
Support contains 2 out of 1157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1157/1157 places, 1848/1848 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1140 transition count 1831
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1140 transition count 1831
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 1131 transition count 1822
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 1131 transition count 1822
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 1127 transition count 1818
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 1127 transition count 1818
Applied a total of 60 rules in 308 ms. Remains 1127 /1157 variables (removed 30) and now considering 1818/1848 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18331825296007077919.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17235603164683180795.kers'
[2026-05-23 11:44:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18331825296007077919.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17235603164683180795.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1818 rows 1127 cols 4912 entries
Finished phase 1 with 1078 SingleSign rule and 0 generalized
[2026-05-23 11:44:33] [INFO ] Computed 49 invariants in 7 ms
Computed 49 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-17235603164683180795.kers
Total runtime 10 ms.
[2026-05-23 11:44:33] [INFO ] Implicit Places using invariants in 653 ms returned []
[2026-05-23 11:44:33] [INFO ] Invariant cache hit.
[2026-05-23 11:44:35] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 1867 ms to find 0 implicit places.
Running 1817 sub problems to find dead transitions.
[2026-05-23 11:44:35] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1126/2945 variables, and 0 constraints, problems are : Problem set: 0 solved, 1817 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1127 constraints, PredecessorRefiner: 1817/1817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1126/2945 variables, and 0 constraints, problems are : Problem set: 0 solved, 1817 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1127 constraints, PredecessorRefiner: 0/1817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60516ms problems are : Problem set: 0 solved, 1817 unsolved
Search for dead transitions found 0 dead transitions in 60520ms
Starting structural reductions in LTL mode, iteration 1 : 1127/1157 places, 1818/1848 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62701 ms. Remains : 1127/1157 places, 1818/1848 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)||X(X(F(p1))))))'
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-06
Product exploration explored 100000 steps with 25000 reset in 393 ms.
Product exploration explored 100000 steps with 25000 reset in 356 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 21792 steps (14 resets) in 341 ms. (63 steps per ms) remains 0/3 properties
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 484 ms.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1127/1127 places, 1818/1818 transitions.
Applied a total of 0 rules in 70 ms. Remains 1127 /1127 variables (removed 0) and now considering 1818/1818 (removed 0) transitions.
[2026-05-23 11:45:37] [INFO ] Invariant cache hit.
[2026-05-23 11:45:37] [INFO ] Implicit Places using invariants in 612 ms returned []
[2026-05-23 11:45:37] [INFO ] Invariant cache hit.
[2026-05-23 11:45:39] [INFO ] Implicit Places using invariants and state equation in 1370 ms returned []
Implicit Place search using SMT with State Equation took 1987 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2060 ms. Remains : 1127/1127 places, 1818/1818 transitions.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge based reduction with 1 factoid took 50 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 23099 steps (15 resets) in 192 ms. (119 steps per ms) remains 0/3 properties
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 439 ms.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 276 ms.
Product exploration explored 100000 steps with 25000 reset in 311 ms.
Spot run failed in 56 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin15771129098020054119
[2026-05-23 11:45:40] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15771129098020054119
Running compilation step : cd /tmp/ltsmin15771129098020054119;'/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/ltsmin15771129098020054119;'/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/ltsmin15771129098020054119;'/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 2 out of 1127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1127/1127 places, 1818/1818 transitions.
Applied a total of 0 rules in 43 ms. Remains 1127 /1127 variables (removed 0) and now considering 1818/1818 (removed 0) transitions.
[2026-05-23 11:45:43] [INFO ] Invariant cache hit.
[2026-05-23 11:45:44] [INFO ] Implicit Places using invariants in 610 ms returned []
[2026-05-23 11:45:44] [INFO ] Invariant cache hit.
[2026-05-23 11:45:45] [INFO ] Implicit Places using invariants and state equation in 1360 ms returned []
Implicit Place search using SMT with State Equation took 1972 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2016 ms. Remains : 1127/1127 places, 1818/1818 transitions.
Built C files in :
/tmp/ltsmin16209776408444886928
[2026-05-23 11:45:45] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16209776408444886928
Running compilation step : cd /tmp/ltsmin16209776408444886928;'/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/ltsmin16209776408444886928;'/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/ltsmin16209776408444886928;'/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-23 11:45:48] [INFO ] Flatten gal took : 66 ms
[2026-05-23 11:45:48] [INFO ] Flatten gal took : 58 ms
[2026-05-23 11:45:49] [INFO ] Time to serialize gal into /tmp/LTL17069535616792326075.gal : 23 ms
[2026-05-23 11:45:49] [INFO ] Time to serialize properties into /tmp/LTL2443176687652354253.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/LTL17069535616792326075.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9512201887025282833.hoa' '-atoms' '/tmp/LTL2443176687652354253.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/LTL2443176687652354253.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9512201887025282833.hoa
Detected timeout of ITS tools.
[2026-05-23 11:46:04] [INFO ] Flatten gal took : 64 ms
[2026-05-23 11:46:04] [INFO ] Flatten gal took : 30 ms
[2026-05-23 11:46:04] [INFO ] Time to serialize gal into /tmp/LTL11590132746702900951.gal : 10 ms
[2026-05-23 11:46:04] [INFO ] Time to serialize properties into /tmp/LTL3971823519980774777.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/LTL11590132746702900951.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3971823519980774777.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F("(p722==1)"))||(X(X(F("(p1478==0)")))))))
Formula 0 simplified : X(G!"(p722==1)" & XXG!"(p1478==0)")
Detected timeout of ITS tools.
[2026-05-23 11:46:19] [INFO ] Flatten gal took : 31 ms
[2026-05-23 11:46:19] [INFO ] Applying decomposition
[2026-05-23 11:46:19] [INFO ] Flatten gal took : 30 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/graph1218044608611886940.txt' '-o' '/tmp/graph1218044608611886940.bin' '-w' '/tmp/graph1218044608611886940.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1218044608611886940.bin' '-l' '-1' '-v' '-w' '/tmp/graph1218044608611886940.weights' '-q' '0' '-e' '0.001'
[2026-05-23 11:46:19] [INFO ] Decomposing Gal with order
[2026-05-23 11:46:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 11:46:19] [INFO ] Removed a total of 1362 redundant transitions.
[2026-05-23 11:46:19] [INFO ] Flatten gal took : 118 ms
[2026-05-23 11:46:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 20 ms.
[2026-05-23 11:46:19] [INFO ] Time to serialize gal into /tmp/LTL1732167579464923926.gal : 15 ms
[2026-05-23 11:46:19] [INFO ] Time to serialize properties into /tmp/LTL15240000909906817882.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/LTL1732167579464923926.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15240000909906817882.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 : !((X((F("(i18.u179.p722==1)"))||(X(X(F("(i40.u351.p1478==0)")))))))
Formula 0 simplified : X(G!"(i18.u179.p722==1)" & XXG!"(i40.u351.p1478==0)")
Detected timeout of ITS tools.
Treatment of property Champagne-PT-H09T2O-LTLFireability-06 finished in 122091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(X(G(p1)))&&p0)) U X(X(!p1)))))'
Support contains 3 out of 1157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1157/1157 places, 1848/1848 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1141 transition count 1832
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1141 transition count 1832
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 1133 transition count 1824
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 1133 transition count 1824
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 1130 transition count 1821
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 1130 transition count 1821
Applied a total of 54 rules in 182 ms. Remains 1130 /1157 variables (removed 27) and now considering 1821/1848 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7601298311249309532.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3031359914091523565.kers'
[2026-05-23 11:46:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7601298311249309532.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3031359914091523565.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1821 rows 1130 cols 4918 entries
Finished phase 1 with 1081 SingleSign rule and 0 generalized
[2026-05-23 11:46:35] [INFO ] Computed 49 invariants in 7 ms
Computed 49 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-3031359914091523565.kers
Total runtime 9 ms.
[2026-05-23 11:46:35] [INFO ] Implicit Places using invariants in 572 ms returned []
[2026-05-23 11:46:35] [INFO ] Invariant cache hit.
[2026-05-23 11:46:37] [INFO ] Implicit Places using invariants and state equation in 1597 ms returned []
Implicit Place search using SMT with State Equation took 2183 ms to find 0 implicit places.
Running 1820 sub problems to find dead transitions.
[2026-05-23 11:46:37] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1129/2951 variables, and 0 constraints, problems are : Problem set: 0 solved, 1820 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1130 constraints, PredecessorRefiner: 1820/1820 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1820 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1129/2951 variables, and 0 constraints, problems are : Problem set: 0 solved, 1820 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1130 constraints, PredecessorRefiner: 0/1820 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60811ms problems are : Problem set: 0 solved, 1820 unsolved
Search for dead transitions found 0 dead transitions in 60815ms
Starting structural reductions in LTL mode, iteration 1 : 1130/1157 places, 1821/1848 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63190 ms. Remains : 1130/1157 places, 1821/1848 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(X(G(p1)))&&p0)) U X(X(!p1)))))'
Stuttering acceptance computed with spot in 752 ms :[p1, p1, p1, (AND (NOT p0) p1), false, p1, (AND (NOT p0) p1), false, (AND (NOT p0) p1), false, false, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-07
Product exploration explored 100000 steps with 25000 reset in 408 ms.
Product exploration explored 100000 steps with 25000 reset in 449 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 15 states, 34 edges and 2 AP (stutter sensitive) to 12 states, 26 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (27 resets) in 549 ms. (72 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
[2026-05-23 11:47:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 80/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1047/1130 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1130 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1821/2951 variables, 1130/1179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2951 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/2951 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2951/2951 variables, and 1179 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2142 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1130/1130 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 80/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1047/1130 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1130 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1821/2951 variables, 1130/1179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2951 variables, 3/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2951 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/2951 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2951/2951 variables, and 1182 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2092 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1130/1130 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4255ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1505 ms.
Support contains 3 out of 1130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1130/1130 places, 1821/1821 transitions.
Graph (trivial) has 1200 edges and 1130 vertex of which 730 / 1130 are part of one of the 49 SCC in 1 ms
Free SCC test removed 681 places
Drop transitions (Empty/Sink Transition effects.) removed 805 transitions
Reduce isomorphic transitions removed 805 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 127 place count 449 transition count 890
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 1 with 219 rules applied. Total rules applied 346 place count 323 transition count 797
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 2 with 46 rules applied. Total rules applied 392 place count 277 transition count 797
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 392 place count 277 transition count 794
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 398 place count 274 transition count 794
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 433 place count 239 transition count 520
Iterating global reduction 3 with 35 rules applied. Total rules applied 468 place count 239 transition count 520
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 503 place count 239 transition count 485
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 691 place count 145 transition count 391
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 697 place count 142 transition count 410
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 708 place count 142 transition count 399
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 714 place count 142 transition count 393
Free-agglomeration rule applied 83 times.
Iterating global reduction 5 with 83 rules applied. Total rules applied 797 place count 142 transition count 310
Reduce places removed 83 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 277 transitions
Reduce isomorphic transitions removed 277 transitions.
Iterating post reduction 5 with 360 rules applied. Total rules applied 1157 place count 59 transition count 33
Ensure Unique test removed 32 places
Iterating post reduction 6 with 32 rules applied. Total rules applied 1189 place count 27 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 1198 place count 27 transition count 24
Ensure Unique test removed 7 places
Iterating post reduction 7 with 7 rules applied. Total rules applied 1205 place count 20 transition count 24
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1206 place count 20 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1207 place count 19 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1208 place count 18 transition count 22
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 13 rules applied. Total rules applied 1221 place count 12 transition count 15
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1223 place count 11 transition count 14
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 11 with 3 rules applied. Total rules applied 1226 place count 9 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1228 place count 8 transition count 13
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 1232 place count 8 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1233 place count 8 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1234 place count 7 transition count 8
Applied a total of 1234 rules in 94 ms. Remains 7 /1130 variables (removed 1123) and now considering 8/1821 (removed 1813) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 7/1130 places, 8/1821 transitions.
RANDOM walk for 121 steps (0 resets) in 4 ms. (24 steps per ms) remains 0/3 properties
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 12 states, 26 edges and 2 AP (stutter sensitive) to 12 states, 26 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 504 ms :[p1, p1, p1, p1, (AND p1 (NOT p0)), false, (AND p1 (NOT p0)), false, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 6871 ms.
Stuttering acceptance computed with spot in 529 ms :[p1, p1, p1, p1, (AND p1 (NOT p0)), false, (AND p1 (NOT p0)), false, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 1130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1130/1130 places, 1821/1821 transitions.
Applied a total of 0 rules in 96 ms. Remains 1130 /1130 variables (removed 0) and now considering 1821/1821 (removed 0) transitions.
[2026-05-23 11:47:47] [INFO ] Invariant cache hit.
[2026-05-23 11:47:47] [INFO ] Implicit Places using invariants in 470 ms returned []
[2026-05-23 11:47:47] [INFO ] Invariant cache hit.
[2026-05-23 11:47:49] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1776 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1874 ms. Remains : 1130/1130 places, 1821/1821 transitions.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge based reduction with 1 factoid took 60 ms. Reduced automaton from 12 states, 26 edges and 2 AP (stutter sensitive) to 12 states, 26 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (28 resets) in 264 ms. (150 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
[2026-05-23 11:47:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 80/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1047/1130 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1130 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1821/2951 variables, 1130/1179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2951 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/2951 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2951/2951 variables, and 1179 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1976 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1130/1130 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 80/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1047/1130 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1130 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1821/2951 variables, 1130/1179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2951 variables, 3/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2951 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/2951 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2951/2951 variables, and 1182 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1899 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1130/1130 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3886ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1219 ms.
Support contains 3 out of 1130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1130/1130 places, 1821/1821 transitions.
Graph (trivial) has 1200 edges and 1130 vertex of which 730 / 1130 are part of one of the 49 SCC in 1 ms
Free SCC test removed 681 places
Drop transitions (Empty/Sink Transition effects.) removed 805 transitions
Reduce isomorphic transitions removed 805 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 127 place count 449 transition count 890
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 1 with 219 rules applied. Total rules applied 346 place count 323 transition count 797
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 2 with 46 rules applied. Total rules applied 392 place count 277 transition count 797
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 392 place count 277 transition count 794
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 398 place count 274 transition count 794
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 433 place count 239 transition count 520
Iterating global reduction 3 with 35 rules applied. Total rules applied 468 place count 239 transition count 520
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 503 place count 239 transition count 485
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 691 place count 145 transition count 391
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 697 place count 142 transition count 410
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 708 place count 142 transition count 399
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 714 place count 142 transition count 393
Free-agglomeration rule applied 83 times.
Iterating global reduction 5 with 83 rules applied. Total rules applied 797 place count 142 transition count 310
Reduce places removed 83 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 277 transitions
Reduce isomorphic transitions removed 277 transitions.
Iterating post reduction 5 with 360 rules applied. Total rules applied 1157 place count 59 transition count 33
Ensure Unique test removed 32 places
Iterating post reduction 6 with 32 rules applied. Total rules applied 1189 place count 27 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 1198 place count 27 transition count 24
Ensure Unique test removed 7 places
Iterating post reduction 7 with 7 rules applied. Total rules applied 1205 place count 20 transition count 24
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1206 place count 20 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1207 place count 19 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1208 place count 18 transition count 22
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 13 rules applied. Total rules applied 1221 place count 12 transition count 15
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1223 place count 11 transition count 14
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 11 with 3 rules applied. Total rules applied 1226 place count 9 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1228 place count 8 transition count 13
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 1232 place count 8 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1233 place count 8 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1234 place count 7 transition count 8
Applied a total of 1234 rules in 73 ms. Remains 7 /1130 variables (removed 1123) and now considering 8/1821 (removed 1813) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 7/1130 places, 8/1821 transitions.
RANDOM walk for 204 steps (0 resets) in 4 ms. (40 steps per ms) remains 0/3 properties
Knowledge based reduction with 1 factoid took 121 ms. Reduced automaton from 12 states, 26 edges and 2 AP (stutter sensitive) to 12 states, 26 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 473 ms :[p1, p1, p1, p1, (AND p1 (NOT p0)), false, (AND p1 (NOT p0)), false, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 5960 ms.
Stuttering acceptance computed with spot in 546 ms :[p1, p1, p1, p1, (AND p1 (NOT p0)), false, (AND p1 (NOT p0)), false, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 521 ms :[p1, p1, p1, p1, (AND p1 (NOT p0)), false, (AND p1 (NOT p0)), false, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 402 ms.
Product exploration explored 100000 steps with 25000 reset in 397 ms.
Spot run failed in 55 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin2584516440632665484
[2026-05-23 11:47:57] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2584516440632665484
Running compilation step : cd /tmp/ltsmin2584516440632665484;'/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/ltsmin2584516440632665484;'/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/ltsmin2584516440632665484;'/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 3 out of 1130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1130/1130 places, 1821/1821 transitions.
Applied a total of 0 rules in 37 ms. Remains 1130 /1130 variables (removed 0) and now considering 1821/1821 (removed 0) transitions.
[2026-05-23 11:48:00] [INFO ] Invariant cache hit.
[2026-05-23 11:48:00] [INFO ] Implicit Places using invariants in 473 ms returned []
[2026-05-23 11:48:00] [INFO ] Invariant cache hit.
[2026-05-23 11:48:01] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1679 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1717 ms. Remains : 1130/1130 places, 1821/1821 transitions.
Built C files in :
/tmp/ltsmin12376023384531135783
[2026-05-23 11:48:01] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12376023384531135783
Running compilation step : cd /tmp/ltsmin12376023384531135783;'/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/ltsmin12376023384531135783;'/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/ltsmin12376023384531135783;'/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-23 11:48:04] [INFO ] Flatten gal took : 28 ms
[2026-05-23 11:48:04] [INFO ] Flatten gal took : 28 ms
[2026-05-23 11:48:04] [INFO ] Time to serialize gal into /tmp/LTL4942547915330992583.gal : 8 ms
[2026-05-23 11:48:04] [INFO ] Time to serialize properties into /tmp/LTL593225981527256932.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/LTL4942547915330992583.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13815765924397010881.hoa' '-atoms' '/tmp/LTL593225981527256932.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL593225981527256932.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13815765924397010881.hoa
Detected timeout of ITS tools.
[2026-05-23 11:48:20] [INFO ] Flatten gal took : 26 ms
[2026-05-23 11:48:20] [INFO ] Flatten gal took : 27 ms
[2026-05-23 11:48:20] [INFO ] Time to serialize gal into /tmp/LTL16719518705064811375.gal : 8 ms
[2026-05-23 11:48:20] [INFO ] Time to serialize properties into /tmp/LTL16672215021776471088.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/LTL16719518705064811375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16672215021776471088.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 : !((X((F(("((p1835==1)&&(p1515==1))")&&(X(X(G("(p1258==1)"))))))U(X(X("(p1258!=1)"))))))
Formula 0 simplified : X(G(!"((p1835==1)&&(p1515==1))" | XXF!"(p1258==1)") R XX!"(p1258!=1)")
Detected timeout of ITS tools.
[2026-05-23 11:48:35] [INFO ] Flatten gal took : 43 ms
[2026-05-23 11:48:35] [INFO ] Applying decomposition
[2026-05-23 11:48:35] [INFO ] Flatten gal took : 43 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/graph13678706711962518774.txt' '-o' '/tmp/graph13678706711962518774.bin' '-w' '/tmp/graph13678706711962518774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13678706711962518774.bin' '-l' '-1' '-v' '-w' '/tmp/graph13678706711962518774.weights' '-q' '0' '-e' '0.001'
[2026-05-23 11:48:35] [INFO ] Decomposing Gal with order
[2026-05-23 11:48:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 11:48:35] [INFO ] Removed a total of 1359 redundant transitions.
[2026-05-23 11:48:35] [INFO ] Flatten gal took : 114 ms
[2026-05-23 11:48:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 31 ms.
[2026-05-23 11:48:35] [INFO ] Time to serialize gal into /tmp/LTL782413972437167612.gal : 23 ms
[2026-05-23 11:48:35] [INFO ] Time to serialize properties into /tmp/LTL7531213997664470842.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/LTL782413972437167612.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7531213997664470842.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...253
Read 1 LTL properties
Checking formula 0 : !((X((F(("((i47.i1.i1.u445.p1835==1)&&(i41.u369.p1515==1))")&&(X(X(G("(i34.u308.p1258==1)"))))))U(X(X("(i34.u308.p1258!=1)"))))))
Formula 0 simplified : X(G(!"((i47.i1.i1.u445.p1835==1)&&(i41.u369.p1515==1))" | XXF!"(i34.u308.p1258==1)") R XX!"(i34.u308.p1258!=1)")
Detected timeout of ITS tools.
Treatment of property Champagne-PT-H09T2O-LTLFireability-07 finished in 135921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)))))'
Support contains 2 out of 1157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1157/1157 places, 1848/1848 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1140 transition count 1831
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1140 transition count 1831
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 1131 transition count 1822
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 1131 transition count 1822
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 1127 transition count 1818
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 1127 transition count 1818
Applied a total of 60 rules in 167 ms. Remains 1127 /1157 variables (removed 30) and now considering 1818/1848 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8600620289334427825.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10369405290573438782.kers'
[2026-05-23 11:48:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8600620289334427825.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10369405290573438782.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1818 rows 1127 cols 4912 entries
Finished phase 1 with 1078 SingleSign rule and 0 generalized
[2026-05-23 11:48:51] [INFO ] Computed 49 invariants in 8 ms
Computed 49 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-10369405290573438782.kers
Total runtime 11 ms.
[2026-05-23 11:48:51] [INFO ] Implicit Places using invariants in 669 ms returned []
[2026-05-23 11:48:51] [INFO ] Invariant cache hit.
[2026-05-23 11:48:52] [INFO ] Implicit Places using invariants and state equation in 1200 ms returned []
Implicit Place search using SMT with State Equation took 1872 ms to find 0 implicit places.
Running 1817 sub problems to find dead transitions.
[2026-05-23 11:48:52] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1126/2945 variables, and 0 constraints, problems are : Problem set: 0 solved, 1817 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1127 constraints, PredecessorRefiner: 1817/1817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1817 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1126/2945 variables, and 0 constraints, problems are : Problem set: 0 solved, 1817 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1127 constraints, PredecessorRefiner: 0/1817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60532ms problems are : Problem set: 0 solved, 1817 unsolved
Search for dead transitions found 0 dead transitions in 60535ms
Starting structural reductions in LTL mode, iteration 1 : 1127/1157 places, 1818/1848 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62583 ms. Remains : 1127/1157 places, 1818/1848 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)))))'
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-08 finished in 62842 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 2 out of 1157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1157/1157 places, 1848/1848 transitions.
Graph (trivial) has 1228 edges and 1157 vertex of which 741 / 1157 are part of one of the 48 SCC in 1 ms
Free SCC test removed 693 places
Ensure Unique test removed 769 transitions
Reduce isomorphic transitions removed 769 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 140 place count 463 transition count 939
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 1 with 231 rules applied. Total rules applied 371 place count 324 transition count 847
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 416 place count 279 transition count 847
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 416 place count 279 transition count 845
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 420 place count 277 transition count 845
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 458 place count 239 transition count 581
Iterating global reduction 3 with 38 rules applied. Total rules applied 496 place count 239 transition count 581
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 529 place count 239 transition count 548
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 717 place count 145 transition count 454
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 719 place count 143 transition count 447
Iterating global reduction 4 with 2 rules applied. Total rules applied 721 place count 143 transition count 447
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 723 place count 143 transition count 445
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 727 place count 141 transition count 463
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 728 place count 141 transition count 462
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 729 place count 140 transition count 442
Iterating global reduction 6 with 1 rules applied. Total rules applied 730 place count 140 transition count 442
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 731 place count 140 transition count 441
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 741 place count 140 transition count 431
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 743 place count 138 transition count 429
Applied a total of 743 rules in 60 ms. Remains 138 /1157 variables (removed 1019) and now considering 429/1848 (removed 1419) transitions.
[2026-05-23 11:49:53] [INFO ] Flow matrix only has 136 transitions (discarded 293 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12533775499403142124.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-520097485973464906.kers'
[2026-05-23 11:49:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12533775499403142124.kers, --Pflows, --basisKERS=/tmp/petrispot-output-520097485973464906.kers]
Normalized transition count is 135 out of 136 initially.
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 135 rows 126 cols 354 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-23 11:49:53] [INFO ] Computed 49 invariants in 1 ms
Computed 49 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-520097485973464906.kers
Total runtime 2 ms.
[2026-05-23 11:49:53] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-23 11:49:53] [INFO ] Flow matrix only has 136 transitions (discarded 293 similar events)
[2026-05-23 11:49:53] [INFO ] Invariant cache hit.
[2026-05-23 11:49:54] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2026-05-23 11:49:54] [INFO ] Redundant transitions in 4 ms returned []
Running 295 sub problems to find dead transitions.
[2026-05-23 11:49:54] [INFO ] Flow matrix only has 136 transitions (discarded 293 similar events)
[2026-05-23 11:49:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 3/138 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 135/273 variables, 138/187 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (OVERLAPS) 0/273 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/274 variables, and 187 constraints, problems are : Problem set: 0 solved, 295 unsolved in 21126 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 3/138 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 135/273 variables, 138/187 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 295/482 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 0/273 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/274 variables, and 482 constraints, problems are : Problem set: 0 solved, 295 unsolved in 20357 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41528ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 41529ms
Starting structural reductions in SI_LTL mode, iteration 1 : 138/1157 places, 429/1848 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42110 ms. Remains : 138/1157 places, 429/1848 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 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-10
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 3 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-10 finished in 42239 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((F((p0&&F(p1))) U (p0||F(G(p2)))))))'
Support contains 3 out of 1157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1157/1157 places, 1848/1848 transitions.
Graph (trivial) has 1226 edges and 1157 vertex of which 750 / 1157 are part of one of the 49 SCC in 0 ms
Free SCC test removed 701 places
Ensure Unique test removed 777 transitions
Reduce isomorphic transitions removed 777 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 133 place count 455 transition count 938
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 1 with 222 rules applied. Total rules applied 355 place count 323 transition count 848
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 45 rules applied. Total rules applied 400 place count 279 transition count 847
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 401 place count 278 transition count 847
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 401 place count 278 transition count 846
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 403 place count 277 transition count 846
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 440 place count 240 transition count 577
Iterating global reduction 4 with 37 rules applied. Total rules applied 477 place count 240 transition count 577
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 510 place count 240 transition count 544
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 5 with 186 rules applied. Total rules applied 696 place count 147 transition count 451
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 698 place count 145 transition count 441
Iterating global reduction 5 with 2 rules applied. Total rules applied 700 place count 145 transition count 441
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 702 place count 145 transition count 439
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 704 place count 143 transition count 437
Applied a total of 704 rules in 58 ms. Remains 143 /1157 variables (removed 1014) and now considering 437/1848 (removed 1411) transitions.
[2026-05-23 11:50:36] [INFO ] Flow matrix only has 147 transitions (discarded 290 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6783731829800509049.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17466797318621761184.kers'
[2026-05-23 11:50:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6783731829800509049.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17466797318621761184.kers]
Normalized transition count is 146 out of 147 initially.
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 146 rows 132 cols 386 entries
Finished phase 1 with 94 SingleSign rule and 0 generalized
[2026-05-23 11:50:36] [INFO ] Computed 49 invariants in 1 ms
Computed 49 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17466797318621761184.kers
Total runtime 2 ms.
[2026-05-23 11:50:36] [INFO ] Implicit Places using invariants in 237 ms returned []
[2026-05-23 11:50:36] [INFO ] Flow matrix only has 147 transitions (discarded 290 similar events)
[2026-05-23 11:50:36] [INFO ] Invariant cache hit.
[2026-05-23 11:50:36] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
[2026-05-23 11:50:36] [INFO ] Redundant transitions in 4 ms returned []
Running 300 sub problems to find dead transitions.
[2026-05-23 11:50:36] [INFO ] Flow matrix only has 147 transitions (discarded 290 similar events)
[2026-05-23 11:50:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 2/143 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 146/289 variables, 143/192 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/289 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/290 variables, and 192 constraints, problems are : Problem set: 0 solved, 300 unsolved in 21448 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 2/143 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 146/289 variables, 143/192 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 300/492 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/290 variables, and 492 constraints, problems are : Problem set: 0 solved, 300 unsolved in 19533 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41015ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 41016ms
Starting structural reductions in SI_LTL mode, iteration 1 : 143/1157 places, 437/1848 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41661 ms. Remains : 143/1157 places, 437/1848 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((F((p0&&F(p1))) U (p0||F(G(p2)))))))'
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-11
Stuttering criterion allowed to conclude after 168 steps with 1 reset in 2 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-11 finished in 41846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(X(p0))) U ((p1&&X(X(X(p0))))||X(X(X(G(p0)))))))||(G(F(p1))&&(X(X(X(p0))) U ((p1&&X(X(X(p0))))||X(X(X(G(p0)))))))))'
Support contains 2 out of 1157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1157/1157 places, 1848/1848 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1141 transition count 1832
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1141 transition count 1832
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 1133 transition count 1824
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 1133 transition count 1824
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 1129 transition count 1820
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 1129 transition count 1820
Applied a total of 56 rules in 177 ms. Remains 1129 /1157 variables (removed 28) and now considering 1820/1848 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4998957098357363085.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9125606999973599861.kers'
[2026-05-23 11:51:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4998957098357363085.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9125606999973599861.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1820 rows 1129 cols 4916 entries
Finished phase 1 with 1080 SingleSign rule and 0 generalized
[2026-05-23 11:51:18] [INFO ] Computed 49 invariants in 8 ms
Computed 49 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9125606999973599861.kers
Total runtime 10 ms.
[2026-05-23 11:51:18] [INFO ] Implicit Places using invariants in 501 ms returned []
[2026-05-23 11:51:18] [INFO ] Invariant cache hit.
[2026-05-23 11:51:19] [INFO ] Implicit Places using invariants and state equation in 1351 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
Running 1819 sub problems to find dead transitions.
[2026-05-23 11:51:19] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1128/2949 variables, and 0 constraints, problems are : Problem set: 0 solved, 1819 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1129 constraints, PredecessorRefiner: 1819/1819 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1819 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1128/2949 variables, and 0 constraints, problems are : Problem set: 0 solved, 1819 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1129 constraints, PredecessorRefiner: 0/1819 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60631ms problems are : Problem set: 0 solved, 1819 unsolved
Search for dead transitions found 0 dead transitions in 60635ms
Starting structural reductions in LTL mode, iteration 1 : 1129/1157 places, 1820/1848 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62672 ms. Remains : 1129/1157 places, 1820/1848 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))) U ((p1&&X(X(X(p0))))||X(X(X(G(p0)))))))||(G(F(p1))&&(X(X(X(p0))) U ((p1&&X(X(X(p0))))||X(X(X(G(p0)))))))))'
Stuttering acceptance computed with spot in 850 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-12
Product exploration explored 100000 steps with 19977 reset in 395 ms.
Product exploration explored 100000 steps with 20009 reset in 296 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge based reduction with 9 factoid took 112 ms. Reduced automaton from 17 states, 27 edges and 2 AP (stutter sensitive) to 16 states, 23 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (25 resets) in 230 ms. (173 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
[2026-05-23 11:52:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1067/1129 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1820/2949 variables, 1129/1178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2949 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2949 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2949/2949 variables, and 1178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1460 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1129/1129 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1067/1129 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1820/2949 variables, 1129/1178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2949 variables, 1/1179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2949 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2949 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2949/2949 variables, and 1179 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1113 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1129/1129 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2583ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13686 steps, including 40 resets, run visited all 1 properties in 72 ms. (steps per millisecond=190 )
Parikh walk visited 1 properties in 72 ms.
Knowledge based reduction with 9 factoid took 201 ms. Reduced automaton from 16 states, 23 edges and 2 AP (stutter sensitive) to 16 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 785 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) p0)]
Knowledge-based reduction took 3862 ms.
Stuttering acceptance computed with spot in 780 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) p0)]
Support contains 2 out of 1129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1129/1129 places, 1820/1820 transitions.
Applied a total of 0 rules in 66 ms. Remains 1129 /1129 variables (removed 0) and now considering 1820/1820 (removed 0) transitions.
[2026-05-23 11:52:26] [INFO ] Invariant cache hit.
[2026-05-23 11:52:27] [INFO ] Implicit Places using invariants in 792 ms returned []
[2026-05-23 11:52:27] [INFO ] Invariant cache hit.
[2026-05-23 11:52:29] [INFO ] Implicit Places using invariants and state equation in 1675 ms returned []
Implicit Place search using SMT with State Equation took 2475 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2541 ms. Remains : 1129/1129 places, 1820/1820 transitions.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 16 states, 23 edges and 2 AP (stutter sensitive) to 16 states, 23 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (27 resets) in 257 ms. (155 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
[2026-05-23 11:52:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1067/1129 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1820/2949 variables, 1129/1178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2949 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2949 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2949/2949 variables, and 1178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1672 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1129/1129 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1067/1129 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1820/2949 variables, 1129/1178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2949 variables, 1/1179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2949 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2949 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2949/2949 variables, and 1179 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1438 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1129/1129 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3124ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 28504 steps, including 84 resets, run visited all 1 properties in 95 ms. (steps per millisecond=300 )
Parikh walk visited 1 properties in 94 ms.
Knowledge based reduction with 5 factoid took 154 ms. Reduced automaton from 16 states, 23 edges and 2 AP (stutter sensitive) to 16 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 786 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) p0)]
Knowledge-based reduction took 4379 ms.
Stuttering acceptance computed with spot in 782 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 778 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 19995 reset in 373 ms.
Product exploration explored 100000 steps with 20020 reset in 345 ms.
Spot run failed in 88 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin8559851988832643952
[2026-05-23 11:52:36] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8559851988832643952
Running compilation step : cd /tmp/ltsmin8559851988832643952;'/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/ltsmin8559851988832643952;'/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/ltsmin8559851988832643952;'/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 2 out of 1129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1129/1129 places, 1820/1820 transitions.
Applied a total of 0 rules in 39 ms. Remains 1129 /1129 variables (removed 0) and now considering 1820/1820 (removed 0) transitions.
[2026-05-23 11:52:39] [INFO ] Invariant cache hit.
[2026-05-23 11:52:39] [INFO ] Implicit Places using invariants in 666 ms returned []
[2026-05-23 11:52:39] [INFO ] Invariant cache hit.
[2026-05-23 11:52:40] [INFO ] Implicit Places using invariants and state equation in 1133 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1841 ms. Remains : 1129/1129 places, 1820/1820 transitions.
Built C files in :
/tmp/ltsmin11664582810917422393
[2026-05-23 11:52:41] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11664582810917422393
Running compilation step : cd /tmp/ltsmin11664582810917422393;'/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/ltsmin11664582810917422393;'/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/ltsmin11664582810917422393;'/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-23 11:52:44] [INFO ] Flatten gal took : 44 ms
[2026-05-23 11:52:44] [INFO ] Flatten gal took : 44 ms
[2026-05-23 11:52:44] [INFO ] Time to serialize gal into /tmp/LTL8693247634019533405.gal : 11 ms
[2026-05-23 11:52:44] [INFO ] Time to serialize properties into /tmp/LTL8415913093694145978.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/LTL8693247634019533405.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14096711700765765695.hoa' '-atoms' '/tmp/LTL8415913093694145978.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/LTL8415913093694145978.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14096711700765765695.hoa
Detected timeout of ITS tools.
[2026-05-23 11:52:59] [INFO ] Flatten gal took : 26 ms
[2026-05-23 11:52:59] [INFO ] Flatten gal took : 27 ms
[2026-05-23 11:52:59] [INFO ] Time to serialize gal into /tmp/LTL17487015983012826524.gal : 7 ms
[2026-05-23 11:52:59] [INFO ] Time to serialize properties into /tmp/LTL15113631005114075347.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/LTL17487015983012826524.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15113631005114075347.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G((X(X(X("(p1766!=1)"))))U((X(X(X(G("(p1766!=1)")))))||(("(p261!=1)")&&(X(X(X("(p1766!=1)"))))))))||(((X(X(X("(p1766!=1)"))))U((X(...246
Formula 0 simplified : F(XXX!"(p1766!=1)" R (XXXF!"(p1766!=1)" & (!"(p261!=1)" | XXX!"(p1766!=1)"))) & ((XXX!"(p1766!=1)" R (XXXF!"(p1766!=1)" & (!"(p261!=...198
Detected timeout of ITS tools.
[2026-05-23 11:53:14] [INFO ] Flatten gal took : 25 ms
[2026-05-23 11:53:14] [INFO ] Applying decomposition
[2026-05-23 11:53:14] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10634802450812612789.txt' '-o' '/tmp/graph10634802450812612789.bin' '-w' '/tmp/graph10634802450812612789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10634802450812612789.bin' '-l' '-1' '-v' '-w' '/tmp/graph10634802450812612789.weights' '-q' '0' '-e' '0.001'
[2026-05-23 11:53:14] [INFO ] Decomposing Gal with order
[2026-05-23 11:53:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 11:53:14] [INFO ] Removed a total of 1363 redundant transitions.
[2026-05-23 11:53:14] [INFO ] Flatten gal took : 102 ms
[2026-05-23 11:53:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 18 ms.
[2026-05-23 11:53:14] [INFO ] Time to serialize gal into /tmp/LTL17095706254944656241.gal : 20 ms
[2026-05-23 11:53:14] [INFO ] Time to serialize properties into /tmp/LTL17252936511622602443.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/LTL17095706254944656241.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17252936511622602443.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...256
Read 1 LTL properties
Checking formula 0 : !(((G((X(X(X("(i46.i2.i0.u427.p1766!=1)"))))U((X(X(X(G("(i46.i2.i0.u427.p1766!=1)")))))||(("(i7.u66.p261!=1)")&&(X(X(X("(i46.i2.i0.u42...357
Formula 0 simplified : F(XXX!"(i46.i2.i0.u427.p1766!=1)" R (XXXF!"(i46.i2.i0.u427.p1766!=1)" & (!"(i7.u66.p261!=1)" | XXX!"(i46.i2.i0.u427.p1766!=1)"))) & ...309
Detected timeout of ITS tools.
Treatment of property Champagne-PT-H09T2O-LTLFireability-12 finished in 132172 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(X(p1))&&F(p2)&&F(p3))))'
Support contains 5 out of 1157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1157/1157 places, 1848/1848 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1142 transition count 1833
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1142 transition count 1833
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 1134 transition count 1825
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 1134 transition count 1825
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 1131 transition count 1822
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 1131 transition count 1822
Applied a total of 52 rules in 181 ms. Remains 1131 /1157 variables (removed 26) and now considering 1822/1848 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9850609352129602735.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14982725400660331573.kers'
[2026-05-23 11:53:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9850609352129602735.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14982725400660331573.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1822 rows 1131 cols 4920 entries
Finished phase 1 with 1082 SingleSign rule and 0 generalized
[2026-05-23 11:53:30] [INFO ] Computed 49 invariants in 12 ms
Computed 49 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-14982725400660331573.kers
Total runtime 16 ms.
[2026-05-23 11:53:30] [INFO ] Implicit Places using invariants in 687 ms returned []
[2026-05-23 11:53:30] [INFO ] Invariant cache hit.
[2026-05-23 11:53:32] [INFO ] Implicit Places using invariants and state equation in 1716 ms returned []
Implicit Place search using SMT with State Equation took 2406 ms to find 0 implicit places.
Running 1821 sub problems to find dead transitions.
[2026-05-23 11:53:32] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1130/2953 variables, and 0 constraints, problems are : Problem set: 0 solved, 1821 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1131 constraints, PredecessorRefiner: 1821/1821 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1821 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1130/2953 variables, and 0 constraints, problems are : Problem set: 0 solved, 1821 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1131 constraints, PredecessorRefiner: 0/1821 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60803ms problems are : Problem set: 0 solved, 1821 unsolved
Search for dead transitions found 0 dead transitions in 60808ms
Starting structural reductions in LTL mode, iteration 1 : 1131/1157 places, 1822/1848 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63401 ms. Remains : 1131/1157 places, 1822/1848 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(X(p1))&&F(p2)&&F(p3))))'
Stuttering acceptance computed with spot in 480 ms :[(OR (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (NOT p2), (NOT p3), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-14
Stuttering criterion allowed to conclude after 1132 steps with 0 reset in 8 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-14 finished in 63968 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((p0||X(X(X(p1)))||(p2 U (p3||G(p2))))))))'
Spot run failed in 102 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' '!(X((F(p0)||X(X(F(p1))))))'
Spot run failed in 76 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' '!(X((F((X(X(G(p1)))&&p0)) U X(X(!p1)))))'
Spot run failed in 77 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(X(p0))) U ((p1&&X(X(X(p0))))||X(X(X(G(p0)))))))||(G(F(p1))&&(X(X(X(p0))) U ((p1&&X(X(X(p0))))||X(X(X(G(p0)))))))))'
Spot run failed in 78 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-23 11:54:34] [INFO ] Flatten gal took : 47 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4747386564642219993
[2026-05-23 11:54:34] [INFO ] Too many transitions (1848) to apply POR reductions. Disabling POR matrices.
[2026-05-23 11:54:34] [INFO ] Applying decomposition
[2026-05-23 11:54:34] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4747386564642219993
Running compilation step : cd /tmp/ltsmin4747386564642219993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '180' '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-23 11:54:34] [INFO ] Flatten gal took : 42 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/graph3990186722555397291.txt' '-o' '/tmp/graph3990186722555397291.bin' '-w' '/tmp/graph3990186722555397291.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3990186722555397291.bin' '-l' '-1' '-v' '-w' '/tmp/graph3990186722555397291.weights' '-q' '0' '-e' '0.001'
[2026-05-23 11:54:34] [INFO ] Decomposing Gal with order
[2026-05-23 11:54:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 11:54:34] [INFO ] Removed a total of 1365 redundant transitions.
[2026-05-23 11:54:34] [INFO ] Flatten gal took : 117 ms
[2026-05-23 11:54:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 20 ms.
[2026-05-23 11:54:35] [INFO ] Time to serialize gal into /tmp/LTLFireability9106398449086229652.gal : 24 ms
[2026-05-23 11:54:35] [INFO ] Time to serialize properties into /tmp/LTLFireability6705393462531808472.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/LTLFireability9106398449086229652.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6705393462531808472.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 4 LTL properties
Checking formula 0 : !((X(X(G((("(i27.u262.p1032==0)")||(X(X(X("((i36.u352.p1404==0)||(i41.i2.i0.u389.p1566==0))")))))||(("(i42.u420.p1682!=1)")U(("((i31.u...227
Formula 0 simplified : XXF(!"(i27.u262.p1032==0)" & XXX!"((i36.u352.p1404==0)||(i41.i2.i0.u389.p1566==0))" & (!"(i42.u420.p1682!=1)" M !"((i31.u293.p1147!=...182
Compilation finished in 6303 ms.
Running link step : cd /tmp/ltsmin4747386564642219993;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin4747386564642219993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X([](((LTLAPp0==true)||X(X(X((LTLAPp1==true))))||((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin4747386564642219993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X([](((LTLAPp0==true)||X(X(X((LTLAPp1==true))))||((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4747386564642219993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X((<>((LTLAPp4==true))||X(X(<>((LTLAPp5==true))))))' '--buchi-type=spotba'
LTSmin run took 337 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin4747386564642219993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X((<>((X(X([]((LTLAPp7==true))))&&(LTLAPp6==true))) U X(X(!(LTLAPp7==true)))))' '--buchi-type=spotba'
LTSmin run took 334 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin4747386564642219993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([]((X(X(X((LTLAPp8==true)))) U (((LTLAPp9==true)&&X(X(X((LTLAPp8==true)))))||X(X(X([]((LTLAPp8==true))))))))||([](<>((LTLAPp9==true)))&&(X(X(X((LTLAPp8==true)))) U (((LTLAPp9==true)&&X(X(X((LTLAPp8==true)))))||X(X(X([]((LTLAPp8==true)))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin4747386564642219993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([]((X(X(X((LTLAPp8==true)))) U (((LTLAPp9==true)&&X(X(X((LTLAPp8==true)))))||X(X(X([]((LTLAPp8==true))))))))||([](<>((LTLAPp9==true)))&&(X(X(X((LTLAPp8==true)))) U (((LTLAPp9==true)&&X(X(X((LTLAPp8==true)))))||X(X(X([]((LTLAPp8==true)))))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin4747386564642219993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X([](((LTLAPp0==true)||X(X(X((LTLAPp1==true))))||((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-23 12:20:07] [INFO ] Applying decomposition
[2026-05-23 12:20:08] [INFO ] Flatten gal took : 399 ms
[2026-05-23 12:20:08] [INFO ] Decomposing Gal with order
[2026-05-23 12:20:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 12:20:10] [INFO ] Removed a total of 1011 redundant transitions.
[2026-05-23 12:20:10] [INFO ] Flatten gal took : 1345 ms
[2026-05-23 12:20:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 472 labels/synchronizations in 1032 ms.
[2026-05-23 12:20:12] [INFO ] Time to serialize gal into /tmp/LTLFireability14395492644983944004.gal : 159 ms
[2026-05-23 12:20:12] [INFO ] Time to serialize properties into /tmp/LTLFireability7462894514278964068.ltl : 52 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/LTLFireability14395492644983944004.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7462894514278964068.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 2 LTL properties
Checking formula 0 : !((X(X(G((("(i1.i1.i0.i0.u56.p1032==0)")||(X(X(X("((i1.i1.i1.i1.i0.i0.u74.p1404==0)||(i1.i1.i1.i1.i1.i0.u83.p1566==0))")))))||(("(i1.i...318
Formula 0 simplified : XXF(!"(i1.i1.i0.i0.u56.p1032==0)" & XXX!"((i1.i1.i1.i1.i0.i0.u74.p1404==0)||(i1.i1.i1.i1.i1.i0.u83.p1566==0))" & (!"(i1.i1.i1.i1.i1....257
Reverse transition relation is NOT exact ! Due to transitions i0.u23.t955, i0.u23.t975, i0.i0.u22.t981, i0.i0.i0.u21.t1008, i0.i0.i0.i0.u20.t1033, i0.i0.i0...2172
Computing Next relation with stutter on 4.50284e+17 deadlock states
16 unique states visited
16 strongly connected components in search stack
17 transitions explored
16 items max in DFS search stack
337 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.72941,117372,1,0,165453,9629,29822,643402,4033,49282,290512
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Champagne-PT-H09T2O-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G((X(X(X("(i1.i1.i1.i1.i1.i1.i1.i0.u93.p1766!=1)"))))U((("(i0.i0.i0.i0.i0.i0.u18.p261!=1)")&&(X(X(X("(i1.i1.i1.i1.i1.i1.i1.i0.u93....480
Formula 1 simplified : F(XXX!"(i1.i1.i1.i1.i1.i1.i1.i0.u93.p1766!=1)" R (XXXF!"(i1.i1.i1.i1.i1.i1.i1.i0.u93.p1766!=1)" & (!"(i0.i0.i0.i0.i0.i0.u18.p261!=1)...432
Computing Next relation with stutter on 4.50284e+17 deadlock states
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin4747386564642219993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X([](((LTLAPp0==true)||X(X(X((LTLAPp1==true))))||((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4747386564642219993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([]((X(X(X((LTLAPp8==true)))) U (((LTLAPp9==true)&&X(X(X((LTLAPp8==true)))))||X(X(X([]((LTLAPp8==true))))))))||([](<>((LTLAPp9==true)))&&(X(X(X((LTLAPp8==true)))) U (((LTLAPp9==true)&&X(X(X((LTLAPp8==true)))))||X(X(X([]((LTLAPp8==true)))))))))' '--buchi-type=spotba'

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="Champagne-PT-H09T2O"
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 Champagne-PT-H09T2O, 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 r050-smll-177946901100140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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