Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 5.2K Mar 8 06:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 8 06:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 8 06:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 8 06:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 16 08:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 16 08:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 16 08:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 16 08:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Mar 8 06:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 8 06:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 8 06:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Mar 8 06:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 608K 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 NoC3x3-PT-4B-CTLFireability-2024-00
FORMULA_NAME NoC3x3-PT-4B-CTLFireability-2024-01
FORMULA_NAME NoC3x3-PT-4B-CTLFireability-2024-02
FORMULA_NAME NoC3x3-PT-4B-CTLFireability-2024-03
FORMULA_NAME NoC3x3-PT-4B-CTLFireability-2024-04
FORMULA_NAME NoC3x3-PT-4B-CTLFireability-2024-05
FORMULA_NAME NoC3x3-PT-4B-CTLFireability-2024-06
FORMULA_NAME NoC3x3-PT-4B-CTLFireability-2024-07
FORMULA_NAME NoC3x3-PT-4B-CTLFireability-2024-08
FORMULA_NAME NoC3x3-PT-4B-CTLFireability-2024-09
FORMULA_NAME NoC3x3-PT-4B-CTLFireability-2024-10
FORMULA_NAME NoC3x3-PT-4B-CTLFireability-2024-11
FORMULA_NAME NoC3x3-PT-4B-CTLFireability-2024-12
FORMULA_NAME NoC3x3-PT-4B-CTLFireability-2024-13
FORMULA_NAME NoC3x3-PT-4B-CTLFireability-2024-14
FORMULA_NAME NoC3x3-PT-4B-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779750548116

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-4B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 23:09:09] [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 23:09:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 23:09:09] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2026-05-25 23:09:09] [INFO ] Transformed 2328 places.
[2026-05-25 23:09:09] [INFO ] Transformed 2701 transitions.
[2026-05-25 23:09:09] [INFO ] Found NUPN structural information;
[2026-05-25 23:09:09] [INFO ] Parsed PT model containing 2328 places and 2701 transitions and 6091 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 118 out of 2328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2328/2328 places, 2701/2701 transitions.
Discarding 577 places :
Symmetric choice reduction at 0 with 577 rule applications. Total rules 577 place count 1751 transition count 2124
Iterating global reduction 0 with 577 rules applied. Total rules applied 1154 place count 1751 transition count 2124
Discarding 275 places :
Symmetric choice reduction at 0 with 275 rule applications. Total rules 1429 place count 1476 transition count 1849
Iterating global reduction 0 with 275 rules applied. Total rules applied 1704 place count 1476 transition count 1849
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 1803 place count 1476 transition count 1750
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 1827 place count 1452 transition count 1726
Iterating global reduction 1 with 24 rules applied. Total rules applied 1851 place count 1452 transition count 1726
Applied a total of 1851 rules in 575 ms. Remains 1452 /2328 variables (removed 876) and now considering 1726/2701 (removed 975) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-357717752329289610.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6969102978520273056.kers'
[2026-05-25 23:09:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-357717752329289610.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6969102978520273056.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1726 rows 1452 cols 4087 entries
Finished phase 1 with 1386 SingleSign rule and 0 generalized
[2026-05-25 23:09:10] [INFO ] Computed 66 invariants in 7 ms
Computed 66 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-6969102978520273056.kers
Total runtime 10 ms.
[2026-05-25 23:09:11] [INFO ] Implicit Places using invariants in 735 ms returned []
[2026-05-25 23:09:11] [INFO ] Invariant cache hit.
[2026-05-25 23:09:12] [INFO ] Implicit Places using invariants and state equation in 1017 ms returned []
Implicit Place search using SMT with State Equation took 1784 ms to find 0 implicit places.
Running 1725 sub problems to find dead transitions.
[2026-05-25 23:09:12] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1451/3178 variables, and 0 constraints, problems are : Problem set: 0 solved, 1725 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1452 constraints, PredecessorRefiner: 1725/1725 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1725 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1451/3178 variables, and 0 constraints, problems are : Problem set: 0 solved, 1725 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1452 constraints, PredecessorRefiner: 0/1725 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60526ms problems are : Problem set: 0 solved, 1725 unsolved
Search for dead transitions found 0 dead transitions in 60546ms
Starting structural reductions in LTL mode, iteration 1 : 1452/2328 places, 1726/2701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62946 ms. Remains : 1452/2328 places, 1726/2701 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1452/1452 places, 1726/1726 transitions.
Applied a total of 0 rules in 51 ms. Remains 1452 /1452 variables (removed 0) and now considering 1726/1726 (removed 0) transitions.
[2026-05-25 23:10:12] [INFO ] Invariant cache hit.
[2026-05-25 23:10:13] [INFO ] Implicit Places using invariants in 412 ms returned []
[2026-05-25 23:10:13] [INFO ] Invariant cache hit.
[2026-05-25 23:10:14] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1384 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1436 ms. Remains : 1452/1452 places, 1726/1726 transitions.
Support contains 118 out of 1452 places after structural reductions.
[2026-05-25 23:10:14] [INFO ] Flatten gal took : 112 ms
[2026-05-25 23:10:14] [INFO ] Flatten gal took : 63 ms
[2026-05-25 23:10:14] [INFO ] Input system was already deterministic with 1726 transitions.
Support contains 114 out of 1452 places (down from 118) after GAL structural reductions.
RANDOM walk for 40000 steps (26 resets) in 1442 ms. (27 steps per ms) remains 17/77 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
[2026-05-25 23:10:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 1 (OVERLAPS) 1226/1267 variables, 54/54 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1267 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 185/1452 variables, 12/66 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/66 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1726/3178 variables, 1452/1518 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3178 variables, 0/1518 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/3178 variables, 0/1518 constraints. Problems are: Problem set: 2 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3178/3178 variables, and 1518 constraints, problems are : Problem set: 2 solved, 15 unsolved in 2533 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1452/1452 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 959/991 variables, 40/40 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/991 variables, 1/41 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/991 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 461/1452 variables, 26/67 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1452 variables, 3/70 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1452 variables, 0/70 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1726/3178 variables, 1452/1522 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3178 variables, 15/1537 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3178 variables, 1/1538 constraints. Problems are: Problem set: 2 solved, 15 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3178/3178 variables, and 1538 constraints, problems are : Problem set: 2 solved, 15 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1452/1452 constraints, PredecessorRefiner: 15/17 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7566ms problems are : Problem set: 2 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 1452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1452/1452 places, 1726/1726 transitions.
Graph (trivial) has 1319 edges and 1452 vertex of which 829 / 1452 are part of one of the 32 SCC in 12 ms
Free SCC test removed 797 places
Drop transitions (Empty/Sink Transition effects.) removed 958 transitions
Reduce isomorphic transitions removed 958 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 655 transition count 731
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 43 rules applied. Total rules applied 81 place count 618 transition count 725
Reduce places removed 4 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 10 rules applied. Total rules applied 91 place count 614 transition count 719
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 97 place count 608 transition count 719
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 97 place count 608 transition count 679
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 177 place count 568 transition count 679
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 201 place count 544 transition count 628
Iterating global reduction 4 with 24 rules applied. Total rules applied 225 place count 544 transition count 628
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 225 place count 544 transition count 627
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 543 transition count 627
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 230 place count 540 transition count 622
Iterating global reduction 4 with 3 rules applied. Total rules applied 233 place count 540 transition count 622
Performed 115 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 115 places in 1 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 4 with 230 rules applied. Total rules applied 463 place count 425 transition count 506
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 467 place count 425 transition count 502
Performed 9 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 485 place count 416 transition count 588
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 494 place count 416 transition count 579
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 509 place count 416 transition count 564
Free-agglomeration rule applied 173 times.
Iterating global reduction 6 with 173 rules applied. Total rules applied 682 place count 416 transition count 391
Reduce places removed 173 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Graph (complete) has 743 edges and 243 vertex of which 202 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Discarding 41 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Iterating post reduction 6 with 203 rules applied. Total rules applied 885 place count 202 transition count 355
Drop transitions (Empty/Sink Transition effects.) removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 7 with 47 rules applied. Total rules applied 932 place count 202 transition count 308
Applied a total of 932 rules in 296 ms. Remains 202 /1452 variables (removed 1250) and now considering 308/1726 (removed 1418) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 202/1452 places, 308/1726 transitions.
RANDOM walk for 40000 steps (8 resets) in 834 ms. (47 steps per ms) remains 4/15 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 2/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10718228934684998431.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14107998196902613179.kers'
[2026-05-25 23:10:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10718228934684998431.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14107998196902613179.kers]
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 308 rows 183 cols 905 entries
Finished phase 1 with 147 SingleSign rule and 0 generalized
[2026-05-25 23:10:23] [INFO ] Computed 55 invariants in 1 ms
Computed 55 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14107998196902613179.kers
Total runtime 1 ms.
[2026-05-25 23:10:23] [INFO ] State equation strengthened by 128 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 154/195 variables, 43/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/202 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 308/510 variables, 202/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 128/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/510 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 385 constraints, problems are : Problem set: 0 solved, 2 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 202/202 constraints, ReadFeed: 128/128 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 154/195 variables, 43/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/202 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 308/510 variables, 202/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 128/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/510 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 510/510 variables, and 387 constraints, problems are : Problem set: 0 solved, 2 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 202/202 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 385ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 229 steps, including 12 resets, run visited all 2 properties in 4 ms. (steps per millisecond=57 )
Parikh walk visited 2 properties in 9 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
FORMULA NoC3x3-PT-4B-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 23:10:23] [INFO ] Flatten gal took : 46 ms
[2026-05-25 23:10:23] [INFO ] Flatten gal took : 43 ms
[2026-05-25 23:10:23] [INFO ] Input system was already deterministic with 1726 transitions.
Computed a total of 72 stabilizing places and 72 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1452/1452 places, 1726/1726 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 1400 transition count 1674
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 1400 transition count 1674
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 107 place count 1400 transition count 1671
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 135 place count 1372 transition count 1643
Iterating global reduction 1 with 28 rules applied. Total rules applied 163 place count 1372 transition count 1643
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 173 place count 1372 transition count 1633
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 177 place count 1368 transition count 1629
Iterating global reduction 2 with 4 rules applied. Total rules applied 181 place count 1368 transition count 1629
Applied a total of 181 rules in 226 ms. Remains 1368 /1452 variables (removed 84) and now considering 1629/1726 (removed 97) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7681264003335159055.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12111407555954558848.kers'
[2026-05-25 23:10:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7681264003335159055.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12111407555954558848.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1629 rows 1368 cols 3887 entries
Finished phase 1 with 1302 SingleSign rule and 0 generalized
[2026-05-25 23:10:24] [INFO ] Computed 66 invariants in 10 ms
Computed 66 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-12111407555954558848.kers
Total runtime 12 ms.
[2026-05-25 23:10:24] [INFO ] Implicit Places using invariants in 434 ms returned []
[2026-05-25 23:10:24] [INFO ] Invariant cache hit.
[2026-05-25 23:10:25] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1392 ms to find 0 implicit places.
Running 1628 sub problems to find dead transitions.
[2026-05-25 23:10:25] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1367/2997 variables, and 0 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1368 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1628 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1367/2997 variables, and 0 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1368 constraints, PredecessorRefiner: 0/1628 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60311ms problems are : Problem set: 0 solved, 1628 unsolved
Search for dead transitions found 0 dead transitions in 60315ms
Starting structural reductions in LTL mode, iteration 1 : 1368/1452 places, 1629/1726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61939 ms. Remains : 1368/1452 places, 1629/1726 transitions.
[2026-05-25 23:11:25] [INFO ] Flatten gal took : 30 ms
[2026-05-25 23:11:25] [INFO ] Flatten gal took : 27 ms
[2026-05-25 23:11:26] [INFO ] Input system was already deterministic with 1629 transitions.
[2026-05-25 23:11:26] [INFO ] Flatten gal took : 26 ms
[2026-05-25 23:11:26] [INFO ] Flatten gal took : 26 ms
[2026-05-25 23:11:26] [INFO ] Time to serialize gal into /tmp/CTLFireability10582349092332574916.gal : 34 ms
[2026-05-25 23:11:26] [INFO ] Time to serialize properties into /tmp/CTLFireability1419911371614727477.ctl : 3 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/CTLFireability10582349092332574916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1419911371614727477.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,6.15146e+74,12.8538,379004,2,52147,5,1.2748e+06,6,0,7103,1.67334e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 23:11:56] [INFO ] Flatten gal took : 25 ms
[2026-05-25 23:11:56] [INFO ] Applying decomposition
[2026-05-25 23:11:56] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12502485434530152089.txt' '-o' '/tmp/graph12502485434530152089.bin' '-w' '/tmp/graph12502485434530152089.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12502485434530152089.bin' '-l' '-1' '-v' '-w' '/tmp/graph12502485434530152089.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:11:56] [INFO ] Decomposing Gal with order
[2026-05-25 23:11:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:11:56] [INFO ] Removed a total of 464 redundant transitions.
[2026-05-25 23:11:57] [INFO ] Flatten gal took : 259 ms
[2026-05-25 23:11:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 58 ms.
[2026-05-25 23:11:57] [INFO ] Time to serialize gal into /tmp/CTLFireability1251457762685128330.gal : 38 ms
[2026-05-25 23:11:57] [INFO ] Time to serialize properties into /tmp/CTLFireability7429513599251967034.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/CTLFireability1251457762685128330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7429513599251967034.ctl'

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 -...262
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.15146e+74,2.80433,111320,2675,21,257452,912,2707,379443,74,2644,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1452/1452 places, 1726/1726 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 1402 transition count 1676
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 1402 transition count 1676
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 104 place count 1402 transition count 1672
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 131 place count 1375 transition count 1645
Iterating global reduction 1 with 27 rules applied. Total rules applied 158 place count 1375 transition count 1645
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 168 place count 1375 transition count 1635
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 1370 transition count 1630
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 1370 transition count 1630
Applied a total of 178 rules in 207 ms. Remains 1370 /1452 variables (removed 82) and now considering 1630/1726 (removed 96) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14785915381190129258.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12443010037837759090.kers'
[2026-05-25 23:12:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14785915381190129258.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12443010037837759090.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1630 rows 1370 cols 3891 entries
Finished phase 1 with 1304 SingleSign rule and 0 generalized
[2026-05-25 23:12:27] [INFO ] Computed 66 invariants in 14 ms
Computed 66 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-12443010037837759090.kers
Total runtime 15 ms.
[2026-05-25 23:12:28] [INFO ] Implicit Places using invariants in 541 ms returned []
[2026-05-25 23:12:28] [INFO ] Invariant cache hit.
[2026-05-25 23:12:28] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1464 ms to find 0 implicit places.
Running 1629 sub problems to find dead transitions.
[2026-05-25 23:12:28] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1369/3000 variables, and 0 constraints, problems are : Problem set: 0 solved, 1629 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1370 constraints, PredecessorRefiner: 1629/1629 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1629 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1369/3000 variables, and 0 constraints, problems are : Problem set: 0 solved, 1629 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1370 constraints, PredecessorRefiner: 0/1629 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60312ms problems are : Problem set: 0 solved, 1629 unsolved
Search for dead transitions found 0 dead transitions in 60315ms
Starting structural reductions in LTL mode, iteration 1 : 1370/1452 places, 1630/1726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61990 ms. Remains : 1370/1452 places, 1630/1726 transitions.
[2026-05-25 23:13:29] [INFO ] Flatten gal took : 23 ms
[2026-05-25 23:13:29] [INFO ] Flatten gal took : 28 ms
[2026-05-25 23:13:29] [INFO ] Input system was already deterministic with 1630 transitions.
[2026-05-25 23:13:29] [INFO ] Flatten gal took : 24 ms
[2026-05-25 23:13:29] [INFO ] Flatten gal took : 24 ms
[2026-05-25 23:13:29] [INFO ] Time to serialize gal into /tmp/CTLFireability13347881495740939713.gal : 5 ms
[2026-05-25 23:13:29] [INFO ] Time to serialize properties into /tmp/CTLFireability4129307066682312080.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/CTLFireability13347881495740939713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4129307066682312080.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,1.16786e+75,13.0073,384896,2,52695,5,1.30353e+06,6,0,7112,1.70038e+06,0


Converting to forward existential form...Done !
original formula: AG(((((p794==0)||(p538==0))||((p97==0)||(p1736==0))) + (AF((p212==1)) * AX((p643==0)))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !((((p794==0)||(p538==0))||((p97==0)||(p1736==0))))),!((p212==1)))] = FALSE * [(EY((Fw...250
(forward)formula 0,0,13.8285,384896,1,0,12,1.30353e+06,11,4,11217,1.70038e+06,3
FORMULA NoC3x3-PT-4B-CTLFireability-2024-01 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 : 1452/1452 places, 1726/1726 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 1405 transition count 1679
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 1405 transition count 1679
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 98 place count 1405 transition count 1675
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 121 place count 1382 transition count 1652
Iterating global reduction 1 with 23 rules applied. Total rules applied 144 place count 1382 transition count 1652
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 152 place count 1382 transition count 1644
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 155 place count 1379 transition count 1641
Iterating global reduction 2 with 3 rules applied. Total rules applied 158 place count 1379 transition count 1641
Applied a total of 158 rules in 201 ms. Remains 1379 /1452 variables (removed 73) and now considering 1641/1726 (removed 85) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14326040566507959909.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10924232765933944866.kers'
[2026-05-25 23:13:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14326040566507959909.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10924232765933944866.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1641 rows 1379 cols 3911 entries
Finished phase 1 with 1313 SingleSign rule and 0 generalized
[2026-05-25 23:13:43] [INFO ] Computed 66 invariants in 7 ms
Computed 66 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-10924232765933944866.kers
Total runtime 11 ms.
[2026-05-25 23:13:43] [INFO ] Implicit Places using invariants in 414 ms returned []
[2026-05-25 23:13:43] [INFO ] Invariant cache hit.
[2026-05-25 23:13:44] [INFO ] Implicit Places using invariants and state equation in 962 ms returned []
Implicit Place search using SMT with State Equation took 1378 ms to find 0 implicit places.
Running 1640 sub problems to find dead transitions.
[2026-05-25 23:13:44] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1378/3020 variables, and 0 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 1640/1640 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1640 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1378/3020 variables, and 0 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 0/1640 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60309ms problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 60313ms
Starting structural reductions in LTL mode, iteration 1 : 1379/1452 places, 1641/1726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61897 ms. Remains : 1379/1452 places, 1641/1726 transitions.
[2026-05-25 23:14:45] [INFO ] Flatten gal took : 22 ms
[2026-05-25 23:14:45] [INFO ] Flatten gal took : 21 ms
[2026-05-25 23:14:45] [INFO ] Input system was already deterministic with 1641 transitions.
[2026-05-25 23:14:45] [INFO ] Flatten gal took : 21 ms
[2026-05-25 23:14:45] [INFO ] Flatten gal took : 20 ms
[2026-05-25 23:14:45] [INFO ] Time to serialize gal into /tmp/CTLFireability5728964371555520734.gal : 7 ms
[2026-05-25 23:14:45] [INFO ] Time to serialize properties into /tmp/CTLFireability15716084677616348873.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/CTLFireability5728964371555520734.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15716084677616348873.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,8.18364e+74,14.983,416136,2,53882,5,1.4184e+06,6,0,7159,1.84404e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 23:15:15] [INFO ] Flatten gal took : 19 ms
[2026-05-25 23:15:15] [INFO ] Applying decomposition
[2026-05-25 23:15:15] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16351600502443829164.txt' '-o' '/tmp/graph16351600502443829164.bin' '-w' '/tmp/graph16351600502443829164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16351600502443829164.bin' '-l' '-1' '-v' '-w' '/tmp/graph16351600502443829164.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:15:15] [INFO ] Decomposing Gal with order
[2026-05-25 23:15:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:15:15] [INFO ] Removed a total of 483 redundant transitions.
[2026-05-25 23:15:15] [INFO ] Flatten gal took : 54 ms
[2026-05-25 23:15:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 23 ms.
[2026-05-25 23:15:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1710887728653684333.gal : 14 ms
[2026-05-25 23:15:15] [INFO ] Time to serialize properties into /tmp/CTLFireability13532891080271540910.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/CTLFireability1710887728653684333.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13532891080271540910.ctl'

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 -...263
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,8.18364e+74,1.49916,60104,2515,27,127754,729,2649,178907,68,2022,0


Converting to forward existential form...Done !
original formula: (AX(((EF((i3.u66.p247==1)) * ((i24.u415.p1842==0)||(((i17.u244.p1077==1)&&(i0.i1.i1.u258.p1127==1))&&(i28.i0.i2.u432.p1940==0)))) * AF(AG...264
=> equivalent forward existential formula: [(FwdU((Init * !(!(EX(!(((E(TRUE U (i3.u66.p247==1)) * ((i24.u415.p1842==0)||(((i17.u244.p1077==1)&&(i0.i1.i1.u2...339
Reverse transition relation is NOT exact ! Due to transitions t221, t343, t652, t972, t1246, t1381, t1594, i0.t689, i2.t1211, i4.t1087, i4.i0.t1122, i4.i0....505
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1452/1452 places, 1726/1726 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 1407 transition count 1681
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 1407 transition count 1681
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 93 place count 1407 transition count 1678
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 116 place count 1384 transition count 1655
Iterating global reduction 1 with 23 rules applied. Total rules applied 139 place count 1384 transition count 1655
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 148 place count 1384 transition count 1646
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 153 place count 1379 transition count 1641
Iterating global reduction 2 with 5 rules applied. Total rules applied 158 place count 1379 transition count 1641
Applied a total of 158 rules in 207 ms. Remains 1379 /1452 variables (removed 73) and now considering 1641/1726 (removed 85) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8882824519188751627.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16914829433360936621.kers'
[2026-05-25 23:15:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8882824519188751627.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16914829433360936621.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1641 rows 1379 cols 3913 entries
Finished phase 1 with 1313 SingleSign rule and 0 generalized
[2026-05-25 23:15:46] [INFO ] Computed 66 invariants in 13 ms
Computed 66 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-16914829433360936621.kers
Total runtime 16 ms.
[2026-05-25 23:15:46] [INFO ] Implicit Places using invariants in 440 ms returned []
[2026-05-25 23:15:46] [INFO ] Invariant cache hit.
[2026-05-25 23:15:47] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 1458 ms to find 0 implicit places.
Running 1640 sub problems to find dead transitions.
[2026-05-25 23:15:47] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1378/3020 variables, and 0 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 1640/1640 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1640 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1378/3020 variables, and 0 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 0/1640 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60330ms problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 60333ms
Starting structural reductions in LTL mode, iteration 1 : 1379/1452 places, 1641/1726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62003 ms. Remains : 1379/1452 places, 1641/1726 transitions.
[2026-05-25 23:16:47] [INFO ] Flatten gal took : 17 ms
[2026-05-25 23:16:47] [INFO ] Flatten gal took : 18 ms
[2026-05-25 23:16:47] [INFO ] Input system was already deterministic with 1641 transitions.
[2026-05-25 23:16:48] [INFO ] Flatten gal took : 30 ms
[2026-05-25 23:16:48] [INFO ] Flatten gal took : 17 ms
[2026-05-25 23:16:48] [INFO ] Time to serialize gal into /tmp/CTLFireability16874438358189744736.gal : 5 ms
[2026-05-25 23:16:48] [INFO ] Time to serialize properties into /tmp/CTLFireability717869377660422971.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/CTLFireability16874438358189744736.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability717869377660422971.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,1.04385e+75,14.7482,397384,2,53544,5,1.34561e+06,6,0,7159,1.76184e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 23:17:18] [INFO ] Flatten gal took : 17 ms
[2026-05-25 23:17:18] [INFO ] Applying decomposition
[2026-05-25 23:17:18] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4903396358608849025.txt' '-o' '/tmp/graph4903396358608849025.bin' '-w' '/tmp/graph4903396358608849025.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4903396358608849025.bin' '-l' '-1' '-v' '-w' '/tmp/graph4903396358608849025.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:17:18] [INFO ] Decomposing Gal with order
[2026-05-25 23:17:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:17:18] [INFO ] Removed a total of 486 redundant transitions.
[2026-05-25 23:17:18] [INFO ] Flatten gal took : 43 ms
[2026-05-25 23:17:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 15 ms.
[2026-05-25 23:17:18] [INFO ] Time to serialize gal into /tmp/CTLFireability9539999011934125752.gal : 32 ms
[2026-05-25 23:17:18] [INFO ] Time to serialize properties into /tmp/CTLFireability1708294521243454645.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/CTLFireability9539999011934125752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1708294521243454645.ctl'

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 -...262
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,1.04385e+75,2.61239,103784,2851,21,230490,853,2709,365882,79,1969,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1452/1452 places, 1726/1726 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 1403 transition count 1677
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 1403 transition count 1677
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 102 place count 1403 transition count 1673
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 130 place count 1375 transition count 1645
Iterating global reduction 1 with 28 rules applied. Total rules applied 158 place count 1375 transition count 1645
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 167 place count 1375 transition count 1636
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 172 place count 1370 transition count 1631
Iterating global reduction 2 with 5 rules applied. Total rules applied 177 place count 1370 transition count 1631
Applied a total of 177 rules in 198 ms. Remains 1370 /1452 variables (removed 82) and now considering 1631/1726 (removed 95) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1816929165620858610.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7936519527367407535.kers'
[2026-05-25 23:17:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1816929165620858610.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7936519527367407535.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1631 rows 1370 cols 3891 entries
Finished phase 1 with 1304 SingleSign rule and 0 generalized
[2026-05-25 23:17:48] [INFO ] Computed 66 invariants in 6 ms
Computed 66 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-7936519527367407535.kers
Total runtime 10 ms.
[2026-05-25 23:17:49] [INFO ] Implicit Places using invariants in 410 ms returned []
[2026-05-25 23:17:49] [INFO ] Invariant cache hit.
[2026-05-25 23:17:50] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1447 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2026-05-25 23:17:50] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1369/3001 variables, and 0 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1370 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1369/3001 variables, and 0 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1370 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60317ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 60321ms
Starting structural reductions in LTL mode, iteration 1 : 1370/1452 places, 1631/1726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61971 ms. Remains : 1370/1452 places, 1631/1726 transitions.
[2026-05-25 23:18:50] [INFO ] Flatten gal took : 17 ms
[2026-05-25 23:18:50] [INFO ] Flatten gal took : 17 ms
[2026-05-25 23:18:50] [INFO ] Input system was already deterministic with 1631 transitions.
[2026-05-25 23:18:50] [INFO ] Flatten gal took : 18 ms
[2026-05-25 23:18:50] [INFO ] Flatten gal took : 17 ms
[2026-05-25 23:18:50] [INFO ] Time to serialize gal into /tmp/CTLFireability17344951373603306232.gal : 5 ms
[2026-05-25 23:18:50] [INFO ] Time to serialize properties into /tmp/CTLFireability6241304365231005667.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/CTLFireability17344951373603306232.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6241304365231005667.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,6.36537e+74,14.0538,380344,2,52347,5,1.27802e+06,6,0,7113,1.6796e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 23:19:20] [INFO ] Flatten gal took : 17 ms
[2026-05-25 23:19:20] [INFO ] Applying decomposition
[2026-05-25 23:19:20] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16579995778765682099.txt' '-o' '/tmp/graph16579995778765682099.bin' '-w' '/tmp/graph16579995778765682099.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16579995778765682099.bin' '-l' '-1' '-v' '-w' '/tmp/graph16579995778765682099.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:19:20] [INFO ] Decomposing Gal with order
[2026-05-25 23:19:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:19:20] [INFO ] Removed a total of 484 redundant transitions.
[2026-05-25 23:19:20] [INFO ] Flatten gal took : 42 ms
[2026-05-25 23:19:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 14 ms.
[2026-05-25 23:19:20] [INFO ] Time to serialize gal into /tmp/CTLFireability987559926400965205.gal : 12 ms
[2026-05-25 23:19:20] [INFO ] Time to serialize properties into /tmp/CTLFireability6799400314074506448.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/CTLFireability987559926400965205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6799400314074506448.ctl'

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 -...261
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.36537e+74,2.16872,89616,2399,20,201723,685,2657,304078,72,1751,0


Converting to forward existential form...Done !
original formula: (EG(AG((((i28.u496.p2251==0)||(i4.u120.p501==0)) * EX(((i21.u373.p1674==0)||(i21.u381.p1708==0)))))) + (A((AF((((i15.i1.i0.u293.p1292==1)...300
=> equivalent forward existential formula: ((([FwdG((FwdU((Init * !(EG(!(E(TRUE U !((((i28.u496.p2251==0)||(i4.u120.p501==0)) * EX(((i21.u373.p1674==0)||(i...905
Reverse transition relation is NOT exact ! Due to transitions t649, t812, t968, t1084, t1119, i1.t1240, i1.i1.t1205, i4.u79.t1159, i7.u135.t1006, i8.i0.t84...496
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1452/1452 places, 1726/1726 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 1404 transition count 1678
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 1404 transition count 1678
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 100 place count 1404 transition count 1674
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 128 place count 1376 transition count 1646
Iterating global reduction 1 with 28 rules applied. Total rules applied 156 place count 1376 transition count 1646
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 165 place count 1376 transition count 1637
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 170 place count 1371 transition count 1632
Iterating global reduction 2 with 5 rules applied. Total rules applied 175 place count 1371 transition count 1632
Applied a total of 175 rules in 217 ms. Remains 1371 /1452 variables (removed 81) and now considering 1632/1726 (removed 94) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17064614563716382700.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9828818185692364506.kers'
[2026-05-25 23:19:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17064614563716382700.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9828818185692364506.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1632 rows 1371 cols 3893 entries
Finished phase 1 with 1305 SingleSign rule and 0 generalized
[2026-05-25 23:19:51] [INFO ] Computed 66 invariants in 8 ms
Computed 66 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9828818185692364506.kers
Total runtime 11 ms.
[2026-05-25 23:19:51] [INFO ] Implicit Places using invariants in 439 ms returned []
[2026-05-25 23:19:51] [INFO ] Invariant cache hit.
[2026-05-25 23:19:52] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1429 ms to find 0 implicit places.
Running 1631 sub problems to find dead transitions.
[2026-05-25 23:19:52] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1370/3003 variables, and 0 constraints, problems are : Problem set: 0 solved, 1631 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1371 constraints, PredecessorRefiner: 1631/1631 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1631 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1370/3003 variables, and 0 constraints, problems are : Problem set: 0 solved, 1631 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1371 constraints, PredecessorRefiner: 0/1631 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60351ms problems are : Problem set: 0 solved, 1631 unsolved
Search for dead transitions found 0 dead transitions in 60354ms
Starting structural reductions in LTL mode, iteration 1 : 1371/1452 places, 1632/1726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62006 ms. Remains : 1371/1452 places, 1632/1726 transitions.
[2026-05-25 23:20:52] [INFO ] Flatten gal took : 18 ms
[2026-05-25 23:20:53] [INFO ] Flatten gal took : 17 ms
[2026-05-25 23:20:53] [INFO ] Input system was already deterministic with 1632 transitions.
[2026-05-25 23:20:53] [INFO ] Flatten gal took : 17 ms
[2026-05-25 23:20:53] [INFO ] Flatten gal took : 17 ms
[2026-05-25 23:20:53] [INFO ] Time to serialize gal into /tmp/CTLFireability16727988420517369730.gal : 5 ms
[2026-05-25 23:20:53] [INFO ] Time to serialize properties into /tmp/CTLFireability11402085815865729442.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/CTLFireability16727988420517369730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11402085815865729442.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,6.94897e+74,14.2579,386480,2,52465,5,1.30756e+06,6,0,7118,1.71649e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 23:21:23] [INFO ] Flatten gal took : 26 ms
[2026-05-25 23:21:23] [INFO ] Applying decomposition
[2026-05-25 23:21:23] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8489579574467528470.txt' '-o' '/tmp/graph8489579574467528470.bin' '-w' '/tmp/graph8489579574467528470.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8489579574467528470.bin' '-l' '-1' '-v' '-w' '/tmp/graph8489579574467528470.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:21:23] [INFO ] Decomposing Gal with order
[2026-05-25 23:21:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:21:23] [INFO ] Removed a total of 451 redundant transitions.
[2026-05-25 23:21:23] [INFO ] Flatten gal took : 48 ms
[2026-05-25 23:21:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 13 ms.
[2026-05-25 23:21:23] [INFO ] Time to serialize gal into /tmp/CTLFireability16987255562777201571.gal : 12 ms
[2026-05-25 23:21:23] [INFO ] Time to serialize properties into /tmp/CTLFireability2511518288004427376.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/CTLFireability16987255562777201571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2511518288004427376.ctl'

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 -...263
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.94897e+74,5.9779,201216,3131,25,422969,1499,2561,948185,84,4535,0


Converting to forward existential form...Done !
original formula: EG(!(A(EG((((i29.i0.i3.u470.p2192==1)||((i29.i0.i5.u466.p2134==1)&&(i29.i1.i3.u493.p2233==1)))&&(i13.u236.p1042!=1))) U ((A(E((i17.u326.p...295
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!(((!((E(!((i18.i1.i1.u332.p1489==1)) U (!(E((i17.u326.p1462==1) U (i0.i1.i2.u57.p195==1))) * ...930
Reverse transition relation is NOT exact ! Due to transitions t219, t490, t648, t685, t812, t849, t968, t1118, t1207, t1335, i0.i0.i1.t1242, i3.t1083, i3.u...528
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1452/1452 places, 1726/1726 transitions.
Graph (trivial) has 1370 edges and 1452 vertex of which 921 / 1452 are part of one of the 33 SCC in 2 ms
Free SCC test removed 888 places
Ensure Unique test removed 1041 transitions
Reduce isomorphic transitions removed 1041 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 563 transition count 681
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 560 transition count 681
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 7 place count 560 transition count 646
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 77 place count 525 transition count 646
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 106 place count 496 transition count 588
Iterating global reduction 2 with 29 rules applied. Total rules applied 135 place count 496 transition count 588
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 135 place count 496 transition count 587
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 495 transition count 587
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 143 place count 489 transition count 578
Iterating global reduction 2 with 6 rules applied. Total rules applied 149 place count 489 transition count 578
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 359 place count 384 transition count 473
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 360 place count 383 transition count 472
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 265 edges and 374 vertex of which 48 / 374 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 2 with 10 rules applied. Total rules applied 370 place count 350 transition count 472
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 418 place count 350 transition count 424
Applied a total of 418 rules in 98 ms. Remains 350 /1452 variables (removed 1102) and now considering 424/1726 (removed 1302) transitions.
[2026-05-25 23:21:53] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3852277639835772443.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8556376723311557962.kers'
[2026-05-25 23:21:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3852277639835772443.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8556376723311557962.kers]
Normalized transition count is 391 out of 392 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 391 rows 350 cols 1156 entries
Finished phase 1 with 293 SingleSign rule and 0 generalized
[2026-05-25 23:21:53] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8556376723311557962.kers
Total runtime 2 ms.
[2026-05-25 23:21:53] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-25 23:21:53] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2026-05-25 23:21:53] [INFO ] Invariant cache hit.
[2026-05-25 23:21:53] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-25 23:21:53] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2026-05-25 23:21:53] [INFO ] Redundant transitions in 24 ms returned []
Running 205 sub problems to find dead transitions.
[2026-05-25 23:21:54] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2026-05-25 23:21:54] [INFO ] Invariant cache hit.
[2026-05-25 23:21:54] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 33/350 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 391/741 variables, 350/407 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/741 variables, 14/421 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 0/741 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 741/742 variables, and 421 constraints, problems are : Problem set: 0 solved, 205 unsolved in 16595 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 350/350 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 33/350 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 391/741 variables, 350/407 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/741 variables, 14/421 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 205/626 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/741 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 0/741 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 741/742 variables, and 626 constraints, problems are : Problem set: 0 solved, 205 unsolved in 16751 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 350/350 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33373ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 33374ms
Starting structural reductions in SI_CTL mode, iteration 1 : 350/1452 places, 424/1726 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33890 ms. Remains : 350/1452 places, 424/1726 transitions.
[2026-05-25 23:22:27] [INFO ] Flatten gal took : 9 ms
[2026-05-25 23:22:27] [INFO ] Flatten gal took : 6 ms
[2026-05-25 23:22:27] [INFO ] Input system was already deterministic with 424 transitions.
[2026-05-25 23:22:27] [INFO ] Flatten gal took : 6 ms
[2026-05-25 23:22:27] [INFO ] Flatten gal took : 7 ms
[2026-05-25 23:22:27] [INFO ] Time to serialize gal into /tmp/CTLFireability15596972870438728095.gal : 2 ms
[2026-05-25 23:22:27] [INFO ] Time to serialize properties into /tmp/CTLFireability9053777693103472395.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/CTLFireability15596972870438728095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9053777693103472395.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,2.79598e+44,0.214408,11584,2,644,5,39434,6,0,1794,32615,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 23:22:57] [INFO ] Flatten gal took : 13 ms
[2026-05-25 23:22:57] [INFO ] Applying decomposition
[2026-05-25 23:22:57] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13877370749445959440.txt' '-o' '/tmp/graph13877370749445959440.bin' '-w' '/tmp/graph13877370749445959440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13877370749445959440.bin' '-l' '-1' '-v' '-w' '/tmp/graph13877370749445959440.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:22:57] [INFO ] Decomposing Gal with order
[2026-05-25 23:22:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:22:57] [INFO ] Removed a total of 42 redundant transitions.
[2026-05-25 23:22:57] [INFO ] Flatten gal took : 11 ms
[2026-05-25 23:22:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2026-05-25 23:22:57] [INFO ] Time to serialize gal into /tmp/CTLFireability3165766372373933594.gal : 2 ms
[2026-05-25 23:22:57] [INFO ] Time to serialize properties into /tmp/CTLFireability13250330976147692818.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/CTLFireability3165766372373933594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13250330976147692818.ctl'

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 -...263
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,2.79598e+44,0.111915,8108,321,617,4911,5848,716,5550,280,13601,0


Converting to forward existential form...Done !
original formula: E(((i7.u27.p1592==1)||((i1.u4.p273==1)&&(i1.u5.p339==1))) U AG((i3.u18.p1025!=1)))
=> equivalent forward existential formula: [(FwdU(Init,((i7.u27.p1592==1)||((i1.u4.p273==1)&&(i1.u5.p339==1)))) * !(E(TRUE U !((i3.u18.p1025!=1)))))] != FA...158
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1452/1452 places, 1726/1726 transitions.
Graph (trivial) has 1347 edges and 1452 vertex of which 852 / 1452 are part of one of the 33 SCC in 5 ms
Free SCC test removed 819 places
Ensure Unique test removed 957 transitions
Reduce isomorphic transitions removed 957 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 632 transition count 734
Reduce places removed 34 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 1 with 37 rules applied. Total rules applied 72 place count 598 transition count 731
Reduce places removed 2 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 8 rules applied. Total rules applied 80 place count 596 transition count 725
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 86 place count 590 transition count 725
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 86 place count 590 transition count 685
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 166 place count 550 transition count 685
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 198 place count 518 transition count 623
Iterating global reduction 4 with 32 rules applied. Total rules applied 230 place count 518 transition count 623
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 230 place count 518 transition count 622
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 517 transition count 622
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 238 place count 511 transition count 613
Iterating global reduction 4 with 6 rules applied. Total rules applied 244 place count 511 transition count 613
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 1 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 4 with 216 rules applied. Total rules applied 460 place count 403 transition count 505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 461 place count 403 transition count 504
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 470 place count 403 transition count 495
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 470 place count 403 transition count 491
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 478 place count 399 transition count 491
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 479 place count 398 transition count 490
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 265 edges and 389 vertex of which 36 / 389 are part of one of the 18 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 5 with 16 rules applied. Total rules applied 495 place count 371 transition count 484
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 543 place count 365 transition count 442
Applied a total of 543 rules in 112 ms. Remains 365 /1452 variables (removed 1087) and now considering 442/1726 (removed 1284) transitions.
[2026-05-25 23:23:27] [INFO ] Flow matrix only has 410 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6928782901149072628.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13286288864884704790.kers'
[2026-05-25 23:23:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6928782901149072628.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13286288864884704790.kers]
Normalized transition count is 409 out of 410 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 409 rows 365 cols 1190 entries
Finished phase 1 with 308 SingleSign rule and 0 generalized
[2026-05-25 23:23:27] [INFO ] Computed 57 invariants in 5 ms
Computed 57 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-13286288864884704790.kers
Total runtime 6 ms.
[2026-05-25 23:23:27] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-25 23:23:27] [INFO ] Flow matrix only has 410 transitions (discarded 32 similar events)
[2026-05-25 23:23:27] [INFO ] Invariant cache hit.
[2026-05-25 23:23:28] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-25 23:23:28] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2026-05-25 23:23:28] [INFO ] Redundant transitions in 8 ms returned []
Running 248 sub problems to find dead transitions.
[2026-05-25 23:23:28] [INFO ] Flow matrix only has 410 transitions (discarded 32 similar events)
[2026-05-25 23:23:28] [INFO ] Invariant cache hit.
[2026-05-25 23:23:28] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 33/365 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 409/774 variables, 365/422 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/774 variables, 14/436 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/774 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 0/774 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/775 variables, and 436 constraints, problems are : Problem set: 0 solved, 248 unsolved in 20920 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 365/365 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 33/365 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 409/774 variables, 365/422 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/774 variables, 14/436 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/774 variables, 248/684 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/774 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (OVERLAPS) 0/774 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 774/775 variables, and 684 constraints, problems are : Problem set: 0 solved, 248 unsolved in 20766 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 365/365 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41707ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 41707ms
Starting structural reductions in SI_CTL mode, iteration 1 : 365/1452 places, 442/1726 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42282 ms. Remains : 365/1452 places, 442/1726 transitions.
[2026-05-25 23:24:09] [INFO ] Flatten gal took : 10 ms
[2026-05-25 23:24:09] [INFO ] Flatten gal took : 6 ms
[2026-05-25 23:24:09] [INFO ] Input system was already deterministic with 442 transitions.
[2026-05-25 23:24:09] [INFO ] Flatten gal took : 6 ms
[2026-05-25 23:24:09] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:24:09] [INFO ] Time to serialize gal into /tmp/CTLFireability920426053612666454.gal : 2 ms
[2026-05-25 23:24:09] [INFO ] Time to serialize properties into /tmp/CTLFireability13666888240845883080.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/CTLFireability920426053612666454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13666888240845883080.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,1.83982e+45,0.227162,12688,2,674,5,42685,6,0,1872,41087,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 23:24:40] [INFO ] Flatten gal took : 12 ms
[2026-05-25 23:24:40] [INFO ] Applying decomposition
[2026-05-25 23:24:40] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12187461582037596018.txt' '-o' '/tmp/graph12187461582037596018.bin' '-w' '/tmp/graph12187461582037596018.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12187461582037596018.bin' '-l' '-1' '-v' '-w' '/tmp/graph12187461582037596018.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:24:40] [INFO ] Decomposing Gal with order
[2026-05-25 23:24:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:24:40] [INFO ] Removed a total of 50 redundant transitions.
[2026-05-25 23:24:40] [INFO ] Flatten gal took : 11 ms
[2026-05-25 23:24:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2026-05-25 23:24:40] [INFO ] Time to serialize gal into /tmp/CTLFireability15965540009491189139.gal : 5 ms
[2026-05-25 23:24:40] [INFO ] Time to serialize properties into /tmp/CTLFireability1316614000226159249.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/CTLFireability15965540009491189139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1316614000226159249.ctl'

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 -...263
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,1.83982e+45,0.165681,9524,254,639,6252,8344,795,7224,290,22306,0


Converting to forward existential form...Done !
original formula: A((i5.u27.p1265==1) U E(!(AF(!(((i2.i1.u13.p681==1)&&(i10.i1.u49.p2269==1))))) U E(((i1.u6.p362!=1)||(i9.i1.u42.p2063==1)) U AF(E(((i0.u0...208
=> equivalent forward existential formula: [((Init * !(EG(!(E(!(!(EG(!(!(((i2.i1.u13.p681==1)&&(i10.i1.u49.p2269==1))))))) U E(((i1.u6.p362!=1)||(i9.i1.u42...655
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1452/1452 places, 1726/1726 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 1398 transition count 1672
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 1398 transition count 1672
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 112 place count 1398 transition count 1668
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 141 place count 1369 transition count 1639
Iterating global reduction 1 with 29 rules applied. Total rules applied 170 place count 1369 transition count 1639
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 180 place count 1369 transition count 1629
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 185 place count 1364 transition count 1624
Iterating global reduction 2 with 5 rules applied. Total rules applied 190 place count 1364 transition count 1624
Applied a total of 190 rules in 206 ms. Remains 1364 /1452 variables (removed 88) and now considering 1624/1726 (removed 102) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13438647780194465808.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4110750121703506481.kers'
[2026-05-25 23:25:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13438647780194465808.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4110750121703506481.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1624 rows 1364 cols 3877 entries
Finished phase 1 with 1298 SingleSign rule and 0 generalized
[2026-05-25 23:25:10] [INFO ] Computed 66 invariants in 6 ms
Computed 66 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4110750121703506481.kers
Total runtime 9 ms.
[2026-05-25 23:25:10] [INFO ] Implicit Places using invariants in 390 ms returned []
[2026-05-25 23:25:10] [INFO ] Invariant cache hit.
[2026-05-25 23:25:11] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1318 ms to find 0 implicit places.
Running 1623 sub problems to find dead transitions.
[2026-05-25 23:25:11] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1363/2988 variables, and 0 constraints, problems are : Problem set: 0 solved, 1623 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1364 constraints, PredecessorRefiner: 1623/1623 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1623 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1363/2988 variables, and 0 constraints, problems are : Problem set: 0 solved, 1623 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1364 constraints, PredecessorRefiner: 0/1623 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60310ms problems are : Problem set: 0 solved, 1623 unsolved
Search for dead transitions found 0 dead transitions in 60312ms
Starting structural reductions in LTL mode, iteration 1 : 1364/1452 places, 1624/1726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61841 ms. Remains : 1364/1452 places, 1624/1726 transitions.
[2026-05-25 23:26:12] [INFO ] Flatten gal took : 18 ms
[2026-05-25 23:26:12] [INFO ] Flatten gal took : 19 ms
[2026-05-25 23:26:12] [INFO ] Input system was already deterministic with 1624 transitions.
[2026-05-25 23:26:12] [INFO ] Flatten gal took : 19 ms
[2026-05-25 23:26:12] [INFO ] Flatten gal took : 19 ms
[2026-05-25 23:26:12] [INFO ] Time to serialize gal into /tmp/CTLFireability8345150303396527429.gal : 5 ms
[2026-05-25 23:26:12] [INFO ] Time to serialize properties into /tmp/CTLFireability8074387542359322065.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/CTLFireability8345150303396527429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8074387542359322065.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.42278e+74,13.2752,378592,2,52080,5,1.27334e+06,6,0,7082,1.67176e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 23:26:42] [INFO ] Flatten gal took : 23 ms
[2026-05-25 23:26:42] [INFO ] Applying decomposition
[2026-05-25 23:26:42] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17867426116080606629.txt' '-o' '/tmp/graph17867426116080606629.bin' '-w' '/tmp/graph17867426116080606629.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17867426116080606629.bin' '-l' '-1' '-v' '-w' '/tmp/graph17867426116080606629.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:26:42] [INFO ] Decomposing Gal with order
[2026-05-25 23:26:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:26:42] [INFO ] Removed a total of 480 redundant transitions.
[2026-05-25 23:26:42] [INFO ] Flatten gal took : 43 ms
[2026-05-25 23:26:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 11 ms.
[2026-05-25 23:26:42] [INFO ] Time to serialize gal into /tmp/CTLFireability5328418744954176908.gal : 12 ms
[2026-05-25 23:26:42] [INFO ] Time to serialize properties into /tmp/CTLFireability6482170270024405074.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/CTLFireability5328418744954176908.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6482170270024405074.ctl'

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 -...262
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.42278e+74,1.82134,69468,2498,19,149772,677,2427,209737,73,1748,0


Converting to forward existential form...Done !
original formula: AG(AF((AX(EX((i26.i0.i4.u429.p1949==1))) + (i26.i0.i5.u431.p1955==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((!(EX(!(EX((i26.i0.i4.u429.p1949==1))))) + (i26.i0.i5.u431.p1955==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t336, t644, t681, t844, t1078, i0.u181.t882, i1.t1234, i1.i1.t1199, i3.t1113, i6.u80.t1153, i...469
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1452/1452 places, 1726/1726 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 1400 transition count 1674
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 1400 transition count 1674
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 108 place count 1400 transition count 1670
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 136 place count 1372 transition count 1642
Iterating global reduction 1 with 28 rules applied. Total rules applied 164 place count 1372 transition count 1642
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 174 place count 1372 transition count 1632
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 179 place count 1367 transition count 1627
Iterating global reduction 2 with 5 rules applied. Total rules applied 184 place count 1367 transition count 1627
Applied a total of 184 rules in 202 ms. Remains 1367 /1452 variables (removed 85) and now considering 1627/1726 (removed 99) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12193519951236545474.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15575248118520218735.kers'
[2026-05-25 23:27:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12193519951236545474.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15575248118520218735.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1627 rows 1367 cols 3885 entries
Finished phase 1 with 1301 SingleSign rule and 0 generalized
[2026-05-25 23:27:12] [INFO ] Computed 66 invariants in 6 ms
Computed 66 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-15575248118520218735.kers
Total runtime 8 ms.
[2026-05-25 23:27:13] [INFO ] Implicit Places using invariants in 410 ms returned []
[2026-05-25 23:27:13] [INFO ] Invariant cache hit.
[2026-05-25 23:27:14] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
Running 1626 sub problems to find dead transitions.
[2026-05-25 23:27:14] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1366/2994 variables, and 0 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1367 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1626 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1366/2994 variables, and 0 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1367 constraints, PredecessorRefiner: 0/1626 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60314ms problems are : Problem set: 0 solved, 1626 unsolved
Search for dead transitions found 0 dead transitions in 60318ms
Starting structural reductions in LTL mode, iteration 1 : 1367/1452 places, 1627/1726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61856 ms. Remains : 1367/1452 places, 1627/1726 transitions.
[2026-05-25 23:28:14] [INFO ] Flatten gal took : 16 ms
[2026-05-25 23:28:14] [INFO ] Flatten gal took : 16 ms
[2026-05-25 23:28:14] [INFO ] Input system was already deterministic with 1627 transitions.
[2026-05-25 23:28:14] [INFO ] Flatten gal took : 16 ms
[2026-05-25 23:28:14] [INFO ] Flatten gal took : 16 ms
[2026-05-25 23:28:14] [INFO ] Time to serialize gal into /tmp/CTLFireability6456767279512060093.gal : 5 ms
[2026-05-25 23:28:14] [INFO ] Time to serialize properties into /tmp/CTLFireability13692862383556993755.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/CTLFireability6456767279512060093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13692862383556993755.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,7.45632e+74,17.2443,383420,2,52203,5,1.29027e+06,6,0,7097,1.69477e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 23:28:44] [INFO ] Flatten gal took : 22 ms
[2026-05-25 23:28:44] [INFO ] Applying decomposition
[2026-05-25 23:28:44] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9747031040931619138.txt' '-o' '/tmp/graph9747031040931619138.bin' '-w' '/tmp/graph9747031040931619138.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9747031040931619138.bin' '-l' '-1' '-v' '-w' '/tmp/graph9747031040931619138.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:28:44] [INFO ] Decomposing Gal with order
[2026-05-25 23:28:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:28:44] [INFO ] Removed a total of 491 redundant transitions.
[2026-05-25 23:28:44] [INFO ] Flatten gal took : 35 ms
[2026-05-25 23:28:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 11 ms.
[2026-05-25 23:28:44] [INFO ] Time to serialize gal into /tmp/CTLFireability15288906025099182401.gal : 11 ms
[2026-05-25 23:28:44] [INFO ] Time to serialize properties into /tmp/CTLFireability3601590640232844747.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/CTLFireability15288906025099182401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3601590640232844747.ctl'

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 -...263
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,7.45632e+74,2.89543,104012,2388,17,223821,603,2711,377600,62,1788,0


Converting to forward existential form...Done !
original formula: AX(EF((E((i9.i1.i1.u194.p871==1) U (i18.i1.i1.u308.p1400==1)) + ((i10.u210.p934==1)&&((i9.i0.i6.u17.p40==1)||((i22.u368.p1673==1)&&(i22.u...174
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (E((i9.i1.i1.u194.p871==1) U (i18.i1.i1.u308.p1400==1)) + ((i10.u210.p934==1)&&((i9.i0.i...227
Reverse transition relation is NOT exact ! Due to transitions t218, t336, t645, t964, t1114, t1235, i1.t1200, i5.u78.t1154, i6.u132.t1002, i9.t808, i9.i0.t...496
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1452/1452 places, 1726/1726 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 1400 transition count 1674
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 1400 transition count 1674
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 107 place count 1400 transition count 1671
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 136 place count 1371 transition count 1642
Iterating global reduction 1 with 29 rules applied. Total rules applied 165 place count 1371 transition count 1642
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 175 place count 1371 transition count 1632
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 180 place count 1366 transition count 1627
Iterating global reduction 2 with 5 rules applied. Total rules applied 185 place count 1366 transition count 1627
Applied a total of 185 rules in 209 ms. Remains 1366 /1452 variables (removed 86) and now considering 1627/1726 (removed 99) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17866811559787124048.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1661171247696899085.kers'
[2026-05-25 23:29:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17866811559787124048.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1661171247696899085.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1627 rows 1366 cols 3883 entries
Finished phase 1 with 1300 SingleSign rule and 0 generalized
[2026-05-25 23:29:15] [INFO ] Computed 66 invariants in 11 ms
Computed 66 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-1661171247696899085.kers
Total runtime 14 ms.
[2026-05-25 23:29:15] [INFO ] Implicit Places using invariants in 438 ms returned []
[2026-05-25 23:29:15] [INFO ] Invariant cache hit.
[2026-05-25 23:29:16] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
Running 1626 sub problems to find dead transitions.
[2026-05-25 23:29:16] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1365/2993 variables, and 0 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1366 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1626 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1365/2993 variables, and 0 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1366 constraints, PredecessorRefiner: 0/1626 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60320ms problems are : Problem set: 0 solved, 1626 unsolved
Search for dead transitions found 0 dead transitions in 60322ms
Starting structural reductions in LTL mode, iteration 1 : 1366/1452 places, 1627/1726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61915 ms. Remains : 1366/1452 places, 1627/1726 transitions.
[2026-05-25 23:30:16] [INFO ] Flatten gal took : 17 ms
[2026-05-25 23:30:16] [INFO ] Flatten gal took : 17 ms
[2026-05-25 23:30:17] [INFO ] Input system was already deterministic with 1627 transitions.
[2026-05-25 23:30:17] [INFO ] Flatten gal took : 17 ms
[2026-05-25 23:30:17] [INFO ] Flatten gal took : 17 ms
[2026-05-25 23:30:17] [INFO ] Time to serialize gal into /tmp/CTLFireability2546225374826793746.gal : 6 ms
[2026-05-25 23:30:17] [INFO ] Time to serialize properties into /tmp/CTLFireability13569285461702067360.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/CTLFireability2546225374826793746.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13569285461702067360.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,5.75671e+74,14.0455,380276,2,52159,5,1.27556e+06,6,0,7093,1.67453e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 23:30:47] [INFO ] Flatten gal took : 19 ms
[2026-05-25 23:30:47] [INFO ] Applying decomposition
[2026-05-25 23:30:47] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5445049950785286076.txt' '-o' '/tmp/graph5445049950785286076.bin' '-w' '/tmp/graph5445049950785286076.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5445049950785286076.bin' '-l' '-1' '-v' '-w' '/tmp/graph5445049950785286076.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:30:47] [INFO ] Decomposing Gal with order
[2026-05-25 23:30:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:30:47] [INFO ] Removed a total of 483 redundant transitions.
[2026-05-25 23:30:47] [INFO ] Flatten gal took : 39 ms
[2026-05-25 23:30:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 10 ms.
[2026-05-25 23:30:47] [INFO ] Time to serialize gal into /tmp/CTLFireability18314264090660172314.gal : 9 ms
[2026-05-25 23:30:47] [INFO ] Time to serialize properties into /tmp/CTLFireability2827290898567034799.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/CTLFireability18314264090660172314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2827290898567034799.ctl'

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 -...263
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.75671e+74,2.52537,101224,3034,17,229664,577,2404,330625,62,1427,0


Converting to forward existential form...Done !
original formula: EX((EG(AX((((i18.u334.p1489==1)||(i2.i2.i3.u103.p418==1)) * E((i19.u353.p1581==1) U (i10.u218.p946==1))))) + EF(EX((i17.u330.p1475==1))))...156
=> equivalent forward existential formula: ([FwdG(EY(Init),!(EX(!((((i18.u334.p1489==1)||(i2.i2.i3.u103.p418==1)) * E((i19.u353.p1581==1) U (i10.u218.p946=...236
Reverse transition relation is NOT exact ! Due to transitions t218, t645, t809, t965, i0.t1236, i0.i0.t1201, i2.t1115, i2.i2.t1080, i2.i2.i1.u82.t1155, i6....469
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1452/1452 places, 1726/1726 transitions.
Graph (trivial) has 1375 edges and 1452 vertex of which 924 / 1452 are part of one of the 33 SCC in 2 ms
Free SCC test removed 891 places
Ensure Unique test removed 1046 transitions
Reduce isomorphic transitions removed 1046 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 560 transition count 676
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 557 transition count 676
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 7 place count 557 transition count 640
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 79 place count 521 transition count 640
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 108 place count 492 transition count 580
Iterating global reduction 2 with 29 rules applied. Total rules applied 137 place count 492 transition count 580
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 137 place count 492 transition count 579
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 491 transition count 579
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 144 place count 486 transition count 572
Iterating global reduction 2 with 5 rules applied. Total rules applied 149 place count 486 transition count 572
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 359 place count 381 transition count 467
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 360 place count 380 transition count 466
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 265 edges and 371 vertex of which 48 / 371 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 2 with 10 rules applied. Total rules applied 370 place count 347 transition count 466
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 418 place count 347 transition count 418
Applied a total of 418 rules in 64 ms. Remains 347 /1452 variables (removed 1105) and now considering 418/1726 (removed 1308) transitions.
[2026-05-25 23:31:17] [INFO ] Flow matrix only has 385 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12703743541551715152.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13085151850789637749.kers'
[2026-05-25 23:31:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12703743541551715152.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13085151850789637749.kers]
Normalized transition count is 384 out of 385 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 384 rows 347 cols 1138 entries
Finished phase 1 with 290 SingleSign rule and 0 generalized
[2026-05-25 23:31:17] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13085151850789637749.kers
Total runtime 1 ms.
[2026-05-25 23:31:17] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-25 23:31:17] [INFO ] Flow matrix only has 385 transitions (discarded 33 similar events)
[2026-05-25 23:31:17] [INFO ] Invariant cache hit.
[2026-05-25 23:31:17] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-25 23:31:17] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2026-05-25 23:31:17] [INFO ] Redundant transitions in 2 ms returned []
Running 201 sub problems to find dead transitions.
[2026-05-25 23:31:17] [INFO ] Flow matrix only has 385 transitions (discarded 33 similar events)
[2026-05-25 23:31:17] [INFO ] Invariant cache hit.
[2026-05-25 23:31:17] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 33/347 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 384/731 variables, 347/404 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/731 variables, 14/418 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/731 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 731/732 variables, and 418 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16078 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 347/347 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 33/347 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 384/731 variables, 347/404 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/731 variables, 14/418 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 201/619 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/731 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 731/732 variables, and 619 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16154 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 347/347 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32246ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 32247ms
Starting structural reductions in SI_CTL mode, iteration 1 : 347/1452 places, 418/1726 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32754 ms. Remains : 347/1452 places, 418/1726 transitions.
[2026-05-25 23:31:50] [INFO ] Flatten gal took : 9 ms
[2026-05-25 23:31:50] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:31:50] [INFO ] Input system was already deterministic with 418 transitions.
[2026-05-25 23:31:50] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:31:50] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:31:50] [INFO ] Time to serialize gal into /tmp/CTLFireability17738660785641170929.gal : 1 ms
[2026-05-25 23:31:50] [INFO ] Time to serialize properties into /tmp/CTLFireability7341716632695150408.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/CTLFireability17738660785641170929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7341716632695150408.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,1.95718e+44,0.213593,12404,2,638,5,44575,6,0,1776,37417,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 23:32:20] [INFO ] Flatten gal took : 8 ms
[2026-05-25 23:32:20] [INFO ] Applying decomposition
[2026-05-25 23:32:20] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13354697694232270847.txt' '-o' '/tmp/graph13354697694232270847.bin' '-w' '/tmp/graph13354697694232270847.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13354697694232270847.bin' '-l' '-1' '-v' '-w' '/tmp/graph13354697694232270847.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:32:20] [INFO ] Decomposing Gal with order
[2026-05-25 23:32:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:32:20] [INFO ] Removed a total of 34 redundant transitions.
[2026-05-25 23:32:20] [INFO ] Flatten gal took : 9 ms
[2026-05-25 23:32:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 1 ms.
[2026-05-25 23:32:20] [INFO ] Time to serialize gal into /tmp/CTLFireability1527833523212769285.gal : 8 ms
[2026-05-25 23:32:20] [INFO ] Time to serialize properties into /tmp/CTLFireability8545043170328157538.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/CTLFireability1527833523212769285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8545043170328157538.ctl'

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 -...262
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,1.95718e+44,0.096547,7264,191,434,3582,4339,700,3855,257,9236,0


Converting to forward existential form...Done !
original formula: EF(EG((i3.u12.p764==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(i3.u12.p764==0))] != FALSE
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,2.22612,95000,1,0,127925,24998,2481,314341,1202,198262,10404
FORMULA NoC3x3-PT-4B-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1452/1452 places, 1726/1726 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 1403 transition count 1677
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 1403 transition count 1677
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 102 place count 1403 transition count 1673
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 125 place count 1380 transition count 1650
Iterating global reduction 1 with 23 rules applied. Total rules applied 148 place count 1380 transition count 1650
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 153 place count 1380 transition count 1645
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 158 place count 1375 transition count 1640
Iterating global reduction 2 with 5 rules applied. Total rules applied 163 place count 1375 transition count 1640
Applied a total of 163 rules in 195 ms. Remains 1375 /1452 variables (removed 77) and now considering 1640/1726 (removed 86) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7862716583156846542.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8200761412332389389.kers'
[2026-05-25 23:32:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7862716583156846542.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8200761412332389389.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1640 rows 1375 cols 3909 entries
Finished phase 1 with 1309 SingleSign rule and 0 generalized
[2026-05-25 23:32:22] [INFO ] Computed 66 invariants in 14 ms
Computed 66 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-8200761412332389389.kers
Total runtime 16 ms.
[2026-05-25 23:32:23] [INFO ] Implicit Places using invariants in 406 ms returned []
[2026-05-25 23:32:23] [INFO ] Invariant cache hit.
[2026-05-25 23:32:24] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1332 ms to find 0 implicit places.
Running 1639 sub problems to find dead transitions.
[2026-05-25 23:32:24] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1374/3015 variables, and 0 constraints, problems are : Problem set: 0 solved, 1639 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1375 constraints, PredecessorRefiner: 1639/1639 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1639 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1374/3015 variables, and 0 constraints, problems are : Problem set: 0 solved, 1639 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1375 constraints, PredecessorRefiner: 0/1639 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60308ms problems are : Problem set: 0 solved, 1639 unsolved
Search for dead transitions found 0 dead transitions in 60311ms
Starting structural reductions in LTL mode, iteration 1 : 1375/1452 places, 1640/1726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61851 ms. Remains : 1375/1452 places, 1640/1726 transitions.
[2026-05-25 23:33:24] [INFO ] Flatten gal took : 15 ms
[2026-05-25 23:33:24] [INFO ] Flatten gal took : 16 ms
[2026-05-25 23:33:24] [INFO ] Input system was already deterministic with 1640 transitions.
[2026-05-25 23:33:24] [INFO ] Flatten gal took : 15 ms
[2026-05-25 23:33:24] [INFO ] Flatten gal took : 16 ms
[2026-05-25 23:33:24] [INFO ] Time to serialize gal into /tmp/CTLFireability6719565141862607235.gal : 5 ms
[2026-05-25 23:33:24] [INFO ] Time to serialize properties into /tmp/CTLFireability4283489064859082319.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/CTLFireability6719565141862607235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4283489064859082319.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,7.49401e+74,13.7767,382112,2,52508,5,1.28316e+06,6,0,7142,1.68334e+06,0


Converting to forward existential form...Done !
original formula: EF((((p1412==1)&&(p1575==1)) + (((p2119==1) * A(AX((p106==1)) U (p1947!=1))) * (EF(AX(AF((p1528==1)))) * ((AG((p424==1)) + (p175==0)) + (...182
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((p1412==1)&&(p1575==1)))] != FALSE + (([(((FwdU(Init,TRUE) * ((p2119==1) * !((E(!((p1947!=...710
(forward)formula 0,1,13.7909,382112,1,0,7,1.28316e+06,8,1,7148,1.68334e+06,1
FORMULA NoC3x3-PT-4B-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 1452/1452 places, 1726/1726 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 1403 transition count 1677
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 1403 transition count 1677
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 101 place count 1403 transition count 1674
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 127 place count 1377 transition count 1648
Iterating global reduction 1 with 26 rules applied. Total rules applied 153 place count 1377 transition count 1648
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 163 place count 1377 transition count 1638
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 166 place count 1374 transition count 1635
Iterating global reduction 2 with 3 rules applied. Total rules applied 169 place count 1374 transition count 1635
Applied a total of 169 rules in 205 ms. Remains 1374 /1452 variables (removed 78) and now considering 1635/1726 (removed 91) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11382471067954426629.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1659435830844562104.kers'
[2026-05-25 23:33:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11382471067954426629.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1659435830844562104.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1635 rows 1374 cols 3899 entries
Finished phase 1 with 1308 SingleSign rule and 0 generalized
[2026-05-25 23:33:38] [INFO ] Computed 66 invariants in 6 ms
Computed 66 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1659435830844562104.kers
Total runtime 9 ms.
[2026-05-25 23:33:39] [INFO ] Implicit Places using invariants in 399 ms returned []
[2026-05-25 23:33:39] [INFO ] Invariant cache hit.
[2026-05-25 23:33:39] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1354 ms to find 0 implicit places.
Running 1634 sub problems to find dead transitions.
[2026-05-25 23:33:39] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1373/3009 variables, and 0 constraints, problems are : Problem set: 0 solved, 1634 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1374 constraints, PredecessorRefiner: 1634/1634 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1634 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1373/3009 variables, and 0 constraints, problems are : Problem set: 0 solved, 1634 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1374 constraints, PredecessorRefiner: 0/1634 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60307ms problems are : Problem set: 0 solved, 1634 unsolved
Search for dead transitions found 0 dead transitions in 60309ms
Starting structural reductions in LTL mode, iteration 1 : 1374/1452 places, 1635/1726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61873 ms. Remains : 1374/1452 places, 1635/1726 transitions.
[2026-05-25 23:34:40] [INFO ] Flatten gal took : 16 ms
[2026-05-25 23:34:40] [INFO ] Flatten gal took : 16 ms
[2026-05-25 23:34:40] [INFO ] Input system was already deterministic with 1635 transitions.
[2026-05-25 23:34:40] [INFO ] Flatten gal took : 16 ms
[2026-05-25 23:34:40] [INFO ] Flatten gal took : 16 ms
[2026-05-25 23:34:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12437281049393652162.gal : 5 ms
[2026-05-25 23:34:40] [INFO ] Time to serialize properties into /tmp/CTLFireability4853422943808983428.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/CTLFireability12437281049393652162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4853422943808983428.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,7.6022e+74,13.6567,381692,2,52422,5,1.28429e+06,6,0,7133,1.68424e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 23:35:10] [INFO ] Flatten gal took : 21 ms
[2026-05-25 23:35:10] [INFO ] Applying decomposition
[2026-05-25 23:35:10] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12101748148595057361.txt' '-o' '/tmp/graph12101748148595057361.bin' '-w' '/tmp/graph12101748148595057361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12101748148595057361.bin' '-l' '-1' '-v' '-w' '/tmp/graph12101748148595057361.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:35:10] [INFO ] Decomposing Gal with order
[2026-05-25 23:35:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:35:10] [INFO ] Removed a total of 483 redundant transitions.
[2026-05-25 23:35:10] [INFO ] Flatten gal took : 32 ms
[2026-05-25 23:35:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 10 ms.
[2026-05-25 23:35:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3035038378257820141.gal : 10 ms
[2026-05-25 23:35:10] [INFO ] Time to serialize properties into /tmp/CTLFireability17946126164079067550.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/CTLFireability3035038378257820141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17946126164079067550.ctl'

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 -...263
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,7.6022e+74,5.05424,178956,2415,19,401975,776,2638,721164,75,2127,0


Converting to forward existential form...Done !
original formula: A(!((!((AX((i21.i1.i4.u385.p1718==1)) * ((i3.i1.i0.u102.p392==1) + EX((i3.i0.i6.u94.p367==1))))) * AF(((i24.i1.i1.u424.p1877==1) * AX((i2...213
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!(EX(!((i22.u401.p1778==1))))))))) * !(E(!(EG(!(EX(!((i22.u401.p1778==1)))))) U (!(!((!((!(E...380
Reverse transition relation is NOT exact ! Due to transitions t220, t340, t495, t651, t688, t851, t1085, t1121, t1207, t1242, i3.i0.i3.u83.t1161, i6.t970, ...461
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1452/1452 places, 1726/1726 transitions.
Graph (trivial) has 1374 edges and 1452 vertex of which 905 / 1452 are part of one of the 33 SCC in 1 ms
Free SCC test removed 872 places
Ensure Unique test removed 1022 transitions
Reduce isomorphic transitions removed 1022 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 579 transition count 692
Reduce places removed 11 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 1 with 14 rules applied. Total rules applied 26 place count 568 transition count 689
Reduce places removed 2 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 5 rules applied. Total rules applied 31 place count 566 transition count 686
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 33 place count 564 transition count 686
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 33 place count 564 transition count 649
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 107 place count 527 transition count 649
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 137 place count 497 transition count 588
Iterating global reduction 4 with 30 rules applied. Total rules applied 167 place count 497 transition count 588
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 167 place count 497 transition count 587
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 169 place count 496 transition count 587
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 175 place count 490 transition count 578
Iterating global reduction 4 with 6 rules applied. Total rules applied 181 place count 490 transition count 578
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 4 with 216 rules applied. Total rules applied 397 place count 382 transition count 470
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 398 place count 382 transition count 469
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 399 place count 382 transition count 468
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 400 place count 381 transition count 467
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 267 edges and 372 vertex of which 48 / 372 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 5 with 10 rules applied. Total rules applied 410 place count 348 transition count 467
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 458 place count 348 transition count 419
Applied a total of 458 rules in 67 ms. Remains 348 /1452 variables (removed 1104) and now considering 419/1726 (removed 1307) transitions.
[2026-05-25 23:35:40] [INFO ] Flow matrix only has 387 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11180345134565489377.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2090591814062345025.kers'
[2026-05-25 23:35:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11180345134565489377.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2090591814062345025.kers]
Normalized transition count is 386 out of 387 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 386 rows 348 cols 1140 entries
Finished phase 1 with 291 SingleSign rule and 0 generalized
[2026-05-25 23:35:40] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2090591814062345025.kers
Total runtime 2 ms.
[2026-05-25 23:35:40] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-25 23:35:40] [INFO ] Flow matrix only has 387 transitions (discarded 32 similar events)
[2026-05-25 23:35:40] [INFO ] Invariant cache hit.
[2026-05-25 23:35:41] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-25 23:35:41] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2026-05-25 23:35:41] [INFO ] Redundant transitions in 2 ms returned []
Running 208 sub problems to find dead transitions.
[2026-05-25 23:35:41] [INFO ] Flow matrix only has 387 transitions (discarded 32 similar events)
[2026-05-25 23:35:41] [INFO ] Invariant cache hit.
[2026-05-25 23:35:41] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 33/348 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 386/734 variables, 348/405 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/734 variables, 14/419 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/734 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/734 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 734/735 variables, and 419 constraints, problems are : Problem set: 0 solved, 208 unsolved in 16428 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 348/348 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 33/348 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 386/734 variables, 348/405 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/734 variables, 14/419 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/734 variables, 208/627 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/734 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/734 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 734/735 variables, and 627 constraints, problems are : Problem set: 0 solved, 208 unsolved in 17101 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 348/348 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33542ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 33542ms
Starting structural reductions in SI_CTL mode, iteration 1 : 348/1452 places, 419/1726 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34037 ms. Remains : 348/1452 places, 419/1726 transitions.
[2026-05-25 23:36:14] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:36:14] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:36:14] [INFO ] Input system was already deterministic with 419 transitions.
[2026-05-25 23:36:14] [INFO ] Flatten gal took : 13 ms
RANDOM walk for 215 steps (0 resets) in 23 ms. (8 steps per ms) remains 0/1 properties
FORMULA NoC3x3-PT-4B-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 23:36:14] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:36:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8219825660614735073.gal : 1 ms
[2026-05-25 23:36:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11979011832228804894.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8219825660614735073.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11979011832228804894.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 23:36:14] [INFO ] Flatten gal took : 17 ms
[2026-05-25 23:36:14] [INFO ] Flatten gal took : 17 ms
[2026-05-25 23:36:14] [INFO ] Applying decomposition
[2026-05-25 23:36:14] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11832966360129625855.txt' '-o' '/tmp/graph11832966360129625855.bin' '-w' '/tmp/graph11832966360129625855.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11832966360129625855.bin' '-l' '-1' '-v' '-w' '/tmp/graph11832966360129625855.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:36:15] [INFO ] Decomposing Gal with order
[2026-05-25 23:36:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:36:15] [INFO ] Removed a total of 489 redundant transitions.
[2026-05-25 23:36:15] [INFO ] Flatten gal took : 34 ms
[2026-05-25 23:36:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 12 ms.
[2026-05-25 23:36:15] [INFO ] Time to serialize gal into /tmp/CTLFireability12801069140943206890.gal : 11 ms
[2026-05-25 23:36:15] [INFO ] Time to serialize properties into /tmp/CTLFireability16318208322422424864.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/CTLFireability12801069140943206890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16318208322422424864.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 11 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,2.11647e+76,3.25026,119344,3575,28,269152,831,3009,439665,83,2229,0


Converting to forward existential form...Done !
original formula: EG((EF(!(A(AX((i4.u119.p463==1)) U (i21.u417.p1752==1)))) * E(!(((i28.u543.p2305==1) * EG((i10.u227.p929==1)))) U EG((i3.i0.i1.u105.p424=...162
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U !(!((E(!((i21.u417.p1752==1)) U (!(!(EX(!((i4.u119.p463==1))))) * !((i21.u417.p1752==1)))) ...284
Reverse transition relation is NOT exact ! Due to transitions t242, t530, t730, t1146, t1183, t1387, t1410, t1579, t1616, t1678, i0.t1312, i0.i1.t1275, i1....837
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-26 00:05:29] [INFO ] Applying decomposition
[2026-05-26 00:05:30] [INFO ] Flatten gal took : 379 ms
[2026-05-26 00:05:30] [INFO ] Decomposing Gal with order
[2026-05-26 00:05:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 00:05:31] [INFO ] Removed a total of 102 redundant transitions.
[2026-05-26 00:05:33] [INFO ] Flatten gal took : 1739 ms
[2026-05-26 00:05:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1048 labels/synchronizations in 393 ms.
[2026-05-26 00:05:34] [INFO ] Time to serialize gal into /tmp/CTLFireability4016457769586791515.gal : 22 ms
[2026-05-26 00:05:34] [INFO ] Time to serialize properties into /tmp/CTLFireability14478793268202685431.ctl : 7 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/CTLFireability4016457769586791515.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14478793268202685431.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 11 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,2.11647e+76,1.53778,63696,1423,482,138561,9951,1539,317418,758,20013,0


Converting to forward existential form...Done !

BK_TIME_CONFINEMENT_REACHED

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

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

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