MCC'2026- Execution of r162-smll-177961107700090

About the Execution of ITS-Tools for IBM703-PT-none

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
444.367	446664.00	496093.00	1711.20	FTTFFFFFFTFFTTFF	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.r162-smll-177961107700090.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 IBM703-PT-none, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107700090
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 13K Mar 7 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 7 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.0K Mar 15 11:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 11:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 11:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Mar 7 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 199K Mar 7 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 7 16:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Mar 7 16:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 11:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 11:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 203K 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 IBM703-PT-none-CTLFireability-2024-00
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-01
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-02
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-03
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-04
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-05
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-06
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-07
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-08
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-09
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-10
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-11
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-12
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-13
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-14
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779723628008

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM703-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 15:40:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 15:40:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 15:40:30] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2026-05-25 15:40:30] [INFO ] Transformed 262 places.
[2026-05-25 15:40:30] [INFO ] Transformed 284 transitions.
[2026-05-25 15:40:30] [INFO ] Found NUPN structural information;
[2026-05-25 15:40:30] [INFO ] Parsed PT model containing 262 places and 284 transitions and 572 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Support contains 78 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 284/284 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 256 transition count 284
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 25 place count 237 transition count 265
Iterating global reduction 1 with 19 rules applied. Total rules applied 44 place count 237 transition count 265
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 234 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 234 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 233 transition count 261
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 233 transition count 261
Applied a total of 52 rules in 102 ms. Remains 233 /262 variables (removed 29) and now considering 261/284 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5813459103757634697.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10827929157839793982.kers'
[2026-05-25 15:40:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5813459103757634697.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10827929157839793982.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 233 cols 522 entries
Finished phase 1 with 233 SingleSign rule and 0 generalized
[2026-05-25 15:40:30] [INFO ] Computed 0 invariants in 2 ms
Computed 0 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10827929157839793982.kers
Total runtime 3 ms.
[2026-05-25 15:40:30] [INFO ] Implicit Places using invariants in 298 ms returned []
[2026-05-25 15:40:30] [INFO ] Invariant cache hit.
[2026-05-25 15:40:31] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2026-05-25 15:40:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 261/493 variables, 232/232 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/494 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/494 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/494 variables, and 233 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30042 ms.
Refiners :[State Equation: 233/233 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 261/493 variables, 232/232 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 260/492 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 1/494 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/494 variables, and 493 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30021 ms.
Refiners :[State Equation: 233/233 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Starting structural reductions in LTL mode, iteration 1 : 233/262 places, 261/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61012 ms. Remains : 233/262 places, 261/284 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 261/261 transitions.
Applied a total of 0 rules in 6 ms. Remains 233 /233 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2026-05-25 15:41:31] [INFO ] Invariant cache hit.
[2026-05-25 15:41:31] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-25 15:41:31] [INFO ] Invariant cache hit.
[2026-05-25 15:41:31] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 279 ms. Remains : 233/233 places, 261/261 transitions.
Support contains 78 out of 233 places after structural reductions.
[2026-05-25 15:41:31] [INFO ] Flatten gal took : 65 ms
[2026-05-25 15:41:31] [INFO ] Flatten gal took : 27 ms
[2026-05-25 15:41:32] [INFO ] Input system was already deterministic with 261 transitions.
Support contains 74 out of 233 places (down from 78) after GAL structural reductions.
RANDOM walk for 40000 steps (684 resets) in 1198 ms. (33 steps per ms) remains 6/61 properties
BEST_FIRST walk for 40003 steps (465 resets) in 594 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (493 resets) in 636 ms. (62 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (440 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (459 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (443 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (470 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
[2026-05-25 15:41:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 27/40 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 59/99 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 66/165 variables, 32/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 74/239 variables, 33/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 72/311 variables, 36/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 64/375 variables, 32/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 53/428 variables, 26/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 38/466 variables, 18/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 26/492 variables, 16/231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/492 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 19 (OVERLAPS) 2/494 variables, 2/233 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 0/233 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/494 variables, 0/233 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 233 constraints, problems are : Problem set: 4 solved, 2 unsolved in 864 ms.
Refiners :[State Equation: 233/233 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/41 variables, 11/16 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 2/18 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/18 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 30/71 variables, 13/31 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/31 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 35/106 variables, 16/47 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/47 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 41/147 variables, 19/66 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/66 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 40/187 variables, 20/86 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 0/86 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 35/222 variables, 17/103 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/222 variables, 0/103 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 35/257 variables, 15/118 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/257 variables, 0/118 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 39/296 variables, 18/136 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/296 variables, 0/136 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 41/337 variables, 20/156 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/337 variables, 0/156 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 36/373 variables, 18/174 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/373 variables, 0/174 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 29/402 variables, 15/189 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/402 variables, 0/189 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 32/434 variables, 14/203 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/434 variables, 0/203 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 31/465 variables, 14/217 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/465 variables, 0/217 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 21/486 variables, 13/230 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/486 variables, 0/230 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 5/491 variables, 3/233 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/491 variables, 0/233 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 2/493 variables, 1/234 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/493 variables, 0/234 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp39 is UNSAT
After SMT solving in domain Int declared 494/494 variables, and 235 constraints, problems are : Problem set: 6 solved, 0 unsolved in 700 ms.
Refiners :[State Equation: 233/233 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1576ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2026-05-25 15:41:34] [INFO ] Flatten gal took : 17 ms
[2026-05-25 15:41:34] [INFO ] Flatten gal took : 16 ms
[2026-05-25 15:41:34] [INFO ] Input system was already deterministic with 261 transitions.
Support contains 59 out of 233 places (down from 61) after GAL structural reductions.
Computed a total of 233 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 233 transition count 261
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA IBM703-PT-none-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 261/261 transitions.
Graph (complete) has 261 edges and 233 vertex of which 112 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.2 ms
Discarding 121 places :
Also discarding 131 output transitions
Drop transitions (Output transitions of discarded places.) removed 131 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 111 transition count 45
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 94 rules applied. Total rules applied 179 place count 28 transition count 34
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 186 place count 21 transition count 34
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 186 place count 21 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 194 place count 17 transition count 30
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 196 place count 15 transition count 27
Iterating global reduction 3 with 2 rules applied. Total rules applied 198 place count 15 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 200 place count 15 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 14 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 203 place count 13 transition count 24
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 206 place count 13 transition count 21
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 208 place count 12 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 211 place count 12 transition count 17
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 3 rules applied. Total rules applied 214 place count 12 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 217 place count 9 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 218 place count 9 transition count 13
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 219 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 220 place count 8 transition count 12
Applied a total of 220 rules in 41 ms. Remains 8 /233 variables (removed 225) and now considering 12/261 (removed 249) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17629674770594817922.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13623429598355923787.kers'
[2026-05-25 15:41:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17629674770594817922.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13623429598355923787.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 8 cols 19 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-25 15:41:34] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13623429598355923787.kers
Total runtime 0 ms.
[2026-05-25 15:41:34] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-25 15:41:34] [INFO ] Invariant cache hit.
[2026-05-25 15:41:34] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2026-05-25 15:41:34] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-25 15:41:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/20 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 8 constraints, problems are : Problem set: 0 solved, 10 unsolved in 156 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/20 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 18 constraints, problems are : Problem set: 0 solved, 10 unsolved in 147 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 310ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 311ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/233 places, 12/261 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 406 ms. Remains : 8/233 places, 12/261 transitions.
[2026-05-25 15:41:35] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:41:35] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:41:35] [INFO ] Input system was already deterministic with 12 transitions.
[2026-05-25 15:41:35] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:41:35] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:41:35] [INFO ] Time to serialize gal into /tmp/CTLFireability12200354291042416385.gal : 1 ms
[2026-05-25 15:41:35] [INFO ] Time to serialize properties into /tmp/CTLFireability12655552225802825787.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12200354291042416385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12655552225802825787.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9,0.014578,3692,2,16,5,85,6,0,41,79,0

Converting to forward existential form...Done !
original formula: AF(AG(((task_s00000735_inputCriterion_s00000257_used==1)||(merge_s00000451_activated==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((task_s00000735_inputCriterion_s00000257_used==1)||(merge_s00000451_activated==1)))))...166
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t4, t7, t8, Intersection with reachable at each step enabled. (destroyed/reverse/int...178
(forward)formula 0,0,0.017756,4000,1,0,34,401,49,19,228,454,46
FORMULA IBM703-PT-none-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 261/261 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 215 transition count 243
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 215 transition count 243
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 47 place count 204 transition count 232
Iterating global reduction 0 with 11 rules applied. Total rules applied 58 place count 204 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 204 transition count 229
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 199 transition count 224
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 199 transition count 224
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 195 transition count 220
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 195 transition count 220
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 83 place count 191 transition count 216
Iterating global reduction 1 with 4 rules applied. Total rules applied 87 place count 191 transition count 216
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 91 place count 187 transition count 212
Iterating global reduction 1 with 4 rules applied. Total rules applied 95 place count 187 transition count 212
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 99 place count 183 transition count 208
Iterating global reduction 1 with 4 rules applied. Total rules applied 103 place count 183 transition count 208
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 106 place count 180 transition count 205
Iterating global reduction 1 with 3 rules applied. Total rules applied 109 place count 180 transition count 205
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 179 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 179 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 178 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 178 transition count 203
Applied a total of 113 rules in 54 ms. Remains 178 /233 variables (removed 55) and now considering 203/261 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12900708486300531369.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17759931392977348495.kers'
[2026-05-25 15:41:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12900708486300531369.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17759931392977348495.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 203 rows 178 cols 407 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-25 15:41:35] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17759931392977348495.kers
Total runtime 2 ms.
[2026-05-25 15:41:35] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 15:41:35] [INFO ] Invariant cache hit.
[2026-05-25 15:41:35] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2026-05-25 15:41:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 203/380 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 1/381 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 0/381 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 178 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30027 ms.
Refiners :[State Equation: 178/178 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 203/380 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 202/379 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 1/381 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/381 variables, and 380 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30014 ms.
Refiners :[State Equation: 178/178 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in LTL mode, iteration 1 : 178/233 places, 203/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60358 ms. Remains : 178/233 places, 203/261 transitions.
[2026-05-25 15:42:35] [INFO ] Flatten gal took : 14 ms
[2026-05-25 15:42:35] [INFO ] Flatten gal took : 10 ms
[2026-05-25 15:42:35] [INFO ] Input system was already deterministic with 203 transitions.
[2026-05-25 15:42:35] [INFO ] Flatten gal took : 10 ms
[2026-05-25 15:42:35] [INFO ] Flatten gal took : 8 ms
[2026-05-25 15:42:35] [INFO ] Time to serialize gal into /tmp/CTLFireability16921243607870016439.gal : 7 ms
[2026-05-25 15:42:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4018542047967571088.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16921243607870016439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4018542047967571088.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2788,0.092434,6268,2,873,5,6370,6,0,914,9078,0

Converting to forward existential form...Done !
original formula: EF((EF(EG((fork_s00000464_activated_s00000274==0))) * ((EX((task_s00000755_inputCriterion_s00000257_used==1)) + (fork_s00000464_input_s00...251
=> equivalent forward existential formula: (([(EY((FwdU(Init,TRUE) * E(TRUE U EG((fork_s00000464_activated_s00000274==0))))) * (task_s00000755_inputCriteri...487
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t26, t28, t29, t30, t31, t34, t36, t37, t41, t47, t48, t56, t57, t63, t71, t79, t125,...292
(forward)formula 0,1,2.78691,72576,1,0,660,402797,433,348,5000,379301,845
FORMULA IBM703-PT-none-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 261/261 transitions.
Graph (complete) has 261 edges and 233 vertex of which 10 are kept as prefixes of interest. Removing 223 places using SCC suffix rule.1 ms
Discarding 223 places :
Also discarding 247 output transitions
Drop transitions (Output transitions of discarded places.) removed 247 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 9 transition count 5
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 4 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 4 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 3 transition count 4
Applied a total of 16 rules in 4 ms. Remains 3 /233 variables (removed 230) and now considering 4/261 (removed 257) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2700126026380500284.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9209934344620175571.kers'
[2026-05-25 15:42:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2700126026380500284.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9209934344620175571.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 3 cols 6 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-25 15:42:38] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9209934344620175571.kers
Total runtime 0 ms.
[2026-05-25 15:42:38] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-25 15:42:38] [INFO ] Invariant cache hit.
[2026-05-25 15:42:38] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2026-05-25 15:42:38] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-25 15:42:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 47 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/7 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 50 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 100ms
Starting structural reductions in SI_CTL mode, iteration 1 : 3/233 places, 4/261 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 160 ms. Remains : 3/233 places, 4/261 transitions.
[2026-05-25 15:42:38] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:42:38] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:42:38] [INFO ] Input system was already deterministic with 4 transitions.
[2026-05-25 15:42:38] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:42:38] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:42:38] [INFO ] Time to serialize gal into /tmp/CTLFireability6059830652191894983.gal : 0 ms
[2026-05-25 15:42:38] [INFO ] Time to serialize properties into /tmp/CTLFireability6749664776049980262.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6059830652191894983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6749664776049980262.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4,0.003205,3736,2,6,5,21,6,0,16,15,0

Converting to forward existential form...Done !
original formula: AF(AG((task_s00000752_output_s00000264==0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((task_s00000752_output_s00000264==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
dead was empty
(forward)formula 0,1,0.004984,4008,1,0,17,65,32,8,75,78,22
FORMULA IBM703-PT-none-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 261/261 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 213 transition count 241
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 213 transition count 241
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 51 place count 202 transition count 230
Iterating global reduction 0 with 11 rules applied. Total rules applied 62 place count 202 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 202 transition count 227
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 70 place count 197 transition count 222
Iterating global reduction 1 with 5 rules applied. Total rules applied 75 place count 197 transition count 222
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 80 place count 192 transition count 217
Iterating global reduction 1 with 5 rules applied. Total rules applied 85 place count 192 transition count 217
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 90 place count 187 transition count 212
Iterating global reduction 1 with 5 rules applied. Total rules applied 95 place count 187 transition count 212
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 100 place count 182 transition count 207
Iterating global reduction 1 with 5 rules applied. Total rules applied 105 place count 182 transition count 207
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 110 place count 177 transition count 202
Iterating global reduction 1 with 5 rules applied. Total rules applied 115 place count 177 transition count 202
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 119 place count 173 transition count 198
Iterating global reduction 1 with 4 rules applied. Total rules applied 123 place count 173 transition count 198
Applied a total of 123 rules in 42 ms. Remains 173 /233 variables (removed 60) and now considering 198/261 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16485137195798433218.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13037201136026663824.kers'
[2026-05-25 15:42:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16485137195798433218.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13037201136026663824.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 198 rows 173 cols 398 entries
Finished phase 1 with 173 SingleSign rule and 0 generalized
[2026-05-25 15:42:38] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13037201136026663824.kers
Total runtime 1 ms.
[2026-05-25 15:42:38] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-25 15:42:38] [INFO ] Invariant cache hit.
[2026-05-25 15:42:38] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2026-05-25 15:42:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 198/370 variables, 172/172 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (OVERLAPS) 1/371 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 371/371 variables, and 173 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30012 ms.
Refiners :[State Equation: 173/173 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 198/370 variables, 172/172 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 197/369 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 1/371 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 370 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30012 ms.
Refiners :[State Equation: 173/173 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in LTL mode, iteration 1 : 173/233 places, 198/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60299 ms. Remains : 173/233 places, 198/261 transitions.
[2026-05-25 15:43:39] [INFO ] Flatten gal took : 16 ms
[2026-05-25 15:43:39] [INFO ] Flatten gal took : 18 ms
[2026-05-25 15:43:39] [INFO ] Input system was already deterministic with 198 transitions.
[2026-05-25 15:43:39] [INFO ] Flatten gal took : 13 ms
[2026-05-25 15:43:39] [INFO ] Flatten gal took : 12 ms
[2026-05-25 15:43:39] [INFO ] Time to serialize gal into /tmp/CTLFireability5143785635699566279.gal : 6 ms
[2026-05-25 15:43:39] [INFO ] Time to serialize properties into /tmp/CTLFireability4848864481281078967.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5143785635699566279.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4848864481281078967.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2974,0.089217,6228,2,703,5,6592,6,0,890,9173,0

Converting to forward existential form...Done !
original formula: AX(A(EF((callToProcess_s00000807_output_s00000264==1)) U (task_s00000732_inputCriterion_s00000257_used==1)))
=> equivalent forward existential formula: ([((FwdU(EY(Init),!((task_s00000732_inputCriterion_s00000257_used==1))) * !((task_s00000732_inputCriterion_s0000...322
Hit Full ! (commute/partial/dont) 196/0/2
(forward)formula 0,0,0.838613,24396,1,0,116,92314,19,4,3950,93565,115
FORMULA IBM703-PT-none-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 261/261 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 214 transition count 242
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 214 transition count 242
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 204 transition count 232
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 204 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 204 transition count 229
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 65 place count 200 transition count 225
Iterating global reduction 1 with 4 rules applied. Total rules applied 69 place count 200 transition count 225
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 197 transition count 222
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 197 transition count 222
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 194 transition count 219
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 194 transition count 219
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 191 transition count 216
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 191 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 190 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 190 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 189 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 189 transition count 214
Applied a total of 91 rules in 43 ms. Remains 189 /233 variables (removed 44) and now considering 214/261 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11742570355738878942.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18320347740119010671.kers'
[2026-05-25 15:43:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11742570355738878942.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18320347740119010671.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 189 cols 429 entries
Finished phase 1 with 189 SingleSign rule and 0 generalized
[2026-05-25 15:43:40] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18320347740119010671.kers
Total runtime 1 ms.
[2026-05-25 15:43:40] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 15:43:40] [INFO ] Invariant cache hit.
[2026-05-25 15:43:40] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2026-05-25 15:43:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 214/402 variables, 188/188 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/403 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 403/403 variables, and 189 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30009 ms.
Refiners :[State Equation: 189/189 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 214/402 variables, 188/188 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 213/401 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 1/403 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/403 variables, and 402 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30014 ms.
Refiners :[State Equation: 189/189 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60046ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Starting structural reductions in LTL mode, iteration 1 : 189/233 places, 214/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60287 ms. Remains : 189/233 places, 214/261 transitions.
[2026-05-25 15:44:40] [INFO ] Flatten gal took : 15 ms
[2026-05-25 15:44:40] [INFO ] Flatten gal took : 13 ms
[2026-05-25 15:44:40] [INFO ] Input system was already deterministic with 214 transitions.
[2026-05-25 15:44:40] [INFO ] Flatten gal took : 18 ms
[2026-05-25 15:44:40] [INFO ] Flatten gal took : 13 ms
[2026-05-25 15:44:40] [INFO ] Time to serialize gal into /tmp/CTLFireability4219708532028051651.gal : 3 ms
[2026-05-25 15:44:40] [INFO ] Time to serialize properties into /tmp/CTLFireability16247044334007209916.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4219708532028051651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16247044334007209916.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4468,0.16226,6516,2,773,5,7208,6,0,969,10521,0

Converting to forward existential form...Done !
original formula: (A((task_s00000758_inputCriterion_s00000257_used==1) U A((task_s00000748_inputCriterion_s00000257_used==1) U AX(AF((task_s00000736_inputC...485
=> equivalent forward existential formula: [(((Init * !((E(!(!((E(!(!(EX(!(!(EG(!((task_s00000736_inputCriterion_s00000257_used==1)))))))) U (!((task_s0000...1608
Reverse transition relation is NOT exact ! Due to transitions t20, t24, t26, t27, t28, t29, t33, t35, t40, t41, t45, t47, t52, t55, t56, t70, t79, t120, t1...289
(forward)formula 0,0,2.44816,68336,1,0,700,383055,471,377,4981,360678,886
FORMULA IBM703-PT-none-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 261/261 transitions.
Graph (complete) has 261 edges and 233 vertex of which 73 are kept as prefixes of interest. Removing 160 places using SCC suffix rule.2 ms
Discarding 160 places :
Also discarding 175 output transitions
Drop transitions (Output transitions of discarded places.) removed 175 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 72 transition count 31
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 61 rules applied. Total rules applied 116 place count 19 transition count 23
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 122 place count 14 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 13 transition count 22
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 123 place count 13 transition count 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 129 place count 10 transition count 19
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 9 transition count 17
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 9 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 133 place count 8 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 135 place count 8 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 137 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 140 place count 7 transition count 10
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 141 place count 7 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 142 place count 6 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 142 place count 6 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 144 place count 5 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 145 place count 5 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 145 place count 5 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 147 place count 4 transition count 6
Applied a total of 147 rules in 14 ms. Remains 4 /233 variables (removed 229) and now considering 6/261 (removed 255) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5355816907033205764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18166708141264146918.kers'
[2026-05-25 15:44:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5355816907033205764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18166708141264146918.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 4 cols 10 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 15:44:42] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18166708141264146918.kers
Total runtime 0 ms.
[2026-05-25 15:44:42] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 15:44:42] [INFO ] Invariant cache hit.
[2026-05-25 15:44:42] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2026-05-25 15:44:42] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-25 15:44:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 4 constraints, problems are : Problem set: 0 solved, 4 unsolved in 88 ms.
Refiners :[State Equation: 4/4 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/10 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 97 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 189ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 189ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/233 places, 6/261 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 271 ms. Remains : 4/233 places, 6/261 transitions.
[2026-05-25 15:44:43] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:44:43] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:44:43] [INFO ] Input system was already deterministic with 6 transitions.
[2026-05-25 15:44:43] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:44:43] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:44:43] [INFO ] Time to serialize gal into /tmp/CTLFireability14077939398029264595.gal : 1 ms
[2026-05-25 15:44:43] [INFO ] Time to serialize properties into /tmp/CTLFireability11127081011517101788.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14077939398029264595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11127081011517101788.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5,0.003806,3752,2,8,5,30,6,0,22,24,0

Converting to forward existential form...Done !
original formula: EG(A(AF(!(EG((task_s00000711_input_s00000263==1)))) U (merge_s00000446_input_s00000290==1)))
=> equivalent forward existential formula: [FwdG(Init,!((E(!((merge_s00000446_input_s00000290==1)) U (!(!(EG(!(!(EG((task_s00000711_input_s00000263==1)))))...260
Reverse transition relation is NOT exact ! Due to transitions t0, t5, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
dead was empty
(forward)formula 0,0,0.008035,4308,1,0,26,100,41,19,103,140,41
FORMULA IBM703-PT-none-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 261/261 transitions.
Graph (complete) has 261 edges and 233 vertex of which 185 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.3 ms
Discarding 48 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 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 134 rules applied. Total rules applied 135 place count 184 transition count 77
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 153 rules applied. Total rules applied 288 place count 51 transition count 57
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 16 rules applied. Total rules applied 304 place count 38 transition count 54
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 307 place count 36 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 308 place count 35 transition count 53
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 308 place count 35 transition count 46
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 322 place count 28 transition count 46
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 324 place count 26 transition count 43
Iterating global reduction 5 with 2 rules applied. Total rules applied 326 place count 26 transition count 43
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 327 place count 25 transition count 41
Iterating global reduction 5 with 1 rules applied. Total rules applied 328 place count 25 transition count 41
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 329 place count 25 transition count 40
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 331 place count 24 transition count 39
Performed 7 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 345 place count 17 transition count 31
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 5 rules applied. Total rules applied 350 place count 17 transition count 26
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 353 place count 15 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 355 place count 14 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 357 place count 14 transition count 22
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 3 rules applied. Total rules applied 360 place count 13 transition count 20
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 3 rules applied. Total rules applied 363 place count 12 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 364 place count 11 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 366 place count 11 transition count 16
Applied a total of 366 rules in 31 ms. Remains 11 /233 variables (removed 222) and now considering 16/261 (removed 245) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14794340157831984961.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1074639741993402387.kers'
[2026-05-25 15:44:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14794340157831984961.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1074639741993402387.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 11 cols 29 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-25 15:44:43] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1074639741993402387.kers
Total runtime 0 ms.
[2026-05-25 15:44:43] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-25 15:44:43] [INFO ] Invariant cache hit.
[2026-05-25 15:44:43] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2026-05-25 15:44:43] [INFO ] Redundant transitions in 1 ms returned []
Running 14 sub problems to find dead transitions.
[2026-05-25 15:44:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 15/25 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 2/27 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 11 constraints, problems are : Problem set: 0 solved, 14 unsolved in 317 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 15/25 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 2/27 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 25 constraints, problems are : Problem set: 0 solved, 14 unsolved in 324 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 647ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 647ms
Starting structural reductions in SI_CTL mode, iteration 1 : 11/233 places, 16/261 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 759 ms. Remains : 11/233 places, 16/261 transitions.
[2026-05-25 15:44:43] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:44:43] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:44:43] [INFO ] Input system was already deterministic with 16 transitions.
[2026-05-25 15:44:43] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:44:43] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:44:43] [INFO ] Time to serialize gal into /tmp/CTLFireability15480080880193109842.gal : 0 ms
[2026-05-25 15:44:43] [INFO ] Time to serialize properties into /tmp/CTLFireability6231522033836984244.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15480080880193109842.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6231522033836984244.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,12,0.005832,3816,2,22,5,103,6,0,59,72,0

Converting to forward existential form...Done !
original formula: (EF(((decision_s00000776_activated==1)||(task_s00000763_inputCriterion_s00000257_used==0))) * EF(AG(EF((task_s00000759_inputCriterion_s00...174
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U ((decision_s00000776_activated==1)||(task_s00000763_inputCriterion_s00000257_used==0))))...250
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...172
(forward)formula 0,0,0.01209,4092,1,0,30,564,53,18,297,535,48
FORMULA IBM703-PT-none-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 261/261 transitions.
Graph (complete) has 261 edges and 233 vertex of which 83 are kept as prefixes of interest. Removing 150 places using SCC suffix rule.2 ms
Discarding 150 places :
Also discarding 163 output transitions
Drop transitions (Output transitions of discarded places.) removed 163 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 82 transition count 34
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 70 rules applied. Total rules applied 134 place count 20 transition count 26
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 139 place count 15 transition count 26
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 139 place count 15 transition count 23
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 145 place count 12 transition count 23
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 11 transition count 21
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 11 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 10 transition count 20
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 152 place count 10 transition count 17
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 154 place count 9 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 157 place count 9 transition count 13
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 3 rules applied. Total rules applied 160 place count 9 transition count 10
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 163 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 165 place count 6 transition count 8
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 166 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 167 place count 5 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 167 place count 5 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 169 place count 4 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 170 place count 4 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 170 place count 4 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 172 place count 3 transition count 4
Applied a total of 172 rules in 13 ms. Remains 3 /233 variables (removed 230) and now considering 4/261 (removed 257) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13146132554616266879.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16369396028818632040.kers'
[2026-05-25 15:44:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13146132554616266879.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16369396028818632040.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 3 cols 6 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-25 15:44:43] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16369396028818632040.kers
Total runtime 0 ms.
[2026-05-25 15:44:43] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-25 15:44:43] [INFO ] Invariant cache hit.
[2026-05-25 15:44:43] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2026-05-25 15:44:43] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-25 15:44:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 54 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/7 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 57 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 134ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 135ms
Starting structural reductions in SI_CTL mode, iteration 1 : 3/233 places, 4/261 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 209 ms. Remains : 3/233 places, 4/261 transitions.
[2026-05-25 15:44:44] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:44:44] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:44:44] [INFO ] Input system was already deterministic with 4 transitions.
[2026-05-25 15:44:44] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:44:44] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:44:44] [INFO ] Time to serialize gal into /tmp/CTLFireability5195128814536511146.gal : 1 ms
[2026-05-25 15:44:44] [INFO ] Time to serialize properties into /tmp/CTLFireability8488402546497283328.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5195128814536511146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8488402546497283328.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4,0.003956,3732,2,6,5,21,6,0,16,15,0

Converting to forward existential form...Done !
original formula: EG(EF((task_s00000722_output_s00000264==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (task_s00000722_output_s00000264==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
dead was empty
(forward)formula 0,0,0.006425,4008,1,0,17,65,31,8,74,78,22
FORMULA IBM703-PT-none-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 261/261 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 218 transition count 246
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 218 transition count 246
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 212 transition count 240
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 212 transition count 240
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 212 transition count 238
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 209 transition count 235
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 209 transition count 235
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 207 transition count 233
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 207 transition count 233
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 205 transition count 231
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 205 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 203 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 203 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 201 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 201 transition count 227
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 199 transition count 225
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 199 transition count 225
Applied a total of 70 rules in 22 ms. Remains 199 /233 variables (removed 34) and now considering 225/261 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2977163911426357044.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15574677355264567341.kers'
[2026-05-25 15:44:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2977163911426357044.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15574677355264567341.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 225 rows 199 cols 452 entries
Finished phase 1 with 199 SingleSign rule and 0 generalized
[2026-05-25 15:44:44] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15574677355264567341.kers
Total runtime 3 ms.
[2026-05-25 15:44:44] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-25 15:44:44] [INFO ] Invariant cache hit.
[2026-05-25 15:44:44] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2026-05-25 15:44:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 225/423 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 1/424 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/424 variables, and 199 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30015 ms.
Refiners :[State Equation: 199/199 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 225/423 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 224/422 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 1/424 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 423 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30012 ms.
Refiners :[State Equation: 199/199 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Starting structural reductions in LTL mode, iteration 1 : 199/233 places, 225/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60336 ms. Remains : 199/233 places, 225/261 transitions.
[2026-05-25 15:45:44] [INFO ] Flatten gal took : 8 ms
[2026-05-25 15:45:44] [INFO ] Flatten gal took : 9 ms
[2026-05-25 15:45:44] [INFO ] Input system was already deterministic with 225 transitions.
[2026-05-25 15:45:44] [INFO ] Flatten gal took : 17 ms
[2026-05-25 15:45:44] [INFO ] Flatten gal took : 13 ms
[2026-05-25 15:45:44] [INFO ] Time to serialize gal into /tmp/CTLFireability16455676852994276472.gal : 2 ms
[2026-05-25 15:45:44] [INFO ] Time to serialize properties into /tmp/CTLFireability11720711643783492462.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16455676852994276472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11720711643783492462.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4479,0.141365,7668,2,978,5,10879,6,0,1021,16940,0

Converting to forward existential form...Done !
original formula: E(E(AG((EG((task_s00000714_input_s00000263==1)) + (EF((task_s00000704_inputCriterion_s00000257_used==1)) * ((task_s00000725_input_s000002...866
=> equivalent forward existential formula: ([(FwdU(Init,E(!(E(TRUE U !((EG((task_s00000714_input_s00000263==1)) + (E(TRUE U (task_s00000704_inputCriterion_...1391
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t28, t29, t30, t34, t35, t36, t41, t42, t46, t48, t53, t58, t72, t81, t82, t90, t93...287
(forward)formula 0,0,3.94315,107352,1,0,885,669592,523,550,5610,567127,1234
FORMULA IBM703-PT-none-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 261/261 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 214 transition count 242
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 214 transition count 242
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 205 transition count 233
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 205 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 205 transition count 232
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 200 transition count 227
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 200 transition count 227
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 197 transition count 224
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 197 transition count 224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 194 transition count 221
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 194 transition count 221
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 191 transition count 218
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 191 transition count 218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 189 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 189 transition count 216
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 187 transition count 214
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 187 transition count 214
Applied a total of 93 rules in 18 ms. Remains 187 /233 variables (removed 46) and now considering 214/261 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1698217068621636550.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10098141855799297161.kers'
[2026-05-25 15:45:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1698217068621636550.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10098141855799297161.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 187 cols 429 entries
Finished phase 1 with 187 SingleSign rule and 0 generalized
[2026-05-25 15:45:48] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10098141855799297161.kers
Total runtime 2 ms.
[2026-05-25 15:45:48] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 15:45:48] [INFO ] Invariant cache hit.
[2026-05-25 15:45:48] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2026-05-25 15:45:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 214/400 variables, 186/186 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/401 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/401 variables, and 187 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30019 ms.
Refiners :[State Equation: 187/187 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 214/400 variables, 186/186 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 213/399 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 1/401 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/401 variables, and 400 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30020 ms.
Refiners :[State Equation: 187/187 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Starting structural reductions in LTL mode, iteration 1 : 187/233 places, 214/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60284 ms. Remains : 187/233 places, 214/261 transitions.
[2026-05-25 15:46:48] [INFO ] Flatten gal took : 13 ms
[2026-05-25 15:46:48] [INFO ] Flatten gal took : 8 ms
[2026-05-25 15:46:48] [INFO ] Input system was already deterministic with 214 transitions.
[2026-05-25 15:46:48] [INFO ] Flatten gal took : 7 ms
[2026-05-25 15:46:48] [INFO ] Flatten gal took : 7 ms
[2026-05-25 15:46:48] [INFO ] Time to serialize gal into /tmp/CTLFireability12596897250688429474.gal : 2 ms
[2026-05-25 15:46:48] [INFO ] Time to serialize properties into /tmp/CTLFireability14158748924390381016.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12596897250688429474.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14158748924390381016.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4436,0.117343,6520,2,788,5,6807,6,0,961,10449,0

Converting to forward existential form...Done !
original formula: A((task_s00000759_inputCriterion_s00000257_used==1) U ((A((EF((task_s00000732_inputCriterion_s00000257_used==1)) + !(((task_s00000736_inp...823
=> equivalent forward existential formula: [((Init * !(EG(!(((!((E(!(!(EX(!((task_s00000706_input_s00000263!=1))))) U (!((E(TRUE U (task_s00000732_inputCri...2847
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t27, t29, t31, t32, t35, t36, t37, t42, t43, t47, t49, t54, t57, t58, t72, t81, t12...294
(forward)formula 0,0,3.23804,92120,1,0,1136,555781,482,719,5302,527662,1313
FORMULA IBM703-PT-none-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 261/261 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 214 transition count 242
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 214 transition count 242
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 50 place count 202 transition count 230
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 202 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 202 transition count 227
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 71 place count 196 transition count 221
Iterating global reduction 1 with 6 rules applied. Total rules applied 77 place count 196 transition count 221
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 82 place count 191 transition count 216
Iterating global reduction 1 with 5 rules applied. Total rules applied 87 place count 191 transition count 216
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 92 place count 186 transition count 211
Iterating global reduction 1 with 5 rules applied. Total rules applied 97 place count 186 transition count 211
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 102 place count 181 transition count 206
Iterating global reduction 1 with 5 rules applied. Total rules applied 107 place count 181 transition count 206
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 111 place count 177 transition count 202
Iterating global reduction 1 with 4 rules applied. Total rules applied 115 place count 177 transition count 202
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 118 place count 174 transition count 199
Iterating global reduction 1 with 3 rules applied. Total rules applied 121 place count 174 transition count 199
Applied a total of 121 rules in 19 ms. Remains 174 /233 variables (removed 59) and now considering 199/261 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3000929279270492695.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-230071622207824801.kers'
[2026-05-25 15:46:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3000929279270492695.kers, --Pflows, --basisKERS=/tmp/petrispot-output-230071622207824801.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 174 cols 400 entries
Finished phase 1 with 174 SingleSign rule and 0 generalized
[2026-05-25 15:46:52] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-230071622207824801.kers
Total runtime 1 ms.
[2026-05-25 15:46:52] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 15:46:52] [INFO ] Invariant cache hit.
[2026-05-25 15:46:52] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2026-05-25 15:46:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 199/372 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 1/373 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/373 variables, and 174 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30014 ms.
Refiners :[State Equation: 174/174 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 199/372 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 198/371 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 1/373 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 372 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30016 ms.
Refiners :[State Equation: 174/174 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60040ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 60041ms
Starting structural reductions in LTL mode, iteration 1 : 174/233 places, 199/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60229 ms. Remains : 174/233 places, 199/261 transitions.
[2026-05-25 15:47:52] [INFO ] Flatten gal took : 6 ms
[2026-05-25 15:47:52] [INFO ] Flatten gal took : 6 ms
[2026-05-25 15:47:52] [INFO ] Input system was already deterministic with 199 transitions.
[2026-05-25 15:47:52] [INFO ] Flatten gal took : 5 ms
[2026-05-25 15:47:52] [INFO ] Flatten gal took : 5 ms
[2026-05-25 15:47:52] [INFO ] Time to serialize gal into /tmp/CTLFireability15028444685653380947.gal : 1 ms
[2026-05-25 15:47:52] [INFO ] Time to serialize properties into /tmp/CTLFireability14157369921581210177.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15028444685653380947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14157369921581210177.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3274,0.092827,6208,2,710,5,6224,6,0,895,9031,0

Converting to forward existential form...Done !
original formula: A((EF(EX(!(EG((task_s00000706_input_s00000263==1))))) + (merge_s00000453_input_s00000263==1)) U !((EX(!(EF((task_s00000748_inputCriterion...223
=> equivalent forward existential formula: [((Init * !(EG(!(!((EX(!(E(TRUE U (task_s00000748_inputCriterion_s00000257_used==1)))) + !(EG(!((merge_s00000446...558
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t27, t28, t29, t32, t33, t34, t39, t40, t44, t46, t51, t55, t61, t69, t78, t88, t12...288
(forward)formula 0,0,1.26094,37176,1,0,394,158969,431,216,4915,161059,575
FORMULA IBM703-PT-none-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 261/261 transitions.
Graph (complete) has 261 edges and 233 vertex of which 71 are kept as prefixes of interest. Removing 162 places using SCC suffix rule.1 ms
Discarding 162 places :
Also discarding 179 output transitions
Drop transitions (Output transitions of discarded places.) removed 179 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 70 transition count 29
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 60 rules applied. Total rules applied 113 place count 18 transition count 21
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 118 place count 13 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 118 place count 13 transition count 18
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 124 place count 10 transition count 18
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 9 transition count 16
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 9 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 130 place count 7 transition count 14
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 135 place count 7 transition count 9
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 140 place count 5 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 141 place count 4 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 142 place count 4 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 142 place count 4 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 144 place count 3 transition count 4
Applied a total of 144 rules in 6 ms. Remains 3 /233 variables (removed 230) and now considering 4/261 (removed 257) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-251932225405031850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12896822112728518612.kers'
[2026-05-25 15:47:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-251932225405031850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12896822112728518612.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 3 cols 6 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-25 15:47:53] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12896822112728518612.kers
Total runtime 0 ms.
[2026-05-25 15:47:53] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-25 15:47:53] [INFO ] Invariant cache hit.
[2026-05-25 15:47:53] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2026-05-25 15:47:53] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-25 15:47:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 38 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/7 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 49 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 87ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 87ms
Starting structural reductions in SI_CTL mode, iteration 1 : 3/233 places, 4/261 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 136 ms. Remains : 3/233 places, 4/261 transitions.
[2026-05-25 15:47:53] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:47:53] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:47:53] [INFO ] Input system was already deterministic with 4 transitions.
[2026-05-25 15:47:53] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:47:53] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:47:53] [INFO ] Time to serialize gal into /tmp/CTLFireability10579680127777020637.gal : 1 ms
[2026-05-25 15:47:53] [INFO ] Time to serialize properties into /tmp/CTLFireability12945203818343525378.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10579680127777020637.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12945203818343525378.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4,0.003083,3732,2,6,5,21,6,0,16,15,0

Converting to forward existential form...Done !
original formula: EG((task_s00000741_input_s00000263==0))
=> equivalent forward existential formula: [FwdG(Init,(task_s00000741_input_s00000263==0))] != FALSE
Hit Full ! (commute/partial/dont) 2/0/2
(forward)formula 0,1,0.004269,4004,1,0,10,52,18,3,74,55,10
FORMULA IBM703-PT-none-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 261/261 transitions.
Graph (complete) has 261 edges and 233 vertex of which 20 are kept as prefixes of interest. Removing 213 places using SCC suffix rule.1 ms
Discarding 213 places :
Also discarding 235 output transitions
Drop transitions (Output transitions of discarded places.) removed 235 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 19 transition count 11
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 7 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 6 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 30 place count 6 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 5 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 5 transition count 7
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 5 transition count 7
Applied a total of 34 rules in 6 ms. Remains 5 /233 variables (removed 228) and now considering 7/261 (removed 254) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11122630925470482847.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13386575581784206396.kers'
[2026-05-25 15:47:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11122630925470482847.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13386575581784206396.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 5 cols 11 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-25 15:47:53] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13386575581784206396.kers
Total runtime 0 ms.
[2026-05-25 15:47:53] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-25 15:47:53] [INFO ] Invariant cache hit.
[2026-05-25 15:47:53] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2026-05-25 15:47:53] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-25 15:47:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/12 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 98 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/12 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 95 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 195ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 195ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/233 places, 7/261 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 257 ms. Remains : 5/233 places, 7/261 transitions.
[2026-05-25 15:47:54] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:47:54] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:47:54] [INFO ] Input system was already deterministic with 7 transitions.
[2026-05-25 15:47:54] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:47:54] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:47:54] [INFO ] Time to serialize gal into /tmp/CTLFireability9930723113577079740.gal : 1 ms
[2026-05-25 15:47:54] [INFO ] Time to serialize properties into /tmp/CTLFireability796632076616142130.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9930723113577079740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability796632076616142130.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6,0.004498,3760,2,10,5,37,6,0,26,30,0

Converting to forward existential form...Done !
original formula: (AG((task_s00000753_input_s00000263==1)) + AG(EF((decision_s00000775_activated!=1))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(E(TRUE U !((task_s00000753_input_s00000263==1)))))),TRUE) * !(E(TRUE U (decision_s00000775_ac...178
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...169
(forward)formula 0,1,0.007101,4032,1,0,22,139,35,10,125,159,27
FORMULA IBM703-PT-none-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 261/261 transitions.
Graph (complete) has 261 edges and 233 vertex of which 68 are kept as prefixes of interest. Removing 165 places using SCC suffix rule.1 ms
Discarding 165 places :
Also discarding 179 output transitions
Drop transitions (Output transitions of discarded places.) removed 179 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 67 transition count 32
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 53 rules applied. Total rules applied 103 place count 19 transition count 27
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 107 place count 16 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 108 place count 15 transition count 26
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 108 place count 15 transition count 23
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 114 place count 12 transition count 23
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 11 transition count 21
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 11 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 118 place count 10 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 120 place count 10 transition count 18
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 122 place count 9 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 125 place count 9 transition count 14
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 127 place count 9 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 129 place count 7 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 129 place count 7 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 131 place count 6 transition count 11
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 133 place count 6 transition count 9
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 134 place count 6 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 135 place count 5 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 136 place count 5 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 136 place count 5 transition count 6
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 138 place count 4 transition count 6
Applied a total of 138 rules in 9 ms. Remains 4 /233 variables (removed 229) and now considering 6/261 (removed 255) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11226613757631798333.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16317121928977802895.kers'
[2026-05-25 15:47:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11226613757631798333.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16317121928977802895.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 4 cols 10 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 15:47:54] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16317121928977802895.kers
Total runtime 1 ms.
[2026-05-25 15:47:54] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-25 15:47:54] [INFO ] Invariant cache hit.
[2026-05-25 15:47:54] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2026-05-25 15:47:54] [INFO ] Redundant transitions in 1 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-25 15:47:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 4 constraints, problems are : Problem set: 0 solved, 4 unsolved in 91 ms.
Refiners :[State Equation: 4/4 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/10 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 99 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 193ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 193ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/233 places, 6/261 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 258 ms. Remains : 4/233 places, 6/261 transitions.
[2026-05-25 15:47:54] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:47:54] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:47:54] [INFO ] Input system was already deterministic with 6 transitions.
[2026-05-25 15:47:54] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:47:54] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:47:54] [INFO ] Time to serialize gal into /tmp/CTLFireability8247866172753050844.gal : 0 ms
[2026-05-25 15:47:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8232760068500565254.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8247866172753050844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8232760068500565254.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5,0.003956,3752,2,8,5,30,6,0,22,24,0

Converting to forward existential form...Done !
original formula: AF(E((task_s00000710_input_s00000263==1) U (task_s00000761_input_s00000263==1)))
=> equivalent forward existential formula: [FwdG(Init,!(E((task_s00000710_input_s00000263==1) U (task_s00000761_input_s00000263==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t5, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
(forward)formula 0,0,0.007676,4036,1,0,23,88,37,16,102,130,36
FORMULA IBM703-PT-none-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 261/261 transitions.
Graph (complete) has 261 edges and 233 vertex of which 111 are kept as prefixes of interest. Removing 122 places using SCC suffix rule.1 ms
Discarding 122 places :
Also discarding 131 output transitions
Drop transitions (Output transitions of discarded places.) removed 131 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 47
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 94 rules applied. Total rules applied 177 place count 30 transition count 33
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 186 place count 21 transition count 33
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 186 place count 21 transition count 28
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 196 place count 16 transition count 28
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 197 place count 15 transition count 26
Iterating global reduction 3 with 1 rules applied. Total rules applied 198 place count 15 transition count 26
Performed 5 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 208 place count 10 transition count 20
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 213 place count 10 transition count 15
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 216 place count 8 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 218 place count 8 transition count 12
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 220 place count 8 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 222 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 223 place count 6 transition count 9
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 224 place count 6 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 225 place count 5 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 226 place count 5 transition count 7
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 227 place count 5 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 228 place count 4 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 229 place count 4 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 229 place count 4 transition count 4
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 231 place count 3 transition count 4
Applied a total of 231 rules in 10 ms. Remains 3 /233 variables (removed 230) and now considering 4/261 (removed 257) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13892391881062853820.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11332690713273187103.kers'
[2026-05-25 15:47:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13892391881062853820.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11332690713273187103.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 3 cols 6 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-25 15:47:54] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11332690713273187103.kers
Total runtime 0 ms.
[2026-05-25 15:47:54] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-25 15:47:54] [INFO ] Invariant cache hit.
[2026-05-25 15:47:54] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2026-05-25 15:47:54] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-25 15:47:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 48 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/7 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 55 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 105ms
Starting structural reductions in SI_CTL mode, iteration 1 : 3/233 places, 4/261 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 170 ms. Remains : 3/233 places, 4/261 transitions.
[2026-05-25 15:47:54] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:47:54] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:47:54] [INFO ] Input system was already deterministic with 4 transitions.
[2026-05-25 15:47:54] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:47:54] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:47:54] [INFO ] Time to serialize gal into /tmp/CTLFireability159866956206363173.gal : 0 ms
[2026-05-25 15:47:54] [INFO ] Time to serialize properties into /tmp/CTLFireability11376457609056707162.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability159866956206363173.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11376457609056707162.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4,0.00387,3732,2,6,5,21,6,0,16,15,0

Converting to forward existential form...Done !
original formula: AF((decision_s00000773_activated==1))
=> equivalent forward existential formula: [FwdG(Init,!((decision_s00000773_activated==1)))] = FALSE
Hit Full ! (commute/partial/dont) 2/0/2
(forward)formula 0,0,0.005146,4004,1,0,10,52,19,3,75,55,10
FORMULA IBM703-PT-none-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2026-05-25 15:47:54] [INFO ] Flatten gal took : 9 ms
[2026-05-25 15:47:54] [INFO ] Flatten gal took : 10 ms
Total runtime 444714 ms.

BK_STOP 1779724074672

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="IBM703-PT-none"
export BK_EXAMINATION="CTLFireability"
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 IBM703-PT-none, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r162-smll-177961107700090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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