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.r207-tall-177969919800106.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 gold2025
Input is PGCD-PT-D04N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r207-tall-177969919800106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 8.3K Mar 8 14:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 8 14:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 8 14:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 8 14:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 16 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 16 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 16 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Mar 8 14:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 8 14:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 8 14:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 8 14:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 9.3K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779721568093

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PGCD-PT-D04N050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 15:06:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 15:06:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 15:06:09] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2026-05-25 15:06:09] [INFO ] Transformed 15 places.
[2026-05-25 15:06:09] [INFO ] Transformed 15 transitions.
[2026-05-25 15:06:09] [INFO ] Parsed PT model containing 15 places and 15 transitions and 70 arcs in 114 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 11
Current structural bounds on expressions (Initially) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 50, 50, 50, 50] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 50, 50, 50, 50] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 15 rows 15 cols
[2026-05-25 15:06:09] [INFO ] Computed 6 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 50, 50, 50, 50] Max Struct:[255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255]
RANDOM walk for 10041 steps (2 resets) in 14 ms. (669 steps per ms)
BEST_FIRST walk for 110007 steps (22 resets) in 105 ms. (1037 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[125, 91, 91, 105, 125, 117, 73, 165, 175, 169, 167] Max Struct:[255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255]
[2026-05-25 15:06:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:09] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2026-05-25 15:06:09] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-25 15:06:09] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 15:06:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:09] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:09] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-25 15:06:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:06:09] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:09] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 15:06:09] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 35 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:09] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:09] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-25 15:06:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:09] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 15:06:09] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-25 15:06:09] [INFO ] [Nat]Added 5 Read/Feed constraints in 0 ms returned sat
[2026-05-25 15:06:09] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:09] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-25 15:06:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Nat]Added 5 Read/Feed constraints in 5 ms returned sat
[2026-05-25 15:06:10] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 15:06:10] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-25 15:06:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 15:06:10] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:10] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 283 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 15:06:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:10] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 33 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2026-05-25 15:06:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:10] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 38 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-25 15:06:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Nat]Added 5 Read/Feed constraints in 5 ms returned sat
[2026-05-25 15:06:10] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 15:06:10] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 36 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-25 15:06:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:10] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 45 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:10] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-25 15:06:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:11] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:11] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 15:06:11] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:11] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:11] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 60 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:11] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:11] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:11] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-25 15:06:11] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 15:06:11] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:11] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 40 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:11] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-25 15:06:11] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:11] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-25 15:06:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:06:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-25 15:06:11] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:11] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-25 15:06:11] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:11] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:11] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[125, 91, 91, 105, 125, 117, 73, 165, 175, 169, 167] Max Struct:[255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[251, 251, 251, 251, 251, 250, 249, 247, 245, 249, 249] Max Struct:[255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255]
Support contains 11 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 7 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2026-05-25 15:06:12] [INFO ] Invariant cache hit.
[2026-05-25 15:06:12] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 5/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 15/30 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 26 constraints, problems are : Problem set: 0 solved, 5 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 5/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 15/30 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 31 constraints, problems are : Problem set: 0 solved, 5 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 202ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 209ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 15/15 places, 15/15 transitions.
[2026-05-25 15:06:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[251, 251, 251, 251, 251, 250, 249, 247, 245, 249, 249] Max Struct:[255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255]
RANDOM walk for 1000061 steps (2 resets) in 213 ms. (4673 steps per ms)
BEST_FIRST walk for 11000008 steps (22 resets) in 3350 ms. (3282 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[251, 251, 251, 251, 251, 250, 249, 247, 245, 249, 249] Max Struct:[255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255]
[2026-05-25 15:06:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:15] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-25 15:06:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:15] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using state equation in 188 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-25 15:06:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using state equation in 150 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-25 15:06:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using state equation in 193 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using state equation in 14 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:06:16] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:16] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 34 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-25 15:06:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:16] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 14 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 15:06:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:16] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 22 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:17] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 15:06:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:17] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:17] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 15:06:17] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:17] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:17] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 21 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:17] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:17] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:17] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2026-05-25 15:06:17] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-25 15:06:17] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2026-05-25 15:06:17] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 15:06:17] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 18 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:17] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 15:06:17] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-25 15:06:17] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 15:06:17] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 15:06:17] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:17] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:17] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[251, 251, 251, 251, 251, 250, 249, 247, 245, 249, 249] Max Struct:[251, 251, 251, 251, 251, 255, 255, 255, 255, 255, 255]
FORMULA PGCD-PT-D04N050-UpperBounds-04 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D04N050-UpperBounds-14 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D04N050-UpperBounds-03 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D04N050-UpperBounds-02 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D04N050-UpperBounds-01 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D04N050-UpperBounds-00 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[250, 251, 247, 249, 249, 249] Max Struct:[255, 255, 255, 255, 255, 255]
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 15/15 transitions.
[2026-05-25 15:06:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[250, 251, 247, 249, 249, 249] Max Struct:[255, 255, 255, 255, 255, 255]
RANDOM walk for 1000037 steps (2 resets) in 161 ms. (6173 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 1599 ms. (3750 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[250, 251, 247, 249, 249, 249] Max Struct:[255, 255, 255, 255, 255, 255]
[2026-05-25 15:06:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 15:06:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:06:19] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:19] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:19] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 35 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:19] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 15:06:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Nat]Absence check using state equation in 11 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 15:06:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:19] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 15:06:19] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 23 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 15:06:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2026-05-25 15:06:19] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:19] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 23 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:19] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 15:06:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:19] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:19] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 18 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:19] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-25 15:06:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-25 15:06:19] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 15:06:19] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:19] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[250, 251, 247, 249, 249, 249] Max Struct:[255, 251, 255, 255, 255, 255]
FORMULA PGCD-PT-D04N050-UpperBounds-06 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[251, 249, 249, 249, 249] Max Struct:[255, 255, 255, 255, 255]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 15/15 transitions.
[2026-05-25 15:06:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[251, 249, 249, 249, 249] Max Struct:[255, 255, 255, 255, 255]
RANDOM walk for 1000055 steps (2 resets) in 154 ms. (6451 steps per ms)
BEST_FIRST walk for 5000003 steps (10 resets) in 1353 ms. (3692 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[251, 249, 249, 249, 249] Max Struct:[255, 255, 255, 255, 255]
[2026-05-25 15:06:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Nat]Absence check using state equation in 108 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-25 15:06:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:06:21] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2026-05-25 15:06:21] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:21] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 14 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:21] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 0 ms.
[2026-05-25 15:06:21] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 24 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:21] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 18 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 15:06:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:21] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:21] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:22] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[251, 249, 249, 249, 249] Max Struct:[251, 255, 255, 255, 255]
FORMULA PGCD-PT-D04N050-UpperBounds-11 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D04N050-UpperBounds-05 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249, 249, 249, 249] Max Struct:[255, 255, 255, 255]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 15/15 places, 15/15 transitions.
[2026-05-25 15:06:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[249, 249, 249, 249] Max Struct:[255, 255, 255, 255]
RANDOM walk for 1000008 steps (2 resets) in 157 ms. (6329 steps per ms)
BEST_FIRST walk for 4000002 steps (8 resets) in 1072 ms. (3727 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[249, 249, 249, 249] Max Struct:[255, 255, 255, 255]
[2026-05-25 15:06:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 15:06:23] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2026-05-25 15:06:23] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:23] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 15:06:23] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:06:23] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:23] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:23] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 12 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:23] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:23] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:23] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:23] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 15:06:23] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:23] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:23] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:23] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-25 15:06:23] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:23] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:23] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2026-05-25 15:06:23] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-25 15:06:23] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:23] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:23] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 19 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:23] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:23] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-25 15:06:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-25 15:06:23] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 15:06:23] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-25 15:06:23] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 15:06:23] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:23] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[249, 249, 249, 249] Max Struct:[255, 255, 255, 255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249, 249, 249, 249] Max Struct:[255, 255, 255, 255]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 15/15 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2026-05-25 15:06:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:06:23] [INFO ] Implicit Places using invariants in 43 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 47 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 10/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 49 ms. Remains : 10/15 places, 15/15 transitions.
// Phase 1: matrix 15 rows 10 cols
[2026-05-25 15:06:23] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[249, 249, 249, 249] Max Struct:[255, 255, 255, 255]
RANDOM walk for 1000001 steps (2 resets) in 130 ms. (7633 steps per ms)
BEST_FIRST walk for 4000003 steps (8 resets) in 832 ms. (4801 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[249, 249, 249, 249] Max Struct:[255, 255, 255, 255]
[2026-05-25 15:06:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 15:06:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 15:06:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:06:24] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:25] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:25] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 15 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:25] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 15:06:25] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 15:06:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 15:06:25] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-25 15:06:25] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:25] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:25] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 109 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:25] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 15:06:25] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:25] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 15:06:25] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 0 ms.
[2026-05-25 15:06:25] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 16 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:25] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 15:06:25] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 15:06:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:06:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 15:06:25] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:06:25] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:06:25] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:06:25] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[249, 249, 249, 249] Max Struct:[255, 255, 255, 255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249, 249, 249, 249] Max Struct:[255, 255, 255, 255]
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2026-05-25 15:06:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:06:25] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-25 15:06:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:06:25] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:06:25] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 15:06:25] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-25 15:06:25] [INFO ] Invariant cache hit.
[2026-05-25 15:06:25] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 143ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 144ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 10/10 places, 15/15 transitions.
RANDOM walk for 40087 steps (8 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
[2026-05-25 15:06:25] [INFO ] Flatten gal took : 21 ms
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
[2026-05-25 15:06:25] [INFO ] Flatten gal took : 3 ms
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
[2026-05-25 15:06:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality204845102750919482.gal : 4 ms
[2026-05-25 15:06:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2013749652807354348.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality204845102750919482.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2013749652807354348.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (8 resets) in 75 ms. (526 steps per ms) remains 8/8 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality2013749652807354348.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :19 after 36
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :36 after 9957
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :9957 after 46231
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :46231 after 6.44381e+07
Interrupted probabilistic random walk after 332348 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 8
Probabilistic random walk after 332348 steps, saw 198947 distinct states, run finished after 3007 ms. (steps per millisecond=110 ) properties seen :0
[2026-05-25 15:06:29] [INFO ] Invariant cache hit.
[2026-05-25 15:06:29] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 15:06:29] [INFO ] Deduced a trap composed of 5 places in 621 ms of which 23 ms to minimize.
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 4 solved, 4 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 4/21 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 4 solved, 4 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 847ms problems are : Problem set: 4 solved, 4 unsolved
Parikh walk visited 0 properties in 1297 ms.
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2026-05-25 15:06:31] [INFO ] Invariant cache hit.
[2026-05-25 15:06:31] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 161ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 10/10 places, 15/15 transitions.
RANDOM walk for 40093 steps (8 resets) in 40 ms. (977 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 39 ms. (1000 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 454162 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 4
Probabilistic random walk after 454162 steps, saw 271355 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
[2026-05-25 15:06:34] [INFO ] Invariant cache hit.
[2026-05-25 15:06:34] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 15:06:34] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 0 solved, 4 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 4 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 219ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2400 ms.
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2026-05-25 15:06:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:06:37] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-25 15:06:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:06:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:06:37] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 15:06:37] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-25 15:06:37] [INFO ] Invariant cache hit.
[2026-05-25 15:06:37] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 127ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 127ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 10/10 places, 15/15 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 15:06:37] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:06:37] [INFO ] Applying decomposition
[2026-05-25 15:06:37] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3774909579255577005.txt' '-o' '/tmp/graph3774909579255577005.bin' '-w' '/tmp/graph3774909579255577005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3774909579255577005.bin' '-l' '-1' '-v' '-w' '/tmp/graph3774909579255577005.weights' '-q' '0' '-e' '0.001'
[2026-05-25 15:06:37] [INFO ] Decomposing Gal with order
[2026-05-25 15:06:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 15:06:37] [INFO ] Flatten gal took : 29 ms
[2026-05-25 15:06:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 15:06:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5536881151249569436.gal : 1 ms
[2026-05-25 15:06:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1098597276657763505.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5536881151249569436.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1098597276657763505.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality1098597276657763505.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :36 after 969
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :969 after 421209
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :421209 after 1.52454e+10
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.66122e+13 after 1.72362e+13
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.72362e+13 after 1.72391e+13
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.72391e+13 after 1.72391e+13
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.72391e+13 after 1.72391e+13
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.72391e+13 after 1.72391e+13
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :1.72391e+13 after 1.72395e+13
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[249, 249, 249, 249] Max Struct:[255, 255, 255, 255]
Starting property specific reduction for PGCD-PT-D04N050-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[255]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[255]
[2026-05-25 15:07:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[255]
RANDOM walk for 10034 steps (2 resets) in 8 ms. (1114 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[173] Max Struct:[255]
[2026-05-25 15:07:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:07:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 15:07:27] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:07:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:07:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 15:07:27] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 15:07:27] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:07:27] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 15:07:27] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:07:27] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[173] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[245] Max Struct:[255]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2026-05-25 15:07:27] [INFO ] Invariant cache hit.
[2026-05-25 15:07:27] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 125ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 10/10 places, 15/15 transitions.
[2026-05-25 15:07:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[245] Max Struct:[255]
RANDOM walk for 1000019 steps (2 resets) in 140 ms. (7092 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 208 ms. (4784 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[245] Max Struct:[255]
[2026-05-25 15:07:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:07:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 15:07:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 15:07:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:07:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 15:07:28] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 15:07:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:07:28] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 15:07:28] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:07:28] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[245] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[247] Max Struct:[255]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2026-05-25 15:07:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:07:28] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-25 15:07:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:07:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:07:28] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 15:07:28] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-25 15:07:28] [INFO ] Invariant cache hit.
[2026-05-25 15:07:28] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 130ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 10/10 places, 15/15 transitions.
[2026-05-25 15:07:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[247] Max Struct:[255]
RANDOM walk for 1000048 steps (2 resets) in 130 ms. (7633 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 205 ms. (4854 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[247] Max Struct:[255]
[2026-05-25 15:07:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:07:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 15:07:28] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 15:07:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:07:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 15:07:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:07:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:07:28] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:07:28] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 15:07:28] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[247] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[247] Max Struct:[255]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2026-05-25 15:07:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:07:28] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-25 15:07:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:07:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:07:28] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 15:07:28] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-25 15:07:28] [INFO ] Invariant cache hit.
[2026-05-25 15:07:28] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 137ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 10/10 places, 15/15 transitions.
RANDOM walk for 40101 steps (8 resets) in 14 ms. (2673 steps per ms) remains 2/2 properties
[2026-05-25 15:07:29] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:07:29] [INFO ] Flatten gal took : 5 ms
[2026-05-25 15:07:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11265132724950716860.gal : 1 ms
[2026-05-25 15:07:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13501592837381466115.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11265132724950716860.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13501592837381466115.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13501592837381466115.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
BEST_FIRST walk for 40001 steps (8 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 9957
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9957 after 46231
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :46231 after 6.44381e+07
Interrupted probabilistic random walk after 696243 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :0 out of 2
Probabilistic random walk after 696243 steps, saw 407855 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
[2026-05-25 15:07:32] [INFO ] Invariant cache hit.
[2026-05-25 15:07:32] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 15:07:32] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 1 solved, 1 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 1 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2026-05-25 15:07:32] [INFO ] Invariant cache hit.
[2026-05-25 15:07:32] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 128ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 129ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 10/10 places, 15/15 transitions.
RANDOM walk for 40128 steps (8 resets) in 12 ms. (3086 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2804058 steps, run timeout after 3001 ms. (steps per millisecond=934 ) properties seen :0 out of 1
Probabilistic random walk after 2804058 steps, saw 1581293 distinct states, run finished after 3001 ms. (steps per millisecond=934 ) properties seen :0
[2026-05-25 15:07:35] [INFO ] Invariant cache hit.
[2026-05-25 15:07:35] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 15:07:35] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2026-05-25 15:07:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:07:35] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-25 15:07:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:07:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:07:35] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 15:07:35] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-25 15:07:35] [INFO ] Invariant cache hit.
[2026-05-25 15:07:35] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 156ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 10/10 places, 15/15 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 15:07:35] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:07:35] [INFO ] Applying decomposition
[2026-05-25 15:07:35] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9157631778684505710.txt' '-o' '/tmp/graph9157631778684505710.bin' '-w' '/tmp/graph9157631778684505710.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9157631778684505710.bin' '-l' '-1' '-v' '-w' '/tmp/graph9157631778684505710.weights' '-q' '0' '-e' '0.001'
[2026-05-25 15:07:35] [INFO ] Decomposing Gal with order
[2026-05-25 15:07:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 15:07:35] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:07:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 15:07:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4697024387794643886.gal : 1 ms
[2026-05-25 15:07:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16967139823793059382.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4697024387794643886.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16967139823793059382.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality16967139823793059382.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 969
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :969 after 374408
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :374408 after 4.5324e+09
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.66122e+13 after 1.66124e+13
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.66124e+13 after 1.66124e+13
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.66124e+13 after 1.66124e+13
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.66124e+13 after 1.66124e+13
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.66124e+13 after 1.72281e+13
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.72281e+13 after 1.72285e+13
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[247] Max Struct:[255]
Ending property specific reduction for PGCD-PT-D04N050-UpperBounds-07 in 58439 ms.
Starting property specific reduction for PGCD-PT-D04N050-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[255]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[255]
[2026-05-25 15:08:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[255]
RANDOM walk for 10013 steps (2 resets) in 3 ms. (2503 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[171] Max Struct:[255]
[2026-05-25 15:08:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:08:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 15:08:25] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 15:08:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:08:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 15:08:25] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 15:08:25] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:08:25] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:08:25] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:08:25] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[171] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[245] Max Struct:[255]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2026-05-25 15:08:26] [INFO ] Invariant cache hit.
[2026-05-25 15:08:26] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 147ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 147ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 10/10 places, 15/15 transitions.
[2026-05-25 15:08:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[245] Max Struct:[255]
RANDOM walk for 1000066 steps (2 resets) in 129 ms. (7692 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 275 ms. (3623 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[245] Max Struct:[255]
[2026-05-25 15:08:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:08:26] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 15:08:26] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 15:08:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:08:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 15:08:26] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:08:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:08:26] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:08:26] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:08:26] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[245] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[245] Max Struct:[255]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2026-05-25 15:08:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:08:26] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 15:08:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:08:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:08:26] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 15:08:26] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-25 15:08:26] [INFO ] Invariant cache hit.
[2026-05-25 15:08:26] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 128ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 128ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 10/10 places, 15/15 transitions.
[2026-05-25 15:08:26] [INFO ] Flatten gal took : 4 ms
[2026-05-25 15:08:26] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 40129 steps (8 resets) in 17 ms. (2229 steps per ms) remains 2/2 properties
[2026-05-25 15:08:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6140483244404442493.gal : 3 ms
[2026-05-25 15:08:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3217717836419046641.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6140483244404442493.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3217717836419046641.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality3217717836419046641.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 9957
BEST_FIRST walk for 40003 steps (8 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9957 after 46231
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :46231 after 6.44381e+07
Interrupted probabilistic random walk after 796952 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 2
Probabilistic random walk after 796952 steps, saw 465714 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
[2026-05-25 15:08:29] [INFO ] Invariant cache hit.
[2026-05-25 15:08:29] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 15:08:29] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 1 solved, 1 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 1 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 440 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=440 )
Parikh walk visited 1 properties in 5 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[245] Max Struct:[255]
Ending property specific reduction for PGCD-PT-D04N050-UpperBounds-08 in 4156 ms.
Starting property specific reduction for PGCD-PT-D04N050-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[255]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[255]
[2026-05-25 15:08:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[255]
RANDOM walk for 10040 steps (2 resets) in 2 ms. (3346 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[160] Max Struct:[255]
[2026-05-25 15:08:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:08:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 15:08:30] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 15:08:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:08:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 15:08:30] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 15:08:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:08:30] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:08:30] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:08:30] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[160] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[243] Max Struct:[255]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2026-05-25 15:08:30] [INFO ] Invariant cache hit.
[2026-05-25 15:08:30] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 136ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 10/10 places, 15/15 transitions.
[2026-05-25 15:08:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[243] Max Struct:[255]
RANDOM walk for 1000031 steps (2 resets) in 131 ms. (7575 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 207 ms. (4807 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[243] Max Struct:[255]
[2026-05-25 15:08:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:08:30] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 15:08:30] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-25 15:08:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:08:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 15:08:30] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:08:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:08:30] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:08:30] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:08:30] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[243] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[245] Max Struct:[255]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2026-05-25 15:08:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:08:30] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-25 15:08:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:08:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:08:30] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 15:08:30] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-25 15:08:30] [INFO ] Invariant cache hit.
[2026-05-25 15:08:30] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 131ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 131ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 10/10 places, 15/15 transitions.
[2026-05-25 15:08:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[245] Max Struct:[255]
RANDOM walk for 1000063 steps (2 resets) in 130 ms. (7634 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 205 ms. (4854 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[245] Max Struct:[255]
[2026-05-25 15:08:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:08:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 15:08:31] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 15:08:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:08:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 15:08:31] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:08:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:08:31] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 15:08:31] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:08:31] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[245] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249] Max Struct:[255]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2026-05-25 15:08:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:08:31] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-25 15:08:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:08:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:08:31] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 15:08:31] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-25 15:08:31] [INFO ] Invariant cache hit.
[2026-05-25 15:08:31] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 144ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 144ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 10/10 places, 15/15 transitions.
[2026-05-25 15:08:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[249] Max Struct:[255]
RANDOM walk for 1000041 steps (2 resets) in 132 ms. (7519 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 231 ms. (4310 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[249] Max Struct:[255]
[2026-05-25 15:08:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:08:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 15:08:32] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 15:08:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:08:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2026-05-25 15:08:32] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:08:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:08:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2026-05-25 15:08:32] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 15:08:32] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[249] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249] Max Struct:[255]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2026-05-25 15:08:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:08:32] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-25 15:08:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:08:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:08:32] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 15:08:32] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-25 15:08:32] [INFO ] Invariant cache hit.
[2026-05-25 15:08:32] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 131ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 10/10 places, 15/15 transitions.
[2026-05-25 15:08:32] [INFO ] Flatten gal took : 4 ms
[2026-05-25 15:08:32] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 40113 steps (8 resets) in 22 ms. (1744 steps per ms) remains 2/2 properties
[2026-05-25 15:08:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9611743912645854788.gal : 0 ms
[2026-05-25 15:08:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10996774098743324943.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9611743912645854788.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10996774098743324943.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10996774098743324943.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 9957
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9957 after 46231
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :46231 after 6.44381e+07
Interrupted probabilistic random walk after 873469 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :0 out of 2
Probabilistic random walk after 873469 steps, saw 508546 distinct states, run finished after 3001 ms. (steps per millisecond=291 ) properties seen :0
[2026-05-25 15:08:35] [INFO ] Invariant cache hit.
[2026-05-25 15:08:35] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 15:08:35] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 1 solved, 1 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 1 solved, 1 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2026-05-25 15:08:35] [INFO ] Invariant cache hit.
[2026-05-25 15:08:35] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 128ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 128ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 10/10 places, 15/15 transitions.
RANDOM walk for 40116 steps (8 resets) in 13 ms. (2865 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3213869 steps, run timeout after 3001 ms. (steps per millisecond=1070 ) properties seen :0 out of 1
Probabilistic random walk after 3213869 steps, saw 1811633 distinct states, run finished after 3001 ms. (steps per millisecond=1070 ) properties seen :0
[2026-05-25 15:08:38] [INFO ] Invariant cache hit.
[2026-05-25 15:08:38] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 15:08:38] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 0 solved, 1 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 0 solved, 1 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 97ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 129 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2026-05-25 15:08:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:08:38] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-25 15:08:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:08:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:08:38] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 15:08:38] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-25 15:08:38] [INFO ] Invariant cache hit.
[2026-05-25 15:08:38] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 10/10 places, 15/15 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 15:08:39] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:08:39] [INFO ] Applying decomposition
[2026-05-25 15:08:39] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16656812997291076610.txt' '-o' '/tmp/graph16656812997291076610.bin' '-w' '/tmp/graph16656812997291076610.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16656812997291076610.bin' '-l' '-1' '-v' '-w' '/tmp/graph16656812997291076610.weights' '-q' '0' '-e' '0.001'
[2026-05-25 15:08:39] [INFO ] Decomposing Gal with order
[2026-05-25 15:08:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 15:08:39] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:08:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-25 15:08:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3603576596152216254.gal : 1 ms
[2026-05-25 15:08:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2051124138639143532.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3603576596152216254.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2051124138639143532.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality2051124138639143532.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 969
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :969 after 421209
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :421209 after 4.38976e+09
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.66122e+13 after 1.68124e+13
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.68124e+13 after 1.70015e+13
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.70015e+13 after 1.70323e+13
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.70323e+13 after 1.70607e+13
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.70607e+13 after 1.72395e+13
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.01101e+13 after 3.01579e+13
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[249] Max Struct:[255]
Ending property specific reduction for PGCD-PT-D04N050-UpperBounds-10 in 59086 ms.
Starting property specific reduction for PGCD-PT-D04N050-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[255]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[255]
[2026-05-25 15:09:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[255]
RANDOM walk for 10001 steps (2 resets) in 3 ms. (2500 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[159] Max Struct:[255]
[2026-05-25 15:09:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:09:29] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 15:09:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:09:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 15:09:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 15:09:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:09:29] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:09:29] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2026-05-25 15:09:29] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:09:29] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[159] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249] Max Struct:[255]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2026-05-25 15:09:29] [INFO ] Invariant cache hit.
[2026-05-25 15:09:29] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 135ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 10/10 places, 15/15 transitions.
[2026-05-25 15:09:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[249] Max Struct:[255]
RANDOM walk for 1000043 steps (2 resets) in 130 ms. (7633 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 263 ms. (3787 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[249] Max Struct:[255]
[2026-05-25 15:09:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:09:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 15:09:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 15:09:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 15:09:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 15:09:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:09:29] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:09:29] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2026-05-25 15:09:29] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:09:29] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[249] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249] Max Struct:[255]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2026-05-25 15:09:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:09:29] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-25 15:09:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:09:29] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:09:29] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 15:09:29] [INFO ] Redundant transitions in 1 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-25 15:09:29] [INFO ] Invariant cache hit.
[2026-05-25 15:09:29] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 10/10 places, 15/15 transitions.
[2026-05-25 15:09:30] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:09:30] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:09:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4758932773285488994.gal : 1 ms
[2026-05-25 15:09:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality288123147555530749.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4758932773285488994.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality288123147555530749.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40117 steps (8 resets) in 12 ms. (3085 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality288123147555530749.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
BEST_FIRST walk for 40002 steps (8 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 9957
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9957 after 46231
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :46231 after 6.44381e+07
Interrupted probabilistic random walk after 741624 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :0 out of 2
Probabilistic random walk after 741624 steps, saw 433988 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
[2026-05-25 15:09:33] [INFO ] Invariant cache hit.
[2026-05-25 15:09:33] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 15:09:33] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 1 solved, 1 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 1 solved, 1 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2026-05-25 15:09:33] [INFO ] Invariant cache hit.
[2026-05-25 15:09:33] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 151ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 151ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 10/10 places, 15/15 transitions.
RANDOM walk for 40125 steps (8 resets) in 12 ms. (3086 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3214602 steps, run timeout after 3001 ms. (steps per millisecond=1071 ) properties seen :0 out of 1
Probabilistic random walk after 3214602 steps, saw 1812037 distinct states, run finished after 3001 ms. (steps per millisecond=1071 ) properties seen :0
[2026-05-25 15:09:36] [INFO ] Invariant cache hit.
[2026-05-25 15:09:36] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 15:09:36] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 0 solved, 1 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 0 solved, 1 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2026-05-25 15:09:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:09:36] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-25 15:09:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 15:09:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 15:09:36] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 15:09:36] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-25 15:09:36] [INFO ] Invariant cache hit.
[2026-05-25 15:09:36] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 123ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 124ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 10/10 places, 15/15 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 15:09:36] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:09:36] [INFO ] Applying decomposition
[2026-05-25 15:09:36] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph324390243733033925.txt' '-o' '/tmp/graph324390243733033925.bin' '-w' '/tmp/graph324390243733033925.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph324390243733033925.bin' '-l' '-1' '-v' '-w' '/tmp/graph324390243733033925.weights' '-q' '0' '-e' '0.001'
[2026-05-25 15:09:36] [INFO ] Decomposing Gal with order
[2026-05-25 15:09:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 15:09:36] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:09:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-25 15:09:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6307711327565971666.gal : 0 ms
[2026-05-25 15:09:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8002676576189088682.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6307711327565971666.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8002676576189088682.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality8002676576189088682.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 969
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :969 after 374408
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :374408 after 1.52454e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.66122e+13 after 1.66127e+13
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.66127e+13 after 1.66152e+13
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.66152e+13 after 1.66484e+13
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.66484e+13 after 1.66484e+13
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.66484e+13 after 1.66484e+13
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.66484e+13 after 1.66484e+13
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[249] Max Struct:[255]
Ending property specific reduction for PGCD-PT-D04N050-UpperBounds-13 in 57764 ms.
[2026-05-25 15:10:26] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:10:26] [INFO ] Applying decomposition
[2026-05-25 15:10:26] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16734049875558345634.txt' '-o' '/tmp/graph16734049875558345634.bin' '-w' '/tmp/graph16734049875558345634.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16734049875558345634.bin' '-l' '-1' '-v' '-w' '/tmp/graph16734049875558345634.weights' '-q' '0' '-e' '0.001'
[2026-05-25 15:10:26] [INFO ] Decomposing Gal with order
[2026-05-25 15:10:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 15:10:26] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:10:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-25 15:10:26] [INFO ] Time to serialize gal into /tmp/UpperBounds12346901674040682863.gal : 1 ms
[2026-05-25 15:10:26] [INFO ] Time to serialize properties into /tmp/UpperBounds8259819456020545381.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12346901674040682863.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8259819456020545381.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds8259819456020545381.prop.
Detected timeout of ITS tools.
[2026-05-25 15:31:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:31:52] [INFO ] Time to serialize gal into /tmp/UpperBounds8619679520086309376.gal : 1 ms
[2026-05-25 15:31:52] [INFO ] Time to serialize properties into /tmp/UpperBounds10545178260867800897.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8619679520086309376.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10545178260867800897.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds10545178260867800897.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9.33482e+14,246.479,2215492,2,4596,5,7.96874e+06,6,0,73,8.07218e+06,0
Total reachable state count : 933481841500756

Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 249
Bounds property PGCD-PT-D04N050-UpperBounds-07 :0 <= p1_2 <= 249
FORMULA PGCD-PT-D04N050-UpperBounds-09 249 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
FORMULA PGCD-PT-D04N050-UpperBounds-15 249 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
FORMULA PGCD-PT-D04N050-UpperBounds-07 249 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-PT-D04N050-UpperBounds-07,0,246.722,2215492,1,0,7,7.96874e+06,9,1,350,8.07218e+06,4
Min sum of variable value : 0
Maximum sum along a path : 249
Bounds property PGCD-PT-D04N050-UpperBounds-08 :0 <= p1_3 <= 249
FORMULA PGCD-PT-D04N050-UpperBounds-08 249 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-PT-D04N050-UpperBounds-08,0,246.914,2215492,1,0,8,7.96874e+06,10,1,611,8.07218e+06,5
Min sum of variable value : 0
Maximum sum along a path : 249
Bounds property PGCD-PT-D04N050-UpperBounds-10 :0 <= p1_5 <= 249
FORMULA PGCD-PT-D04N050-UpperBounds-12 249 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
FORMULA PGCD-PT-D04N050-UpperBounds-10 249 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-PT-D04N050-UpperBounds-10,0,246.916,2215492,1,0,9,7.96874e+06,11,1,864,8.07218e+06,6
Min sum of variable value : 0
Maximum sum along a path : 249
Bounds property PGCD-PT-D04N050-UpperBounds-13 :0 <= p1_4 <= 249
FORMULA PGCD-PT-D04N050-UpperBounds-13 249 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-PT-D04N050-UpperBounds-13,0,246.983,2215492,1,0,10,7.96874e+06,12,1,1121,8.07218e+06,7
Total runtime 1790169 ms.

BK_STOP 1779723359486

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="PGCD-PT-D04N050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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 gold2025"
echo " Input is PGCD-PT-D04N050, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r207-tall-177969919800106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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