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-177955809100364.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 FlexibleBarrier-PT-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809100364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.6K Mar 7 06:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 7 06:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 7 06:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 06:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 15 10:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Mar 7 06:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Mar 7 06:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 7 06:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 06:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 374K 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 FlexibleBarrier-PT-10b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779886823380

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 13:00:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 13:00:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 13:00:26] [INFO ] Load time of PNML (sax parser for PT used): 371 ms
[2026-05-27 13:00:26] [INFO ] Transformed 1402 places.
[2026-05-27 13:00:26] [INFO ] Transformed 1613 transitions.
[2026-05-27 13:00:26] [INFO ] Found NUPN structural information;
[2026-05-27 13:00:26] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 671 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Discarding 535 places :
Symmetric choice reduction at 0 with 535 rule applications. Total rules 535 place count 867 transition count 1078
Iterating global reduction 0 with 535 rules applied. Total rules applied 1070 place count 867 transition count 1078
Discarding 231 places :
Symmetric choice reduction at 0 with 231 rule applications. Total rules 1301 place count 636 transition count 847
Iterating global reduction 0 with 231 rules applied. Total rules applied 1532 place count 636 transition count 847
Discarding 141 places :
Symmetric choice reduction at 0 with 141 rule applications. Total rules 1673 place count 495 transition count 706
Iterating global reduction 0 with 141 rules applied. Total rules applied 1814 place count 495 transition count 706
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 1880 place count 495 transition count 640
Applied a total of 1880 rules in 478 ms. Remains 495 /1402 variables (removed 907) and now considering 640/1613 (removed 973) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16414041276527055829.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9085331278559482097.kers'
[2026-05-27 13:00:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16414041276527055829.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9085331278559482097.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 640 rows 495 cols 1815 entries
Finished phase 1 with 483 SingleSign rule and 0 generalized
[2026-05-27 13:00:27] [INFO ] Computed 12 invariants in 6 ms
Computed 12 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-9085331278559482097.kers
Total runtime 9 ms.
[2026-05-27 13:00:28] [INFO ] Implicit Places using invariants in 1282 ms returned []
[2026-05-27 13:00:28] [INFO ] Invariant cache hit.
[2026-05-27 13:00:29] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned []
Implicit Place search using SMT with State Equation took 2669 ms to find 0 implicit places.
Running 639 sub problems to find dead transitions.
[2026-05-27 13:00:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 495/1135 variables, and 12 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/495 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 639 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/1135 variables, and 18 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/495 constraints, PredecessorRefiner: 0/639 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60706ms problems are : Problem set: 0 solved, 639 unsolved
Search for dead transitions found 0 dead transitions in 60742ms
Starting structural reductions in LTL mode, iteration 1 : 495/1402 places, 640/1613 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63966 ms. Remains : 495/1402 places, 640/1613 transitions.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 640/640 transitions.
Applied a total of 0 rules in 47 ms. Remains 495 /495 variables (removed 0) and now considering 640/640 (removed 0) transitions.
[2026-05-27 13:01:30] [INFO ] Invariant cache hit.
[2026-05-27 13:01:31] [INFO ] Implicit Places using invariants in 561 ms returned []
[2026-05-27 13:01:31] [INFO ] Invariant cache hit.
[2026-05-27 13:01:32] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1576 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1625 ms. Remains : 495/495 places, 640/640 transitions.
Support contains 37 out of 495 places after structural reductions.
[2026-05-27 13:01:32] [INFO ] Flatten gal took : 155 ms
[2026-05-27 13:01:33] [INFO ] Flatten gal took : 79 ms
[2026-05-27 13:01:33] [INFO ] Input system was already deterministic with 640 transitions.
Support contains 35 out of 495 places (down from 37) after GAL structural reductions.
RANDOM walk for 40000 steps (525 resets) in 2917 ms. (13 steps per ms) remains 16/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
[2026-05-27 13:01:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 397/417 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 78/495 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 640/1135 variables, 495/507 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1135 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1135 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/1135 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1135 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/1135 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1135/1135 variables, and 509 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5000 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 397/417 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 78/495 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 640/1135 variables, 495/510 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1135 variables, 15/525 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1135 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/1135 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1135/1135 variables, and 525 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10019ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 14 properties in 1477 ms.
Support contains 1 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 640/640 transitions.
Graph (trivial) has 461 edges and 495 vertex of which 61 / 495 are part of one of the 10 SCC in 10 ms
Free SCC test removed 51 places
Drop transitions (Empty/Sink Transition effects.) removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 444 transition count 526
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 392 transition count 526
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 105 place count 392 transition count 498
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 161 place count 364 transition count 498
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 201 place count 324 transition count 458
Iterating global reduction 2 with 40 rules applied. Total rules applied 241 place count 324 transition count 458
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 243 place count 324 transition count 456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 243 place count 324 transition count 455
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 245 place count 323 transition count 455
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 256 place count 312 transition count 444
Iterating global reduction 3 with 11 rules applied. Total rules applied 267 place count 312 transition count 444
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 278 place count 312 transition count 433
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 404 place count 249 transition count 370
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 424 place count 249 transition count 350
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 436 place count 237 transition count 338
Iterating global reduction 5 with 12 rules applied. Total rules applied 448 place count 237 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 450 place count 237 transition count 336
Free-agglomeration rule applied 182 times.
Iterating global reduction 6 with 182 rules applied. Total rules applied 632 place count 237 transition count 154
Reduce places removed 182 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (complete) has 147 edges and 55 vertex of which 15 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 263 rules applied. Total rules applied 895 place count 15 transition count 74
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 7 with 56 rules applied. Total rules applied 951 place count 15 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 952 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 10 edges and 13 vertex of which 4 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 954 place count 11 transition count 17
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 958 place count 11 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 958 place count 11 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 962 place count 9 transition count 11
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 964 place count 9 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 968 place count 7 transition count 7
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 970 place count 7 transition count 5
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 976 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 976 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 978 place count 2 transition count 2
Applied a total of 978 rules in 268 ms. Remains 2 /495 variables (removed 493) and now considering 2/640 (removed 638) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 2/495 places, 2/640 transitions.
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Computed a total of 14 stabilizing places and 14 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' '!((F(p0)&&X(p1)))'
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 640/640 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 474 transition count 619
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 474 transition count 619
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 474 transition count 617
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 61 place count 457 transition count 600
Iterating global reduction 1 with 17 rules applied. Total rules applied 78 place count 457 transition count 600
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 88 place count 457 transition count 590
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 454 transition count 587
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 454 transition count 587
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 96 place count 454 transition count 585
Applied a total of 96 rules in 143 ms. Remains 454 /495 variables (removed 41) and now considering 585/640 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16069091413686112409.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15812286747687710762.kers'
[2026-05-27 13:01:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16069091413686112409.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15812286747687710762.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 585 rows 454 cols 1649 entries
Finished phase 1 with 442 SingleSign rule and 0 generalized
[2026-05-27 13:01:46] [INFO ] Computed 12 invariants in 5 ms
Computed 12 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15812286747687710762.kers
Total runtime 6 ms.
[2026-05-27 13:01:47] [INFO ] Implicit Places using invariants in 708 ms returned []
[2026-05-27 13:01:47] [INFO ] Invariant cache hit.
[2026-05-27 13:01:48] [INFO ] Implicit Places using invariants and state equation in 1124 ms returned []
Implicit Place search using SMT with State Equation took 1838 ms to find 0 implicit places.
Running 584 sub problems to find dead transitions.
[2026-05-27 13:01:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/454 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1039 variables, and 12 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/454 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/454 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1039 variables, and 12 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/454 constraints, PredecessorRefiner: 0/584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60404ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60410ms
Starting structural reductions in LTL mode, iteration 1 : 454/495 places, 585/640 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62404 ms. Remains : 454/495 places, 585/640 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)&&X(p1)))'
Stuttering acceptance computed with spot in 490 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 498 ms.
Product exploration explored 100000 steps with 50000 reset in 418 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 19 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 41 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-01 finished in 63995 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' '!(G((F(p0)&&F(G((p1&&(p2 U p3)))))))'
Support contains 6 out of 495 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 495/495 places, 640/640 transitions.
Graph (trivial) has 447 edges and 495 vertex of which 55 / 495 are part of one of the 9 SCC in 2 ms
Free SCC test removed 46 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 448 transition count 539
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 395 transition count 539
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 107 place count 395 transition count 511
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 163 place count 367 transition count 511
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 200 place count 330 transition count 474
Iterating global reduction 2 with 37 rules applied. Total rules applied 237 place count 330 transition count 474
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 238 place count 330 transition count 473
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 238 place count 330 transition count 472
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 240 place count 329 transition count 472
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 251 place count 318 transition count 461
Iterating global reduction 3 with 11 rules applied. Total rules applied 262 place count 318 transition count 461
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 272 place count 318 transition count 451
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 396 place count 256 transition count 389
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 398 place count 254 transition count 387
Iterating global reduction 4 with 2 rules applied. Total rules applied 400 place count 254 transition count 387
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 402 place count 254 transition count 385
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 404 place count 253 transition count 385
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 415 place count 253 transition count 374
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 417 place count 251 transition count 372
Applied a total of 417 rules in 272 ms. Remains 251 /495 variables (removed 244) and now considering 372/640 (removed 268) transitions.
[2026-05-27 13:02:50] [INFO ] Flow matrix only has 354 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17259638744848242520.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12493609377333202181.kers'
[2026-05-27 13:02:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17259638744848242520.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12493609377333202181.kers]
Normalized transition count is 353 out of 354 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 353 rows 250 cols 1064 entries
Finished phase 1 with 239 SingleSign rule and 0 generalized
[2026-05-27 13:02:50] [INFO ] Computed 12 invariants in 3 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12493609377333202181.kers
Total runtime 4 ms.
[2026-05-27 13:02:51] [INFO ] Implicit Places using invariants in 400 ms returned []
[2026-05-27 13:02:51] [INFO ] Flow matrix only has 354 transitions (discarded 18 similar events)
[2026-05-27 13:02:51] [INFO ] Invariant cache hit.
[2026-05-27 13:02:51] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
[2026-05-27 13:02:51] [INFO ] Redundant transitions in 45 ms returned []
Running 266 sub problems to find dead transitions.
[2026-05-27 13:02:51] [INFO ] Flow matrix only has 354 transitions (discarded 18 similar events)
[2026-05-27 13:02:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/248 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 3/251 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 353/604 variables, 251/263 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 604/605 variables, and 263 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/248 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 3/251 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 353/604 variables, 251/263 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 266/529 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/605 variables, and 529 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60171ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Starting structural reductions in SI_LTL mode, iteration 1 : 251/495 places, 372/640 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61499 ms. Remains : 251/495 places, 372/640 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)&&F(G((p1&&(p2 U p3)))))))'
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (OR (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-02 finished in 61850 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((F(p0)&&F((X(X(p1))||G(p2)))))))'
Support contains 3 out of 495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 640/640 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 474 transition count 619
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 474 transition count 619
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 474 transition count 617
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 61 place count 457 transition count 600
Iterating global reduction 1 with 17 rules applied. Total rules applied 78 place count 457 transition count 600
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 87 place count 457 transition count 591
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 91 place count 453 transition count 587
Iterating global reduction 2 with 4 rules applied. Total rules applied 95 place count 453 transition count 587
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 453 transition count 585
Applied a total of 97 rules in 73 ms. Remains 453 /495 variables (removed 42) and now considering 585/640 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2182616879308483181.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3112290137803091335.kers'
[2026-05-27 13:03:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2182616879308483181.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3112290137803091335.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 585 rows 453 cols 1653 entries
Finished phase 1 with 441 SingleSign rule and 0 generalized
[2026-05-27 13:03:52] [INFO ] Computed 12 invariants in 5 ms
Computed 12 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3112290137803091335.kers
Total runtime 8 ms.
[2026-05-27 13:03:53] [INFO ] Implicit Places using invariants in 523 ms returned []
[2026-05-27 13:03:53] [INFO ] Invariant cache hit.
[2026-05-27 13:03:54] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1534 ms to find 0 implicit places.
Running 584 sub problems to find dead transitions.
[2026-05-27 13:03:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 453/1038 variables, and 12 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/453 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 584 unsolved
SMT process timed out in 60197ms, After SMT, problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Starting structural reductions in LTL mode, iteration 1 : 453/495 places, 585/640 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61811 ms. Remains : 453/495 places, 585/640 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)&&F((X(X(p1))||G(p2)))))))'
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-03
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-03 finished in 62238 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&&G(p2)&&X(p0))))))'
Support contains 3 out of 495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 640/640 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 474 transition count 619
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 474 transition count 619
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 474 transition count 617
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 61 place count 457 transition count 600
Iterating global reduction 1 with 17 rules applied. Total rules applied 78 place count 457 transition count 600
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 87 place count 457 transition count 591
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 91 place count 453 transition count 587
Iterating global reduction 2 with 4 rules applied. Total rules applied 95 place count 453 transition count 587
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 453 transition count 585
Applied a total of 97 rules in 53 ms. Remains 453 /495 variables (removed 42) and now considering 585/640 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7762058647151475222.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2048776806386848092.kers'
[2026-05-27 13:04:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7762058647151475222.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2048776806386848092.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 585 rows 453 cols 1653 entries
Finished phase 1 with 441 SingleSign rule and 0 generalized
[2026-05-27 13:04:54] [INFO ] Computed 12 invariants in 5 ms
Computed 12 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2048776806386848092.kers
Total runtime 6 ms.
[2026-05-27 13:04:55] [INFO ] Implicit Places using invariants in 647 ms returned []
[2026-05-27 13:04:55] [INFO ] Invariant cache hit.
[2026-05-27 13:04:56] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1635 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 453/495 places, 585/640 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1688 ms. Remains : 453/495 places, 585/640 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||(p1&&G(p2)&&X(p0))))))'
Stuttering acceptance computed with spot in 286 ms :[true, (NOT p2), (NOT p0), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-04 finished in 2020 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' '!((G((G(p0)||(p1&&X(X(p2)))))||F(p1)))'
Support contains 2 out of 495 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 495/495 places, 640/640 transitions.
Graph (trivial) has 377 edges and 495 vertex of which 61 / 495 are part of one of the 10 SCC in 2 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 443 transition count 537
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 393 transition count 536
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 103 place count 392 transition count 536
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 103 place count 392 transition count 508
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 159 place count 364 transition count 508
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 198 place count 325 transition count 469
Iterating global reduction 3 with 39 rules applied. Total rules applied 237 place count 325 transition count 469
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 239 place count 325 transition count 467
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 250 place count 314 transition count 456
Iterating global reduction 4 with 11 rules applied. Total rules applied 261 place count 314 transition count 456
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 270 place count 314 transition count 447
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 5 with 122 rules applied. Total rules applied 392 place count 253 transition count 386
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 394 place count 251 transition count 384
Iterating global reduction 5 with 2 rules applied. Total rules applied 396 place count 251 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 398 place count 251 transition count 382
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 400 place count 249 transition count 380
Applied a total of 400 rules in 122 ms. Remains 249 /495 variables (removed 246) and now considering 380/640 (removed 260) transitions.
[2026-05-27 13:04:56] [INFO ] Flow matrix only has 352 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-680161776987974469.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16152502061896846879.kers'
[2026-05-27 13:04:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-680161776987974469.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16152502061896846879.kers]
Normalized transition count is 351 out of 352 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 4 ms.
// Phase 1: matrix 351 rows 248 cols 1093 entries
Finished phase 1 with 237 SingleSign rule and 0 generalized
[2026-05-27 13:04:56] [INFO ] Computed 12 invariants in 6 ms
Computed 12 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-16152502061896846879.kers
Total runtime 7 ms.
[2026-05-27 13:04:57] [INFO ] Implicit Places using invariants in 429 ms returned []
[2026-05-27 13:04:57] [INFO ] Flow matrix only has 352 transitions (discarded 28 similar events)
[2026-05-27 13:04:57] [INFO ] Invariant cache hit.
[2026-05-27 13:04:58] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
[2026-05-27 13:04:58] [INFO ] Redundant transitions in 11 ms returned []
Running 266 sub problems to find dead transitions.
[2026-05-27 13:04:58] [INFO ] Flow matrix only has 352 transitions (discarded 28 similar events)
[2026-05-27 13:04:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/248 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 1/249 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 351/600 variables, 249/261 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/600 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 0/600 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/601 variables, and 261 constraints, problems are : Problem set: 0 solved, 266 unsolved in 29008 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/248 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 1/249 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 351/600 variables, 249/261 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/600 variables, 266/527 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/601 variables, and 527 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59174ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 59176ms
Starting structural reductions in SI_LTL mode, iteration 1 : 249/495 places, 380/640 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60469 ms. Remains : 249/495 places, 380/640 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((G(p0)||(p1&&X(X(p2)))))||F(p1)))'
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-05
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-05 finished in 60603 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)) U (X(X(G(p0)))||(p1&&X(X(p0))&&(G(!p2)||(!p2&&F(p3)))))))'
Support contains 5 out of 495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 640/640 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 474 transition count 619
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 474 transition count 619
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 474 transition count 617
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 456 transition count 599
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 456 transition count 599
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 90 place count 456 transition count 589
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 94 place count 452 transition count 585
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 452 transition count 585
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 452 transition count 583
Applied a total of 100 rules in 58 ms. Remains 452 /495 variables (removed 43) and now considering 583/640 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1186021913165581769.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2317504881623768304.kers'
[2026-05-27 13:05:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1186021913165581769.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2317504881623768304.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 583 rows 452 cols 1645 entries
Finished phase 1 with 440 SingleSign rule and 0 generalized
[2026-05-27 13:05:57] [INFO ] Computed 12 invariants in 4 ms
Computed 12 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2317504881623768304.kers
Total runtime 6 ms.
[2026-05-27 13:05:57] [INFO ] Implicit Places using invariants in 562 ms returned []
[2026-05-27 13:05:57] [INFO ] Invariant cache hit.
[2026-05-27 13:05:58] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 1296 ms to find 0 implicit places.
Running 582 sub problems to find dead transitions.
[2026-05-27 13:05:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/452 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/1035 variables, and 12 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/452 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/452 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (OVERLAPS) 583/1035 variables, 452/464 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 582/1046 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1035/1035 variables, and 1046 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 452/452 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 582 unsolved
Search for dead transitions found 0 dead transitions in 60207ms
Starting structural reductions in LTL mode, iteration 1 : 452/495 places, 583/640 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61564 ms. Remains : 452/495 places, 583/640 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)) U (X(X(G(p0)))||(p1&&X(X(p0))&&(G(!p2)||(!p2&&F(p3)))))))'
Stuttering acceptance computed with spot in 460 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p3) (NOT p0) p2), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true, (AND (NOT p3) (NOT p0) p2), (AND (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p3) p0 p2)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 245 ms.
Product exploration explored 100000 steps with 33333 reset in 197 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 31 factoid took 13 ms. Proved property starting from automaton with 12 states, 27 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 23 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-06 finished in 62576 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||X((p1 U p2)))))'
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 640/640 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 474 transition count 619
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 474 transition count 619
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 474 transition count 617
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 456 transition count 599
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 456 transition count 599
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 91 place count 456 transition count 588
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 94 place count 453 transition count 585
Iterating global reduction 2 with 3 rules applied. Total rules applied 97 place count 453 transition count 585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 453 transition count 584
Applied a total of 98 rules in 49 ms. Remains 453 /495 variables (removed 42) and now considering 584/640 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3682281955303545488.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15410825197090624738.kers'
[2026-05-27 13:06:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3682281955303545488.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15410825197090624738.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 584 rows 453 cols 1647 entries
Finished phase 1 with 441 SingleSign rule and 0 generalized
[2026-05-27 13:06:59] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15410825197090624738.kers
Total runtime 4 ms.
[2026-05-27 13:07:00] [INFO ] Implicit Places using invariants in 432 ms returned []
[2026-05-27 13:07:00] [INFO ] Invariant cache hit.
[2026-05-27 13:07:01] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
Running 583 sub problems to find dead transitions.
[2026-05-27 13:07:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 453/1037 variables, and 12 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/453 constraints, PredecessorRefiner: 583/583 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 583 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/1037 variables, and 12 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/453 constraints, PredecessorRefiner: 0/583 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60207ms problems are : Problem set: 0 solved, 583 unsolved
Search for dead transitions found 0 dead transitions in 60211ms
Starting structural reductions in LTL mode, iteration 1 : 453/495 places, 584/640 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61412 ms. Remains : 453/495 places, 584/640 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||X((p1 U p2)))))'
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-07
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-07 finished in 61558 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&&X(X((F(p0)||X(F(!p1))))))||G((F(p0)||X(F(!p1)))))))'
Support contains 3 out of 495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 640/640 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 475 transition count 620
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 475 transition count 620
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 475 transition count 618
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 58 place count 459 transition count 602
Iterating global reduction 1 with 16 rules applied. Total rules applied 74 place count 459 transition count 602
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 85 place count 459 transition count 591
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 457 transition count 589
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 457 transition count 589
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 457 transition count 588
Applied a total of 90 rules in 53 ms. Remains 457 /495 variables (removed 38) and now considering 588/640 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7381947715499969485.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5706631145814199793.kers'
[2026-05-27 13:08:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7381947715499969485.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5706631145814199793.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 588 rows 457 cols 1655 entries
Finished phase 1 with 445 SingleSign rule and 0 generalized
[2026-05-27 13:08:01] [INFO ] Computed 12 invariants in 5 ms
Computed 12 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5706631145814199793.kers
Total runtime 6 ms.
[2026-05-27 13:08:02] [INFO ] Implicit Places using invariants in 565 ms returned []
[2026-05-27 13:08:02] [INFO ] Invariant cache hit.
[2026-05-27 13:08:02] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1406 ms to find 0 implicit places.
Running 587 sub problems to find dead transitions.
[2026-05-27 13:08:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/457 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 457/1045 variables, and 12 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/457 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 587 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/457 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 457/1045 variables, and 12 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/457 constraints, PredecessorRefiner: 0/587 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60204ms problems are : Problem set: 0 solved, 587 unsolved
Search for dead transitions found 0 dead transitions in 60207ms
Starting structural reductions in LTL mode, iteration 1 : 457/495 places, 588/640 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61669 ms. Remains : 457/495 places, 588/640 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((F(p0)||X(F(p1))))||(p0&&X(X((F(p0)||X(F(p1)))))))))'
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 318 ms.
Product exploration explored 100000 steps with 33333 reset in 345 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 15 ms. Proved property starting from automaton with 4 states, 7 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 23 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-09 finished in 62651 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' '!(G((X((G(p0)||G(F(p1)))) U (X(!p2) U ((p1&&X(!p2))||X(G(!p2)))))))'
Support contains 5 out of 495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 640/640 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 475 transition count 620
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 475 transition count 620
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 475 transition count 619
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 58 place count 458 transition count 602
Iterating global reduction 1 with 17 rules applied. Total rules applied 75 place count 458 transition count 602
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 85 place count 458 transition count 592
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 89 place count 454 transition count 588
Iterating global reduction 2 with 4 rules applied. Total rules applied 93 place count 454 transition count 588
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 454 transition count 586
Applied a total of 95 rules in 30 ms. Remains 454 /495 variables (removed 41) and now considering 586/640 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11880429405439643049.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13785346983900460034.kers'
[2026-05-27 13:09:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11880429405439643049.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13785346983900460034.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 586 rows 454 cols 1655 entries
Finished phase 1 with 442 SingleSign rule and 0 generalized
[2026-05-27 13:09:04] [INFO ] Computed 12 invariants in 3 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13785346983900460034.kers
Total runtime 4 ms.
[2026-05-27 13:09:04] [INFO ] Implicit Places using invariants in 391 ms returned []
[2026-05-27 13:09:04] [INFO ] Invariant cache hit.
[2026-05-27 13:09:05] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1389 ms to find 0 implicit places.
Running 585 sub problems to find dead transitions.
[2026-05-27 13:09:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 1 (OVERLAPS) 1/454 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 585 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1040 variables, and 14 constraints, problems are : Problem set: 0 solved, 585 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/454 constraints, PredecessorRefiner: 585/585 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 585 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 1 (OVERLAPS) 1/454 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 585 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1040 variables, and 18 constraints, problems are : Problem set: 0 solved, 585 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/454 constraints, PredecessorRefiner: 0/585 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60215ms problems are : Problem set: 0 solved, 585 unsolved
Search for dead transitions found 0 dead transitions in 60217ms
Starting structural reductions in LTL mode, iteration 1 : 454/495 places, 586/640 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61639 ms. Remains : 454/495 places, 586/640 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((X((G(p0)||G(F(p1)))) U (X(!p2) U (X(G(!p2))||(p1&&X(!p2)))))))'
Stuttering acceptance computed with spot in 506 ms :[p2, (AND (NOT p1) p2 (NOT p0)), p2, p2, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-11
Product exploration explored 100000 steps with 39949 reset in 238 ms.
Product exploration explored 100000 steps with 39908 reset in 259 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Detected a total of 14/454 stabilizing places and 14/586 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 26 factoid took 195 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter sensitive) to 10 states, 30 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (518 resets) in 681 ms. (58 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (59 resets) in 184 ms. (216 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40002 steps (54 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (57 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (61 resets) in 315 ms. (126 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (55 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (57 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (57 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (58 resets) in 84 ms. (470 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (60 resets) in 145 ms. (274 steps per ms) remains 8/8 properties
[2026-05-27 13:10:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf1 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 201/206 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem apf10 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 248/454 variables, 8/13 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 586/1040 variables, 454/467 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1040 variables, 0/467 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1040 variables, 0/467 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1040/1040 variables, and 467 constraints, problems are : Problem set: 3 solved, 5 unsolved in 1461 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 454/454 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 201/206 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 248/454 variables, 8/13 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 586/1040 variables, 454/467 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1040 variables, 5/472 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1040 variables, 0/472 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/1040 variables, 0/472 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1040/1040 variables, and 472 constraints, problems are : Problem set: 3 solved, 5 unsolved in 1557 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 454/454 constraints, PredecessorRefiner: 5/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3029ms problems are : Problem set: 3 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 76 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=25 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 12 ms.
Found 3 invariant AP formulas.
Knowledge based reduction with 29 factoid took 420 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[p2, (AND (NOT p1) p2), p2, p2, (NOT p1), (NOT p1)]
Knowledge-based reduction took 4559 ms.
Stuttering acceptance computed with spot in 305 ms :[p2, (AND (NOT p1) p2), p2, p2, (NOT p1), (NOT p1)]
Support contains 4 out of 454 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 586/586 transitions.
Applied a total of 0 rules in 11 ms. Remains 454 /454 variables (removed 0) and now considering 586/586 (removed 0) transitions.
[2026-05-27 13:10:11] [INFO ] Invariant cache hit.
[2026-05-27 13:10:12] [INFO ] Implicit Places using invariants in 469 ms returned []
[2026-05-27 13:10:12] [INFO ] Invariant cache hit.
[2026-05-27 13:10:12] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 1220 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1231 ms. Remains : 454/454 places, 586/586 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge based reduction with 13 factoid took 103 ms. Reduced automaton from 6 states, 17 edges and 2 AP (stutter sensitive) to 6 states, 17 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (516 resets) in 337 ms. (118 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (59 resets) in 86 ms. (459 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (57 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
[2026-05-27 13:10:13] [INFO ] Invariant cache hit.
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) 202/206 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 248/454 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 586/1040 variables, 454/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1040 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1040 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1040/1040 variables, and 466 constraints, problems are : Problem set: 0 solved, 1 unsolved in 641 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 454/454 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) 202/206 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 248/454 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 586/1040 variables, 454/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1040 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1040 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1040 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1040/1040 variables, and 467 constraints, problems are : Problem set: 0 solved, 1 unsolved in 637 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 454/454 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1286ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 148 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=74 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 13 factoid took 197 ms. Reduced automaton from 6 states, 17 edges and 2 AP (stutter sensitive) to 6 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[p2, (AND (NOT p1) p2), p2, p2, (NOT p1), (NOT p1)]
Knowledge-based reduction took 2099 ms.
Stuttering acceptance computed with spot in 313 ms :[p2, (AND (NOT p1) p2), p2, p2, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 316 ms :[p2, (AND (NOT p1) p2), p2, p2, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 39898 reset in 251 ms.
Product exploration explored 100000 steps with 39916 reset in 283 ms.
Spot run failed in 147 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/ltsmin11070894806781271190
[2026-05-27 13:10:16] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11070894806781271190
Running compilation step : cd /tmp/ltsmin11070894806781271190;'/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 2227 ms.
Running link step : cd /tmp/ltsmin11070894806781271190;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 116 ms.
Running LTSmin : cd /tmp/ltsmin11070894806781271190;'/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/stateBased6609825309360360825.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 586/586 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 585
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 585
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 452 transition count 584
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 452 transition count 584
Applied a total of 4 rules in 26 ms. Remains 452 /454 variables (removed 2) and now considering 584/586 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14374502263036407598.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15202356558433409657.kers'
[2026-05-27 13:10:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14374502263036407598.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15202356558433409657.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 584 rows 452 cols 1651 entries
Finished phase 1 with 440 SingleSign rule and 0 generalized
[2026-05-27 13:10:31] [INFO ] Computed 12 invariants in 3 ms
Computed 12 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15202356558433409657.kers
Total runtime 5 ms.
[2026-05-27 13:10:32] [INFO ] Implicit Places using invariants in 570 ms returned []
[2026-05-27 13:10:32] [INFO ] Invariant cache hit.
[2026-05-27 13:10:32] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
Running 583 sub problems to find dead transitions.
[2026-05-27 13:10:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/452 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/1036 variables, and 12 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/452 constraints, PredecessorRefiner: 583/583 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 583 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/452 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/1036 variables, and 12 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/452 constraints, PredecessorRefiner: 0/583 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60207ms problems are : Problem set: 0 solved, 583 unsolved
Search for dead transitions found 0 dead transitions in 60210ms
Starting structural reductions in LTL mode, iteration 1 : 452/454 places, 584/586 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61750 ms. Remains : 452/454 places, 584/586 transitions.
Built C files in :
/tmp/ltsmin5615915273307579361
[2026-05-27 13:11:33] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5615915273307579361
Running compilation step : cd /tmp/ltsmin5615915273307579361;'/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 1728 ms.
Running link step : cd /tmp/ltsmin5615915273307579361;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin5615915273307579361;'/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/stateBased746982218217563341.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 13:11:48] [INFO ] Flatten gal took : 56 ms
[2026-05-27 13:11:48] [INFO ] Flatten gal took : 52 ms
[2026-05-27 13:11:48] [INFO ] Time to serialize gal into /tmp/LTL10965144449995499498.gal : 13 ms
[2026-05-27 13:11:48] [INFO ] Time to serialize properties into /tmp/LTL16318598662773769420.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/LTL10965144449995499498.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16541150167949616996.hoa' '-atoms' '/tmp/LTL16318598662773769420.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...320
Loading property file /tmp/LTL16318598662773769420.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16541150167949616996.hoa
Detected timeout of ITS tools.
[2026-05-27 13:12:03] [INFO ] Flatten gal took : 50 ms
[2026-05-27 13:12:03] [INFO ] Flatten gal took : 47 ms
[2026-05-27 13:12:03] [INFO ] Time to serialize gal into /tmp/LTL5432152099182341135.gal : 10 ms
[2026-05-27 13:12:03] [INFO ] Time to serialize properties into /tmp/LTL4002664439648312054.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5432152099182341135.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4002664439648312054.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...275
Read 1 LTL properties
Checking formula 0 : !((G((X((G("(p1389==1)"))||(G(F("(p750!=1)")))))U((X(!("(((p59==1)&&(p506==1))&&(p998==1))")))U((X(G(!("(((p59==1)&&(p506==1))&&(p998=...232
Formula 0 simplified : F(X(F!"(p1389==1)" & FG!"(p750!=1)") R (X"(((p59==1)&&(p506==1))&&(p998==1))" R (XF"(((p59==1)&&(p506==1))&&(p998==1))" & (!"(p750!=...202
Detected timeout of ITS tools.
[2026-05-27 13:12:18] [INFO ] Flatten gal took : 43 ms
[2026-05-27 13:12:18] [INFO ] Applying decomposition
[2026-05-27 13:12:18] [INFO ] Flatten gal took : 24 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/graph8544123546039365899.txt' '-o' '/tmp/graph8544123546039365899.bin' '-w' '/tmp/graph8544123546039365899.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8544123546039365899.bin' '-l' '-1' '-v' '-w' '/tmp/graph8544123546039365899.weights' '-q' '0' '-e' '0.001'
[2026-05-27 13:12:19] [INFO ] Decomposing Gal with order
[2026-05-27 13:12:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 13:12:19] [INFO ] Removed a total of 283 redundant transitions.
[2026-05-27 13:12:19] [INFO ] Flatten gal took : 242 ms
[2026-05-27 13:12:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 33 ms.
[2026-05-27 13:12:19] [INFO ] Time to serialize gal into /tmp/LTL4978074761526752855.gal : 20 ms
[2026-05-27 13:12:19] [INFO ] Time to serialize properties into /tmp/LTL12611429620048437214.ltl : 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/LTL4978074761526752855.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12611429620048437214.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 : !((G((X((G("(i0.i0.i0.u111.p1389==1)"))||(G(F("(i10.u89.p750!=1)")))))U((X(!("(((i2.u13.p59==1)&&(i7.i1.i1.u50.p506==1))&&(u110.p998==...337
Formula 0 simplified : F(X(F!"(i0.i0.i0.u111.p1389==1)" & FG!"(i10.u89.p750!=1)") R (X"(((i2.u13.p59==1)&&(i7.i1.i1.u50.p506==1))&&(u110.p998==1))" R (XF"(...307
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-11 finished in 210420 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' '!((G(p0) U X(G(p1))))'
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 640/640 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 474 transition count 619
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 474 transition count 619
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 474 transition count 617
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 61 place count 457 transition count 600
Iterating global reduction 1 with 17 rules applied. Total rules applied 78 place count 457 transition count 600
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 88 place count 457 transition count 590
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 92 place count 453 transition count 586
Iterating global reduction 2 with 4 rules applied. Total rules applied 96 place count 453 transition count 586
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 453 transition count 584
Applied a total of 98 rules in 29 ms. Remains 453 /495 variables (removed 42) and now considering 584/640 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9714058201177968379.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11893819983727817170.kers'
[2026-05-27 13:12:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9714058201177968379.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11893819983727817170.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 584 rows 453 cols 1647 entries
Finished phase 1 with 441 SingleSign rule and 0 generalized
[2026-05-27 13:12:34] [INFO ] Computed 12 invariants in 4 ms
Computed 12 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11893819983727817170.kers
Total runtime 6 ms.
[2026-05-27 13:12:35] [INFO ] Implicit Places using invariants in 540 ms returned []
[2026-05-27 13:12:35] [INFO ] Invariant cache hit.
[2026-05-27 13:12:35] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1409 ms to find 0 implicit places.
Running 583 sub problems to find dead transitions.
[2026-05-27 13:12:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 453/1037 variables, and 12 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/453 constraints, PredecessorRefiner: 583/583 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 583 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (OVERLAPS) 584/1037 variables, 453/465 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1037 variables, 583/1048 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1037/1037 variables, and 1051 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 453/453 constraints, PredecessorRefiner: 583/583 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 583 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Starting structural reductions in LTL mode, iteration 1 : 453/495 places, 584/640 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61585 ms. Remains : 453/495 places, 584/640 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(p0) U X(G(p1))))'
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 65969 steps with 855 reset in 182 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-12 finished in 62003 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' '!(G(F(p0)))'
Support contains 1 out of 495 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 495/495 places, 640/640 transitions.
Graph (trivial) has 379 edges and 495 vertex of which 61 / 495 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 443 transition count 536
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 392 transition count 536
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 103 place count 392 transition count 506
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 163 place count 362 transition count 506
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 204 place count 321 transition count 465
Iterating global reduction 2 with 41 rules applied. Total rules applied 245 place count 321 transition count 465
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 247 place count 321 transition count 463
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 258 place count 310 transition count 452
Iterating global reduction 3 with 11 rules applied. Total rules applied 269 place count 310 transition count 452
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 280 place count 310 transition count 441
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 402 place count 249 transition count 380
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 404 place count 247 transition count 378
Iterating global reduction 4 with 2 rules applied. Total rules applied 406 place count 247 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 408 place count 247 transition count 376
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 410 place count 245 transition count 374
Applied a total of 410 rules in 104 ms. Remains 245 /495 variables (removed 250) and now considering 374/640 (removed 266) transitions.
[2026-05-27 13:13:36] [INFO ] Flow matrix only has 346 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11453766912672390215.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3366687158619737539.kers'
[2026-05-27 13:13:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11453766912672390215.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3366687158619737539.kers]
Normalized transition count is 345 out of 346 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 345 rows 244 cols 1073 entries
Finished phase 1 with 233 SingleSign rule and 0 generalized
[2026-05-27 13:13:36] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3366687158619737539.kers
Total runtime 2 ms.
[2026-05-27 13:13:36] [INFO ] Implicit Places using invariants in 314 ms returned []
[2026-05-27 13:13:36] [INFO ] Flow matrix only has 346 transitions (discarded 28 similar events)
[2026-05-27 13:13:36] [INFO ] Invariant cache hit.
[2026-05-27 13:13:37] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
[2026-05-27 13:13:37] [INFO ] Redundant transitions in 21 ms returned []
Running 262 sub problems to find dead transitions.
[2026-05-27 13:13:37] [INFO ] Flow matrix only has 346 transitions (discarded 28 similar events)
[2026-05-27 13:13:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/245 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 345/590 variables, 245/257 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/590 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/590 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 590/591 variables, and 257 constraints, problems are : Problem set: 0 solved, 262 unsolved in 25555 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/245 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 345/590 variables, 245/257 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/590 variables, 262/519 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/590 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 590/591 variables, and 519 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55676ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 55677ms
Starting structural reductions in SI_LTL mode, iteration 1 : 245/495 places, 374/640 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56673 ms. Remains : 245/495 places, 374/640 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 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-14 finished in 56806 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 1 out of 495 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 495/495 places, 640/640 transitions.
Graph (trivial) has 461 edges and 495 vertex of which 61 / 495 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 443 transition count 535
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 391 transition count 535
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 105 place count 391 transition count 507
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 161 place count 363 transition count 507
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 201 place count 323 transition count 467
Iterating global reduction 2 with 40 rules applied. Total rules applied 241 place count 323 transition count 467
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 243 place count 323 transition count 465
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 243 place count 323 transition count 464
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 245 place count 322 transition count 464
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 256 place count 311 transition count 453
Iterating global reduction 3 with 11 rules applied. Total rules applied 267 place count 311 transition count 453
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 278 place count 311 transition count 442
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 400 place count 250 transition count 381
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 402 place count 248 transition count 379
Iterating global reduction 4 with 2 rules applied. Total rules applied 404 place count 248 transition count 379
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 406 place count 248 transition count 377
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 416 place count 248 transition count 367
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 418 place count 246 transition count 365
Applied a total of 418 rules in 94 ms. Remains 246 /495 variables (removed 249) and now considering 365/640 (removed 275) transitions.
[2026-05-27 13:14:33] [INFO ] Flow matrix only has 346 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16515419439108118626.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8558589358347772498.kers'
[2026-05-27 13:14:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16515419439108118626.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8558589358347772498.kers]
Normalized transition count is 345 out of 346 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 345 rows 245 cols 1033 entries
Finished phase 1 with 234 SingleSign rule and 0 generalized
[2026-05-27 13:14:33] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8558589358347772498.kers
Total runtime 4 ms.
[2026-05-27 13:14:33] [INFO ] Implicit Places using invariants in 294 ms returned []
[2026-05-27 13:14:33] [INFO ] Flow matrix only has 346 transitions (discarded 19 similar events)
[2026-05-27 13:14:33] [INFO ] Invariant cache hit.
[2026-05-27 13:14:34] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
[2026-05-27 13:14:34] [INFO ] Redundant transitions in 5 ms returned []
Running 173 sub problems to find dead transitions.
[2026-05-27 13:14:34] [INFO ] Flow matrix only has 346 transitions (discarded 19 similar events)
[2026-05-27 13:14:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 10/246 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 345/591 variables, 246/258 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/591 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 0/591 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 591/592 variables, and 258 constraints, problems are : Problem set: 0 solved, 173 unsolved in 19520 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 10/246 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 345/591 variables, 246/258 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/591 variables, 173/431 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/591 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/591 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 591/592 variables, and 431 constraints, problems are : Problem set: 0 solved, 173 unsolved in 24820 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44400ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 44402ms
Starting structural reductions in SI_LTL mode, iteration 1 : 246/495 places, 365/640 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45345 ms. Remains : 246/495 places, 365/640 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 58 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-15 finished in 45436 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' '!(G((X((G(p0)||G(F(p1)))) U (X(!p2) U ((p1&&X(!p2))||X(G(!p2)))))))'
Spot run failed in 86 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-27 13:15:18] [INFO ] Flatten gal took : 41 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15263277559181998633
[2026-05-27 13:15:19] [INFO ] Computing symmetric may disable matrix : 640 transitions.
[2026-05-27 13:15:19] [INFO ] Applying decomposition
[2026-05-27 13:15:19] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 13:15:19] [INFO ] Computing symmetric may enable matrix : 640 transitions.
[2026-05-27 13:15:19] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 13:15:19] [INFO ] Flatten gal took : 57 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/graph9622000398178113775.txt' '-o' '/tmp/graph9622000398178113775.bin' '-w' '/tmp/graph9622000398178113775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9622000398178113775.bin' '-l' '-1' '-v' '-w' '/tmp/graph9622000398178113775.weights' '-q' '0' '-e' '0.001'
[2026-05-27 13:15:19] [INFO ] Decomposing Gal with order
[2026-05-27 13:15:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 13:15:19] [INFO ] Computing Do-Not-Accords matrix : 640 transitions.
[2026-05-27 13:15:19] [INFO ] Removed a total of 235 redundant transitions.
[2026-05-27 13:15:19] [INFO ] Flatten gal took : 151 ms
[2026-05-27 13:15:19] [INFO ] Computation of Completed DNA matrix. took 105 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 13:15:19] [INFO ] Built C files in 482ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15263277559181998633
Running compilation step : cd /tmp/ltsmin15263277559181998633;'/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'
[2026-05-27 13:15:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 11 ms.
[2026-05-27 13:15:19] [INFO ] Time to serialize gal into /tmp/LTLFireability9369828471489097536.gal : 8 ms
[2026-05-27 13:15:19] [INFO ] Time to serialize properties into /tmp/LTLFireability11552588474561354433.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/LTLFireability9369828471489097536.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11552588474561354433.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...277
Read 1 LTL properties
Checking formula 0 : !((G((X((G("(i7.i0.i0.u106.p1389==1)"))||(G(F("(i10.u85.p750!=1)")))))U((X(!("(((i0.u13.p59==1)&&(i5.u45.p506==1))&&(i13.u113.p998==1)...331
Formula 0 simplified : F(X(F!"(i7.i0.i0.u106.p1389==1)" & FG!"(i10.u85.p750!=1)") R (X"(((i0.u13.p59==1)&&(i5.u45.p506==1))&&(i13.u113.p998==1))" R (XF"(((...301
Compilation finished in 2496 ms.
Running link step : cd /tmp/ltsmin15263277559181998633;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin15263277559181998633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((X(([]((LTLAPp0==true))||[](<>((LTLAPp1==true))))) U (X(!(LTLAPp2==true)) U (((LTLAPp1==true)&&X(!(LTLAPp2==true)))||X([](!(LTLAPp2==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t69, t107, t141, t175, t176, t210, t247, t248, t286, t320, t357, t391, t429, t504, t...1279
Computing Next relation with stutter on 6.33963e+13 deadlock states
59 unique states visited
58 strongly connected components in search stack
62 transitions explored
59 items max in DFS search stack
43048 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,430.638,4984756,1,0,8.08282e+06,2.66611e+06,4846,1.84442e+07,1689,7.55057e+06,6501878
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1337972 ms.

BK_STOP 1779888163748

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="FlexibleBarrier-PT-10b"
export BK_EXAMINATION="LTLFireability"
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 FlexibleBarrier-PT-10b, examination is LTLFireability"
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-177955809100364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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