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.r130-smll-177955808900155.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is FireWire-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955808900155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.4K Mar 7 05:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 7 05:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 7 05:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 05:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 05:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Mar 7 05:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 7 05:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Mar 7 05:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 86K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779794015219

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-26 11:13:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 11:13:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 11:13:38] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2026-05-26 11:13:38] [INFO ] Transformed 108 places.
[2026-05-26 11:13:38] [INFO ] Transformed 355 transitions.
[2026-05-26 11:13:38] [INFO ] Found NUPN structural information;
[2026-05-26 11:13:38] [INFO ] Parsed PT model containing 108 places and 355 transitions and 1311 arcs in 401 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 54 transitions
Reduce redundant transitions removed 54 transitions.
FORMULA FireWire-PT-02-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-02-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-02-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-02-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-02-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 301/301 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 104 transition count 290
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 104 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 104 transition count 289
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 102 transition count 285
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 102 transition count 285
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 102 transition count 279
Applied a total of 19 rules in 69 ms. Remains 102 /108 variables (removed 6) and now considering 279/301 (removed 22) transitions.
[2026-05-26 11:13:38] [INFO ] Flow matrix only has 253 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17712472604188803835.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8861083784234408694.kers'
[2026-05-26 11:13:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17712472604188803835.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8861083784234408694.kers]
Normalized transition count is 252 out of 253 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 252 rows 102 cols 843 entries
Finished phase 1 with 94 SingleSign rule and 0 generalized
[2026-05-26 11:13:38] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8861083784234408694.kers
Total runtime 3 ms.
[2026-05-26 11:13:39] [INFO ] Implicit Places using invariants in 534 ms returned []
[2026-05-26 11:13:39] [INFO ] Flow matrix only has 253 transitions (discarded 26 similar events)
[2026-05-26 11:13:39] [INFO ] Invariant cache hit.
[2026-05-26 11:13:39] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 11:13:39] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2026-05-26 11:13:39] [INFO ] Flow matrix only has 253 transitions (discarded 26 similar events)
[2026-05-26 11:13:39] [INFO ] Invariant cache hit.
[2026-05-26 11:13:39] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 252/354 variables, 102/116 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (OVERLAPS) 1/355 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 355/355 variables, and 154 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 252/354 variables, 102/117 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 278/431 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (OVERLAPS) 1/355 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 432 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60443ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 60464ms
Starting structural reductions in LTL mode, iteration 1 : 102/108 places, 279/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61841 ms. Remains : 102/108 places, 279/301 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 279/279 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2026-05-26 11:14:40] [INFO ] Flow matrix only has 253 transitions (discarded 26 similar events)
[2026-05-26 11:14:40] [INFO ] Invariant cache hit.
[2026-05-26 11:14:40] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-26 11:14:40] [INFO ] Flow matrix only has 253 transitions (discarded 26 similar events)
[2026-05-26 11:14:40] [INFO ] Invariant cache hit.
[2026-05-26 11:14:40] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 11:14:40] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 376 ms. Remains : 102/102 places, 279/279 transitions.
Support contains 28 out of 102 places after structural reductions.
[2026-05-26 11:14:41] [INFO ] Flatten gal took : 118 ms
[2026-05-26 11:14:41] [INFO ] Flatten gal took : 56 ms
[2026-05-26 11:14:41] [INFO ] Input system was already deterministic with 279 transitions.
RANDOM walk for 40000 steps (2134 resets) in 2204 ms. (18 steps per ms) remains 5/18 properties
BEST_FIRST walk for 40003 steps (657 resets) in 556 ms. (71 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (573 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (608 resets) in 94 ms. (421 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (597 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (566 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
[2026-05-26 11:14:42] [INFO ] Flow matrix only has 253 transitions (discarded 26 similar events)
[2026-05-26 11:14:42] [INFO ] Invariant cache hit.
[2026-05-26 11:14:42] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 52/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 38/101 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 252/353 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 36/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/354 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/355 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/355 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 150 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1039 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 52/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 38/101 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 252/353 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 36/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/354 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/355 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/355 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 155 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1157 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2209ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 1 properties in 1667 ms.
Support contains 9 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 279/279 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 99 transition count 271
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 99 transition count 271
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 99 transition count 269
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 97 transition count 273
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 19 place count 97 transition count 269
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 21 place count 97 transition count 267
Applied a total of 21 rules in 76 ms. Remains 97 /102 variables (removed 5) and now considering 267/279 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 97/102 places, 267/279 transitions.
RANDOM walk for 40000 steps (2308 resets) in 227 ms. (175 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (727 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (642 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (613 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (578 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1588330 steps, run timeout after 3001 ms. (steps per millisecond=529 ) properties seen :3 out of 4
Probabilistic random walk after 1588330 steps, saw 322249 distinct states, run finished after 3009 ms. (steps per millisecond=527 ) properties seen :3
[2026-05-26 11:14:49] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1800277894220378540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12146478085067427322.kers'
[2026-05-26 11:14:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1800277894220378540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12146478085067427322.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 241 rows 97 cols 805 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-26 11:14:49] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12146478085067427322.kers
Total runtime 2 ms.
[2026-05-26 11:14:49] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/96 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 241/337 variables, 96/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 38/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/338 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/338 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/96 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 241/337 variables, 96/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 38/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/338 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/338 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 654 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 833ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 267/267 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 96 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 265
Applied a total of 2 rules in 32 ms. Remains 96 /97 variables (removed 1) and now considering 265/267 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 96/97 places, 265/267 transitions.
RANDOM walk for 40000 steps (2311 resets) in 279 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (622 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1464862 steps, run timeout after 3001 ms. (steps per millisecond=488 ) properties seen :0 out of 1
Probabilistic random walk after 1464862 steps, saw 296884 distinct states, run finished after 3001 ms. (steps per millisecond=488 ) properties seen :0
[2026-05-26 11:14:53] [INFO ] Flow matrix only has 239 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2118066096704186822.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7474503903375792318.kers'
[2026-05-26 11:14:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2118066096704186822.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7474503903375792318.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 239 rows 96 cols 797 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-26 11:14:53] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7474503903375792318.kers
Total runtime 2 ms.
[2026-05-26 11:14:53] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/95 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 239/334 variables, 95/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/335 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/335 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/95 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 239/334 variables, 95/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 38/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/335 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/335 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/335 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/335 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/335 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/335 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 736 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 919ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 265/265 transitions.
Applied a total of 0 rules in 23 ms. Remains 96 /96 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 96/96 places, 265/265 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 265/265 transitions.
Applied a total of 0 rules in 20 ms. Remains 96 /96 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2026-05-26 11:14:54] [INFO ] Flow matrix only has 239 transitions (discarded 26 similar events)
[2026-05-26 11:14:54] [INFO ] Invariant cache hit.
[2026-05-26 11:14:54] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-26 11:14:54] [INFO ] Flow matrix only has 239 transitions (discarded 26 similar events)
[2026-05-26 11:14:54] [INFO ] Invariant cache hit.
[2026-05-26 11:14:54] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 11:14:55] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2026-05-26 11:14:55] [INFO ] Redundant transitions in 25 ms returned []
Running 264 sub problems to find dead transitions.
[2026-05-26 11:14:55] [INFO ] Flow matrix only has 239 transitions (discarded 26 similar events)
[2026-05-26 11:14:55] [INFO ] Invariant cache hit.
[2026-05-26 11:14:55] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 239/335 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 38/149 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 0/335 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 149 constraints, problems are : Problem set: 0 solved, 264 unsolved in 24619 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 239/335 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 38/149 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 264/413 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/335 variables, and 413 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54808ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 54811ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55416 ms. Remains : 96/96 places, 265/265 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 94 edges and 96 vertex of which 26 / 96 are part of one of the 4 SCC in 4 ms
Free SCC test removed 22 places
Drop transitions (Empty/Sink Transition effects.) removed 96 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 74 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 73 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 72 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 13 place count 72 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 71 transition count 138
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 71 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 70 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 69 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 69 transition count 118
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 69 transition count 116
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 67 transition count 115
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 67 transition count 115
Applied a total of 26 rules in 80 ms. Remains 67 /96 variables (removed 29) and now considering 115/265 (removed 150) transitions.
Running SMT prover for 1 properties.
[2026-05-26 11:15:50] [INFO ] Flow matrix only has 113 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13468830930306715504.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13707631062838165684.kers'
[2026-05-26 11:15:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13468830930306715504.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13707631062838165684.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 67 cols 399 entries
Finished phase 1 with 59 SingleSign rule and 0 generalized
[2026-05-26 11:15:50] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13707631062838165684.kers
Total runtime 4 ms.
[2026-05-26 11:15:50] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 11:15:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-26 11:15:50] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-26 11:15:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-26 11:15:50] [INFO ] After 12ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 11:15:50] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 11:15:50] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 391 ms.
Computed a total of 6 stabilizing places and 11 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 279/279 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 100 transition count 277
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 100 transition count 276
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 99 transition count 276
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 96 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 96 transition count 270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 96 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 93 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 24 place count 93 transition count 268
Applied a total of 24 rules in 58 ms. Remains 93 /102 variables (removed 9) and now considering 268/279 (removed 11) transitions.
[2026-05-26 11:15:50] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-363193464968401946.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9725043477093763349.kers'
[2026-05-26 11:15:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-363193464968401946.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9725043477093763349.kers]
Normalized transition count is 234 out of 235 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 234 rows 89 cols 757 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-26 11:15:50] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9725043477093763349.kers
Total runtime 4 ms.
[2026-05-26 11:15:50] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-26 11:15:50] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2026-05-26 11:15:50] [INFO ] Invariant cache hit.
[2026-05-26 11:15:51] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 11:15:51] [INFO ] Implicit Places using invariants and state equation in 297 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 440 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/102 places, 268/279 transitions.
Applied a total of 0 rules in 13 ms. Remains 92 /92 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 511 ms. Remains : 92/102 places, 268/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 409 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-02-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-02-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLCardinality-00 finished in 1071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 279/279 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 99 transition count 273
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 99 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 99 transition count 271
Applied a total of 8 rules in 5 ms. Remains 99 /102 variables (removed 3) and now considering 271/279 (removed 8) transitions.
[2026-05-26 11:15:51] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10733274653029741262.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9988626674645049079.kers'
[2026-05-26 11:15:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10733274653029741262.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9988626674645049079.kers]
Normalized transition count is 244 out of 245 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 244 rows 99 cols 811 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-26 11:15:51] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9988626674645049079.kers
Total runtime 2 ms.
[2026-05-26 11:15:51] [INFO ] Implicit Places using invariants in 164 ms returned []
[2026-05-26 11:15:51] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2026-05-26 11:15:51] [INFO ] Invariant cache hit.
[2026-05-26 11:15:52] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 11:15:52] [INFO ] Implicit Places using invariants and state equation in 404 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 584 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 271/279 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 590 ms. Remains : 98/102 places, 271/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Stuttering acceptance computed with spot in 267 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-02-LTLCardinality-01
Product exploration explored 100000 steps with 1 reset in 331 ms.
Product exploration explored 100000 steps with 3 reset in 148 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (2185 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (597 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 255 steps, run visited all 1 properties in 6 ms. (steps per millisecond=42 )
Probabilistic random walk after 255 steps, saw 194 distinct states, run finished after 11 ms. (steps per millisecond=23 ) properties seen :1
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 532 ms.
Stuttering acceptance computed with spot in 263 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 271/271 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
[2026-05-26 11:15:53] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7847060053345992797.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6783292066211093759.kers'
[2026-05-26 11:15:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7847060053345992797.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6783292066211093759.kers]
Normalized transition count is 244 out of 245 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 244 rows 98 cols 802 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-26 11:15:53] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6783292066211093759.kers
Total runtime 2 ms.
[2026-05-26 11:15:54] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-26 11:15:54] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2026-05-26 11:15:54] [INFO ] Invariant cache hit.
[2026-05-26 11:15:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 11:15:54] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2026-05-26 11:15:54] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2026-05-26 11:15:54] [INFO ] Invariant cache hit.
[2026-05-26 11:15:54] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 244/342 variables, 98/112 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 149 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 244/342 variables, 98/112 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 270/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
SMT process timed out in 60152ms, After SMT, problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Finished structural reductions in LTL mode , in 1 iterations and 60586 ms. Remains : 98/98 places, 271/271 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge based reduction with 1 factoid took 53 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (2176 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (551 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 255 steps, run visited all 1 properties in 5 ms. (steps per millisecond=51 )
Probabilistic random walk after 255 steps, saw 194 distinct states, run finished after 5 ms. (steps per millisecond=51 ) properties seen :1
Knowledge based reduction with 1 factoid took 63 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 389 ms.
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 175 ms.
Product exploration explored 100000 steps with 1 reset in 199 ms.
Spot run failed in 167 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin8260407957479338449
[2026-05-26 11:16:56] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8260407957479338449
Running compilation step : cd /tmp/ltsmin8260407957479338449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1302 ms.
Running link step : cd /tmp/ltsmin8260407957479338449;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin8260407957479338449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased9758334152883433221.hoa' '--buchi-type=spotba'
LTSmin run took 80 ms.
FORMULA FireWire-PT-02-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-02-LTLCardinality-01 finished in 65806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 279/279 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 102 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 101 transition count 278
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 98 transition count 272
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 98 transition count 272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 98 transition count 270
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 96 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 96 transition count 270
Applied a total of 18 rules in 34 ms. Remains 96 /102 variables (removed 6) and now considering 270/279 (removed 9) transitions.
[2026-05-26 11:16:57] [INFO ] Flow matrix only has 240 transitions (discarded 30 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8375721412885860833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14491295816336345945.kers'
[2026-05-26 11:16:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8375721412885860833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14491295816336345945.kers]
Normalized transition count is 239 out of 240 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 239 rows 96 cols 797 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-26 11:16:57] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14491295816336345945.kers
Total runtime 2 ms.
[2026-05-26 11:16:57] [INFO ] Implicit Places using invariants in 143 ms returned []
[2026-05-26 11:16:57] [INFO ] Flow matrix only has 240 transitions (discarded 30 similar events)
[2026-05-26 11:16:57] [INFO ] Invariant cache hit.
[2026-05-26 11:16:57] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 11:16:58] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2026-05-26 11:16:58] [INFO ] Redundant transitions in 14 ms returned []
Running 269 sub problems to find dead transitions.
[2026-05-26 11:16:58] [INFO ] Flow matrix only has 240 transitions (discarded 30 similar events)
[2026-05-26 11:16:58] [INFO ] Invariant cache hit.
[2026-05-26 11:16:58] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 239/335 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 38/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/336 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/336 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 150 constraints, problems are : Problem set: 0 solved, 269 unsolved in 29349 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 239/335 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 38/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 269/418 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/336 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 336/336 variables, and 419 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59488ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 59490ms
Starting structural reductions in SI_LTL mode, iteration 1 : 96/102 places, 270/279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60061 ms. Remains : 96/102 places, 270/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-02-LTLCardinality-03
Product exploration explored 100000 steps with 3 reset in 63 ms.
Product exploration explored 100000 steps with 1 reset in 72 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge based reduction with 3 factoid took 50 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (2308 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (634 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1317918 steps, run timeout after 3001 ms. (steps per millisecond=439 ) properties seen :0 out of 1
Probabilistic random walk after 1317918 steps, saw 249369 distinct states, run finished after 3001 ms. (steps per millisecond=439 ) properties seen :0
[2026-05-26 11:18:00] [INFO ] Flow matrix only has 240 transitions (discarded 30 similar events)
[2026-05-26 11:18:00] [INFO ] Invariant cache hit.
[2026-05-26 11:18:00] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/95 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 239/334 variables, 95/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/335 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/336 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/336 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/336 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/95 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 239/334 variables, 95/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 38/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/335 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/335 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/335 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/335 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/335 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/336 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/336 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/336 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 147 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1104 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1323ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 270/270 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 96 transition count 265
Applied a total of 5 rules in 12 ms. Remains 96 /96 variables (removed 0) and now considering 265/270 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 96/96 places, 265/270 transitions.
RANDOM walk for 40000 steps (2315 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (619 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1473973 steps, run timeout after 3001 ms. (steps per millisecond=491 ) properties seen :0 out of 1
Probabilistic random walk after 1473973 steps, saw 298234 distinct states, run finished after 3001 ms. (steps per millisecond=491 ) properties seen :0
[2026-05-26 11:18:05] [INFO ] Flow matrix only has 239 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7717903266495476366.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4214255902957815931.kers'
[2026-05-26 11:18:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7717903266495476366.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4214255902957815931.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 239 rows 96 cols 797 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-26 11:18:05] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4214255902957815931.kers
Total runtime 3 ms.
[2026-05-26 11:18:05] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/95 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 239/334 variables, 95/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/335 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/335 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/95 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 239/334 variables, 95/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 38/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/335 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/335 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/335 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/335 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 750ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 265/265 transitions.
Applied a total of 0 rules in 14 ms. Remains 96 /96 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 96/96 places, 265/265 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 265/265 transitions.
Applied a total of 0 rules in 9 ms. Remains 96 /96 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2026-05-26 11:18:06] [INFO ] Flow matrix only has 239 transitions (discarded 26 similar events)
[2026-05-26 11:18:06] [INFO ] Invariant cache hit.
[2026-05-26 11:18:06] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-26 11:18:06] [INFO ] Flow matrix only has 239 transitions (discarded 26 similar events)
[2026-05-26 11:18:06] [INFO ] Invariant cache hit.
[2026-05-26 11:18:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 11:18:06] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2026-05-26 11:18:06] [INFO ] Redundant transitions in 6 ms returned []
Running 264 sub problems to find dead transitions.
[2026-05-26 11:18:06] [INFO ] Flow matrix only has 239 transitions (discarded 26 similar events)
[2026-05-26 11:18:06] [INFO ] Invariant cache hit.
[2026-05-26 11:18:06] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 239/335 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 38/149 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 0/335 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 149 constraints, problems are : Problem set: 0 solved, 264 unsolved in 22743 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 239/335 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 38/149 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 264/413 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/335 variables, and 413 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52861ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 52863ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53385 ms. Remains : 96/96 places, 265/265 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 94 edges and 96 vertex of which 26 / 96 are part of one of the 4 SCC in 1 ms
Free SCC test removed 22 places
Drop transitions (Empty/Sink Transition effects.) removed 96 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 74 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 73 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 72 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 13 place count 72 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 71 transition count 138
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 71 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 70 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 69 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 69 transition count 118
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 69 transition count 116
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 67 transition count 115
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 67 transition count 115
Applied a total of 26 rules in 34 ms. Remains 67 /96 variables (removed 29) and now considering 115/265 (removed 150) transitions.
Running SMT prover for 1 properties.
[2026-05-26 11:18:59] [INFO ] Flow matrix only has 113 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11029541210069848673.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11374726130195145541.kers'
[2026-05-26 11:18:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11029541210069848673.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11374726130195145541.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 67 cols 399 entries
Finished phase 1 with 59 SingleSign rule and 0 generalized
[2026-05-26 11:18:59] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11374726130195145541.kers
Total runtime 1 ms.
[2026-05-26 11:18:59] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 11:18:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-26 11:18:59] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-26 11:18:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-26 11:18:59] [INFO ] After 13ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 11:18:59] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 11:18:59] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 259 ms.
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Knowledge-based reduction took 62049 ms.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 270/270 transitions.
Applied a total of 0 rules in 9 ms. Remains 96 /96 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2026-05-26 11:18:59] [INFO ] Flow matrix only has 240 transitions (discarded 30 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12986010220411965024.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5994826976383495107.kers'
[2026-05-26 11:18:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12986010220411965024.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5994826976383495107.kers]
Normalized transition count is 239 out of 240 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 239 rows 96 cols 797 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-26 11:18:59] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5994826976383495107.kers
Total runtime 2 ms.
[2026-05-26 11:19:00] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-26 11:19:00] [INFO ] Flow matrix only has 240 transitions (discarded 30 similar events)
[2026-05-26 11:19:00] [INFO ] Invariant cache hit.
[2026-05-26 11:19:00] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 11:19:00] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2026-05-26 11:19:00] [INFO ] Redundant transitions in 3 ms returned []
Running 269 sub problems to find dead transitions.
[2026-05-26 11:19:00] [INFO ] Flow matrix only has 240 transitions (discarded 30 similar events)
[2026-05-26 11:19:00] [INFO ] Invariant cache hit.
[2026-05-26 11:19:00] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 239/335 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 38/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/336 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/336 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 150 constraints, problems are : Problem set: 0 solved, 269 unsolved in 27322 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 239/335 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 38/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 269/418 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/336 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 336/336 variables, and 419 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57484ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 57486ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58019 ms. Remains : 96/96 places, 270/270 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (2334 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (632 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1417337 steps, run timeout after 3001 ms. (steps per millisecond=472 ) properties seen :0 out of 1
Probabilistic random walk after 1417337 steps, saw 267931 distinct states, run finished after 3001 ms. (steps per millisecond=472 ) properties seen :0
[2026-05-26 11:20:01] [INFO ] Flow matrix only has 240 transitions (discarded 30 similar events)
[2026-05-26 11:20:01] [INFO ] Invariant cache hit.
[2026-05-26 11:20:01] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/95 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 239/334 variables, 95/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/335 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/336 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/336 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/336 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/95 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 239/334 variables, 95/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 38/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/335 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/335 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/335 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/335 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/335 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/336 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/336 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/336 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 147 constraints, problems are : Problem set: 0 solved, 1 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1107ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 270/270 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 96 transition count 265
Applied a total of 5 rules in 9 ms. Remains 96 /96 variables (removed 0) and now considering 265/270 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 96/96 places, 265/270 transitions.
RANDOM walk for 40000 steps (2347 resets) in 372 ms. (107 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (701 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1570512 steps, run timeout after 3001 ms. (steps per millisecond=523 ) properties seen :0 out of 1
Probabilistic random walk after 1570512 steps, saw 317194 distinct states, run finished after 3001 ms. (steps per millisecond=523 ) properties seen :0
[2026-05-26 11:20:05] [INFO ] Flow matrix only has 239 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13239713139290454705.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7164093315027734857.kers'
[2026-05-26 11:20:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13239713139290454705.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7164093315027734857.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 239 rows 96 cols 797 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-26 11:20:05] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7164093315027734857.kers
Total runtime 1 ms.
[2026-05-26 11:20:05] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/95 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 239/334 variables, 95/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/335 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/335 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/95 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 239/334 variables, 95/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 38/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/335 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/335 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/335 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/335 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 631ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 265/265 transitions.
Applied a total of 0 rules in 10 ms. Remains 96 /96 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 96/96 places, 265/265 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 265/265 transitions.
Applied a total of 0 rules in 7 ms. Remains 96 /96 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2026-05-26 11:20:06] [INFO ] Flow matrix only has 239 transitions (discarded 26 similar events)
[2026-05-26 11:20:06] [INFO ] Invariant cache hit.
[2026-05-26 11:20:06] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-26 11:20:06] [INFO ] Flow matrix only has 239 transitions (discarded 26 similar events)
[2026-05-26 11:20:06] [INFO ] Invariant cache hit.
[2026-05-26 11:20:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 11:20:06] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2026-05-26 11:20:06] [INFO ] Redundant transitions in 2 ms returned []
Running 264 sub problems to find dead transitions.
[2026-05-26 11:20:06] [INFO ] Flow matrix only has 239 transitions (discarded 26 similar events)
[2026-05-26 11:20:06] [INFO ] Invariant cache hit.
[2026-05-26 11:20:06] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 239/335 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 38/149 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 0/335 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 149 constraints, problems are : Problem set: 0 solved, 264 unsolved in 23175 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 239/335 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 38/149 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 264/413 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/335 variables, and 413 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53315ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 53317ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53801 ms. Remains : 96/96 places, 265/265 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 94 edges and 96 vertex of which 26 / 96 are part of one of the 4 SCC in 1 ms
Free SCC test removed 22 places
Drop transitions (Empty/Sink Transition effects.) removed 96 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 74 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 73 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 72 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 13 place count 72 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 71 transition count 138
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 71 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 70 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 69 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 69 transition count 118
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 69 transition count 116
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 67 transition count 115
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 67 transition count 115
Applied a total of 26 rules in 30 ms. Remains 67 /96 variables (removed 29) and now considering 115/265 (removed 150) transitions.
Running SMT prover for 1 properties.
[2026-05-26 11:20:59] [INFO ] Flow matrix only has 113 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-314783356627356573.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15142476850089389893.kers'
[2026-05-26 11:20:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-314783356627356573.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15142476850089389893.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 67 cols 399 entries
Finished phase 1 with 59 SingleSign rule and 0 generalized
[2026-05-26 11:20:59] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15142476850089389893.kers
Total runtime 1 ms.
[2026-05-26 11:20:59] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 11:20:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-26 11:21:00] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-26 11:21:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-26 11:21:00] [INFO ] After 13ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 11:21:00] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 11:21:00] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 278 ms.
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Knowledge-based reduction took 62283 ms.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 104 ms.
Product exploration explored 100000 steps with 4 reset in 126 ms.
Built C files in :
/tmp/ltsmin483798603099926159
[2026-05-26 11:21:00] [INFO ] Computing symmetric may disable matrix : 270 transitions.
[2026-05-26 11:21:00] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:21:00] [INFO ] Computing symmetric may enable matrix : 270 transitions.
[2026-05-26 11:21:00] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:21:00] [INFO ] Computing Do-Not-Accords matrix : 270 transitions.
[2026-05-26 11:21:00] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:21:00] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin483798603099926159
Running compilation step : cd /tmp/ltsmin483798603099926159;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1074 ms.
Running link step : cd /tmp/ltsmin483798603099926159;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin483798603099926159;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3972197456530068203.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 270/270 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2026-05-26 11:21:15] [INFO ] Flow matrix only has 240 transitions (discarded 30 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6138329918991940173.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10445068525665463020.kers'
[2026-05-26 11:21:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6138329918991940173.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10445068525665463020.kers]
Normalized transition count is 239 out of 240 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 239 rows 96 cols 797 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-26 11:21:15] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10445068525665463020.kers
Total runtime 1 ms.
[2026-05-26 11:21:15] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-26 11:21:15] [INFO ] Flow matrix only has 240 transitions (discarded 30 similar events)
[2026-05-26 11:21:15] [INFO ] Invariant cache hit.
[2026-05-26 11:21:15] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 11:21:15] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2026-05-26 11:21:15] [INFO ] Redundant transitions in 3 ms returned []
Running 269 sub problems to find dead transitions.
[2026-05-26 11:21:15] [INFO ] Flow matrix only has 240 transitions (discarded 30 similar events)
[2026-05-26 11:21:15] [INFO ] Invariant cache hit.
[2026-05-26 11:21:15] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 239/335 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 38/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/336 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (OVERLAPS) 0/336 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 150 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 239/335 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 38/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 269/418 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/336 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 336/336 variables, and 419 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60520 ms. Remains : 96/96 places, 270/270 transitions.
Built C files in :
/tmp/ltsmin9465619405904958359
[2026-05-26 11:22:16] [INFO ] Computing symmetric may disable matrix : 270 transitions.
[2026-05-26 11:22:16] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:22:16] [INFO ] Computing symmetric may enable matrix : 270 transitions.
[2026-05-26 11:22:16] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:22:16] [INFO ] Computing Do-Not-Accords matrix : 270 transitions.
[2026-05-26 11:22:16] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:22:16] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9465619405904958359
Running compilation step : cd /tmp/ltsmin9465619405904958359;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 966 ms.
Running link step : cd /tmp/ltsmin9465619405904958359;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9465619405904958359;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14256206456199784113.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 11:22:31] [INFO ] Flatten gal took : 23 ms
[2026-05-26 11:22:31] [INFO ] Flatten gal took : 23 ms
[2026-05-26 11:22:31] [INFO ] Time to serialize gal into /tmp/LTL8959815156462024567.gal : 6 ms
[2026-05-26 11:22:31] [INFO ] Time to serialize properties into /tmp/LTL14793792377349895209.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8959815156462024567.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13622057386258828943.hoa' '-atoms' '/tmp/LTL14793792377349895209.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14793792377349895209.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13622057386258828943.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t31, t33, t37, t38, t4...575
Computing Next relation with stutter on 4272 deadlock states
Detected timeout of ITS tools.
[2026-05-26 11:22:46] [INFO ] Flatten gal took : 20 ms
[2026-05-26 11:22:46] [INFO ] Flatten gal took : 20 ms
[2026-05-26 11:22:46] [INFO ] Time to serialize gal into /tmp/LTL11070120103566183793.gal : 5 ms
[2026-05-26 11:22:46] [INFO ] Time to serialize properties into /tmp/LTL3087236418438063051.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11070120103566183793.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3087236418438063051.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((p58==0)||(p91==1))||((p79==0)||(p67==1)))"))))
Formula 0 simplified : GF!"(((p58==0)||(p91==1))||((p79==0)||(p67==1)))"
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t31, t33, t37, t38, t4...575
Computing Next relation with stutter on 4272 deadlock states
Detected timeout of ITS tools.
[2026-05-26 11:23:01] [INFO ] Flatten gal took : 20 ms
[2026-05-26 11:23:01] [INFO ] Applying decomposition
[2026-05-26 11:23:01] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3784187939077003737.txt' '-o' '/tmp/graph3784187939077003737.bin' '-w' '/tmp/graph3784187939077003737.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3784187939077003737.bin' '-l' '-1' '-v' '-w' '/tmp/graph3784187939077003737.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:23:01] [INFO ] Decomposing Gal with order
[2026-05-26 11:23:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:23:01] [INFO ] Removed a total of 371 redundant transitions.
[2026-05-26 11:23:01] [INFO ] Flatten gal took : 110 ms
[2026-05-26 11:23:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 26 ms.
[2026-05-26 11:23:01] [INFO ] Time to serialize gal into /tmp/LTL3191754032394030168.gal : 7 ms
[2026-05-26 11:23:01] [INFO ] Time to serialize properties into /tmp/LTL11930800713066765330.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3191754032394030168.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11930800713066765330.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i5.u16.p58==0)||(i6.u24.p91==1))||((i1.u22.p79==0)||(i1.u18.p67==1)))"))))
Formula 0 simplified : GF!"(((i5.u16.p58==0)||(i6.u24.p91==1))||((i1.u22.p79==0)||(i1.u18.p67==1)))"
Reverse transition relation is NOT exact ! Due to transitions t1, t42, t44, t45, t48, t49, t51, t53, t58, t60, t104, t140, t143, t144, t155, t187, t189, t1...726
Computing Next relation with stutter on 4272 deadlock states
Detected timeout of ITS tools.
Treatment of property FireWire-PT-02-LTLCardinality-03 finished in 379284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F((p1&&G(p2)))))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 279/279 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 101 transition count 277
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 277
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 101 transition count 276
Applied a total of 3 rules in 3 ms. Remains 101 /102 variables (removed 1) and now considering 276/279 (removed 3) transitions.
[2026-05-26 11:23:16] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14732213983957626731.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11138035675353929074.kers'
[2026-05-26 11:23:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14732213983957626731.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11138035675353929074.kers]
Normalized transition count is 249 out of 250 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 249 rows 101 cols 831 entries
Finished phase 1 with 93 SingleSign rule and 0 generalized
[2026-05-26 11:23:16] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11138035675353929074.kers
Total runtime 1 ms.
[2026-05-26 11:23:16] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-26 11:23:16] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
[2026-05-26 11:23:16] [INFO ] Invariant cache hit.
[2026-05-26 11:23:17] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 11:23:17] [INFO ] Implicit Places using invariants and state equation in 586 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 678 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/102 places, 276/279 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 685 ms. Remains : 100/102 places, 276/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F((p0&&G(p1))))||p2)))'
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FireWire-PT-02-LTLCardinality-05
Product exploration explored 100000 steps with 5 reset in 90 ms.
Product exploration explored 100000 steps with 0 reset in 114 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge based reduction with 6 factoid took 75 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (2212 resets) in 158 ms. (251 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (563 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
[2026-05-26 11:23:18] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14971170559100089213.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3405254767452901867.kers'
[2026-05-26 11:23:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14971170559100089213.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3405254767452901867.kers]
Normalized transition count is 249 out of 250 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 249 rows 100 cols 822 entries
Finished phase 1 with 93 SingleSign rule and 0 generalized
[2026-05-26 11:23:18] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3405254767452901867.kers
Total runtime 3 ms.
[2026-05-26 11:23:18] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/96 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 246/342 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 35/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/346 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/349 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/350 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/350 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/96 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 246/342 variables, 96/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 35/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/346 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/349 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/349 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/350 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/350 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/350 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 695ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 276/276 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 100 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 99 transition count 272
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 99 transition count 271
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 98 transition count 271
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 97 transition count 269
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 97 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 97 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 94 transition count 274
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 22 place count 94 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 25 place count 94 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 94 transition count 267
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 29 place count 93 transition count 265
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 31 place count 93 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 32 place count 92 transition count 262
Applied a total of 32 rules in 54 ms. Remains 92 /100 variables (removed 8) and now considering 262/276 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 92/100 places, 262/276 transitions.
RANDOM walk for 40000 steps (2582 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (671 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2000 steps, run visited all 1 properties in 10 ms. (steps per millisecond=200 )
Probabilistic random walk after 2000 steps, saw 1163 distinct states, run finished after 11 ms. (steps per millisecond=181 ) properties seen :1
Knowledge based reduction with 6 factoid took 137 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Knowledge-based reduction took 1348 ms.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 276/276 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2026-05-26 11:23:19] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
[2026-05-26 11:23:19] [INFO ] Invariant cache hit.
[2026-05-26 11:23:19] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-26 11:23:19] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
[2026-05-26 11:23:19] [INFO ] Invariant cache hit.
[2026-05-26 11:23:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 11:23:20] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 275 sub problems to find dead transitions.
[2026-05-26 11:23:20] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
[2026-05-26 11:23:20] [INFO ] Invariant cache hit.
[2026-05-26 11:23:20] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 249/349 variables, 100/114 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 1/350 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/350 variables, and 151 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 249/349 variables, 100/114 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 275/425 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (OVERLAPS) 1/350 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/350 variables, and 426 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Finished structural reductions in LTL mode , in 1 iterations and 60625 ms. Remains : 100/100 places, 276/276 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge based reduction with 5 factoid took 70 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (2231 resets) in 118 ms. (336 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (559 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
[2026-05-26 11:24:20] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
[2026-05-26 11:24:20] [INFO ] Invariant cache hit.
[2026-05-26 11:24:20] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/96 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 246/342 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 35/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/346 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/349 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/350 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/350 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/96 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 246/342 variables, 96/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 35/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/346 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/349 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/349 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/350 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/350 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/350 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 413 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 630ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 276/276 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 100 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 99 transition count 272
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 99 transition count 271
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 98 transition count 271
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 97 transition count 269
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 97 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 97 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 94 transition count 274
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 22 place count 94 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 25 place count 94 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 94 transition count 267
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 29 place count 93 transition count 265
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 31 place count 93 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 32 place count 92 transition count 262
Applied a total of 32 rules in 38 ms. Remains 92 /100 variables (removed 8) and now considering 262/276 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 92/100 places, 262/276 transitions.
RANDOM walk for 40000 steps (2690 resets) in 400 ms. (99 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (715 resets) in 256 ms. (155 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2000 steps, run visited all 1 properties in 19 ms. (steps per millisecond=105 )
Probabilistic random walk after 2000 steps, saw 1163 distinct states, run finished after 20 ms. (steps per millisecond=100 ) properties seen :1
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Knowledge-based reduction took 1382 ms.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 63 ms.
Product exploration explored 100000 steps with 7 reset in 75 ms.
Spot run failed in 83 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin15234002470525371444
[2026-05-26 11:24:22] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15234002470525371444
Running compilation step : cd /tmp/ltsmin15234002470525371444;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 882 ms.
Running link step : cd /tmp/ltsmin15234002470525371444;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15234002470525371444;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased9123151088098774065.hoa' '--buchi-type=spotba'
LTSmin run took 73 ms.
FORMULA FireWire-PT-02-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-02-LTLCardinality-05 finished in 66389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0)) U ((!p0&&X(X(p0)))||X(X(G(p0)))))))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 279/279 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 99 transition count 273
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 99 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 99 transition count 271
Applied a total of 8 rules in 5 ms. Remains 99 /102 variables (removed 3) and now considering 271/279 (removed 8) transitions.
[2026-05-26 11:24:23] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-270677943673091495.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10577896043022235092.kers'
[2026-05-26 11:24:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-270677943673091495.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10577896043022235092.kers]
Normalized transition count is 244 out of 245 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 244 rows 99 cols 811 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-26 11:24:23] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10577896043022235092.kers
Total runtime 1 ms.
[2026-05-26 11:24:23] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-26 11:24:23] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2026-05-26 11:24:23] [INFO ] Invariant cache hit.
[2026-05-26 11:24:23] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 11:24:23] [INFO ] Implicit Places using invariants and state equation in 277 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 404 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 271/279 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 412 ms. Remains : 98/102 places, 271/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0)) U (X(X(G(p0)))||(!p0&&X(X(p0)))))))'
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-02-LTLCardinality-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLCardinality-06 finished in 665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 279/279 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 100 transition count 277
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 100 transition count 276
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 99 transition count 276
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 96 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 96 transition count 270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 96 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 93 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 24 place count 93 transition count 268
Applied a total of 24 rules in 25 ms. Remains 93 /102 variables (removed 9) and now considering 268/279 (removed 11) transitions.
[2026-05-26 11:24:23] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3774099320224158786.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6316406264904850525.kers'
[2026-05-26 11:24:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3774099320224158786.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6316406264904850525.kers]
Normalized transition count is 234 out of 235 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 234 rows 89 cols 757 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-26 11:24:23] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6316406264904850525.kers
Total runtime 3 ms.
[2026-05-26 11:24:24] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-26 11:24:24] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2026-05-26 11:24:24] [INFO ] Invariant cache hit.
[2026-05-26 11:24:24] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 11:24:24] [INFO ] Implicit Places using invariants and state equation in 337 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 485 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/102 places, 268/279 transitions.
Applied a total of 0 rules in 6 ms. Remains 92 /92 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 516 ms. Remains : 92/102 places, 268/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-02-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLCardinality-07 finished in 600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (G(p1)||X(!p2))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 279/279 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 101 transition count 277
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 277
Applied a total of 2 rules in 5 ms. Remains 101 /102 variables (removed 1) and now considering 277/279 (removed 2) transitions.
[2026-05-26 11:24:24] [INFO ] Flow matrix only has 251 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14619363022495227714.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14122694837423962480.kers'
[2026-05-26 11:24:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14619363022495227714.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14122694837423962480.kers]
Normalized transition count is 250 out of 251 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 250 rows 101 cols 835 entries
Finished phase 1 with 93 SingleSign rule and 0 generalized
[2026-05-26 11:24:24] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14122694837423962480.kers
Total runtime 2 ms.
[2026-05-26 11:24:24] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-26 11:24:24] [INFO ] Flow matrix only has 251 transitions (discarded 26 similar events)
[2026-05-26 11:24:24] [INFO ] Invariant cache hit.
[2026-05-26 11:24:24] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 11:24:25] [INFO ] Implicit Places using invariants and state equation in 384 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 535 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/102 places, 277/279 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 542 ms. Remains : 100/102 places, 277/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (G(p1)||X(!p2))))'
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p1) p2), (AND (NOT p0) p2), (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-02-LTLCardinality-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLCardinality-08 finished in 914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||(p1&&F(p2)))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 279/279 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 99 transition count 273
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 99 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 99 transition count 271
Applied a total of 8 rules in 3 ms. Remains 99 /102 variables (removed 3) and now considering 271/279 (removed 8) transitions.
[2026-05-26 11:24:25] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2533401554030251095.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9722433180360614088.kers'
[2026-05-26 11:24:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2533401554030251095.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9722433180360614088.kers]
Normalized transition count is 244 out of 245 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 244 rows 99 cols 811 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-26 11:24:25] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9722433180360614088.kers
Total runtime 3 ms.
[2026-05-26 11:24:25] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-05-26 11:24:25] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2026-05-26 11:24:25] [INFO ] Invariant cache hit.
[2026-05-26 11:24:25] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 11:24:25] [INFO ] Implicit Places using invariants and state equation in 311 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 468 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 271/279 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 472 ms. Remains : 98/102 places, 271/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||(F(p1)&&p2))))'
Stuttering acceptance computed with spot in 269 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : FireWire-PT-02-LTLCardinality-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLCardinality-09 finished in 783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 279/279 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 99 transition count 273
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 99 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 99 transition count 271
Applied a total of 8 rules in 3 ms. Remains 99 /102 variables (removed 3) and now considering 271/279 (removed 8) transitions.
[2026-05-26 11:24:26] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2026-05-26 11:24:26] [INFO ] Invariant cache hit.
[2026-05-26 11:24:26] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-26 11:24:26] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2026-05-26 11:24:26] [INFO ] Invariant cache hit.
[2026-05-26 11:24:26] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 11:24:26] [INFO ] Implicit Places using invariants and state equation in 324 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 463 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 271/279 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 467 ms. Remains : 98/102 places, 271/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-02-LTLCardinality-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLCardinality-11 finished in 700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 279/279 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 100 transition count 275
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 100 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 100 transition count 274
Applied a total of 5 rules in 4 ms. Remains 100 /102 variables (removed 2) and now considering 274/279 (removed 5) transitions.
[2026-05-26 11:24:26] [INFO ] Flow matrix only has 248 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16393263571330669833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11277883647159399257.kers'
[2026-05-26 11:24:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16393263571330669833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11277883647159399257.kers]
Normalized transition count is 247 out of 248 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 247 rows 100 cols 823 entries
Finished phase 1 with 92 SingleSign rule and 0 generalized
[2026-05-26 11:24:26] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11277883647159399257.kers
Total runtime 2 ms.
[2026-05-26 11:24:27] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-26 11:24:27] [INFO ] Flow matrix only has 248 transitions (discarded 26 similar events)
[2026-05-26 11:24:27] [INFO ] Invariant cache hit.
[2026-05-26 11:24:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 11:24:27] [INFO ] Implicit Places using invariants and state equation in 337 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 490 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 274/279 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 274/274 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 496 ms. Remains : 99/102 places, 274/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-02-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 153 ms.
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLCardinality-12 finished in 856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (X(X(p1))||G(p0))) U X(!p1)))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 279/279 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 99 transition count 273
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 99 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 99 transition count 271
Applied a total of 8 rules in 4 ms. Remains 99 /102 variables (removed 3) and now considering 271/279 (removed 8) transitions.
[2026-05-26 11:24:27] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6326953640478420069.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6691413694038711799.kers'
[2026-05-26 11:24:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6326953640478420069.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6691413694038711799.kers]
Normalized transition count is 244 out of 245 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 244 rows 99 cols 811 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-26 11:24:27] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6691413694038711799.kers
Total runtime 2 ms.
[2026-05-26 11:24:27] [INFO ] Implicit Places using invariants in 143 ms returned []
[2026-05-26 11:24:27] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2026-05-26 11:24:27] [INFO ] Invariant cache hit.
[2026-05-26 11:24:28] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 11:24:28] [INFO ] Implicit Places using invariants and state equation in 326 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 472 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 271/279 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 479 ms. Remains : 98/102 places, 271/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (X(X(p1))||G(p0))) U X(!p1)))'
Stuttering acceptance computed with spot in 366 ms :[p1, false, p1, false, (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-02-LTLCardinality-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-02-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-02-LTLCardinality-14 finished in 894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Spot run failed in 77 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-26 11:24:28] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
[2026-05-26 11:24:28] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin17589566850395873070
[2026-05-26 11:24:28] [INFO ] Computing symmetric may disable matrix : 279 transitions.
[2026-05-26 11:24:28] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:24:28] [INFO ] Computing symmetric may enable matrix : 279 transitions.
[2026-05-26 11:24:28] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:24:28] [INFO ] Flatten gal took : 43 ms
[2026-05-26 11:24:28] [INFO ] Computing Do-Not-Accords matrix : 279 transitions.
[2026-05-26 11:24:28] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:24:28] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17589566850395873070
Running compilation step : cd /tmp/ltsmin17589566850395873070;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6665999640862289114.txt' '-o' '/tmp/graph6665999640862289114.bin' '-w' '/tmp/graph6665999640862289114.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6665999640862289114.bin' '-l' '-1' '-v' '-w' '/tmp/graph6665999640862289114.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:24:28] [INFO ] Decomposing Gal with order
[2026-05-26 11:24:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:24:28] [INFO ] Removed a total of 412 redundant transitions.
[2026-05-26 11:24:28] [INFO ] Flatten gal took : 51 ms
[2026-05-26 11:24:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 14 ms.
[2026-05-26 11:24:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality17001931097384740038.gal : 5 ms
[2026-05-26 11:24:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality12479210263889382500.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17001931097384740038.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12479210263889382500.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i4.u19.p58==0)||(i5.u28.p91==1))||((i6.u26.p79==0)||(i5.u21.p67==1)))"))))
Formula 0 simplified : GF!"(((i4.u19.p58==0)||(i5.u28.p91==1))||((i6.u26.p79==0)||(i5.u21.p67==1)))"
Compilation finished in 1111 ms.
Running link step : cd /tmp/ltsmin17589566850395873070;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17589566850395873070;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t42, t44, t48, t49, t58, t60, t104, t120, t125, t130, t135, t140, t143, t155, t189, t190,...731
Computing Next relation with stutter on 5645 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
1574 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,15.7818,355264,1,0,468461,4271,2620,2.26731e+06,412,31674,1304252
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FireWire-PT-02-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 668877 ms.

BK_STOP 1779794686735

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="FireWire-PT-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FireWire-PT-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-177955808900155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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