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.r175-smll-177961111800026.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 JoinFreeModules-PT-0500, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-177961111800026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.2K Mar 7 16:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 7 16:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 7 16:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 7 16:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Mar 15 11:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 11:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 11:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 16:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 7 16:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 7 16:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 7 16:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 11:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 JoinFreeModules-PT-0500-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779737443708

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0500
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 19:30:46] [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 19:30:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:30:47] [INFO ] Load time of PNML (sax parser for PT used): 665 ms
[2026-05-25 19:30:47] [INFO ] Transformed 2501 places.
[2026-05-25 19:30:47] [INFO ] Transformed 4001 transitions.
[2026-05-25 19:30:47] [INFO ] Parsed PT model containing 2501 places and 4001 transitions and 11502 arcs in 999 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[2, 1, 500, 0, 0, 0, 2, 0, 0, 2, 500, 0, 0, 2, 500, 500] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[2, 1, 500, 0, 0, 0, 2, 0, 0, 2, 500, 0, 0, 2, 500, 500] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 4001 rows 2500 cols
[2026-05-25 19:30:47] [INFO ] Computed 500 invariants in 81 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 1, 500, 0, 0, 0, 2, 0, 0, 2, 500, 0, 0, 2, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
RANDOM walk for 10030 steps (2 resets) in 600 ms. (16 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 6271 ms. (25 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 5, 500, 4, 4, 4, 2, 4, 4, 2, 500, 4, 4, 2, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
[2026-05-25 19:30:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:30:55] [INFO ] [Real]Absence check using 500 positive place invariants in 355 ms returned sat
[2026-05-25 19:30:58] [INFO ] [Real]Absence check using state equation in 2425 ms returned sat
[2026-05-25 19:30:58] [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 19:30:59] [INFO ] [Nat]Absence check using 500 positive place invariants in 189 ms returned sat
[2026-05-25 19:31:01] [INFO ] [Nat]Absence check using state equation in 2019 ms returned sat
[2026-05-25 19:31:01] [INFO ] State equation strengthened by 500 read => feed constraints.
[2026-05-25 19:31:02] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:31:02] [INFO ] [Nat]Added 500 Read/Feed constraints in 700 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:31:03] [INFO ] Deduced a trap composed of 3 places in 1108 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:31:04] [INFO ] Deduced a trap composed of 3 places in 924 ms of which 34 ms to minimize.
[2026-05-25 19:31:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:31:05] [INFO ] [Real]Absence check using 500 positive place invariants in 275 ms returned sat
[2026-05-25 19:31:07] [INFO ] [Real]Absence check using state equation in 2282 ms returned sat
[2026-05-25 19:31:08] [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 19:31:08] [INFO ] [Nat]Absence check using 500 positive place invariants in 240 ms returned sat
[2026-05-25 19:31:10] [INFO ] [Nat]Absence check using state equation in 1964 ms returned sat
[2026-05-25 19:31:11] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:31:11] [INFO ] [Nat]Added 500 Read/Feed constraints in 799 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:31:13] [INFO ] Deduced a trap composed of 3 places in 1190 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:31:18] [INFO ] Deduced a trap composed of 3 places in 5480 ms of which 1403 ms to minimize.
[2026-05-25 19:31:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:31:19] [INFO ] [Real]Absence check using 500 positive place invariants in 256 ms returned sat
[2026-05-25 19:31:21] [INFO ] [Real]Absence check using state equation in 2270 ms returned sat
[2026-05-25 19:31:21] [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 19:31:22] [INFO ] [Nat]Absence check using 500 positive place invariants in 280 ms returned sat
[2026-05-25 19:31:26] [INFO ] [Nat]Absence check using state equation in 3328 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:31:26] [INFO ] [Real]Absence check using 500 positive place invariants in 244 ms returned sat
[2026-05-25 19:31:28] [INFO ] [Real]Absence check using state equation in 2061 ms returned sat
[2026-05-25 19:31: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 19:31:29] [INFO ] [Nat]Absence check using 500 positive place invariants in 215 ms returned sat
[2026-05-25 19:31:32] [INFO ] [Nat]Absence check using state equation in 2323 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:31:32] [INFO ] [Real]Absence check using 500 positive place invariants in 177 ms returned sat
[2026-05-25 19:31:35] [INFO ] [Real]Absence check using state equation in 2187 ms returned sat
[2026-05-25 19:31:35] [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 19:31:36] [INFO ] [Nat]Absence check using 500 positive place invariants in 256 ms returned sat
[2026-05-25 19:31:38] [INFO ] [Nat]Absence check using state equation in 2126 ms returned sat
[2026-05-25 19:31:38] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:31:38] [INFO ] [Nat]Added 500 Read/Feed constraints in 612 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:31:39] [INFO ] Deduced a trap composed of 3 places in 834 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:31:40] [INFO ] Deduced a trap composed of 3 places in 965 ms of which 52 ms to minimize.
[2026-05-25 19:31:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:31:41] [INFO ] [Real]Absence check using 500 positive place invariants in 244 ms returned sat
[2026-05-25 19:31:43] [INFO ] [Real]Absence check using state equation in 1864 ms returned sat
[2026-05-25 19:31:43] [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 19:31:44] [INFO ] [Nat]Absence check using 500 positive place invariants in 182 ms returned sat
[2026-05-25 19:31:46] [INFO ] [Nat]Absence check using state equation in 1990 ms returned sat
[2026-05-25 19:31:46] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:31:47] [INFO ] [Nat]Added 500 Read/Feed constraints in 627 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:31:48] [INFO ] Deduced a trap composed of 3 places in 1080 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:31:49] [INFO ] Deduced a trap composed of 3 places in 1038 ms of which 51 ms to minimize.
[2026-05-25 19:31:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:31:50] [INFO ] [Real]Absence check using 500 positive place invariants in 209 ms returned sat
[2026-05-25 19:31:52] [INFO ] [Real]Absence check using state equation in 2344 ms returned sat
[2026-05-25 19:31:53] [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 19:31:53] [INFO ] [Nat]Absence check using 500 positive place invariants in 192 ms returned sat
[2026-05-25 19:31:55] [INFO ] [Nat]Absence check using state equation in 2044 ms returned sat
[2026-05-25 19:31:56] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:31:56] [INFO ] [Nat]Added 500 Read/Feed constraints in 746 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:31:57] [INFO ] Deduced a trap composed of 3 places in 1002 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:31:58] [INFO ] Deduced a trap composed of 3 places in 1081 ms of which 55 ms to minimize.
[2026-05-25 19:31:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:31:59] [INFO ] [Real]Absence check using 500 positive place invariants in 262 ms returned sat
[2026-05-25 19:32:01] [INFO ] [Real]Absence check using state equation in 2082 ms returned sat
[2026-05-25 19:32:02] [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 19:32:02] [INFO ] [Nat]Absence check using 500 positive place invariants in 246 ms returned sat
[2026-05-25 19:32:04] [INFO ] [Nat]Absence check using state equation in 1954 ms returned sat
[2026-05-25 19:32:05] [INFO ] [Nat]Added 500 Read/Feed constraints in 544 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:32:06] [INFO ] Deduced a trap composed of 3 places in 899 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:32:07] [INFO ] Deduced a trap composed of 3 places in 1007 ms of which 54 ms to minimize.
[2026-05-25 19:32:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:32:08] [INFO ] [Real]Absence check using 500 positive place invariants in 216 ms returned sat
[2026-05-25 19:32:10] [INFO ] [Real]Absence check using state equation in 2316 ms returned sat
[2026-05-25 19:32: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 19:32:11] [INFO ] [Nat]Absence check using 500 positive place invariants in 286 ms returned sat
[2026-05-25 19:32:13] [INFO ] [Nat]Absence check using state equation in 2353 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:32:14] [INFO ] [Real]Absence check using 500 positive place invariants in 273 ms returned sat
[2026-05-25 19:32:16] [INFO ] [Real]Absence check using state equation in 2081 ms returned sat
[2026-05-25 19:32:16] [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 19:32:17] [INFO ] [Nat]Absence check using 500 positive place invariants in 286 ms returned sat
[2026-05-25 19:32:19] [INFO ] [Nat]Absence check using state equation in 2115 ms returned sat
[2026-05-25 19:32:20] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:32:20] [INFO ] [Nat]Added 500 Read/Feed constraints in 640 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:32:21] [INFO ] Deduced a trap composed of 3 places in 890 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:32:22] [INFO ] Deduced a trap composed of 3 places in 972 ms of which 54 ms to minimize.
[2026-05-25 19:32:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:32:23] [INFO ] [Real]Absence check using 500 positive place invariants in 268 ms returned sat
[2026-05-25 19:32:25] [INFO ] [Real]Absence check using state equation in 2128 ms returned sat
[2026-05-25 19:32: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 19:32:26] [INFO ] [Nat]Absence check using 500 positive place invariants in 267 ms returned sat
[2026-05-25 19:32:28] [INFO ] [Nat]Absence check using state equation in 2192 ms returned sat
[2026-05-25 19:32:29] [INFO ] [Nat]Added 500 Read/Feed constraints in 413 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:32:30] [INFO ] Deduced a trap composed of 3 places in 899 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:32:31] [INFO ] Deduced a trap composed of 3 places in 1004 ms of which 34 ms to minimize.
[2026-05-25 19:32:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:32:31] [INFO ] [Real]Absence check using 500 positive place invariants in 212 ms returned sat
[2026-05-25 19:32:34] [INFO ] [Real]Absence check using state equation in 2082 ms returned sat
[2026-05-25 19:32:34] [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 19:32:34] [INFO ] [Nat]Absence check using 500 positive place invariants in 246 ms returned sat
[2026-05-25 19:32:37] [INFO ] [Nat]Absence check using state equation in 2403 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:32:37] [INFO ] [Real]Absence check using 500 positive place invariants in 181 ms returned sat
[2026-05-25 19:32:39] [INFO ] [Real]Absence check using state equation in 2016 ms returned sat
[2026-05-25 19:32:40] [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 19:32:40] [INFO ] [Nat]Absence check using 500 positive place invariants in 290 ms returned sat
[2026-05-25 19:32:42] [INFO ] [Nat]Absence check using state equation in 1987 ms returned sat
[2026-05-25 19:32:43] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:32:43] [INFO ] [Nat]Added 500 Read/Feed constraints in 592 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:32:44] [INFO ] Deduced a trap composed of 3 places in 1038 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:32:45] [INFO ] Deduced a trap composed of 3 places in 940 ms of which 34 ms to minimize.
[2026-05-25 19:32:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:32:46] [INFO ] [Real]Absence check using 500 positive place invariants in 258 ms returned sat
[2026-05-25 19:32:48] [INFO ] [Real]Absence check using state equation in 2025 ms returned sat
[2026-05-25 19:32:48] [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 19:32:49] [INFO ] [Nat]Absence check using 500 positive place invariants in 205 ms returned sat
[2026-05-25 19:32:51] [INFO ] [Nat]Absence check using state equation in 2184 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:32:52] [INFO ] [Real]Absence check using 500 positive place invariants in 183 ms returned sat
[2026-05-25 19:32:54] [INFO ] [Real]Absence check using state equation in 2032 ms returned sat
[2026-05-25 19:32:54] [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 19:32:55] [INFO ] [Nat]Absence check using 500 positive place invariants in 281 ms returned sat
[2026-05-25 19:32:57] [INFO ] [Nat]Absence check using state equation in 2094 ms returned sat
[2026-05-25 19:32:57] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:32:57] [INFO ] [Nat]Added 500 Read/Feed constraints in 648 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:32:58] [INFO ] Deduced a trap composed of 3 places in 807 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:32:59] [INFO ] Deduced a trap composed of 3 places in 784 ms of which 44 ms to minimize.
[2026-05-25 19:32:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:33:00] [INFO ] [Real]Absence check using 500 positive place invariants in 252 ms returned sat
[2026-05-25 19:33:02] [INFO ] [Real]Absence check using state equation in 1927 ms returned sat
[2026-05-25 19:33:02] [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 19:33:03] [INFO ] [Nat]Absence check using 500 positive place invariants in 164 ms returned sat
[2026-05-25 19:33:05] [INFO ] [Nat]Absence check using state equation in 1891 ms returned sat
[2026-05-25 19:33:05] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:33:05] [INFO ] [Nat]Added 500 Read/Feed constraints in 681 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:33:06] [INFO ] Deduced a trap composed of 3 places in 903 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:33:07] [INFO ] Deduced a trap composed of 3 places in 865 ms of which 34 ms to minimize.
[2026-05-25 19:33:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 15
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Current structural bounds on expressions (after SMT) : Max Seen:[2, 5, 500, 4, 4, 4, 2, 4, 4, 2, 500, 4, 4, 2, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 5, 500, 4, 4, 4, 2, 4, 4, 2, 500, 4, 4, 2, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Support contains 16 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 80 are kept as prefixes of interest. Removing 2420 places using SCC suffix rule.10 ms
Discarding 2420 places :
Also discarding 3872 output transitions
Drop transitions (Output transitions of discarded places.) removed 3872 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 128
Applied a total of 2 rules in 57 ms. Remains 80 /2500 variables (removed 2420) and now considering 128/4001 (removed 3873) transitions.
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 80 cols
[2026-05-25 19:33:08] [INFO ] Computed 16 invariants in 10 ms
[2026-05-25 19:33:08] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 208 constraints, problems are : Problem set: 0 solved, 96 unsolved in 12551 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18646ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 18657ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18732 ms. Remains : 80/2500 places, 128/4001 transitions.
[2026-05-25 19:33:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 5, 500, 4, 4, 4, 2, 4, 4, 2, 500, 4, 4, 2, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
RANDOM walk for 1000159 steps (2 resets) in 1694 ms. (590 steps per ms)
BEST_FIRST walk for 16000015 steps (32 resets) in 25964 ms. (616 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[464, 501, 500, 502, 500, 480, 486, 501, 501, 493, 500, 500, 502, 497, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
[2026-05-25 19:33:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:33:54] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-25 19:33:54] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-25 19:33:54] [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 19:33:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-25 19:33:54] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2026-05-25 19:33:54] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 19:33:54] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2026-05-25 19:33:54] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 19:33:54] [INFO ] Added : 51 causal constraints over 11 iterations in 158 ms. Result :sat
Minimization took 94 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:33:54] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:33:54] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-25 19:33:54] [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 19:33:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:33:55] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2026-05-25 19:33:55] [INFO ] [Nat]Added 16 Read/Feed constraints in 195 ms returned sat
[2026-05-25 19:33:55] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 17 ms.
[2026-05-25 19:33:55] [INFO ] Added : 64 causal constraints over 13 iterations in 303 ms. Result :sat
Minimization took 74 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:33:55] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2026-05-25 19:33:55] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2026-05-25 19:33:55] [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 19:33:55] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2026-05-25 19:33:55] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2026-05-25 19:33:56] [INFO ] [Nat]Added 16 Read/Feed constraints in 147 ms returned sat
[2026-05-25 19:33:56] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 17 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:33:56] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 4 ms to minimize.
[2026-05-25 19:33:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2026-05-25 19:33:56] [INFO ] Added : 54 causal constraints over 12 iterations in 466 ms. Result :sat
Minimization took 81 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:33:56] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2026-05-25 19:33:56] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2026-05-25 19:33:56] [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 19:33:56] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-25 19:33:56] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-25 19:33:57] [INFO ] [Nat]Added 16 Read/Feed constraints in 466 ms returned sat
[2026-05-25 19:33:57] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 16 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:33:57] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
[2026-05-25 19:33:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2026-05-25 19:33:57] [INFO ] Added : 63 causal constraints over 14 iterations in 397 ms. Result :sat
Minimization took 54 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:33:57] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:33:57] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2026-05-25 19:33:57] [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 19:33:58] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2026-05-25 19:33:58] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2026-05-25 19:33:58] [INFO ] [Nat]Added 16 Read/Feed constraints in 7 ms returned sat
[2026-05-25 19:33:58] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 14 ms.
[2026-05-25 19:33:58] [INFO ] Added : 60 causal constraints over 13 iterations in 564 ms. Result :sat
Minimization took 71 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:33:58] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-25 19:33:58] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-25 19:33:58] [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 19:33:58] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:33:59] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2026-05-25 19:33:59] [INFO ] [Nat]Added 16 Read/Feed constraints in 282 ms returned sat
[2026-05-25 19:33:59] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 18 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:33:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 3 ms to minimize.
[2026-05-25 19:33:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2026-05-25 19:33:59] [INFO ] Added : 62 causal constraints over 13 iterations in 503 ms. Result :sat
Minimization took 142 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:34:00] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:34:00] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-25 19:34:00] [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 19:34:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:34:00] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2026-05-25 19:34:00] [INFO ] [Nat]Added 16 Read/Feed constraints in 228 ms returned sat
[2026-05-25 19:34:00] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 13 ms.
[2026-05-25 19:34:01] [INFO ] Added : 41 causal constraints over 11 iterations in 261 ms. Result :sat
Minimization took 66 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:34:01] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-25 19:34:01] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2026-05-25 19:34:01] [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 19:34:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:34:01] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2026-05-25 19:34:01] [INFO ] [Nat]Added 16 Read/Feed constraints in 190 ms returned sat
[2026-05-25 19:34:01] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 14 ms.
[2026-05-25 19:34:01] [INFO ] Added : 58 causal constraints over 12 iterations in 201 ms. Result :sat
Minimization took 47 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:34:01] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:34:01] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-25 19:34:01] [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 19:34:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:34:02] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2026-05-25 19:34:02] [INFO ] [Nat]Added 16 Read/Feed constraints in 556 ms returned sat
[2026-05-25 19:34:02] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 11 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:34:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
[2026-05-25 19:34:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2026-05-25 19:34:02] [INFO ] Added : 56 causal constraints over 13 iterations in 305 ms. Result :sat
Minimization took 66 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:34:03] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2026-05-25 19:34:03] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-25 19:34:03] [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 19:34:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:34:03] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
[2026-05-25 19:34:03] [INFO ] [Nat]Added 16 Read/Feed constraints in 335 ms returned sat
[2026-05-25 19:34:03] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 19:34:04] [INFO ] Added : 54 causal constraints over 12 iterations in 243 ms. Result :sat
Minimization took 46 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:34:04] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-25 19:34:04] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2026-05-25 19:34:04] [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 19:34:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2026-05-25 19:34:04] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2026-05-25 19:34:04] [INFO ] [Nat]Added 16 Read/Feed constraints in 161 ms returned sat
[2026-05-25 19:34:04] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-25 19:34:04] [INFO ] Added : 48 causal constraints over 11 iterations in 123 ms. Result :sat
Minimization took 38 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:34:04] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-25 19:34:04] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2026-05-25 19:34:04] [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 19:34:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:34:04] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2026-05-25 19:34:05] [INFO ] [Nat]Added 16 Read/Feed constraints in 492 ms returned sat
[2026-05-25 19:34:05] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 14 ms.
[2026-05-25 19:34:05] [INFO ] Added : 70 causal constraints over 16 iterations in 546 ms. Result :sat
Minimization took 100 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:34:06] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-25 19:34:06] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2026-05-25 19:34:06] [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 19:34:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-25 19:34:06] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2026-05-25 19:34:06] [INFO ] [Nat]Added 16 Read/Feed constraints in 328 ms returned sat
[2026-05-25 19:34:06] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 15 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:34:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
[2026-05-25 19:34:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2026-05-25 19:34:06] [INFO ] Added : 61 causal constraints over 14 iterations in 314 ms. Result :sat
Minimization took 52 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:34:07] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-25 19:34:07] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2026-05-25 19:34:07] [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 19:34:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:34:07] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2026-05-25 19:34:07] [INFO ] [Nat]Added 16 Read/Feed constraints in 95 ms returned sat
[2026-05-25 19:34:07] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 13 ms.
[2026-05-25 19:34:07] [INFO ] Added : 44 causal constraints over 10 iterations in 183 ms. Result :sat
Minimization took 60 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:34:07] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2026-05-25 19:34:07] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-25 19:34:07] [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 19:34:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:34:08] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2026-05-25 19:34:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 383 ms returned sat
[2026-05-25 19:34:08] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-25 19:34:08] [INFO ] Added : 41 causal constraints over 9 iterations in 267 ms. Result :sat
Minimization took 36 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:34:08] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-25 19:34:08] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2026-05-25 19:34:08] [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 19:34:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-25 19:34:09] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2026-05-25 19:34:09] [INFO ] [Nat]Added 16 Read/Feed constraints in 190 ms returned sat
[2026-05-25 19:34:09] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 19:34:09] [INFO ] Added : 46 causal constraints over 10 iterations in 132 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[464, 501, 500, 502, 500, 480, 486, 501, 501, 493, 500, 500, 502, 497, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[502, 501, 500, 502, 500, 501, 502, 501, 501, 502, 500, 502, 502, 502, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 7 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 80/80 places, 128/128 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2026-05-25 19:34:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:34:51] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 19:34:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:34:52] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 19:34:52] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:34:52] [INFO ] Redundant transitions in 4 ms returned []
Running 96 sub problems to find dead transitions.
[2026-05-25 19:34:52] [INFO ] Invariant cache hit.
[2026-05-25 19:34:52] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5169 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 208 constraints, problems are : Problem set: 0 solved, 96 unsolved in 17850 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23045ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 23046ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23192 ms. Remains : 80/80 places, 128/128 transitions.
[2026-05-25 19:35:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[502, 501, 500, 502, 500, 501, 502, 501, 501, 502, 500, 502, 502, 502, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
RANDOM walk for 1000040 steps (2 resets) in 1311 ms. (762 steps per ms)
FORMULA JoinFreeModules-PT-0500-UpperBounds-12 503 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 15000015 steps (30 resets) in 27045 ms. (554 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[502, 501, 500, 502, 502, 501, 502, 501, 502, 502, 500, 502, 502, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
[2026-05-25 19:35:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:35:43] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-25 19:35:43] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2026-05-25 19:35:43] [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 19:35:43] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-25 19:35:43] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2026-05-25 19:35:43] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 19:35:43] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2026-05-25 19:35:43] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-25 19:35:43] [INFO ] Added : 52 causal constraints over 13 iterations in 155 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:35:44] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-25 19:35:44] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2026-05-25 19:35:44] [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 19:35:44] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-25 19:35:44] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2026-05-25 19:35:44] [INFO ] [Nat]Added 16 Read/Feed constraints in 120 ms returned sat
[2026-05-25 19:35:44] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-25 19:35:44] [INFO ] Added : 64 causal constraints over 13 iterations in 189 ms. Result :sat
Minimization took 46 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:35:44] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-25 19:35:44] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2026-05-25 19:35:44] [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 19:35:44] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-25 19:35:44] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2026-05-25 19:35:44] [INFO ] [Nat]Added 16 Read/Feed constraints in 90 ms returned sat
[2026-05-25 19:35:44] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:35:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
[2026-05-25 19:35:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2026-05-25 19:35:45] [INFO ] Added : 54 causal constraints over 12 iterations in 281 ms. Result :sat
Minimization took 51 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:35:45] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-25 19:35:45] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-25 19:35:45] [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 19:35:45] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-25 19:35:45] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2026-05-25 19:35:45] [INFO ] [Nat]Added 16 Read/Feed constraints in 288 ms returned sat
[2026-05-25 19:35:45] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:35:45] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
[2026-05-25 19:35:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2026-05-25 19:35:45] [INFO ] Added : 63 causal constraints over 14 iterations in 263 ms. Result :sat
Minimization took 36 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:35:45] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-25 19:35:46] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2026-05-25 19:35:46] [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 19:35:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-25 19:35:46] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2026-05-25 19:35:46] [INFO ] [Nat]Added 16 Read/Feed constraints in 422 ms returned sat
[2026-05-25 19:35:46] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:35:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
[2026-05-25 19:35:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2026-05-25 19:35:46] [INFO ] Added : 42 causal constraints over 10 iterations in 170 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:35:46] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-25 19:35:46] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2026-05-25 19:35:46] [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 19:35:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-25 19:35:46] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-25 19:35:47] [INFO ] [Nat]Added 16 Read/Feed constraints in 277 ms returned sat
[2026-05-25 19:35:47] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 12 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:35:47] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
[2026-05-25 19:35:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2026-05-25 19:35:47] [INFO ] Added : 52 causal constraints over 11 iterations in 214 ms. Result :sat
Minimization took 56 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:35:47] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-25 19:35:47] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2026-05-25 19:35:47] [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 19:35:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-25 19:35:48] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2026-05-25 19:35:48] [INFO ] [Nat]Added 16 Read/Feed constraints in 144 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:35:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
[2026-05-25 19:35:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:35:48] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2026-05-25 19:35:48] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2026-05-25 19:35:48] [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 19:35:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2026-05-25 19:35:48] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2026-05-25 19:35:48] [INFO ] [Nat]Added 16 Read/Feed constraints in 325 ms returned sat
[2026-05-25 19:35:48] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 16 ms.
[2026-05-25 19:35:49] [INFO ] Added : 58 causal constraints over 12 iterations in 235 ms. Result :sat
Minimization took 69 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:35:49] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-25 19:35:49] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2026-05-25 19:35:49] [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 19:35:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2026-05-25 19:35:50] [INFO ] [Nat]Absence check using state equation in 667 ms returned sat
[2026-05-25 19:35:50] [INFO ] [Nat]Added 16 Read/Feed constraints in 96 ms returned sat
[2026-05-25 19:35:50] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 14 ms.
[2026-05-25 19:35:50] [INFO ] Added : 45 causal constraints over 10 iterations in 190 ms. Result :sat
Minimization took 46 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:35:50] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:35:50] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-25 19:35:50] [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 19:35:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:35:50] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-25 19:35:50] [INFO ] [Nat]Added 16 Read/Feed constraints in 279 ms returned sat
[2026-05-25 19:35:50] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 14 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:35:51] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:35:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
[2026-05-25 19:35:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2026-05-25 19:35:51] [INFO ] Added : 70 causal constraints over 16 iterations in 645 ms. Result :sat
Minimization took 55 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:35:51] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:35:51] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-25 19:35:51] [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 19:35:51] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:35:51] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2026-05-25 19:35:52] [INFO ] [Nat]Added 16 Read/Feed constraints in 284 ms returned sat
[2026-05-25 19:35:52] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 14 ms.
[2026-05-25 19:35:52] [INFO ] Added : 48 causal constraints over 11 iterations in 191 ms. Result :sat
Minimization took 59 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:35:52] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-25 19:35:52] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-25 19:35:52] [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 19:35:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:35:52] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2026-05-25 19:35:53] [INFO ] [Nat]Added 16 Read/Feed constraints in 560 ms returned sat
[2026-05-25 19:35:53] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-25 19:35:53] [INFO ] Added : 62 causal constraints over 14 iterations in 238 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:35:53] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-25 19:35:53] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2026-05-25 19:35:53] [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 19:35:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-25 19:35:53] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-25 19:35:53] [INFO ] [Nat]Added 16 Read/Feed constraints in 197 ms returned sat
[2026-05-25 19:35:53] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 14 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:35:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
[2026-05-25 19:35:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
Minimization took 42 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:35:54] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:35:54] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-25 19:35:54] [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 19:35:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:35:54] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2026-05-25 19:35:55] [INFO ] [Nat]Added 16 Read/Feed constraints in 400 ms returned sat
[2026-05-25 19:35:55] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-25 19:35:55] [INFO ] Added : 41 causal constraints over 9 iterations in 211 ms. Result :sat
Minimization took 35 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:35:55] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-25 19:35:55] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2026-05-25 19:35:55] [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 19:35:55] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-25 19:35:55] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2026-05-25 19:35:56] [INFO ] [Nat]Added 16 Read/Feed constraints in 323 ms returned sat
[2026-05-25 19:35:56] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-25 19:35:56] [INFO ] Added : 46 causal constraints over 10 iterations in 120 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[502, 501, 500, 502, 502, 501, 502, 501, 502, 502, 500, 502, 502, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 502, 503, 503, 503, 503, 503, 502, 503, 503]
FORMULA JoinFreeModules-PT-0500-UpperBounds-13 502 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0500-UpperBounds-06 502 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[502, 501, 500, 502, 502, 501, 501, 502, 502, 500, 502, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Support contains 13 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 65 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 6 ms. Remains 65 /80 variables (removed 15) and now considering 104/128 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 65/80 places, 104/128 transitions.
// Phase 1: matrix 104 rows 65 cols
[2026-05-25 19:36:28] [INFO ] Computed 13 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[502, 501, 500, 502, 502, 501, 501, 502, 502, 500, 502, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
RANDOM walk for 1000022 steps (2 resets) in 1274 ms. (784 steps per ms)
FORMULA JoinFreeModules-PT-0500-UpperBounds-07 503 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 12000012 steps (24 resets) in 19260 ms. (623 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[502, 501, 500, 502, 502, 501, 502, 502, 500, 502, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
[2026-05-25 19:36:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:36:49] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2026-05-25 19:36:49] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-25 19:36:49] [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 19:36:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2026-05-25 19:36:49] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2026-05-25 19:36:49] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 19:36:49] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2026-05-25 19:36:49] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:36:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
[2026-05-25 19:36:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
Minimization took 27 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:36:50] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2026-05-25 19:36:50] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-25 19:36:50] [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 19:36:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2026-05-25 19:36:50] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2026-05-25 19:36:50] [INFO ] [Nat]Added 13 Read/Feed constraints in 152 ms returned sat
[2026-05-25 19:36:50] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-25 19:36:50] [INFO ] Added : 37 causal constraints over 10 iterations in 151 ms. Result :sat
Minimization took 48 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:36:50] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2026-05-25 19:36:50] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2026-05-25 19:36:50] [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 19:36:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2026-05-25 19:36:50] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2026-05-25 19:36:51] [INFO ] [Nat]Added 13 Read/Feed constraints in 437 ms returned sat
[2026-05-25 19:36:51] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-25 19:36:51] [INFO ] Added : 62 causal constraints over 14 iterations in 207 ms. Result :sat
Minimization took 54 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:36:51] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2026-05-25 19:36:51] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2026-05-25 19:36:51] [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 19:36:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2026-05-25 19:36:51] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2026-05-25 19:36:52] [INFO ] [Nat]Added 13 Read/Feed constraints in 279 ms returned sat
[2026-05-25 19:36:52] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-25 19:36:52] [INFO ] Added : 75 causal constraints over 18 iterations in 295 ms. Result :sat
Minimization took 51 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:36:52] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2026-05-25 19:36:52] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2026-05-25 19:36:52] [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 19:36:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2026-05-25 19:36:52] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2026-05-25 19:36:52] [INFO ] [Nat]Added 13 Read/Feed constraints in 6 ms returned sat
[2026-05-25 19:36:52] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 13 ms.
[2026-05-25 19:36:53] [INFO ] Added : 49 causal constraints over 11 iterations in 668 ms. Result :sat
Minimization took 43 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:36:53] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2026-05-25 19:36:53] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2026-05-25 19:36:53] [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 19:36:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2026-05-25 19:36:53] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2026-05-25 19:36:54] [INFO ] [Nat]Added 13 Read/Feed constraints in 277 ms returned sat
[2026-05-25 19:36:54] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 13 ms.
[2026-05-25 19:36:54] [INFO ] Added : 50 causal constraints over 11 iterations in 373 ms. Result :sat
Minimization took 69 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:36:54] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2026-05-25 19:36:54] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2026-05-25 19:36:54] [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 19:36:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2026-05-25 19:36:55] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2026-05-25 19:36:55] [INFO ] [Nat]Added 13 Read/Feed constraints in 269 ms returned sat
[2026-05-25 19:36:55] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-25 19:36:55] [INFO ] Added : 26 causal constraints over 6 iterations in 105 ms. Result :sat
Minimization took 35 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:36:55] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2026-05-25 19:36:55] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2026-05-25 19:36:55] [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 19:36:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2026-05-25 19:36:56] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2026-05-25 19:36:56] [INFO ] [Nat]Added 13 Read/Feed constraints in 439 ms returned sat
[2026-05-25 19:36:56] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-25 19:36:56] [INFO ] Added : 34 causal constraints over 8 iterations in 117 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:36:56] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2026-05-25 19:36:56] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2026-05-25 19:36:56] [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 19:36:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2026-05-25 19:36:57] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2026-05-25 19:36:57] [INFO ] [Nat]Added 13 Read/Feed constraints in 245 ms returned sat
[2026-05-25 19:36:57] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:36:57] [INFO ] Added : 34 causal constraints over 7 iterations in 72 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:36:57] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2026-05-25 19:36:57] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-25 19:36:57] [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 19:36:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2026-05-25 19:36:57] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2026-05-25 19:36:57] [INFO ] [Nat]Added 13 Read/Feed constraints in 37 ms returned sat
[2026-05-25 19:36:57] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 19:36:58] [INFO ] Added : 46 causal constraints over 11 iterations in 170 ms. Result :sat
Minimization took 33 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:36:58] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2026-05-25 19:36:58] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2026-05-25 19:36:58] [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 19:36:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2026-05-25 19:36:58] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2026-05-25 19:36:58] [INFO ] [Nat]Added 13 Read/Feed constraints in 158 ms returned sat
[2026-05-25 19:36:58] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:36:58] [INFO ] Added : 55 causal constraints over 14 iterations in 166 ms. Result :sat
Minimization took 36 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:36:58] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2026-05-25 19:36:58] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-25 19:36:58] [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 19:36:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2026-05-25 19:36:58] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2026-05-25 19:36:58] [INFO ] [Nat]Added 13 Read/Feed constraints in 188 ms returned sat
[2026-05-25 19:36:58] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 19:36:59] [INFO ] Added : 64 causal constraints over 14 iterations in 134 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[502, 501, 500, 502, 502, 501, 502, 502, 500, 502, 500, 500] Max Struct:[502, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
FORMULA JoinFreeModules-PT-0500-UpperBounds-00 502 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501, 500, 502, 502, 501, 502, 502, 500, 502, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Support contains 11 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 55 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 5 ms. Remains 55 /65 variables (removed 10) and now considering 88/104 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 55/65 places, 88/104 transitions.
// Phase 1: matrix 88 rows 55 cols
[2026-05-25 19:37:18] [INFO ] Computed 11 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[501, 500, 502, 502, 501, 502, 502, 500, 502, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
RANDOM walk for 1000008 steps (2 resets) in 1145 ms. (872 steps per ms)
BEST_FIRST walk for 11000010 steps (22 resets) in 13009 ms. (845 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501, 500, 502, 502, 501, 502, 502, 500, 502, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
[2026-05-25 19:37:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:37:32] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-25 19:37:32] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2026-05-25 19:37: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 19:37:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-25 19:37:32] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2026-05-25 19:37:32] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-25 19:37:32] [INFO ] [Nat]Added 11 Read/Feed constraints in 79 ms returned sat
[2026-05-25 19:37:32] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:37:32] [INFO ] Added : 26 causal constraints over 6 iterations in 63 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:37:32] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-25 19:37:32] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2026-05-25 19:37: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 19:37:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-25 19:37:32] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2026-05-25 19:37:32] [INFO ] [Nat]Added 11 Read/Feed constraints in 197 ms returned sat
[2026-05-25 19:37:32] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:37:33] [INFO ] Added : 37 causal constraints over 8 iterations in 81 ms. Result :sat
Minimization took 31 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:37:33] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-25 19:37:33] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2026-05-25 19:37:33] [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 19:37:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-25 19:37:33] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2026-05-25 19:37:33] [INFO ] [Nat]Added 11 Read/Feed constraints in 225 ms returned sat
[2026-05-25 19:37:33] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:37:33] [INFO ] Added : 38 causal constraints over 8 iterations in 82 ms. Result :sat
Minimization took 23 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:37:33] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-25 19:37:33] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-25 19:37:33] [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 19:37:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-25 19:37:33] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2026-05-25 19:37:33] [INFO ] [Nat]Added 11 Read/Feed constraints in 146 ms returned sat
[2026-05-25 19:37:33] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 19:37:33] [INFO ] Added : 20 causal constraints over 5 iterations in 59 ms. Result :sat
Minimization took 20 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:37:33] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-25 19:37:34] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2026-05-25 19:37:34] [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 19:37:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-25 19:37:34] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2026-05-25 19:37:34] [INFO ] [Nat]Added 11 Read/Feed constraints in 179 ms returned sat
[2026-05-25 19:37:34] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:37:34] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
[2026-05-25 19:37:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2026-05-25 19:37:34] [INFO ] Added : 36 causal constraints over 8 iterations in 198 ms. Result :sat
Minimization took 37 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:37:34] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-25 19:37:34] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2026-05-25 19:37:34] [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 19:37:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-25 19:37:34] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2026-05-25 19:37:34] [INFO ] [Nat]Added 11 Read/Feed constraints in 121 ms returned sat
[2026-05-25 19:37:34] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-25 19:37:34] [INFO ] Added : 36 causal constraints over 8 iterations in 82 ms. Result :sat
Minimization took 22 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:37:34] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-25 19:37:34] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2026-05-25 19:37:34] [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 19:37:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-25 19:37:35] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2026-05-25 19:37:35] [INFO ] [Nat]Added 11 Read/Feed constraints in 634 ms returned sat
[2026-05-25 19:37:35] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:37:35] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 4 ms to minimize.
[2026-05-25 19:37:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
Minimization took 24 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:37:35] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-25 19:37:35] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2026-05-25 19:37:35] [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 19:37:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-25 19:37:36] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2026-05-25 19:37:36] [INFO ] [Nat]Added 11 Read/Feed constraints in 189 ms returned sat
[2026-05-25 19:37:36] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 19:37:36] [INFO ] Added : 29 causal constraints over 7 iterations in 159 ms. Result :sat
Minimization took 26 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:37:36] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-25 19:37:36] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2026-05-25 19:37:36] [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 19:37:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-25 19:37:36] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2026-05-25 19:37:36] [INFO ] [Nat]Added 11 Read/Feed constraints in 145 ms returned sat
[2026-05-25 19:37:36] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 19:37:36] [INFO ] Added : 28 causal constraints over 6 iterations in 100 ms. Result :sat
Minimization took 20 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:37:36] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-25 19:37:36] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2026-05-25 19:37:36] [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 19:37:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-25 19:37:37] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2026-05-25 19:37:37] [INFO ] [Nat]Added 11 Read/Feed constraints in 308 ms returned sat
[2026-05-25 19:37:37] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 19:37:37] [INFO ] Added : 40 causal constraints over 11 iterations in 146 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:37:37] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-25 19:37:37] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2026-05-25 19:37:37] [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 19:37:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-25 19:37:37] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-25 19:37:37] [INFO ] [Nat]Added 11 Read/Feed constraints in 80 ms returned sat
[2026-05-25 19:37:37] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:37:37] [INFO ] Added : 29 causal constraints over 6 iterations in 64 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501, 500, 502, 502, 501, 502, 502, 500, 502, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 502, 503, 503, 503, 503]
FORMULA JoinFreeModules-PT-0500-UpperBounds-09 502 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501, 500, 502, 502, 501, 502, 500, 502, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Support contains 10 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 50 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 3 ms. Remains 50 /55 variables (removed 5) and now considering 80/88 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 50/55 places, 80/88 transitions.
// Phase 1: matrix 80 rows 50 cols
[2026-05-25 19:37:49] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[501, 500, 502, 502, 501, 502, 500, 502, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
RANDOM walk for 1000092 steps (2 resets) in 892 ms. (1119 steps per ms)
FORMULA JoinFreeModules-PT-0500-UpperBounds-11 503 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 9000009 steps (18 resets) in 9380 ms. (959 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501, 500, 502, 502, 501, 502, 500, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503]
[2026-05-25 19:38:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:00] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:00] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2026-05-25 19:38:00] [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 19:38:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:00] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2026-05-25 19:38:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 19:38:00] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:38:00] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-25 19:38:00] [INFO ] Added : 39 causal constraints over 9 iterations in 255 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:00] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:00] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2026-05-25 19:38:00] [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 19:38:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:00] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2026-05-25 19:38:00] [INFO ] [Nat]Added 10 Read/Feed constraints in 270 ms returned sat
[2026-05-25 19:38:00] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:38:01] [INFO ] Added : 31 causal constraints over 9 iterations in 117 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:01] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-25 19:38:01] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2026-05-25 19:38:01] [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 19:38:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:01] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2026-05-25 19:38:01] [INFO ] [Nat]Added 10 Read/Feed constraints in 86 ms returned sat
[2026-05-25 19:38:01] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 19:38:01] [INFO ] Added : 29 causal constraints over 7 iterations in 151 ms. Result :sat
Minimization took 19 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:01] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:01] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2026-05-25 19:38:01] [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 19:38:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:01] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2026-05-25 19:38:01] [INFO ] [Nat]Added 10 Read/Feed constraints in 86 ms returned sat
[2026-05-25 19:38:01] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:38:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:38:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
[2026-05-25 19:38:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 61 ms
[2026-05-25 19:38:01] [INFO ] Added : 35 causal constraints over 7 iterations in 173 ms. Result :sat
Minimization took 20 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:01] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:01] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2026-05-25 19:38:01] [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 19:38:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:02] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2026-05-25 19:38:02] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:38:02] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:38:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2026-05-25 19:38:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2026-05-25 19:38:02] [INFO ] Added : 37 causal constraints over 8 iterations in 106 ms. Result :sat
Minimization took 39 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:02] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:02] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2026-05-25 19:38:02] [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 19:38:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:02] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2026-05-25 19:38:02] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:38:02] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:38:02] [INFO ] Added : 16 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 16 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:02] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-25 19:38:02] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2026-05-25 19:38:02] [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 19:38:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:02] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2026-05-25 19:38:02] [INFO ] [Nat]Added 10 Read/Feed constraints in 166 ms returned sat
[2026-05-25 19:38:02] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 19:38:03] [INFO ] Added : 30 causal constraints over 8 iterations in 154 ms. Result :sat
Minimization took 26 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:03] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:03] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2026-05-25 19:38:03] [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 19:38:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:03] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2026-05-25 19:38:03] [INFO ] [Nat]Added 10 Read/Feed constraints in 84 ms returned sat
[2026-05-25 19:38:03] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:38:03] [INFO ] Added : 29 causal constraints over 8 iterations in 151 ms. Result :sat
Minimization took 26 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:03] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:03] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2026-05-25 19:38:03] [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 19:38:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-25 19:38:03] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2026-05-25 19:38:03] [INFO ] [Nat]Added 10 Read/Feed constraints in 134 ms returned sat
[2026-05-25 19:38:03] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:38:04] [INFO ] Added : 31 causal constraints over 7 iterations in 289 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501, 500, 502, 502, 501, 502, 500, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501, 500, 502, 502, 501, 502, 500, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503]
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 45 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 3 ms. Remains 45 /50 variables (removed 5) and now considering 72/80 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 45/50 places, 72/80 transitions.
// Phase 1: matrix 72 rows 45 cols
[2026-05-25 19:38:13] [INFO ] Computed 9 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[501, 500, 502, 502, 501, 502, 500, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503]
RANDOM walk for 1000072 steps (2 resets) in 773 ms. (1292 steps per ms)
FORMULA JoinFreeModules-PT-0500-UpperBounds-04 503 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0500-UpperBounds-03 503 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7000006 steps (14 resets) in 6668 ms. (1049 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501, 500, 501, 502, 500, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503]
[2026-05-25 19:38:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:20] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-25 19:38:20] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2026-05-25 19:38:20] [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 19:38:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:20] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2026-05-25 19:38:20] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 19:38:20] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:38:20] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 19:38:20] [INFO ] Added : 33 causal constraints over 7 iterations in 63 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:20] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-25 19:38:20] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2026-05-25 19:38:20] [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 19:38:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:20] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2026-05-25 19:38:21] [INFO ] [Nat]Added 9 Read/Feed constraints in 317 ms returned sat
[2026-05-25 19:38:21] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:38:21] [INFO ] Added : 37 causal constraints over 9 iterations in 78 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:21] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:21] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2026-05-25 19:38: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 19:38:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:21] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2026-05-25 19:38:21] [INFO ] [Nat]Added 9 Read/Feed constraints in 80 ms returned sat
[2026-05-25 19:38:21] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:38:21] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:38:21] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
[2026-05-25 19:38:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 58 ms
[2026-05-25 19:38:21] [INFO ] Added : 44 causal constraints over 11 iterations in 150 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:21] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:21] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2026-05-25 19:38: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 19:38:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:21] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-25 19:38:21] [INFO ] [Nat]Added 9 Read/Feed constraints in 127 ms returned sat
[2026-05-25 19:38:21] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:38:21] [INFO ] Added : 36 causal constraints over 10 iterations in 90 ms. Result :sat
Minimization took 20 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:21] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:22] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2026-05-25 19:38:22] [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 19:38:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:22] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2026-05-25 19:38:22] [INFO ] [Nat]Added 9 Read/Feed constraints in 382 ms returned sat
[2026-05-25 19:38:22] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:38:22] [INFO ] Added : 33 causal constraints over 10 iterations in 81 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:22] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-25 19:38:22] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2026-05-25 19:38:22] [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 19:38:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:22] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2026-05-25 19:38:22] [INFO ] [Nat]Added 9 Read/Feed constraints in 278 ms returned sat
[2026-05-25 19:38:23] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 19:38:23] [INFO ] Added : 32 causal constraints over 8 iterations in 69 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:23] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:23] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2026-05-25 19:38: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 19:38:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:23] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2026-05-25 19:38:23] [INFO ] [Nat]Added 9 Read/Feed constraints in 301 ms returned sat
[2026-05-25 19:38:23] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:38:23] [INFO ] Added : 37 causal constraints over 8 iterations in 72 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501, 500, 501, 502, 500, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501, 500, 501, 502, 500, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503]
Support contains 7 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 35 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 3 ms. Remains 35 /45 variables (removed 10) and now considering 56/72 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 35/45 places, 56/72 transitions.
// Phase 1: matrix 56 rows 35 cols
[2026-05-25 19:38:29] [INFO ] Computed 7 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[501, 500, 501, 502, 500, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503]
RANDOM walk for 1000038 steps (2 resets) in 641 ms. (1557 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 5756 ms. (1215 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501, 500, 501, 502, 500, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503]
[2026-05-25 19:38:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:35] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:35] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2026-05-25 19:38:35] [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 19:38:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:35] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2026-05-25 19:38:35] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 19:38:35] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:38:35] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 19:38:35] [INFO ] Added : 21 causal constraints over 5 iterations in 56 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:35] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-25 19:38:35] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2026-05-25 19:38:35] [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 19:38:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 19:38:35] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2026-05-25 19:38:35] [INFO ] [Nat]Added 7 Read/Feed constraints in 65 ms returned sat
[2026-05-25 19:38:35] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 19:38:35] [INFO ] Added : 23 causal constraints over 8 iterations in 50 ms. Result :sat
Minimization took 19 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:35] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 19:38:35] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2026-05-25 19:38:35] [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 19:38:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 19:38:36] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-25 19:38:36] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:38:36] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:38:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:38:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
[2026-05-25 19:38:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 56 ms
[2026-05-25 19:38:36] [INFO ] Added : 33 causal constraints over 7 iterations in 111 ms. Result :sat
Minimization took 24 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:36] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 19:38:36] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-25 19:38:36] [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 19:38:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 19:38:36] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2026-05-25 19:38:36] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2026-05-25 19:38:36] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 7 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:38:36] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:38:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
[2026-05-25 19:38:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
[2026-05-25 19:38:36] [INFO ] Added : 18 causal constraints over 4 iterations in 138 ms. Result :sat
Minimization took 20 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:36] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 19:38:36] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2026-05-25 19:38:36] [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 19:38:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 19:38:36] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2026-05-25 19:38:36] [INFO ] [Nat]Added 7 Read/Feed constraints in 76 ms returned sat
[2026-05-25 19:38:36] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 19:38:36] [INFO ] Added : 28 causal constraints over 7 iterations in 53 ms. Result :sat
Minimization took 21 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:36] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 19:38:36] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2026-05-25 19:38:36] [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 19:38:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 19:38:36] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2026-05-25 19:38:37] [INFO ] [Nat]Added 7 Read/Feed constraints in 31 ms returned sat
[2026-05-25 19:38:37] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:38:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
[2026-05-25 19:38:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2026-05-25 19:38:37] [INFO ] Added : 11 causal constraints over 3 iterations in 59 ms. Result :sat
Minimization took 16 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:38:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 19:38:37] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2026-05-25 19:38:37] [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 19:38:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 19:38:37] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2026-05-25 19:38:37] [INFO ] [Nat]Added 7 Read/Feed constraints in 33 ms returned sat
[2026-05-25 19:38:37] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 19:38:37] [INFO ] Added : 27 causal constraints over 7 iterations in 95 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501, 500, 501, 502, 500, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501, 500, 501, 502, 500, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503]
Support contains 7 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 35/35 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2026-05-25 19:38:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:38:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-25 19:38:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:38:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 19:38:40] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:38:40] [INFO ] Redundant transitions in 1 ms returned []
Running 42 sub problems to find dead transitions.
[2026-05-25 19:38:40] [INFO ] Invariant cache hit.
[2026-05-25 19:38:40] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1145 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:38:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 92 constraints, problems are : Problem set: 0 solved, 42 unsolved in 4386 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5538ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 5539ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5623 ms. Remains : 35/35 places, 56/56 transitions.
RANDOM walk for 40618 steps (8 resets) in 95 ms. (423 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 14/14 properties
[2026-05-25 19:38:47] [INFO ] Flatten gal took : 72 ms
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 14/14 properties
[2026-05-25 19:38:47] [INFO ] Flatten gal took : 24 ms
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 14/14 properties
[2026-05-25 19:38:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4605014069723720698.gal : 13 ms
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 14/14 properties
[2026-05-25 19:38:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6189878008557975803.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/ReachabilityCardinality4605014069723720698.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6189878008557975803.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 14/14 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 ...328
Loading property file /tmp/ReachabilityCardinality6189878008557975803.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 182181 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 14
Probabilistic random walk after 182181 steps, saw 159616 distinct states, run finished after 3008 ms. (steps per millisecond=60 ) properties seen :0
[2026-05-25 19:38:50] [INFO ] Invariant cache hit.
[2026-05-25 19:38:50] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:38:50] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:38:50] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:38:50] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:38:50] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:38:50] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:38:50] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 6/13 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/13 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 56/91 variables, 35/48 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 7/55 constraints. Problems are: Problem set: 6 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/55 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/55 constraints. Problems are: Problem set: 6 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 55 constraints, problems are : Problem set: 6 solved, 8 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 6/13 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/13 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 56/91 variables, 35/48 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 7/55 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 8/63 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/63 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/63 constraints. Problems are: Problem set: 6 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 63 constraints, problems are : Problem set: 6 solved, 8 unsolved in 1973 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 8/14 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2577ms problems are : Problem set: 6 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6177 ms.
Support contains 7 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Running 42 sub problems to find dead transitions.
[2026-05-25 19:38:58] [INFO ] Invariant cache hit.
[2026-05-25 19:38:58] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1086 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:39:01] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 42 unsolved
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :11747 after 45400
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 92 constraints, problems are : Problem set: 0 solved, 42 unsolved in 4453 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5547ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 5547ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5550 ms. Remains : 35/35 places, 56/56 transitions.
RANDOM walk for 40537 steps (8 resets) in 81 ms. (494 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 178280 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 8
Probabilistic random walk after 178280 steps, saw 156371 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2026-05-25 19:39:07] [INFO ] Invariant cache hit.
[2026-05-25 19:39:07] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 8 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 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 19:39:07] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:39:08] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:39:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:39:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:39:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 56/91 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 8/62 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 19:39:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/91 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 63 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2507 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2666ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5871 ms.
Support contains 7 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 35/35 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2026-05-25 19:39:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:39:16] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-25 19:39:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:39:16] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 19:39:16] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:39:16] [INFO ] Redundant transitions in 1 ms returned []
Running 42 sub problems to find dead transitions.
[2026-05-25 19:39:16] [INFO ] Invariant cache hit.
[2026-05-25 19:39:16] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1339 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:39:19] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 92 constraints, problems are : Problem set: 0 solved, 42 unsolved in 4048 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5400ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 5401ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5485 ms. Remains : 35/35 places, 56/56 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 19:39:21] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:39:21] [INFO ] Applying decomposition
[2026-05-25 19:39:21] [INFO ] Flatten gal took : 8 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/graph10894209564598218559.txt' '-o' '/tmp/graph10894209564598218559.bin' '-w' '/tmp/graph10894209564598218559.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10894209564598218559.bin' '-l' '-1' '-v' '-w' '/tmp/graph10894209564598218559.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:39:21] [INFO ] Decomposing Gal with order
[2026-05-25 19:39:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:39:21] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:39:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-25 19:39:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9696267051865849155.gal : 3 ms
[2026-05-25 19:39:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12244050042603166303.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/ReachabilityCardinality9696267051865849155.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12244050042603166303.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/ReachabilityCardinality12244050042603166303.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :3104 after 11747
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :11747 after 45400
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501, 500, 501, 502, 500, 500, 500] Max Struct:[503, 503, 503, 503, 503, 503, 503]
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[503]
[2026-05-25 19:40:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[503]
RANDOM walk for 10226 steps (2 resets) in 6 ms. (1460 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2026-05-25 19:40:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:40:12] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 19:40:12] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2026-05-25 19:40:12] [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 19:40:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 19:40:12] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-25 19:40:12] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 19:40:12] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:40:12] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:40:12] [INFO ] Added : 21 causal constraints over 5 iterations in 44 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2026-05-25 19:40:12] [INFO ] Computed 1 invariants in 0 ms
[2026-05-25 19:40:12] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 251ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 252ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 5/35 places, 8/56 transitions.
[2026-05-25 19:40:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501] Max Struct:[503]
RANDOM walk for 1000036 steps (2 resets) in 251 ms. (3968 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 433 ms. (2304 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2026-05-25 19:40:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:40:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 19:40:13] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-25 19:40:13] [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 19:40:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 19:40:13] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 19:40:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:40:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:40:13] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 19:40:13] [INFO ] Added : 6 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-25 19:40:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:40:13] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-25 19:40:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:40:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:40:13] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:40:13] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 19:40:13] [INFO ] Invariant cache hit.
[2026-05-25 19:40:13] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 293ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 293ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 5/5 places, 8/8 transitions.
[2026-05-25 19:40:14] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:40:14] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:40:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3485527588646280215.gal : 1 ms
[2026-05-25 19:40:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8055672834181889767.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/ReachabilityCardinality3485527588646280215.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8055672834181889767.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40372 steps (8 resets) in 21 ms. (1835 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 ...328
Loading property file /tmp/ReachabilityCardinality8055672834181889767.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 957635 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :0 out of 2
Probabilistic random walk after 957635 steps, saw 374789 distinct states, run finished after 3001 ms. (steps per millisecond=319 ) properties seen :0
[2026-05-25 19:40:17] [INFO ] Invariant cache hit.
[2026-05-25 19:40:17] [INFO ] State equation strengthened by 1 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) 4/5 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 19:40:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2026-05-25 19:40:17] [INFO ] Invariant cache hit.
[2026-05-25 19:40:17] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 194ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 194ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40163 steps (8 resets) in 13 ms. (2868 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4128459 steps, run timeout after 3001 ms. (steps per millisecond=1375 ) properties seen :0 out of 1
Probabilistic random walk after 4128459 steps, saw 1438174 distinct states, run finished after 3001 ms. (steps per millisecond=1375 ) properties seen :0
[2026-05-25 19:40:20] [INFO ] Invariant cache hit.
[2026-05-25 19:40:20] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 95ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-25 19:40:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:40:20] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-25 19:40:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:40:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:40:20] [INFO ] Implicit Places using invariants and state equation in 24 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 19:40:20] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 19:40:20] [INFO ] Invariant cache hit.
[2026-05-25 19:40:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 167ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 19:40:20] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:40:20] [INFO ] Applying decomposition
[2026-05-25 19:40:20] [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/graph13115690647615369767.txt' '-o' '/tmp/graph13115690647615369767.bin' '-w' '/tmp/graph13115690647615369767.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13115690647615369767.bin' '-l' '-1' '-v' '-w' '/tmp/graph13115690647615369767.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:40:20] [INFO ] Decomposing Gal with order
[2026-05-25 19:40:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:40:20] [INFO ] Flatten gal took : 47 ms
[2026-05-25 19:40:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 19:40:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1585369471713876550.gal : 1 ms
[2026-05-25 19:40:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12422614335697302265.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/ReachabilityCardinality1585369471713876550.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12422614335697302265.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/ReachabilityCardinality12422614335697302265.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 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9469 after 18379
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :40567 after 99973
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :99973 after 103457
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :103457 after 103475
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :103475 after 173900
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :173900 after 292276
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :292276 after 462142
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :462142 after 646453
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.37456e+06 after 1.81616e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-01 in 58932 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[500] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[500] Max Struct:[503]
// Phase 1: matrix 56 rows 35 cols
[2026-05-25 19:41:10] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[503]
RANDOM walk for 10113 steps (2 resets) in 6 ms. (1444 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[500] Max Struct:[503]
[2026-05-25 19:41:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:41:10] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 19:41:10] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2026-05-25 19:41: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 19:41:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 19:41:11] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-25 19:41:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 19:41:11] [INFO ] [Nat]Added 7 Read/Feed constraints in 63 ms returned sat
[2026-05-25 19:41:11] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 19:41:11] [INFO ] Added : 23 causal constraints over 8 iterations in 54 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[503]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2026-05-25 19:41:11] [INFO ] Computed 1 invariants in 0 ms
[2026-05-25 19:41:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 260ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 260ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 5/35 places, 8/56 transitions.
[2026-05-25 19:41:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[503]
RANDOM walk for 1000048 steps (2 resets) in 189 ms. (5263 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 290 ms. (3436 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[500] Max Struct:[503]
[2026-05-25 19:41:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:41:12] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-25 19:41:12] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 19:41:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:41:12] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:41:12] [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 19:41:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-25 19:41:12] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 19:41:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:41:12] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:41:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
[2026-05-25 19:41:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2026-05-25 19:41:12] [INFO ] Added : 5 causal constraints over 2 iterations in 42 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-25 19:41:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:41:12] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-25 19:41:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:41:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:41:12] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:41:12] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 19:41:12] [INFO ] Invariant cache hit.
[2026-05-25 19:41:12] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 287ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 287ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 359 ms. Remains : 5/5 places, 8/8 transitions.
[2026-05-25 19:41:12] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:41:12] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:41:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7522999798883837674.gal : 2 ms
[2026-05-25 19:41:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9229187418827126357.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/ReachabilityCardinality7522999798883837674.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9229187418827126357.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40325 steps (8 resets) in 18 ms. (2122 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 ...328
Loading property file /tmp/ReachabilityCardinality9229187418827126357.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 917791 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :0 out of 2
Probabilistic random walk after 917791 steps, saw 360703 distinct states, run finished after 3001 ms. (steps per millisecond=305 ) properties seen :0
[2026-05-25 19:41:15] [INFO ] Invariant cache hit.
[2026-05-25 19:41:15] [INFO ] State equation strengthened by 1 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) 4/5 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 19:41:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2026-05-25 19:41:16] [INFO ] Invariant cache hit.
[2026-05-25 19:41:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 182ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 182ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40298 steps (8 resets) in 10 ms. (3663 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 14 ms. (2666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3856957 steps, run timeout after 3001 ms. (steps per millisecond=1285 ) properties seen :0 out of 1
Probabilistic random walk after 3856957 steps, saw 1341113 distinct states, run finished after 3001 ms. (steps per millisecond=1285 ) properties seen :0
[2026-05-25 19:41:19] [INFO ] Invariant cache hit.
[2026-05-25 19:41:19] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 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 19:41:19] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-25 19:41:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:41:19] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-25 19:41:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:41:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:41:19] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:41:19] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 19:41:19] [INFO ] Invariant cache hit.
[2026-05-25 19:41:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 165ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 166ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 19:41:19] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:41:19] [INFO ] Applying decomposition
[2026-05-25 19:41:19] [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/graph16184253714402092047.txt' '-o' '/tmp/graph16184253714402092047.bin' '-w' '/tmp/graph16184253714402092047.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16184253714402092047.bin' '-l' '-1' '-v' '-w' '/tmp/graph16184253714402092047.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:41:19] [INFO ] Decomposing Gal with order
[2026-05-25 19:41:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:41:19] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:41:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-25 19:41:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13234087604521880306.gal : 0 ms
[2026-05-25 19:41:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16090525319009639048.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/ReachabilityCardinality13234087604521880306.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16090525319009639048.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 ...309
Loading property file /tmp/ReachabilityCardinality16090525319009639048.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 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9469 after 18384
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :38107 after 84787
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :84787 after 162572
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :162572 after 181268
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :181268 after 286914
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :286914 after 306460
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :306460 after 455801
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :455801 after 639161
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.34608e+06 after 1.80801e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[500] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-02 in 58703 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[503]
// Phase 1: matrix 56 rows 35 cols
[2026-05-25 19:42:09] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[503]
RANDOM walk for 10067 steps (2 resets) in 10 ms. (915 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[186] Max Struct:[503]
[2026-05-25 19:42:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:42:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-25 19:42:09] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2026-05-25 19:42: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 19:42:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-25 19:42:09] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2026-05-25 19:42:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 19:42:09] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2026-05-25 19:42:09] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 19:42:09] [INFO ] Added : 33 causal constraints over 7 iterations in 72 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[186] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2026-05-25 19:42:10] [INFO ] Computed 1 invariants in 0 ms
[2026-05-25 19:42:10] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 279ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 279ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 5/35 places, 8/56 transitions.
[2026-05-25 19:42:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501] Max Struct:[503]
RANDOM walk for 1000001 steps (2 resets) in 192 ms. (5181 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 350 ms. (2849 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2026-05-25 19:42:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:42:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 19:42:11] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 19:42:11] [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 19:42:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 19:42:11] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-25 19:42:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:42:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:42:11] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 2 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:42:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
[2026-05-25 19:42:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2026-05-25 19:42:11] [INFO ] Added : 4 causal constraints over 1 iterations in 53 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-25 19:42:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:42:11] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-25 19:42:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:42:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:42:12] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:42:12] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 19:42:12] [INFO ] Invariant cache hit.
[2026-05-25 19:42:12] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 298ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 298ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 359 ms. Remains : 5/5 places, 8/8 transitions.
[2026-05-25 19:42:12] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:42:12] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 40241 steps (8 resets) in 20 ms. (1916 steps per ms) remains 2/2 properties
[2026-05-25 19:42:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12048023431221605177.gal : 2 ms
[2026-05-25 19:42:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13390047703146433358.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/ReachabilityCardinality12048023431221605177.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13390047703146433358.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
BEST_FIRST walk for 40001 steps (8 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality13390047703146433358.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1002908 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :0 out of 2
Probabilistic random walk after 1002908 steps, saw 392077 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
[2026-05-25 19:42:15] [INFO ] Invariant cache hit.
[2026-05-25 19:42:15] [INFO ] State equation strengthened by 1 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) 4/5 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 19:42:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2026-05-25 19:42:15] [INFO ] Invariant cache hit.
[2026-05-25 19:42:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 166ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 166ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40235 steps (8 resets) in 12 ms. (3095 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4187637 steps, run timeout after 3001 ms. (steps per millisecond=1395 ) properties seen :0 out of 1
Probabilistic random walk after 4187637 steps, saw 1458040 distinct states, run finished after 3001 ms. (steps per millisecond=1395 ) properties seen :0
[2026-05-25 19:42:18] [INFO ] Invariant cache hit.
[2026-05-25 19:42:18] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-25 19:42:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:42:18] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-25 19:42:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:42:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:42:18] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:42:18] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 19:42:18] [INFO ] Invariant cache hit.
[2026-05-25 19:42:18] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 261ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 261ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 323 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 19:42:19] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:42:19] [INFO ] Applying decomposition
[2026-05-25 19:42:19] [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/graph14772584754215526407.txt' '-o' '/tmp/graph14772584754215526407.bin' '-w' '/tmp/graph14772584754215526407.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14772584754215526407.bin' '-l' '-1' '-v' '-w' '/tmp/graph14772584754215526407.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:42:19] [INFO ] Decomposing Gal with order
[2026-05-25 19:42:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:42:19] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:42:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-25 19:42:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1657301740570521430.gal : 1 ms
[2026-05-25 19:42:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16617894129655103791.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/ReachabilityCardinality1657301740570521430.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16617894129655103791.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/ReachabilityCardinality16617894129655103791.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 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9469 after 18377
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :38107 after 97573
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :97573 after 101998
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :101998 after 172415
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :172415 after 183258
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :183258 after 286993
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :286993 after 456825
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :456825 after 642141
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.36409e+06 after 1.80802e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-05 in 59556 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[503]
// Phase 1: matrix 56 rows 35 cols
[2026-05-25 19:43:09] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[503]
RANDOM walk for 10412 steps (2 resets) in 6 ms. (1487 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[498] Max Struct:[503]
[2026-05-25 19:43:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:43:09] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 19:43:09] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2026-05-25 19:43: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 19:43:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-25 19:43:09] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2026-05-25 19:43:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 19:43:09] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:43:09] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 7 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:43:09] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
[2026-05-25 19:43:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2026-05-25 19:43:09] [INFO ] Added : 29 causal constraints over 6 iterations in 187 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[498] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[498] Max Struct:[503]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2026-05-25 19:43:10] [INFO ] Computed 1 invariants in 0 ms
[2026-05-25 19:43:10] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 179ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 179ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 5/35 places, 8/56 transitions.
[2026-05-25 19:43:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[498] Max Struct:[503]
RANDOM walk for 1000090 steps (2 resets) in 191 ms. (5208 steps per ms)
FORMULA JoinFreeModules-PT-0500-UpperBounds-08 503 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 404 ms. (2469 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2026-05-25 19:43:11] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:43:11] [INFO ] Flatten gal took : 2 ms
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-25 19:43:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7852800621980855619.gal : 1 ms
[2026-05-25 19:43:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10646121606460883002.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/ReachabilityCardinality7852800621980855619.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10646121606460883002.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

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 ...329
Loading property file /tmp/ReachabilityCardinality10646121606460883002.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
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,8,0.004675,3996,2,15,5,61,6,0,45,39,0
Total reachable state count : 8

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-08 in 2071 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[500] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[500] Max Struct:[503]
// Phase 1: matrix 56 rows 35 cols
[2026-05-25 19:43:11] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[503]
RANDOM walk for 10040 steps (2 resets) in 11 ms. (836 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[500] Max Struct:[503]
[2026-05-25 19:43:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:43:11] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-25 19:43:11] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2026-05-25 19:43: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 19:43:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 19:43:11] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2026-05-25 19:43:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 19:43:11] [INFO ] [Nat]Added 7 Read/Feed constraints in 114 ms returned sat
[2026-05-25 19:43:11] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 19:43:11] [INFO ] Added : 28 causal constraints over 7 iterations in 86 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[503]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2026-05-25 19:43:12] [INFO ] Computed 1 invariants in 0 ms
[2026-05-25 19:43:12] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 191ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 192ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 5/35 places, 8/56 transitions.
[2026-05-25 19:43:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[503]
RANDOM walk for 1000045 steps (2 resets) in 157 ms. (6329 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 358 ms. (2785 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[500] Max Struct:[503]
[2026-05-25 19:43:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:43:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 19:43:12] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-25 19:43:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:43:12] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:43:12] [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 19:43:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 19:43:13] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 19:43:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:43:13] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:43:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
[2026-05-25 19:43:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2026-05-25 19:43:13] [INFO ] Added : 5 causal constraints over 2 iterations in 46 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-25 19:43:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:43:13] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-25 19:43:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:43:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:43:13] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:43:13] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 19:43:13] [INFO ] Invariant cache hit.
[2026-05-25 19:43:13] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 316ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 317ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 382 ms. Remains : 5/5 places, 8/8 transitions.
[2026-05-25 19:43:13] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:43:13] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:43:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10986169772734813740.gal : 1 ms
[2026-05-25 19:43:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality703202588402210878.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/ReachabilityCardinality10986169772734813740.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality703202588402210878.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40429 steps (8 resets) in 39 ms. (1010 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 ...328
Loading property file /tmp/ReachabilityCardinality703202588402210878.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1021723 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :0 out of 2
Probabilistic random walk after 1021723 steps, saw 398500 distinct states, run finished after 3001 ms. (steps per millisecond=340 ) properties seen :0
[2026-05-25 19:43:16] [INFO ] Invariant cache hit.
[2026-05-25 19:43:16] [INFO ] State equation strengthened by 1 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) 4/5 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 19:43:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2026-05-25 19:43:16] [INFO ] Invariant cache hit.
[2026-05-25 19:43:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 183ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 184ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40233 steps (8 resets) in 11 ms. (3352 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3874444 steps, run timeout after 3001 ms. (steps per millisecond=1291 ) properties seen :0 out of 1
Probabilistic random walk after 3874444 steps, saw 1347866 distinct states, run finished after 3001 ms. (steps per millisecond=1291 ) properties seen :0
[2026-05-25 19:43:19] [INFO ] Invariant cache hit.
[2026-05-25 19:43:19] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 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 19:43:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 1 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-25 19:43:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:43:20] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-25 19:43:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:43:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:43:20] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:43:20] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 19:43:20] [INFO ] Invariant cache hit.
[2026-05-25 19:43:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 231ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 231ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 19:43:20] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:43:20] [INFO ] Applying decomposition
[2026-05-25 19:43:20] [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/graph11910766809196886371.txt' '-o' '/tmp/graph11910766809196886371.bin' '-w' '/tmp/graph11910766809196886371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11910766809196886371.bin' '-l' '-1' '-v' '-w' '/tmp/graph11910766809196886371.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:43:20] [INFO ] Decomposing Gal with order
[2026-05-25 19:43:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:43:20] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:43:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-25 19:43:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4632510071899264829.gal : 0 ms
[2026-05-25 19:43:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2546839110970600973.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/ReachabilityCardinality4632510071899264829.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2546839110970600973.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/ReachabilityCardinality2546839110970600973.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 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :20349 after 20353
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.70135e+07 after 6.23548e+07
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[500] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-10 in 59209 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[500] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[500] Max Struct:[503]
// Phase 1: matrix 56 rows 35 cols
[2026-05-25 19:44:10] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[503]
RANDOM walk for 10164 steps (2 resets) in 6 ms. (1452 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[500] Max Struct:[503]
[2026-05-25 19:44:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:44:10] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 19:44:10] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-25 19:44: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 19:44:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 19:44:10] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2026-05-25 19:44:10] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 19:44:10] [INFO ] [Nat]Added 7 Read/Feed constraints in 31 ms returned sat
[2026-05-25 19:44:10] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:44:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
[2026-05-25 19:44:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2026-05-25 19:44:10] [INFO ] Added : 11 causal constraints over 3 iterations in 55 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[503]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2026-05-25 19:44:11] [INFO ] Computed 1 invariants in 1 ms
[2026-05-25 19:44:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 184ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 184ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 5/35 places, 8/56 transitions.
[2026-05-25 19:44:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[503]
RANDOM walk for 1000049 steps (2 resets) in 184 ms. (5405 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 181 ms. (5494 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[500] Max Struct:[503]
[2026-05-25 19:44:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:44:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 19:44:11] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 19:44:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:44:11] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:44:11] [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 19:44:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 19:44:11] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 19:44:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:44:11] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:44:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
[2026-05-25 19:44:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2026-05-25 19:44:11] [INFO ] Added : 5 causal constraints over 2 iterations in 41 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-25 19:44:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:44:11] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-25 19:44:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:44:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:44:11] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:44:11] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 19:44:11] [INFO ] Invariant cache hit.
[2026-05-25 19:44:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 205ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 205ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 5/5 places, 8/8 transitions.
[2026-05-25 19:44:12] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:44:12] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 40405 steps (8 resets) in 20 ms. (1924 steps per ms) remains 2/2 properties
[2026-05-25 19:44:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13384733479580040700.gal : 3 ms
[2026-05-25 19:44:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14240927744378754422.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/ReachabilityCardinality13384733479580040700.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14240927744378754422.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/ReachabilityCardinality14240927744378754422.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 873758 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :0 out of 2
Probabilistic random walk after 873758 steps, saw 344264 distinct states, run finished after 3001 ms. (steps per millisecond=291 ) properties seen :0
[2026-05-25 19:44:15] [INFO ] Invariant cache hit.
[2026-05-25 19:44:15] [INFO ] State equation strengthened by 1 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) 4/5 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 19:44:15] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2026-05-25 19:44:15] [INFO ] Invariant cache hit.
[2026-05-25 19:44:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 205ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 205ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40337 steps (8 resets) in 12 ms. (3102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4157898 steps, run timeout after 3001 ms. (steps per millisecond=1385 ) properties seen :0 out of 1
Probabilistic random walk after 4157898 steps, saw 1447853 distinct states, run finished after 3001 ms. (steps per millisecond=1385 ) properties seen :0
[2026-05-25 19:44:18] [INFO ] Invariant cache hit.
[2026-05-25 19:44:18] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 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 19:44:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 1 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-25 19:44:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:44:18] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-25 19:44:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:44:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:44:18] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:44:18] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 19:44:18] [INFO ] Invariant cache hit.
[2026-05-25 19:44:18] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 210ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 211ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 19:44:18] [INFO ] Flatten gal took : 0 ms
[2026-05-25 19:44:18] [INFO ] Applying decomposition
[2026-05-25 19:44:18] [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/graph4710033040542061104.txt' '-o' '/tmp/graph4710033040542061104.bin' '-w' '/tmp/graph4710033040542061104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4710033040542061104.bin' '-l' '-1' '-v' '-w' '/tmp/graph4710033040542061104.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:44:18] [INFO ] Decomposing Gal with order
[2026-05-25 19:44:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:44:18] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:44:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-25 19:44:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality155645452074392329.gal : 1 ms
[2026-05-25 19:44:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12042775929011907209.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/ReachabilityCardinality155645452074392329.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12042775929011907209.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/ReachabilityCardinality12042775929011907209.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 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9466 after 20358
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.72437e+07 after 6.23676e+07
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[500] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-14 in 58493 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[500] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[500] Max Struct:[503]
// Phase 1: matrix 56 rows 35 cols
[2026-05-25 19:45:08] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[503]
RANDOM walk for 10088 steps (2 resets) in 6 ms. (1441 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[500] Max Struct:[503]
[2026-05-25 19:45:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:45:08] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 19:45:09] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-25 19:45: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 19:45:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 19:45:09] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2026-05-25 19:45:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 19:45:09] [INFO ] [Nat]Added 7 Read/Feed constraints in 32 ms returned sat
[2026-05-25 19:45:09] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 19:45:09] [INFO ] Added : 27 causal constraints over 7 iterations in 68 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[503]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2026-05-25 19:45:09] [INFO ] Computed 1 invariants in 0 ms
[2026-05-25 19:45:09] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 193ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 193ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 5/35 places, 8/56 transitions.
[2026-05-25 19:45:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[503]
RANDOM walk for 1000106 steps (2 resets) in 193 ms. (5155 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 216 ms. (4608 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[500] Max Struct:[503]
[2026-05-25 19:45:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:45:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 19:45:10] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 19:45:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:45:10] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:45:10] [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 19:45:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 19:45:10] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 19:45:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:45:10] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:45:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 3 ms to minimize.
[2026-05-25 19:45:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2026-05-25 19:45:10] [INFO ] Added : 5 causal constraints over 2 iterations in 42 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-25 19:45:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:45:10] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-25 19:45:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:45:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:45:10] [INFO ] Implicit Places using invariants and state equation in 26 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 19:45:10] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 19:45:10] [INFO ] Invariant cache hit.
[2026-05-25 19:45:10] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 292ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 292ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 352 ms. Remains : 5/5 places, 8/8 transitions.
[2026-05-25 19:45:10] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:45:10] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 40241 steps (8 resets) in 23 ms. (1676 steps per ms) remains 2/2 properties
[2026-05-25 19:45:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality318508090979104434.gal : 1 ms
[2026-05-25 19:45:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6778695205813248885.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/ReachabilityCardinality318508090979104434.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6778695205813248885.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 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/ReachabilityCardinality6778695205813248885.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1082870 steps, run timeout after 3001 ms. (steps per millisecond=360 ) properties seen :0 out of 2
Probabilistic random walk after 1082870 steps, saw 421153 distinct states, run finished after 3001 ms. (steps per millisecond=360 ) properties seen :0
[2026-05-25 19:45:13] [INFO ] Invariant cache hit.
[2026-05-25 19:45:13] [INFO ] State equation strengthened by 1 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) 4/5 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 19:45:13] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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 17 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2026-05-25 19:45:13] [INFO ] Invariant cache hit.
[2026-05-25 19:45:13] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 164ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 164ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40323 steps (8 resets) in 13 ms. (2880 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3950276 steps, run timeout after 3001 ms. (steps per millisecond=1316 ) properties seen :0 out of 1
Probabilistic random walk after 3950276 steps, saw 1375985 distinct states, run finished after 3001 ms. (steps per millisecond=1316 ) properties seen :0
[2026-05-25 19:45:17] [INFO ] Invariant cache hit.
[2026-05-25 19:45:17] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 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 19:45:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 1 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-25 19:45:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:45:17] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-25 19:45:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:45:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:45:17] [INFO ] Implicit Places using invariants and state equation in 31 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 19:45:17] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 19:45:17] [INFO ] Invariant cache hit.
[2026-05-25 19:45:17] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 293ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 294ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 358 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 19:45:17] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:45:17] [INFO ] Applying decomposition
[2026-05-25 19:45:17] [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/graph4298993897888851664.txt' '-o' '/tmp/graph4298993897888851664.bin' '-w' '/tmp/graph4298993897888851664.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4298993897888851664.bin' '-l' '-1' '-v' '-w' '/tmp/graph4298993897888851664.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:45:17] [INFO ] Decomposing Gal with order
[2026-05-25 19:45:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:45:17] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:45:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-25 19:45:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12381733799537952106.gal : 1 ms
[2026-05-25 19:45:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5198030376193375958.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/ReachabilityCardinality12381733799537952106.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5198030376193375958.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/ReachabilityCardinality5198030376193375958.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 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9469 after 18384
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :38107 after 96537
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :96537 after 100508
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :100508 after 170484
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :170484 after 182267
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :182267 after 286994
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :286994 after 456821
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :456821 after 642141
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.36409e+06 after 1.37703e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[500] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-15 in 58767 ms.
[2026-05-25 19:46:07] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:46:07] [INFO ] Applying decomposition
[2026-05-25 19:46:07] [INFO ] Flatten gal took : 4 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/graph14233854120736355897.txt' '-o' '/tmp/graph14233854120736355897.bin' '-w' '/tmp/graph14233854120736355897.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14233854120736355897.bin' '-l' '-1' '-v' '-w' '/tmp/graph14233854120736355897.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:46:07] [INFO ] Decomposing Gal with order
[2026-05-25 19:46:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:46:07] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:46:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-25 19:46:07] [INFO ] Time to serialize gal into /tmp/UpperBounds18139958762573765455.gal : 1 ms
[2026-05-25 19:46:07] [INFO ] Time to serialize properties into /tmp/UpperBounds6688759171760477735.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/UpperBounds18139958762573765455.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6688759171760477735.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/UpperBounds6688759171760477735.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\_mod\_flat,1.10324e+66,181.248,1138384,9,3519,25,2.01088e+06,34,0,58,2.38547e+06,0
Total reachable state count : 1.103240079270396605140164157267817745322e+66

Verifying 6 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 501
Bounds property JoinFreeModules-PT-0500-UpperBounds-01 :0 <= u2.p702 <= 501
FORMULA JoinFreeModules-PT-0500-UpperBounds-01 501 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-01,0,184.536,1138384,1,0,45,2.01088e+06,76,8,577,2.38547e+06,65
Min sum of variable value : 0
Maximum sum along a path : 500
Bounds property JoinFreeModules-PT-0500-UpperBounds-02 :0 <= u1.p593 <= 500
FORMULA JoinFreeModules-PT-0500-UpperBounds-02 500 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-02,0,186.108,1138384,1,0,54,2.01088e+06,90,8,1085,2.38547e+06,80
Min sum of variable value : 0
Maximum sum along a path : 502
Bounds property JoinFreeModules-PT-0500-UpperBounds-05 :0 <= u0.p54 <= 502
FORMULA JoinFreeModules-PT-0500-UpperBounds-05 502 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-05,0,186.284,1138384,1,0,62,2.01088e+06,101,8,1593,2.38547e+06,94
Min sum of variable value : 0
Maximum sum along a path : 500
Bounds property JoinFreeModules-PT-0500-UpperBounds-10 :0 <= u3.p848 <= 500
FORMULA JoinFreeModules-PT-0500-UpperBounds-10 500 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-10,0,186.284,1138384,1,0,67,2.01088e+06,114,8,1593,2.38547e+06,105
Min sum of variable value : 0
Maximum sum along a path : 500
Bounds property JoinFreeModules-PT-0500-UpperBounds-14 :0 <= u5.p1598 <= 500
FORMULA JoinFreeModules-PT-0500-UpperBounds-14 500 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-14,0,186.284,1138384,1,0,70,2.01088e+06,130,8,1593,2.38547e+06,114
Min sum of variable value : 0
Maximum sum along a path : 500
Bounds property JoinFreeModules-PT-0500-UpperBounds-15 :0 <= u4.p1388 <= 500
FORMULA JoinFreeModules-PT-0500-UpperBounds-15 500 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-15,0,186.284,1138384,1,0,74,2.01088e+06,143,8,1593,2.38547e+06,121
Total runtime 1108055 ms.

BK_STOP 1779738554459

--------------------
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="JoinFreeModules-PT-0500"
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 JoinFreeModules-PT-0500, 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 r175-smll-177961111800026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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