Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366300435.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-10b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366300435
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.1K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 5 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Mar 5 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 5 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 5 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:11 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 1.4M 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 ASLink-PT-10b-LTLCardinality-00
FORMULA_NAME ASLink-PT-10b-LTLCardinality-01
FORMULA_NAME ASLink-PT-10b-LTLCardinality-02
FORMULA_NAME ASLink-PT-10b-LTLCardinality-03
FORMULA_NAME ASLink-PT-10b-LTLCardinality-04
FORMULA_NAME ASLink-PT-10b-LTLCardinality-05
FORMULA_NAME ASLink-PT-10b-LTLCardinality-06
FORMULA_NAME ASLink-PT-10b-LTLCardinality-07
FORMULA_NAME ASLink-PT-10b-LTLCardinality-08
FORMULA_NAME ASLink-PT-10b-LTLCardinality-09
FORMULA_NAME ASLink-PT-10b-LTLCardinality-10
FORMULA_NAME ASLink-PT-10b-LTLCardinality-11
FORMULA_NAME ASLink-PT-10b-LTLCardinality-12
FORMULA_NAME ASLink-PT-10b-LTLCardinality-13
FORMULA_NAME ASLink-PT-10b-LTLCardinality-14
FORMULA_NAME ASLink-PT-10b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779489408674

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-22 22:36:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 22:36:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 22:36:50] [INFO ] Load time of PNML (sax parser for PT used): 279 ms
[2026-05-22 22:36:50] [INFO ] Transformed 4410 places.
[2026-05-22 22:36:50] [INFO ] Transformed 5405 transitions.
[2026-05-22 22:36:50] [INFO ] Found NUPN structural information;
[2026-05-22 22:36:51] [INFO ] Parsed PT model containing 4410 places and 5405 transitions and 16377 arcs in 472 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-10b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 4410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4410/4410 places, 5405/5405 transitions.
Discarding 272 places :
Symmetric choice reduction at 0 with 272 rule applications. Total rules 272 place count 4138 transition count 5133
Iterating global reduction 0 with 272 rules applied. Total rules applied 544 place count 4138 transition count 5133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 545 place count 4138 transition count 5132
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 651 place count 4032 transition count 4968
Iterating global reduction 1 with 106 rules applied. Total rules applied 757 place count 4032 transition count 4968
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 790 place count 4032 transition count 4935
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 804 place count 4018 transition count 4921
Iterating global reduction 2 with 14 rules applied. Total rules applied 818 place count 4018 transition count 4921
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 822 place count 4014 transition count 4910
Iterating global reduction 2 with 4 rules applied. Total rules applied 826 place count 4014 transition count 4910
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 829 place count 4011 transition count 4907
Iterating global reduction 2 with 3 rules applied. Total rules applied 832 place count 4011 transition count 4907
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 835 place count 4008 transition count 4897
Iterating global reduction 2 with 3 rules applied. Total rules applied 838 place count 4008 transition count 4897
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 839 place count 4007 transition count 4889
Iterating global reduction 2 with 1 rules applied. Total rules applied 840 place count 4007 transition count 4889
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 841 place count 4006 transition count 4888
Iterating global reduction 2 with 1 rules applied. Total rules applied 842 place count 4006 transition count 4888
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 843 place count 4005 transition count 4880
Iterating global reduction 2 with 1 rules applied. Total rules applied 844 place count 4005 transition count 4880
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 845 place count 4004 transition count 4872
Iterating global reduction 2 with 1 rules applied. Total rules applied 846 place count 4004 transition count 4872
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 847 place count 4003 transition count 4871
Iterating global reduction 2 with 1 rules applied. Total rules applied 848 place count 4003 transition count 4871
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 849 place count 4002 transition count 4863
Iterating global reduction 2 with 1 rules applied. Total rules applied 850 place count 4002 transition count 4863
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 851 place count 4001 transition count 4855
Iterating global reduction 2 with 1 rules applied. Total rules applied 852 place count 4001 transition count 4855
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 853 place count 4000 transition count 4854
Iterating global reduction 2 with 1 rules applied. Total rules applied 854 place count 4000 transition count 4854
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 855 place count 3999 transition count 4846
Iterating global reduction 2 with 1 rules applied. Total rules applied 856 place count 3999 transition count 4846
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 857 place count 3998 transition count 4838
Iterating global reduction 2 with 1 rules applied. Total rules applied 858 place count 3998 transition count 4838
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 859 place count 3997 transition count 4837
Iterating global reduction 2 with 1 rules applied. Total rules applied 860 place count 3997 transition count 4837
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 861 place count 3996 transition count 4829
Iterating global reduction 2 with 1 rules applied. Total rules applied 862 place count 3996 transition count 4829
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 863 place count 3995 transition count 4821
Iterating global reduction 2 with 1 rules applied. Total rules applied 864 place count 3995 transition count 4821
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 865 place count 3994 transition count 4820
Iterating global reduction 2 with 1 rules applied. Total rules applied 866 place count 3994 transition count 4820
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 867 place count 3993 transition count 4812
Iterating global reduction 2 with 1 rules applied. Total rules applied 868 place count 3993 transition count 4812
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 869 place count 3992 transition count 4804
Iterating global reduction 2 with 1 rules applied. Total rules applied 870 place count 3992 transition count 4804
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 871 place count 3991 transition count 4803
Iterating global reduction 2 with 1 rules applied. Total rules applied 872 place count 3991 transition count 4803
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 873 place count 3990 transition count 4795
Iterating global reduction 2 with 1 rules applied. Total rules applied 874 place count 3990 transition count 4795
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 875 place count 3989 transition count 4787
Iterating global reduction 2 with 1 rules applied. Total rules applied 876 place count 3989 transition count 4787
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 877 place count 3988 transition count 4786
Iterating global reduction 2 with 1 rules applied. Total rules applied 878 place count 3988 transition count 4786
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 879 place count 3987 transition count 4778
Iterating global reduction 2 with 1 rules applied. Total rules applied 880 place count 3987 transition count 4778
Applied a total of 880 rules in 11010 ms. Remains 3987 /4410 variables (removed 423) and now considering 4778/5405 (removed 627) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13756510506664125227.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3074615112470085555.kers'
[2026-05-22 22:37:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13756510506664125227.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3074615112470085555.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 4778 rows 3987 cols 14727 entries
Finished phase 1 with 2570 SingleSign rule and 984 generalized
[2026-05-22 22:37:02] [INFO ] Computed 433 invariants in 45 ms
Computed 433 P flows in 46 ms.
Exported basis to /tmp/petrispot-output-3074615112470085555.kers
Total runtime 56 ms.
[2026-05-22 22:37:06] [INFO ] Implicit Places using invariants in 4424 ms returned [3821, 3832, 3843, 3851, 3859, 3867, 3875, 3886, 3894, 3902, 3913]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 4489 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3976/4410 places, 4778/5405 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3964 transition count 4766
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3964 transition count 4766
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 3954 transition count 4756
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 3954 transition count 4756
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 3946 transition count 4748
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 3946 transition count 4748
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 3942 transition count 4744
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 3942 transition count 4744
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 3940 transition count 4742
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 3940 transition count 4742
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 3938 transition count 4740
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 3938 transition count 4740
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 3936 transition count 4738
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 3936 transition count 4738
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 3934 transition count 4736
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 3934 transition count 4736
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 3933 transition count 4735
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 3933 transition count 4735
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 3932 transition count 4734
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 3932 transition count 4734
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 3931 transition count 4733
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 3931 transition count 4733
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 3930 transition count 4732
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 3930 transition count 4732
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 3929 transition count 4731
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 3929 transition count 4731
Applied a total of 94 rules in 4634 ms. Remains 3929 /3976 variables (removed 47) and now considering 4731/4778 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14176991481700978791.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12105499236850887222.kers'
[2026-05-22 22:37:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14176991481700978791.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12105499236850887222.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 4731 rows 3929 cols 14575 entries
Finished phase 1 with 2558 SingleSign rule and 949 generalized
[2026-05-22 22:37:11] [INFO ] Computed 422 invariants in 44 ms
Computed 422 P flows in 45 ms.
Exported basis to /tmp/petrispot-output-12105499236850887222.kers
Total runtime 58 ms.
[2026-05-22 22:37:14] [INFO ] Implicit Places using invariants in 3084 ms returned []
[2026-05-22 22:37:14] [INFO ] Invariant cache hit.
[2026-05-22 22:37:33] [INFO ] Implicit Places using invariants and state equation in 18479 ms returned []
Implicit Place search using SMT with State Equation took 21569 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3929/4410 places, 4731/5405 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41732 ms. Remains : 3929/4410 places, 4731/5405 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3929/3929 places, 4731/4731 transitions.
Applied a total of 0 rules in 343 ms. Remains 3929 /3929 variables (removed 0) and now considering 4731/4731 (removed 0) transitions.
[2026-05-22 22:37:33] [INFO ] Invariant cache hit.
[2026-05-22 22:37:36] [INFO ] Implicit Places using invariants in 3349 ms returned []
[2026-05-22 22:37:36] [INFO ] Invariant cache hit.
[2026-05-22 22:37:52] [INFO ] Implicit Places using invariants and state equation in 15760 ms returned []
Implicit Place search using SMT with State Equation took 19127 ms to find 0 implicit places.
Running 4730 sub problems to find dead transitions.
[2026-05-22 22:37:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3928 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4730 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3928/8660 variables, and 255 constraints, problems are : Problem set: 0 solved, 4730 unsolved in 30120 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3929 constraints, PredecessorRefiner: 4730/4730 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4730 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3928 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4730 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3928/8660 variables, and 255 constraints, problems are : Problem set: 0 solved, 4730 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3929 constraints, PredecessorRefiner: 0/4730 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62913ms problems are : Problem set: 0 solved, 4730 unsolved
Search for dead transitions found 0 dead transitions in 62996ms
Finished structural reductions in LTL mode , in 1 iterations and 82558 ms. Remains : 3929/3929 places, 4731/4731 transitions.
Support contains 23 out of 3929 places after structural reductions.
[2026-05-22 22:38:56] [INFO ] Flatten gal took : 278 ms
[2026-05-22 22:38:56] [INFO ] Flatten gal took : 172 ms
[2026-05-22 22:38:56] [INFO ] Input system was already deterministic with 4731 transitions.
RANDOM walk for 40000 steps (49 resets) in 2044 ms. (19 steps per ms) remains 7/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 217 ms. (183 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 7/7 properties
[2026-05-22 22:38:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 169/178 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1277/1455 variables, 80/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1455 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2298/3753 variables, 282/368 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3753 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 176/3929 variables, 54/422 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3929 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 4731/8660 variables, 3929/4351 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8660/8660 variables, and 4351 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5053 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 336/336 constraints, State Equation: 3929/3929 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 169/178 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1277/1455 variables, 80/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1455 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2298/3753 variables, 282/368 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 10841ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 9 out of 3929 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3929/3929 places, 4731/4731 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 737 transitions
Trivial Post-agglo rules discarded 737 transitions
Performed 737 trivial Post agglomeration. Transition count delta: 737
Iterating post reduction 0 with 737 rules applied. Total rules applied 737 place count 3929 transition count 3994
Reduce places removed 737 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 740 rules applied. Total rules applied 1477 place count 3192 transition count 3991
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 1480 place count 3190 transition count 3990
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1481 place count 3189 transition count 3990
Performed 1057 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1057 Pre rules applied. Total rules applied 1481 place count 3189 transition count 2933
Deduced a syphon composed of 1057 places in 8 ms
Ensure Unique test removed 102 places
Reduce places removed 1159 places and 0 transitions.
Iterating global reduction 4 with 2216 rules applied. Total rules applied 3697 place count 2030 transition count 2933
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 4 with 74 rules applied. Total rules applied 3771 place count 2019 transition count 2870
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 64 rules applied. Total rules applied 3835 place count 1956 transition count 2869
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3836 place count 1955 transition count 2869
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 40 Pre rules applied. Total rules applied 3836 place count 1955 transition count 2829
Deduced a syphon composed of 40 places in 8 ms
Ensure Unique test removed 40 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 7 with 120 rules applied. Total rules applied 3956 place count 1875 transition count 2829
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 39 Pre rules applied. Total rules applied 3956 place count 1875 transition count 2790
Deduced a syphon composed of 39 places in 10 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 4034 place count 1836 transition count 2790
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 4037 place count 1833 transition count 2787
Iterating global reduction 7 with 3 rules applied. Total rules applied 4040 place count 1833 transition count 2787
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 4040 place count 1833 transition count 2785
Deduced a syphon composed of 2 places in 25 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 4044 place count 1831 transition count 2785
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4046 place count 1829 transition count 2783
Iterating global reduction 7 with 2 rules applied. Total rules applied 4048 place count 1829 transition count 2783
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4049 place count 1828 transition count 2782
Iterating global reduction 7 with 1 rules applied. Total rules applied 4050 place count 1828 transition count 2782
Performed 312 Post agglomeration using F-continuation condition.Transition count delta: 312
Deduced a syphon composed of 312 places in 6 ms
Ensure Unique test removed 3 places
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 7 with 627 rules applied. Total rules applied 4677 place count 1513 transition count 2470
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 4680 place count 1510 transition count 2467
Ensure Unique test removed 1 places
Iterating global reduction 7 with 4 rules applied. Total rules applied 4684 place count 1509 transition count 2467
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 4685 place count 1509 transition count 2466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4686 place count 1508 transition count 2466
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 4686 place count 1508 transition count 2465
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4688 place count 1507 transition count 2465
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4689 place count 1506 transition count 2464
Iterating global reduction 9 with 1 rules applied. Total rules applied 4690 place count 1506 transition count 2464
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 4692 place count 1506 transition count 2462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 4693 place count 1505 transition count 2462
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 4695 place count 1504 transition count 2467
Free-agglomeration rule applied 11 times.
Iterating global reduction 11 with 11 rules applied. Total rules applied 4706 place count 1504 transition count 2456
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 4717 place count 1493 transition count 2456
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 12 with 9 rules applied. Total rules applied 4726 place count 1493 transition count 2447
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 4735 place count 1484 transition count 2447
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 13 with 10 rules applied. Total rules applied 4745 place count 1484 transition count 2447
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 4746 place count 1483 transition count 2446
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 13 with 30 rules applied. Total rules applied 4776 place count 1463 transition count 2436
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 4786 place count 1453 transition count 2436
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 30 Pre rules applied. Total rules applied 4786 place count 1453 transition count 2406
Deduced a syphon composed of 30 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 15 with 61 rules applied. Total rules applied 4847 place count 1422 transition count 2406
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 15 with 11 rules applied. Total rules applied 4858 place count 1411 transition count 2406
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 4858 place count 1411 transition count 2405
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 4860 place count 1410 transition count 2405
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 6 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 16 with 42 rules applied. Total rules applied 4902 place count 1389 transition count 2384
Discarding 10 places :
Symmetric choice reduction at 16 with 10 rule applications. Total rules 4912 place count 1379 transition count 2374
Iterating global reduction 16 with 10 rules applied. Total rules applied 4922 place count 1379 transition count 2374
Free-agglomeration rule applied 10 times.
Iterating global reduction 16 with 10 rules applied. Total rules applied 4932 place count 1379 transition count 2364
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 16 with 10 rules applied. Total rules applied 4942 place count 1369 transition count 2364
Applied a total of 4942 rules in 1836 ms. Remains 1369 /3929 variables (removed 2560) and now considering 2364/4731 (removed 2367) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1836 ms. Remains : 1369/3929 places, 2364/4731 transitions.
RANDOM walk for 40000 steps (389 resets) in 495 ms. (80 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (34 resets) in 219 ms. (181 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (35 resets) in 202 ms. (197 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (36 resets) in 179 ms. (222 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (36 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (36 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (37 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (34 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 134840 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 7
Probabilistic random walk after 134840 steps, saw 31202 distinct states, run finished after 3012 ms. (steps per millisecond=44 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9427901832817560854.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15521813857068837435.kers'
[2026-05-22 22:39:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9427901832817560854.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15521813857068837435.kers]
Culling duplicate invariants (modulo rational): removing 21 columns.
Culled 21 columns in 3 ms.
// Phase 1: matrix 2364 rows 1348 cols 9297 entries
Finished phase 1 with 343 SingleSign rule and 793 generalized
[2026-05-22 22:39:14] [INFO ] Computed 233 invariants in 40 ms
Computed 233 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-15521813857068837435.kers
Total runtime 42 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 58/67 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 38/105 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 25/130 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 292/422 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 125/547 variables, 27/73 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/547 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 6/553 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/553 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 214/767 variables, 38/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/767 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 103/870 variables, 21/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/870 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 3/873 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 66/939 variables, 18/159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/939 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 39/978 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/978 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 2/980 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/980 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 53/1033 variables, 9/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1033 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 15/1048 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1048 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 1/1049 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1049 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 52/1101 variables, 6/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1101 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (OVERLAPS) 48/1149 variables, 7/193 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1149 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 1/1150 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1150 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 52/1202 variables, 6/200 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1202 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (OVERLAPS) 26/1228 variables, 5/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1228 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (OVERLAPS) 26/1254 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1254 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (OVERLAPS) 42/1296 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1296 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (OVERLAPS) 12/1308 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1308 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (OVERLAPS) 7/1315 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1315 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (OVERLAPS) 46/1361 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1361 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (OVERLAPS) 2/1363 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1363 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (OVERLAPS) 1/1364 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1364 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (OVERLAPS) 5/1369 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1369 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (OVERLAPS) 2364/3733 variables, 1369/1602 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/3733 variables, 0/1602 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (OVERLAPS) 0/3733 variables, 0/1602 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3733/3733 variables, and 1602 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6372 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, Generalized P Invariants (flows): 132/132 constraints, State Equation: 1369/1369 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 58/67 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 38/105 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 25/130 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 292/422 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 125/547 variables, 27/73 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/547 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 6/553 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/553 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 214/767 variables, 38/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/767 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 103/870 variables, 21/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/870 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 3/873 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 66/939 variables, 18/159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/939 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 39/978 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/978 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 2/980 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/980 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 53/1033 variables, 9/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1033 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 15/1048 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1048 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 1/1049 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1049 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 52/1101 variables, 6/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1101 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (OVERLAPS) 48/1149 variables, 7/193 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1149 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 1/1150 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1150 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 52/1202 variables, 6/200 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1202 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (OVERLAPS) 26/1228 variables, 5/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1228 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (OVERLAPS) 26/1254 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1254 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (OVERLAPS) 42/1296 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1296 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (OVERLAPS) 12/1308 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1308 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (OVERLAPS) 7/1315 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1315 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (OVERLAPS) 46/1361 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1361 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (OVERLAPS) 2/1363 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1363 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (OVERLAPS) 1/1364 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1364 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (OVERLAPS) 5/1369 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1369 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (OVERLAPS) 2364/3733 variables, 1369/1602 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/3733 variables, 7/1609 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/3733 variables, 0/1609 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3733/3733 variables, and 1609 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45025 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, Generalized P Invariants (flows): 132/132 constraints, State Equation: 1369/1369 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51473ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 1369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1369/1369 places, 2364/2364 transitions.
Applied a total of 0 rules in 86 ms. Remains 1369 /1369 variables (removed 0) and now considering 2364/2364 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 1369/1369 places, 2364/2364 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1369/1369 places, 2364/2364 transitions.
Applied a total of 0 rules in 58 ms. Remains 1369 /1369 variables (removed 0) and now considering 2364/2364 (removed 0) transitions.
[2026-05-22 22:40:05] [INFO ] Invariant cache hit.
[2026-05-22 22:40:07] [INFO ] Implicit Places using invariants in 1415 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 255, 259, 260, 271, 272, 274, 291, 309, 379, 383, 384, 395, 396, 398, 415, 433, 502, 506, 507, 518, 520, 522, 539, 557, 626, 630, 633, 644, 645, 647, 664, 682, 720, 754, 758, 759, 771, 772, 774, 791, 809, 879, 883, 884, 895, 896, 898, 915, 933, 1002, 1006, 1007, 1018, 1019, 1021, 1038, 1056, 1125, 1129, 1130, 1141, 1142, 1144, 1161, 1179, 1248, 1252, 1253, 1256, 1267, 1268, 1269, 1287, 1308, 1309, 1310, 1311]
[2026-05-22 22:40:07] [INFO ] Actually due to overlaps returned [1287, 1269, 48, 168, 291, 415, 539, 664, 791, 915, 1038, 1161, 31, 151, 274, 398, 522, 647, 774, 898, 1021, 1144, 148, 271, 395, 518, 644, 771, 895, 1018, 1141, 1267, 1308, 149, 272, 396, 520, 645, 772, 896, 1019, 1142, 1268, 1309, 1, 18, 259, 260, 383, 384, 506, 507, 630, 758, 759, 883, 884, 1006, 1007, 1129, 1130, 1252, 1253, 66, 186, 309, 433, 557, 682, 809, 933, 1056, 1179, 1310, 19, 633, 1256, 1311]
Discarding 78 places :
Implicit Place search using SMT only with invariants took 1421 ms to find 78 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1291/1369 places, 2364/2364 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 180 rules applied. Total rules applied 180 place count 1280 transition count 2195
Reduce places removed 169 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 179 rules applied. Total rules applied 359 place count 1111 transition count 2185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 360 place count 1110 transition count 2185
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 360 place count 1110 transition count 2138
Deduced a syphon composed of 47 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 455 place count 1062 transition count 2138
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 467 place count 1058 transition count 2130
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 475 place count 1050 transition count 2130
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 478 place count 1047 transition count 2127
Iterating global reduction 5 with 3 rules applied. Total rules applied 481 place count 1047 transition count 2127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 484 place count 1047 transition count 2124
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 5 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 132 rules applied. Total rules applied 616 place count 981 transition count 2058
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 625 place count 972 transition count 2049
Iterating global reduction 6 with 9 rules applied. Total rules applied 634 place count 972 transition count 2049
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 642 place count 972 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 643 place count 971 transition count 2040
Iterating global reduction 7 with 1 rules applied. Total rules applied 644 place count 971 transition count 2040
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 645 place count 971 transition count 2039
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 649 place count 969 transition count 2040
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 8 with 22 rules applied. Total rules applied 671 place count 969 transition count 2018
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 694 place count 946 transition count 2018
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 695 place count 946 transition count 2017
Partial Free-agglomeration rule applied 29 times.
Drop transitions (Partial Free agglomeration) removed 29 transitions
Iterating global reduction 9 with 29 rules applied. Total rules applied 724 place count 946 transition count 2017
Applied a total of 724 rules in 422 ms. Remains 946 /1291 variables (removed 345) and now considering 2017/2364 (removed 347) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6559972860608374289.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9587799280139249895.kers'
[2026-05-22 22:40:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6559972860608374289.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9587799280139249895.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 14 ms.
// Phase 1: matrix 2017 rows 945 cols 8252 entries
Finished phase 1 with 277 SingleSign rule and 531 generalized
[2026-05-22 22:40:07] [INFO ] Computed 138 invariants in 40 ms
Computed 138 P flows in 53 ms.
Exported basis to /tmp/petrispot-output-9587799280139249895.kers
Total runtime 55 ms.
[2026-05-22 22:40:08] [INFO ] Implicit Places using invariants in 873 ms returned [73, 89, 95, 98, 100, 101, 104, 105, 158, 174, 180, 183, 185, 190, 191, 244, 260, 267, 270, 272, 277, 278, 331, 347, 353, 356, 358, 363, 364, 418, 434, 440, 443, 445, 452, 453, 506, 524, 530, 533, 535, 541, 542, 612, 618, 621, 623, 629, 630, 683, 699, 705, 708, 710, 715, 716, 769, 785, 791, 794, 796, 801, 802, 855, 871, 877, 880, 882]
[2026-05-22 22:40:08] [INFO ] Actually due to overlaps returned [104, 190, 277, 363, 452, 541, 629, 715, 801, 105, 191, 278, 364, 453, 542, 630, 716, 802, 89, 95, 100, 174, 180, 185, 260, 272, 347, 353, 358, 434, 440, 445, 524, 530, 535, 612, 618, 623, 699, 705, 710, 785, 791, 796, 871, 877, 882, 73, 101, 158, 244, 267, 331, 418, 506, 683, 769, 855]
Discarding 58 places :
Implicit Place search using SMT only with invariants took 878 ms to find 58 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 888/1369 places, 2017/2364 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 849 transition count 1978
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 849 transition count 1978
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 87 place count 840 transition count 1969
Iterating global reduction 0 with 9 rules applied. Total rules applied 96 place count 840 transition count 1969
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 134 place count 821 transition count 1950
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 164 place count 821 transition count 1920
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 194 place count 791 transition count 1920
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 202 place count 791 transition count 1912
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 210 place count 783 transition count 1912
Applied a total of 210 rules in 208 ms. Remains 783 /888 variables (removed 105) and now considering 1912/2017 (removed 105) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8655716874042908655.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4251273109315002991.kers'
[2026-05-22 22:40:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8655716874042908655.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4251273109315002991.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1912 rows 783 cols 7774 entries
Finished phase 1 with 195 SingleSign rule and 508 generalized
[2026-05-22 22:40:08] [INFO ] Computed 80 invariants in 18 ms
Computed 80 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-4251273109315002991.kers
Total runtime 24 ms.
[2026-05-22 22:40:09] [INFO ] Implicit Places using invariants in 771 ms returned []
[2026-05-22 22:40:09] [INFO ] Invariant cache hit.
[2026-05-22 22:40:12] [INFO ] Implicit Places using invariants and state equation in 2543 ms returned []
Implicit Place search using SMT with State Equation took 3318 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 783/1369 places, 1912/2364 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6306 ms. Remains : 783/1369 places, 1912/2364 transitions.
RANDOM walk for 40000 steps (634 resets) in 378 ms. (105 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (86 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (84 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (84 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (81 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (82 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (83 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
[2026-05-22 22:40:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 117/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 44/170 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 276/446 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 73/519 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/519 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 28/547 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/547 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 30/577 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 6/583 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/583 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 186/769 variables, 26/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/769 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 1/770 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/770 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 13/783 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/783 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 1912/2695 variables, 783/863 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2695 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/2695 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2695/2695 variables, and 863 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2029 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 56/56 constraints, State Equation: 783/783 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 117/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 44/170 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 276/446 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 73/519 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/519 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 28/547 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/547 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 30/577 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 6/583 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/583 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 186/769 variables, 26/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/769 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 1/770 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/770 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 13/783 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/783 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 1912/2695 variables, 783/863 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2695 variables, 6/869 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2695 variables, 1/870 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2695 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 0/2695 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2695/2695 variables, and 870 constraints, problems are : Problem set: 0 solved, 6 unsolved in 25311 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 56/56 constraints, State Equation: 783/783 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27352ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 22384 ms.
Support contains 9 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 1912/1912 transitions.
Applied a total of 0 rules in 33 ms. Remains 783 /783 variables (removed 0) and now considering 1912/1912 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 783/783 places, 1912/1912 transitions.
Computed a total of 163 stabilizing places and 163 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3929 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3929/3929 places, 4731/4731 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 740 transitions
Trivial Post-agglo rules discarded 740 transitions
Performed 740 trivial Post agglomeration. Transition count delta: 740
Iterating post reduction 0 with 740 rules applied. Total rules applied 740 place count 3928 transition count 3990
Reduce places removed 740 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 743 rules applied. Total rules applied 1483 place count 3188 transition count 3987
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1485 place count 3186 transition count 3987
Performed 1061 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1061 Pre rules applied. Total rules applied 1485 place count 3186 transition count 2926
Deduced a syphon composed of 1061 places in 9 ms
Ensure Unique test removed 104 places
Reduce places removed 1165 places and 0 transitions.
Iterating global reduction 3 with 2226 rules applied. Total rules applied 3711 place count 2021 transition count 2926
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 3 with 74 rules applied. Total rules applied 3785 place count 2011 transition count 2862
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 3849 place count 1947 transition count 2862
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 3849 place count 1947 transition count 2821
Deduced a syphon composed of 41 places in 8 ms
Ensure Unique test removed 41 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 5 with 123 rules applied. Total rules applied 3972 place count 1865 transition count 2821
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 3972 place count 1865 transition count 2781
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 4052 place count 1825 transition count 2781
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4056 place count 1821 transition count 2777
Iterating global reduction 5 with 4 rules applied. Total rules applied 4060 place count 1821 transition count 2777
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4060 place count 1821 transition count 2775
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4064 place count 1819 transition count 2775
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 4066 place count 1817 transition count 2773
Iterating global reduction 5 with 2 rules applied. Total rules applied 4068 place count 1817 transition count 2773
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4069 place count 1816 transition count 2772
Iterating global reduction 5 with 1 rules applied. Total rules applied 4070 place count 1816 transition count 2772
Performed 307 Post agglomeration using F-continuation condition.Transition count delta: 307
Deduced a syphon composed of 307 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 5 with 616 rules applied. Total rules applied 4686 place count 1507 transition count 2465
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 4689 place count 1504 transition count 2462
Ensure Unique test removed 1 places
Iterating global reduction 5 with 4 rules applied. Total rules applied 4693 place count 1503 transition count 2462
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 4694 place count 1503 transition count 2461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4695 place count 1502 transition count 2461
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4695 place count 1502 transition count 2460
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4697 place count 1501 transition count 2460
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4698 place count 1500 transition count 2459
Iterating global reduction 7 with 1 rules applied. Total rules applied 4699 place count 1500 transition count 2459
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 4701 place count 1500 transition count 2457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4702 place count 1499 transition count 2457
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4704 place count 1498 transition count 2462
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4706 place count 1496 transition count 2460
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 9 with 30 rules applied. Total rules applied 4736 place count 1476 transition count 2450
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 4746 place count 1466 transition count 2450
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 30 Pre rules applied. Total rules applied 4746 place count 1466 transition count 2420
Deduced a syphon composed of 30 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 11 with 61 rules applied. Total rules applied 4807 place count 1435 transition count 2420
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 11 with 21 rules applied. Total rules applied 4828 place count 1414 transition count 2420
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 4828 place count 1414 transition count 2419
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4830 place count 1413 transition count 2419
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 5 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 12 with 62 rules applied. Total rules applied 4892 place count 1382 transition count 2388
Discarding 20 places :
Symmetric choice reduction at 12 with 20 rule applications. Total rules 4912 place count 1362 transition count 2368
Iterating global reduction 12 with 20 rules applied. Total rules applied 4932 place count 1362 transition count 2368
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 4942 place count 1352 transition count 2358
Iterating global reduction 12 with 10 rules applied. Total rules applied 4952 place count 1352 transition count 2358
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 4962 place count 1352 transition count 2348
Applied a total of 4962 rules in 1329 ms. Remains 1352 /3929 variables (removed 2577) and now considering 2348/4731 (removed 2383) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6829622322792636529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2149938215824784897.kers'
[2026-05-22 22:41:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6829622322792636529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2149938215824784897.kers]
Culling duplicate invariants (modulo rational): removing 32 columns.
Culled 32 columns in 4 ms.
// Phase 1: matrix 2348 rows 1320 cols 9131 entries
Finished phase 1 with 312 SingleSign rule and 818 generalized
[2026-05-22 22:41:03] [INFO ] Computed 222 invariants in 66 ms
Computed 222 P flows in 66 ms.
Exported basis to /tmp/petrispot-output-2149938215824784897.kers
Total runtime 68 ms.
[2026-05-22 22:41:05] [INFO ] Implicit Places using invariants in 1900 ms returned [1, 18, 19, 31, 48, 66, 86, 138, 148, 149, 151, 168, 186, 206, 257, 258, 270, 271, 273, 290, 308, 328, 379, 380, 392, 393, 395, 412, 430, 450, 501, 502, 514, 515, 517, 534, 552, 572, 623, 624, 636, 637, 639, 656, 674, 694, 745, 746, 758, 759, 761, 778, 796, 816, 867, 868, 880, 881, 883, 900, 918, 938, 989, 990, 1002, 1003, 1005, 1022, 1040, 1060, 1111, 1112, 1124, 1125, 1127, 1144, 1162, 1182, 1233, 1234, 1237, 1248, 1249, 1250, 1268, 1289, 1290, 1291, 1292]
Discarding 89 places :
Implicit Place search using SMT only with invariants took 1902 ms to find 89 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1263/3929 places, 2348/4731 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 162 rules applied. Total rules applied 162 place count 1263 transition count 2186
Reduce places removed 162 places and 0 transitions.
Iterating post reduction 1 with 162 rules applied. Total rules applied 324 place count 1101 transition count 2186
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 324 place count 1101 transition count 2139
Deduced a syphon composed of 47 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 95 rules applied. Total rules applied 419 place count 1053 transition count 2139
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 431 place count 1049 transition count 2131
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 439 place count 1041 transition count 2131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 442 place count 1038 transition count 2128
Iterating global reduction 4 with 3 rules applied. Total rules applied 445 place count 1038 transition count 2128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 448 place count 1038 transition count 2125
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 4 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 600 place count 962 transition count 2049
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 604 place count 960 transition count 2050
Applied a total of 604 rules in 278 ms. Remains 960 /1263 variables (removed 303) and now considering 2050/2348 (removed 298) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3921079606532732983.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2563554653578585197.kers'
[2026-05-22 22:41:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3921079606532732983.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2563554653578585197.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2050 rows 960 cols 8250 entries
Finished phase 1 with 281 SingleSign rule and 551 generalized
[2026-05-22 22:41:06] [INFO ] Computed 128 invariants in 21 ms
Computed 128 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-2563554653578585197.kers
Total runtime 22 ms.
[2026-05-22 22:41:07] [INFO ] Implicit Places using invariants in 1365 ms returned [88, 95, 100, 175, 181, 186, 263, 269, 274, 351, 357, 362, 439, 445, 450, 527, 533, 538, 615, 621, 626, 703, 709, 714, 791, 797, 802, 879, 885, 890, 957]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 1397 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 929/3929 places, 2050/4731 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 929 transition count 2049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 928 transition count 2049
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 22 place count 908 transition count 2029
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 908 transition count 2029
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 62 place count 888 transition count 2009
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 888 transition count 2009
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 92 place count 878 transition count 1999
Iterating global reduction 2 with 10 rules applied. Total rules applied 102 place count 878 transition count 1999
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 122 place count 868 transition count 1989
Applied a total of 122 rules in 162 ms. Remains 868 /929 variables (removed 61) and now considering 1989/2050 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4869908149852049296.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18377270413542248366.kers'
[2026-05-22 22:41:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4869908149852049296.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18377270413542248366.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1989 rows 868 cols 8025 entries
Finished phase 1 with 260 SingleSign rule and 511 generalized
[2026-05-22 22:41:07] [INFO ] Computed 97 invariants in 19 ms
Computed 97 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-18377270413542248366.kers
Total runtime 33 ms.
[2026-05-22 22:41:08] [INFO ] Implicit Places using invariants in 1239 ms returned []
[2026-05-22 22:41:08] [INFO ] Invariant cache hit.
[2026-05-22 22:41:11] [INFO ] Implicit Places using invariants and state equation in 2728 ms returned []
Implicit Place search using SMT with State Equation took 3974 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 868/3929 places, 1989/4731 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 9052 ms. Remains : 868/3929 places, 1989/4731 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 269 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-01
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-10b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-LTLCardinality-01 finished in 9404 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||X(G((X(p1)||(!p2 U (p3||G(!p2))))))))))'
Support contains 6 out of 3929 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3929/3929 places, 4731/4731 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 3926 transition count 4728
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 3926 transition count 4728
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 3923 transition count 4725
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 3923 transition count 4725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3922 transition count 4724
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3922 transition count 4724
Applied a total of 14 rules in 1556 ms. Remains 3922 /3929 variables (removed 7) and now considering 4724/4731 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8434888912489378205.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11335602811744293736.kers'
[2026-05-22 22:41:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8434888912489378205.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11335602811744293736.kers]
Culled 0 columns in 12 ms.
// Phase 1: matrix 4724 rows 3922 cols 14559 entries
Finished phase 1 with 2552 SingleSign rule and 948 generalized
[2026-05-22 22:41:13] [INFO ] Computed 422 invariants in 83 ms
Computed 422 P flows in 97 ms.
Exported basis to /tmp/petrispot-output-11335602811744293736.kers
Total runtime 100 ms.
[2026-05-22 22:41:16] [INFO ] Implicit Places using invariants in 2859 ms returned []
[2026-05-22 22:41:16] [INFO ] Invariant cache hit.
[2026-05-22 22:41:45] [INFO ] Implicit Places using invariants and state equation in 29496 ms returned []
Implicit Place search using SMT with State Equation took 32409 ms to find 0 implicit places.
Running 4723 sub problems to find dead transitions.
[2026-05-22 22:41:45] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3921 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3921/8646 variables, and 255 constraints, problems are : Problem set: 0 solved, 4723 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3922 constraints, PredecessorRefiner: 4723/4723 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3921 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3921/8646 variables, and 255 constraints, problems are : Problem set: 0 solved, 4723 unsolved in 30103 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3922 constraints, PredecessorRefiner: 0/4723 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62945ms problems are : Problem set: 0 solved, 4723 unsolved
Search for dead transitions found 0 dead transitions in 62961ms
Starting structural reductions in LTL mode, iteration 1 : 3922/3929 places, 4724/4731 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96945 ms. Remains : 3922/3929 places, 4724/4731 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G((X(p0)||(!p1 U (p2||G(!p1))))))||p3))))'
Stuttering acceptance computed with spot in 371 ms :[true, (AND (NOT p2) p1 (NOT p3) (NOT p0)), (NOT p0), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2) p1), (AND (NOT p3) (NOT p0) (NOT p2) p1), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-LTLCardinality-03 finished in 97421 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(G(p0)))'
Support contains 1 out of 3929 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3929/3929 places, 4731/4731 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3925 transition count 4727
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3925 transition count 4727
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 3922 transition count 4724
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 3922 transition count 4724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 3921 transition count 4723
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 3921 transition count 4723
Applied a total of 16 rules in 1358 ms. Remains 3921 /3929 variables (removed 8) and now considering 4723/4731 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7201460750776985653.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12935547844607143977.kers'
[2026-05-22 22:42:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7201460750776985653.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12935547844607143977.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 4723 rows 3921 cols 14557 entries
Finished phase 1 with 2551 SingleSign rule and 948 generalized
[2026-05-22 22:42:50] [INFO ] Computed 422 invariants in 41 ms
Computed 422 P flows in 60 ms.
Exported basis to /tmp/petrispot-output-12935547844607143977.kers
Total runtime 66 ms.
[2026-05-22 22:42:53] [INFO ] Implicit Places using invariants in 2862 ms returned []
[2026-05-22 22:42:53] [INFO ] Invariant cache hit.
[2026-05-22 22:43:09] [INFO ] Implicit Places using invariants and state equation in 16341 ms returned []
Implicit Place search using SMT with State Equation took 19207 ms to find 0 implicit places.
Running 4722 sub problems to find dead transitions.
[2026-05-22 22:43:09] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3920/8644 variables, and 255 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 4722/4722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3920/8644 variables, and 255 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30119 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 0/4722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62751ms problems are : Problem set: 0 solved, 4722 unsolved
Search for dead transitions found 0 dead transitions in 62765ms
Starting structural reductions in LTL mode, iteration 1 : 3921/3929 places, 4723/4731 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83377 ms. Remains : 3921/3929 places, 4723/4731 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(G(p0)))'
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 2506 steps with 3 reset in 28 ms.
FORMULA ASLink-PT-10b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-LTLCardinality-04 finished in 83562 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(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))))'
Support contains 5 out of 3929 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3929/3929 places, 4731/4731 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 3928 transition count 4730
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3928 transition count 4730
Applied a total of 2 rules in 630 ms. Remains 3928 /3929 variables (removed 1) and now considering 4730/4731 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15384556330159373908.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16205544368141680935.kers'
[2026-05-22 22:44:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15384556330159373908.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16205544368141680935.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 4730 rows 3928 cols 14573 entries
Finished phase 1 with 2557 SingleSign rule and 949 generalized
[2026-05-22 22:44:13] [INFO ] Computed 422 invariants in 64 ms
Computed 422 P flows in 64 ms.
Exported basis to /tmp/petrispot-output-16205544368141680935.kers
Total runtime 67 ms.
[2026-05-22 22:44:16] [INFO ] Implicit Places using invariants in 3424 ms returned []
[2026-05-22 22:44:16] [INFO ] Invariant cache hit.
[2026-05-22 22:44:32] [INFO ] Implicit Places using invariants and state equation in 15819 ms returned []
Implicit Place search using SMT with State Equation took 19275 ms to find 0 implicit places.
Running 4729 sub problems to find dead transitions.
[2026-05-22 22:44:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3927 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4729 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3927/8658 variables, and 255 constraints, problems are : Problem set: 0 solved, 4729 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3928 constraints, PredecessorRefiner: 4729/4729 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4729 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3927 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4729 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3927/8658 variables, and 255 constraints, problems are : Problem set: 0 solved, 4729 unsolved in 30124 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3928 constraints, PredecessorRefiner: 0/4729 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62464ms problems are : Problem set: 0 solved, 4729 unsolved
Search for dead transitions found 0 dead transitions in 62486ms
Starting structural reductions in LTL mode, iteration 1 : 3928/3929 places, 4730/4731 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82424 ms. Remains : 3928/3929 places, 4730/4731 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(!p1) U (X(G(!p1))||(!p2&&X(!p1)))))))'
Stuttering acceptance computed with spot in 350 ms :[p1, p1, (AND p1 (NOT p0)), p1, (AND (NOT p0) p2 p1), true, (AND p1 p0), (OR (AND p0 p1) (AND p1 p2))]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-LTLCardinality-06 finished in 82870 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 4 out of 3929 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3929/3929 places, 4731/4731 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3925 transition count 4727
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3925 transition count 4727
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 3922 transition count 4724
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 3922 transition count 4724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 3921 transition count 4723
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 3921 transition count 4723
Applied a total of 16 rules in 1312 ms. Remains 3921 /3929 variables (removed 8) and now considering 4723/4731 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7835936178562379722.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11396054810334987096.kers'
[2026-05-22 22:45:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7835936178562379722.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11396054810334987096.kers]
Culled 0 columns in 9 ms.
// Phase 1: matrix 4723 rows 3921 cols 14557 entries
Finished phase 1 with 2551 SingleSign rule and 948 generalized
[2026-05-22 22:45:37] [INFO ] Computed 422 invariants in 104 ms
Computed 422 P flows in 105 ms.
Exported basis to /tmp/petrispot-output-11396054810334987096.kers
Total runtime 114 ms.
[2026-05-22 22:45:40] [INFO ] Implicit Places using invariants in 3490 ms returned []
[2026-05-22 22:45:40] [INFO ] Invariant cache hit.
[2026-05-22 22:45:57] [INFO ] Implicit Places using invariants and state equation in 16517 ms returned []
Implicit Place search using SMT with State Equation took 20049 ms to find 0 implicit places.
Running 4722 sub problems to find dead transitions.
[2026-05-22 22:45:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3920/8644 variables, and 255 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 4722/4722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3920/8644 variables, and 255 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30115 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 0/4722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62858ms problems are : Problem set: 0 solved, 4722 unsolved
Search for dead transitions found 0 dead transitions in 62866ms
Starting structural reductions in LTL mode, iteration 1 : 3921/3929 places, 4723/4731 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84242 ms. Remains : 3921/3929 places, 4723/4731 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 224 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0))]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-10
Product exploration explored 100000 steps with 33365 reset in 826 ms.
Product exploration explored 100000 steps with 33240 reset in 806 ms.
Computed a total of 161 stabilizing places and 161 stable transitions
Computed a total of 161 stabilizing places and 161 stable transitions
Knowledge based reduction with 12 factoid took 110 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (53 resets) in 630 ms. (63 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
[2026-05-22 22:47:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 53/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1397/1454 variables, 85/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1454 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2290/3744 variables, 281/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3744 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 177/3921 variables, 55/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3921 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8644/8644 variables, and 4343 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5028 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 336/336 constraints, State Equation: 3921/3921 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 53/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1397/1454 variables, 85/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1454 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2290/3744 variables, 281/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3744 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3744/8644 variables, and 371 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 281/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10062ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 3921 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3921/3921 places, 4723/4723 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 731 transitions
Trivial Post-agglo rules discarded 731 transitions
Performed 731 trivial Post agglomeration. Transition count delta: 731
Iterating post reduction 0 with 731 rules applied. Total rules applied 731 place count 3921 transition count 3992
Reduce places removed 731 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 734 rules applied. Total rules applied 1465 place count 3190 transition count 3989
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 1468 place count 3188 transition count 3988
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1469 place count 3187 transition count 3988
Performed 1063 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1063 Pre rules applied. Total rules applied 1469 place count 3187 transition count 2925
Deduced a syphon composed of 1063 places in 9 ms
Ensure Unique test removed 103 places
Reduce places removed 1166 places and 0 transitions.
Iterating global reduction 4 with 2229 rules applied. Total rules applied 3698 place count 2021 transition count 2925
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 4 with 74 rules applied. Total rules applied 3772 place count 2011 transition count 2861
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 5 with 64 rules applied. Total rules applied 3836 place count 1947 transition count 2861
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 3836 place count 1947 transition count 2821
Deduced a syphon composed of 40 places in 9 ms
Ensure Unique test removed 40 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 3956 place count 1867 transition count 2821
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 39 Pre rules applied. Total rules applied 3956 place count 1867 transition count 2782
Deduced a syphon composed of 39 places in 9 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 4034 place count 1828 transition count 2782
Performed 314 Post agglomeration using F-continuation condition.Transition count delta: 314
Deduced a syphon composed of 314 places in 6 ms
Ensure Unique test removed 3 places
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 6 with 631 rules applied. Total rules applied 4665 place count 1511 transition count 2468
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 4669 place count 1507 transition count 2464
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 4674 place count 1506 transition count 2464
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 4675 place count 1506 transition count 2463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4676 place count 1505 transition count 2463
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4676 place count 1505 transition count 2462
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4678 place count 1504 transition count 2462
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4680 place count 1502 transition count 2460
Iterating global reduction 8 with 2 rules applied. Total rules applied 4682 place count 1502 transition count 2460
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 4684 place count 1502 transition count 2458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4685 place count 1501 transition count 2458
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4687 place count 1500 transition count 2463
Free-agglomeration rule applied 13 times.
Iterating global reduction 10 with 13 rules applied. Total rules applied 4700 place count 1500 transition count 2450
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 4713 place count 1487 transition count 2450
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 11 with 9 rules applied. Total rules applied 4722 place count 1487 transition count 2441
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 4731 place count 1478 transition count 2441
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 12 with 10 rules applied. Total rules applied 4741 place count 1478 transition count 2441
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4742 place count 1477 transition count 2440
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 12 with 30 rules applied. Total rules applied 4772 place count 1457 transition count 2430
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 4782 place count 1447 transition count 2430
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 30 Pre rules applied. Total rules applied 4782 place count 1447 transition count 2400
Deduced a syphon composed of 30 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 14 with 61 rules applied. Total rules applied 4843 place count 1416 transition count 2400
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 14 with 11 rules applied. Total rules applied 4854 place count 1405 transition count 2400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 4854 place count 1405 transition count 2399
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 4856 place count 1404 transition count 2399
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 4 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 15 with 42 rules applied. Total rules applied 4898 place count 1383 transition count 2378
Discarding 10 places :
Symmetric choice reduction at 15 with 10 rule applications. Total rules 4908 place count 1373 transition count 2368
Iterating global reduction 15 with 10 rules applied. Total rules applied 4918 place count 1373 transition count 2368
Free-agglomeration rule applied 9 times.
Iterating global reduction 15 with 9 rules applied. Total rules applied 4927 place count 1373 transition count 2359
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 15 with 9 rules applied. Total rules applied 4936 place count 1364 transition count 2359
Applied a total of 4936 rules in 1147 ms. Remains 1364 /3921 variables (removed 2557) and now considering 2359/4723 (removed 2364) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1148 ms. Remains : 1364/3921 places, 2359/4723 transitions.
RANDOM walk for 40000 steps (395 resets) in 349 ms. (114 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (32 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (35 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (35 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 99952 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 3
Probabilistic random walk after 99952 steps, saw 23138 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17516400170578295647.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11230038140086552448.kers'
[2026-05-22 22:47:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17516400170578295647.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11230038140086552448.kers]
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 1 ms.
// Phase 1: matrix 2359 rows 1341 cols 9273 entries
Finished phase 1 with 340 SingleSign rule and 791 generalized
[2026-05-22 22:47:17] [INFO ] Computed 233 invariants in 27 ms
Computed 233 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-11230038140086552448.kers
Total runtime 33 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 37/58 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5/63 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 17/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 154/234 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 45/279 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 9/288 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 169/457 variables, 28/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/457 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 115/572 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/572 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 4/576 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/576 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 108/684 variables, 23/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/684 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 51/735 variables, 9/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/735 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 3/738 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/738 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1/739 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/739 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 105/844 variables, 15/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/844 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 54/898 variables, 9/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/898 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 2/900 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/900 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 59/959 variables, 9/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/959 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 29/988 variables, 6/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/988 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 27/1015 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1015 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 67/1082 variables, 11/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1082 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 26/1108 variables, 5/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1108 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 26/1134 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1134 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 63/1197 variables, 9/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1197 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 26/1223 variables, 5/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1223 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 26/1249 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1249 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 42/1291 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1291 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 12/1303 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1303 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 7/1310 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1310 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 46/1356 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1356 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (OVERLAPS) 2/1358 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1358 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (OVERLAPS) 1/1359 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1359 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 5/1364 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1364 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (OVERLAPS) 2359/3723 variables, 1364/1597 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/3723 variables, 0/1597 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 0/3723 variables, 0/1597 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3723/3723 variables, and 1597 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3542 ms.
Refiners :[Positive P Invariants (semi-flows): 103/103 constraints, Generalized P Invariants (flows): 130/130 constraints, State Equation: 1364/1364 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 37/58 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5/63 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 17/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 154/234 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 45/279 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 9/288 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 169/457 variables, 28/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/457 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 115/572 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/572 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/572 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 4/576 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/576 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 108/684 variables, 23/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/684 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 51/735 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/735 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 3/738 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/738 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 1/739 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/739 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 105/844 variables, 15/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/844 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 54/898 variables, 9/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/898 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 2/900 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/900 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 59/959 variables, 9/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/959 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 29/988 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/988 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 27/1015 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1015 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 67/1082 variables, 11/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1082 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 26/1108 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1108 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 26/1134 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1134 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 63/1197 variables, 9/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 26/1223 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1223 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 26/1249 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1249 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 42/1291 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1291 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 12/1303 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1303 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (OVERLAPS) 7/1310 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1310 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 46/1356 variables, 6/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1356 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1356 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (OVERLAPS) 2/1358 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1358 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 1/1359 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1359 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (OVERLAPS) 5/1364 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1364 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 2359/3723 variables, 1364/1599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/3723 variables, 3/1602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/3723 variables, 0/1602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 0/3723 variables, 0/1602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3723/3723 variables, and 1602 constraints, problems are : Problem set: 0 solved, 3 unsolved in 9003 ms.
Refiners :[Positive P Invariants (semi-flows): 103/103 constraints, Generalized P Invariants (flows): 130/130 constraints, State Equation: 1364/1364 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12613ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2136 ms.
Support contains 4 out of 1364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1364/1364 places, 2359/2359 transitions.
Applied a total of 0 rules in 50 ms. Remains 1364 /1364 variables (removed 0) and now considering 2359/2359 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1364/1364 places, 2359/2359 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1364/1364 places, 2359/2359 transitions.
Applied a total of 0 rules in 51 ms. Remains 1364 /1364 variables (removed 0) and now considering 2359/2359 (removed 0) transitions.
[2026-05-22 22:47:31] [INFO ] Invariant cache hit.
[2026-05-22 22:47:33] [INFO ] Implicit Places using invariants in 1630 ms returned [1, 18, 19, 31, 48, 66, 136, 140, 149, 150, 152, 169, 187, 256, 260, 261, 272, 273, 275, 292, 310, 379, 383, 384, 395, 396, 398, 415, 433, 502, 506, 507, 518, 519, 521, 538, 556, 625, 629, 630, 641, 642, 644, 661, 679, 717, 751, 755, 756, 767, 768, 770, 787, 805, 874, 878, 879, 890, 891, 893, 910, 928, 997, 1001, 1002, 1013, 1014, 1016, 1033, 1051, 1120, 1124, 1125, 1136, 1137, 1139, 1156, 1174, 1243, 1247, 1248, 1251, 1262, 1263, 1264, 1282, 1303, 1304, 1305, 1306]
[2026-05-22 22:47:33] [INFO ] Actually due to overlaps returned [1282, 1264, 48, 169, 292, 415, 538, 661, 787, 910, 1033, 1156, 31, 152, 275, 398, 521, 644, 770, 893, 1016, 1139, 149, 272, 395, 518, 641, 767, 890, 1013, 1136, 1262, 1303, 150, 273, 396, 519, 642, 768, 891, 1014, 1137, 1263, 1304, 1, 18, 260, 261, 383, 384, 506, 507, 629, 630, 755, 756, 878, 879, 1001, 1002, 1124, 1125, 1247, 1248, 66, 187, 310, 433, 556, 679, 805, 928, 1051, 1174, 1305, 19, 1251, 1306]
Discarding 78 places :
Implicit Place search using SMT only with invariants took 1634 ms to find 78 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1286/1364 places, 2359/2359 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 179 rules applied. Total rules applied 179 place count 1275 transition count 2191
Reduce places removed 168 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 180 rules applied. Total rules applied 359 place count 1107 transition count 2179
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 362 place count 1104 transition count 2179
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 362 place count 1104 transition count 2133
Deduced a syphon composed of 46 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 93 rules applied. Total rules applied 455 place count 1057 transition count 2133
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 467 place count 1053 transition count 2125
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 475 place count 1045 transition count 2125
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 478 place count 1042 transition count 2122
Iterating global reduction 5 with 3 rules applied. Total rules applied 481 place count 1042 transition count 2122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 484 place count 1042 transition count 2119
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 5 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 132 rules applied. Total rules applied 616 place count 976 transition count 2053
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 626 place count 966 transition count 2043
Iterating global reduction 6 with 10 rules applied. Total rules applied 636 place count 966 transition count 2043
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 645 place count 966 transition count 2034
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 646 place count 965 transition count 2033
Iterating global reduction 7 with 1 rules applied. Total rules applied 647 place count 965 transition count 2033
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 648 place count 965 transition count 2032
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 652 place count 963 transition count 2033
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 8 with 21 rules applied. Total rules applied 673 place count 963 transition count 2012
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 695 place count 941 transition count 2012
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 9 with 30 rules applied. Total rules applied 725 place count 941 transition count 2012
Applied a total of 725 rules in 335 ms. Remains 941 /1286 variables (removed 345) and now considering 2012/2359 (removed 347) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6613688987635655188.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7637885698025043983.kers'
[2026-05-22 22:47:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6613688987635655188.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7637885698025043983.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 2012 rows 940 cols 8239 entries
Finished phase 1 with 264 SingleSign rule and 539 generalized
[2026-05-22 22:47:33] [INFO ] Computed 138 invariants in 55 ms
Computed 138 P flows in 56 ms.
Exported basis to /tmp/petrispot-output-7637885698025043983.kers
Total runtime 61 ms.
[2026-05-22 22:47:35] [INFO ] Implicit Places using invariants in 1149 ms returned [73, 89, 95, 98, 100, 102, 105, 106, 159, 175, 181, 184, 186, 191, 192, 245, 268, 271, 273, 278, 279, 332, 348, 354, 357, 359, 364, 365, 418, 434, 440, 443, 445, 450, 451, 504, 522, 528, 531, 533, 538, 539, 592, 608, 614, 617, 619, 624, 625, 678, 694, 700, 703, 705, 710, 711, 764, 780, 786, 789, 791, 796, 797, 850, 866, 872, 875, 877]
[2026-05-22 22:47:35] [INFO ] Actually due to overlaps returned [105, 191, 278, 364, 450, 538, 624, 710, 796, 106, 192, 279, 365, 451, 539, 625, 711, 797, 89, 95, 100, 175, 181, 186, 268, 273, 348, 354, 359, 434, 440, 445, 522, 528, 533, 608, 614, 619, 694, 700, 705, 780, 786, 791, 866, 872, 877, 73, 102, 159, 245, 332, 418, 504, 592, 678, 764, 850]
Discarding 58 places :
Implicit Place search using SMT only with invariants took 1177 ms to find 58 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 883/1364 places, 2012/2359 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 845 transition count 1974
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 845 transition count 1974
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 85 place count 836 transition count 1965
Iterating global reduction 0 with 9 rules applied. Total rules applied 94 place count 836 transition count 1965
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 134 place count 816 transition count 1945
Free-agglomeration rule applied 29 times.
Iterating global reduction 0 with 29 rules applied. Total rules applied 163 place count 816 transition count 1916
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 192 place count 787 transition count 1916
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 201 place count 787 transition count 1907
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 210 place count 778 transition count 1907
Applied a total of 210 rules in 230 ms. Remains 778 /883 variables (removed 105) and now considering 1907/2012 (removed 105) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5367664596683824867.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6817092447767748059.kers'
[2026-05-22 22:47:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5367664596683824867.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6817092447767748059.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1907 rows 778 cols 7775 entries
Finished phase 1 with 199 SingleSign rule and 499 generalized
[2026-05-22 22:47:35] [INFO ] Computed 80 invariants in 18 ms
Computed 80 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-6817092447767748059.kers
Total runtime 22 ms.
[2026-05-22 22:47:36] [INFO ] Implicit Places using invariants in 1051 ms returned []
[2026-05-22 22:47:36] [INFO ] Invariant cache hit.
[2026-05-22 22:47:38] [INFO ] Implicit Places using invariants and state equation in 2543 ms returned []
Implicit Place search using SMT with State Equation took 3615 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 778/1364 places, 1907/2359 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7043 ms. Remains : 778/1364 places, 1907/2359 transitions.
RANDOM walk for 40000 steps (665 resets) in 307 ms. (129 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (73 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (81 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (82 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 204298 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 3
Probabilistic random walk after 204298 steps, saw 49317 distinct states, run finished after 3013 ms. (steps per millisecond=67 ) properties seen :0
[2026-05-22 22:47:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 24/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 51/79 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 165/244 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 69/313 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 28/341 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 60/401 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/403 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/403 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 138/541 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/541 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 74/615 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/615 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/617 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/617 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 95/712 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 27/739 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/739 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 39/778 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/778 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1907/2685 variables, 778/858 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2685 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/2685 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2685/2685 variables, and 858 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2120 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 778/778 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 24/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 51/79 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 165/244 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 69/313 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 28/341 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 60/401 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/403 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/403 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 138/541 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/541 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 74/615 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/615 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/617 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/617 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 95/712 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 27/739 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/739 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 39/778 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/778 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1907/2685 variables, 778/858 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2685 variables, 3/861 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2685 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/2685 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2685/2685 variables, and 861 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3198 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 778/778 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5341ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1134 ms.
Support contains 4 out of 778 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 778/778 places, 1907/1907 transitions.
Applied a total of 0 rules in 32 ms. Remains 778 /778 variables (removed 0) and now considering 1907/1907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 778/778 places, 1907/1907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 778/778 places, 1907/1907 transitions.
Applied a total of 0 rules in 31 ms. Remains 778 /778 variables (removed 0) and now considering 1907/1907 (removed 0) transitions.
[2026-05-22 22:47:48] [INFO ] Invariant cache hit.
[2026-05-22 22:47:49] [INFO ] Implicit Places using invariants in 696 ms returned []
[2026-05-22 22:47:49] [INFO ] Invariant cache hit.
[2026-05-22 22:47:51] [INFO ] Implicit Places using invariants and state equation in 2277 ms returned []
Implicit Place search using SMT with State Equation took 3013 ms to find 0 implicit places.
[2026-05-22 22:47:51] [INFO ] Redundant transitions in 137 ms returned []
Running 1857 sub problems to find dead transitions.
[2026-05-22 22:47:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/777 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/777 variables, 51/78 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 777/2685 variables, and 78 constraints, problems are : Problem set: 0 solved, 1857 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 27/29 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/778 constraints, PredecessorRefiner: 1857/1857 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1857 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/777 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/777 variables, 51/78 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/2685 variables, and 78 constraints, problems are : Problem set: 0 solved, 1857 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 27/29 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/778 constraints, PredecessorRefiner: 0/1857 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60797ms problems are : Problem set: 0 solved, 1857 unsolved
Search for dead transitions found 0 dead transitions in 60801ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63993 ms. Remains : 778/778 places, 1907/1907 transitions.
Knowledge based reduction with 12 factoid took 179 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Knowledge-based reduction took 111053 ms.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Support contains 4 out of 3921 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3921/3921 places, 4723/4723 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 731 transitions
Trivial Post-agglo rules discarded 731 transitions
Performed 731 trivial Post agglomeration. Transition count delta: 731
Iterating post reduction 0 with 731 rules applied. Total rules applied 731 place count 3920 transition count 3991
Reduce places removed 731 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 734 rules applied. Total rules applied 1465 place count 3189 transition count 3988
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 1468 place count 3187 transition count 3987
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1469 place count 3186 transition count 3987
Performed 1063 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1063 Pre rules applied. Total rules applied 1469 place count 3186 transition count 2924
Deduced a syphon composed of 1063 places in 8 ms
Ensure Unique test removed 103 places
Reduce places removed 1166 places and 0 transitions.
Iterating global reduction 4 with 2229 rules applied. Total rules applied 3698 place count 2020 transition count 2924
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 4 with 74 rules applied. Total rules applied 3772 place count 2010 transition count 2860
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 5 with 64 rules applied. Total rules applied 3836 place count 1946 transition count 2860
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 3836 place count 1946 transition count 2820
Deduced a syphon composed of 40 places in 8 ms
Ensure Unique test removed 40 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 3956 place count 1866 transition count 2820
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 39 Pre rules applied. Total rules applied 3956 place count 1866 transition count 2781
Deduced a syphon composed of 39 places in 7 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 4034 place count 1827 transition count 2781
Performed 312 Post agglomeration using F-continuation condition.Transition count delta: 312
Deduced a syphon composed of 312 places in 7 ms
Ensure Unique test removed 3 places
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 6 with 627 rules applied. Total rules applied 4661 place count 1512 transition count 2469
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 4665 place count 1508 transition count 2465
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 4670 place count 1507 transition count 2465
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 4671 place count 1507 transition count 2464
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4672 place count 1506 transition count 2464
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4672 place count 1506 transition count 2463
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4674 place count 1505 transition count 2463
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4676 place count 1503 transition count 2461
Iterating global reduction 8 with 2 rules applied. Total rules applied 4678 place count 1503 transition count 2461
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 4680 place count 1503 transition count 2459
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4681 place count 1502 transition count 2459
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4683 place count 1501 transition count 2464
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4685 place count 1499 transition count 2462
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 10 with 30 rules applied. Total rules applied 4715 place count 1479 transition count 2452
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 4725 place count 1469 transition count 2452
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 30 Pre rules applied. Total rules applied 4725 place count 1469 transition count 2422
Deduced a syphon composed of 30 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 12 with 61 rules applied. Total rules applied 4786 place count 1438 transition count 2422
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 12 with 21 rules applied. Total rules applied 4807 place count 1417 transition count 2422
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 4807 place count 1417 transition count 2421
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 4809 place count 1416 transition count 2421
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 6 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 13 with 62 rules applied. Total rules applied 4871 place count 1385 transition count 2390
Discarding 20 places :
Symmetric choice reduction at 13 with 20 rule applications. Total rules 4891 place count 1365 transition count 2370
Iterating global reduction 13 with 20 rules applied. Total rules applied 4911 place count 1365 transition count 2370
Discarding 10 places :
Symmetric choice reduction at 13 with 10 rule applications. Total rules 4921 place count 1355 transition count 2360
Iterating global reduction 13 with 10 rules applied. Total rules applied 4931 place count 1355 transition count 2360
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 4941 place count 1355 transition count 2350
Applied a total of 4941 rules in 943 ms. Remains 1355 /3921 variables (removed 2566) and now considering 2350/4723 (removed 2373) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7278910270587608984.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14260999980438177884.kers'
[2026-05-22 22:48:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7278910270587608984.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14260999980438177884.kers]
Culling duplicate invariants (modulo rational): removing 32 columns.
Culled 32 columns in 4 ms.
// Phase 1: matrix 2350 rows 1323 cols 9137 entries
Finished phase 1 with 312 SingleSign rule and 820 generalized
[2026-05-22 22:48:54] [INFO ] Computed 223 invariants in 45 ms
Computed 223 P flows in 79 ms.
Exported basis to /tmp/petrispot-output-14260999980438177884.kers
Total runtime 84 ms.
[2026-05-22 22:48:55] [INFO ] Implicit Places using invariants in 1491 ms returned [1, 18, 19, 31, 48, 66, 87, 138, 148, 149, 151, 168, 186, 206, 257, 258, 270, 271, 273, 290, 308, 329, 380, 381, 393, 394, 396, 413, 431, 451, 502, 503, 515, 516, 518, 535, 553, 573, 624, 625, 637, 638, 640, 657, 675, 695, 714, 749, 750, 762, 763, 765, 782, 800, 820, 871, 872, 884, 885, 887, 904, 922, 942, 993, 994, 1006, 1007, 1009, 1026, 1044, 1064, 1115, 1116, 1128, 1129, 1131, 1148, 1166, 1186, 1237, 1238, 1241, 1252, 1253, 1254, 1272, 1293, 1294, 1295, 1296]
[2026-05-22 22:48:55] [INFO ] Actually due to overlaps returned [1272, 1254, 48, 168, 290, 413, 535, 657, 782, 904, 1026, 1148, 31, 148, 151, 270, 273, 393, 396, 515, 518, 637, 640, 762, 765, 884, 887, 1006, 1009, 1128, 1131, 1252, 1293, 149, 271, 394, 516, 638, 763, 885, 1007, 1129, 1253, 1294, 1, 18, 257, 258, 380, 381, 502, 503, 624, 625, 749, 750, 871, 872, 993, 994, 1115, 1116, 1237, 1238, 1295, 19, 66, 87, 138, 186, 206, 308, 329, 431, 451, 553, 573, 675, 695, 800, 820, 922, 942, 1044, 1064, 1166, 1186, 1241, 1296]
Discarding 89 places :
Implicit Place search using SMT only with invariants took 1513 ms to find 89 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1266/3921 places, 2350/4723 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 1265 transition count 2191
Reduce places removed 159 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 162 rules applied. Total rules applied 322 place count 1106 transition count 2188
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 325 place count 1103 transition count 2188
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 325 place count 1103 transition count 2142
Deduced a syphon composed of 46 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 93 rules applied. Total rules applied 418 place count 1056 transition count 2142
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 430 place count 1052 transition count 2134
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 438 place count 1044 transition count 2134
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 441 place count 1041 transition count 2131
Iterating global reduction 5 with 3 rules applied. Total rules applied 444 place count 1041 transition count 2131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 447 place count 1041 transition count 2128
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 4 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 599 place count 965 transition count 2052
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 603 place count 963 transition count 2053
Applied a total of 603 rules in 224 ms. Remains 963 /1266 variables (removed 303) and now considering 2053/2350 (removed 297) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17149514792541352984.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8138335012155005201.kers'
[2026-05-22 22:48:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17149514792541352984.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8138335012155005201.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 2053 rows 963 cols 8257 entries
Finished phase 1 with 283 SingleSign rule and 552 generalized
[2026-05-22 22:48:55] [INFO ] Computed 128 invariants in 51 ms
Computed 128 P flows in 51 ms.
Exported basis to /tmp/petrispot-output-8138335012155005201.kers
Total runtime 53 ms.
[2026-05-22 22:48:56] [INFO ] Implicit Places using invariants in 1148 ms returned [90, 96, 101, 176, 182, 187, 272, 277, 354, 360, 365, 442, 448, 453, 532, 538, 543, 620, 626, 631, 708, 714, 719, 796, 802, 807, 884, 890, 895, 960]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 1154 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 933/3921 places, 2053/4723 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 933 transition count 2052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 932 transition count 2052
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 21 place count 913 transition count 2033
Iterating global reduction 2 with 19 rules applied. Total rules applied 40 place count 913 transition count 2033
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 59 place count 894 transition count 2014
Iterating global reduction 2 with 19 rules applied. Total rules applied 78 place count 894 transition count 2014
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 885 transition count 2005
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 885 transition count 2005
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 116 place count 875 transition count 1995
Applied a total of 116 rules in 175 ms. Remains 875 /933 variables (removed 58) and now considering 1995/2053 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4755014895304579099.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8643417569157327332.kers'
[2026-05-22 22:48:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4755014895304579099.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8643417569157327332.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1995 rows 875 cols 8043 entries
Finished phase 1 with 264 SingleSign rule and 513 generalized
[2026-05-22 22:48:57] [INFO ] Computed 98 invariants in 19 ms
Computed 98 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-8643417569157327332.kers
Total runtime 24 ms.
[2026-05-22 22:48:58] [INFO ] Implicit Places using invariants in 1013 ms returned []
[2026-05-22 22:48:58] [INFO ] Invariant cache hit.
[2026-05-22 22:49:00] [INFO ] Implicit Places using invariants and state equation in 2699 ms returned []
Implicit Place search using SMT with State Equation took 3716 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 875/3921 places, 1995/4723 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 7725 ms. Remains : 875/3921 places, 1995/4723 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 10 factoid took 122 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (442 resets) in 241 ms. (165 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (49 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (55 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (52 resets) in 72 ms. (547 steps per ms) remains 3/3 properties
[2026-05-22 22:49:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 30/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 76/110 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 159/269 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 70/339 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 29/368 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 25/393 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 25/418 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 66/484 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/484 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/486 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/486 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 290/776 variables, 39/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/776 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 30/806 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/806 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 69/875 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/875 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 1995/2870 variables, 875/973 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2870 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/2870 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2870/2870 variables, and 973 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2787 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 875/875 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 30/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 76/110 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 159/269 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 70/339 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 29/368 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 25/393 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 25/418 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 66/484 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/484 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/486 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/486 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 290/776 variables, 39/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/776 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/776 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 30/806 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/806 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 69/875 variables, 17/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/875 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 1995/2870 variables, 875/974 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2870 variables, 3/977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2870 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/2870 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2870/2870 variables, and 977 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3245 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 875/875 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6043ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1127 ms.
Support contains 4 out of 875 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 875/875 places, 1995/1995 transitions.
Free-agglomeration rule applied 50 times.
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 875 transition count 1945
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 109 place count 825 transition count 1936
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 1 with 29 rules applied. Total rules applied 138 place count 825 transition count 1907
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 167 place count 796 transition count 1907
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 796 transition count 1907
Applied a total of 168 rules in 132 ms. Remains 796 /875 variables (removed 79) and now considering 1907/1995 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 796/875 places, 1907/1995 transitions.
RANDOM walk for 40000 steps (639 resets) in 284 ms. (140 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (68 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (81 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (81 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 106139 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 3
Probabilistic random walk after 106139 steps, saw 26009 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10720201328714689276.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8807303423824712893.kers'
[2026-05-22 22:49:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10720201328714689276.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8807303423824712893.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1907 rows 796 cols 8018 entries
Finished phase 1 with 250 SingleSign rule and 448 generalized
[2026-05-22 22:49:11] [INFO ] Computed 98 invariants in 40 ms
Computed 98 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-8807303423824712893.kers
Total runtime 45 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 24/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 75/103 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 180/283 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 90/373 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 28/401 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 61/462 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/464 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/464 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 243/707 variables, 39/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/707 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 30/737 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/737 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 59/796 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/796 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 1907/2703 variables, 796/894 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2703 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/2703 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2703/2703 variables, and 894 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1618 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 796/796 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 24/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 75/103 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 180/283 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 90/373 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 28/401 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 61/462 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/464 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/464 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 243/707 variables, 39/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/707 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 30/737 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/737 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 59/796 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/796 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/796 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 1907/2703 variables, 796/895 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2703 variables, 3/898 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2703 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/2703 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2703/2703 variables, and 898 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3289 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 796/796 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4988ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 720 ms.
Support contains 4 out of 796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 796/796 places, 1907/1907 transitions.
Applied a total of 0 rules in 31 ms. Remains 796 /796 variables (removed 0) and now considering 1907/1907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 796/796 places, 1907/1907 transitions.
RANDOM walk for 40000 steps (637 resets) in 310 ms. (128 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (69 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 236626 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 1
Probabilistic random walk after 236626 steps, saw 64154 distinct states, run finished after 3002 ms. (steps per millisecond=78 ) properties seen :0
[2026-05-22 22:49:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/103 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 180/283 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 90/373 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/401 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 61/462 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/464 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/464 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 243/707 variables, 39/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/707 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 30/737 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/737 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 59/796 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/796 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1907/2703 variables, 796/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2703 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2703 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2703/2703 variables, and 894 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2176 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 796/796 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) 24/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/103 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 180/283 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 90/373 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/401 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 61/462 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/464 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/464 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 243/707 variables, 39/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/707 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/707 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 30/737 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/737 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 59/796 variables, 17/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/796 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1907/2703 variables, 796/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2703 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2703 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2703 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2703/2703 variables, and 896 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2054 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 796/796 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4259ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 185 ms.
Support contains 4 out of 796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 796/796 places, 1907/1907 transitions.
Applied a total of 0 rules in 31 ms. Remains 796 /796 variables (removed 0) and now considering 1907/1907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 796/796 places, 1907/1907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 796/796 places, 1907/1907 transitions.
Applied a total of 0 rules in 31 ms. Remains 796 /796 variables (removed 0) and now considering 1907/1907 (removed 0) transitions.
[2026-05-22 22:49:25] [INFO ] Invariant cache hit.
[2026-05-22 22:49:26] [INFO ] Implicit Places using invariants in 1061 ms returned [90, 91, 161, 162, 238, 239, 309, 310, 380, 381, 453, 454, 524, 525, 595, 596, 666, 667]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1065 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 778/796 places, 1907/1907 transitions.
Applied a total of 0 rules in 37 ms. Remains 778 /778 variables (removed 0) and now considering 1907/1907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1133 ms. Remains : 778/796 places, 1907/1907 transitions.
RANDOM walk for 40000 steps (647 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (71 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 236304 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 1
Probabilistic random walk after 236304 steps, saw 64078 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-260969209122623862.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15772945259928628555.kers'
[2026-05-22 22:49:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-260969209122623862.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15772945259928628555.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1907 rows 778 cols 7775 entries
Finished phase 1 with 210 SingleSign rule and 488 generalized
[2026-05-22 22:49:29] [INFO ] Computed 80 invariants in 19 ms
Computed 80 P flows in 34 ms.
Exported basis to /tmp/petrispot-output-15772945259928628555.kers
Total runtime 41 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/103 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 178/281 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 90/371 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/399 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 61/460 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/462 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 233/695 variables, 29/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/695 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 30/725 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/725 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 53/778 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/778 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1907/2685 variables, 778/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2685 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2685 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2685/2685 variables, and 858 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1330 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 778/778 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) 24/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/103 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 178/281 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 90/371 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/399 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 61/460 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/462 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 233/695 variables, 29/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/695 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 30/725 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/725 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 53/778 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/778 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1907/2685 variables, 778/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2685 variables, 1/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2685 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2685 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2685/2685 variables, and 859 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1842 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 778/778 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3260ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 171 ms.
Support contains 4 out of 778 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 778/778 places, 1907/1907 transitions.
Applied a total of 0 rules in 30 ms. Remains 778 /778 variables (removed 0) and now considering 1907/1907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 778/778 places, 1907/1907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 778/778 places, 1907/1907 transitions.
Applied a total of 0 rules in 31 ms. Remains 778 /778 variables (removed 0) and now considering 1907/1907 (removed 0) transitions.
[2026-05-22 22:49:32] [INFO ] Invariant cache hit.
[2026-05-22 22:49:33] [INFO ] Implicit Places using invariants in 719 ms returned []
[2026-05-22 22:49:33] [INFO ] Invariant cache hit.
[2026-05-22 22:49:35] [INFO ] Implicit Places using invariants and state equation in 2454 ms returned []
Implicit Place search using SMT with State Equation took 3210 ms to find 0 implicit places.
[2026-05-22 22:49:36] [INFO ] Redundant transitions in 240 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3489 ms. Remains : 778/778 places, 1907/1907 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 69 ms. Remains 778 /778 variables (removed 0) and now considering 1907/1907 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-22 22:49:36] [INFO ] Invariant cache hit.
[2026-05-22 22:49:36] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 22:49:36] [INFO ] [Nat]Absence check using 28 positive place invariants in 7 ms returned sat
[2026-05-22 22:49:36] [INFO ] [Nat]Absence check using 28 positive and 52 generalized place invariants in 56 ms returned sat
[2026-05-22 22:49:37] [INFO ] After 757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 22:49:37] [INFO ] After 869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 22:49:37] [INFO ] After 1148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1499 ms.
Knowledge based reduction with 10 factoid took 155 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Knowledge-based reduction took 37157 ms.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 1142 reset in 351 ms.
Product exploration explored 100000 steps with 1136 reset in 426 ms.
Built C files in :
/tmp/ltsmin8482442125748893755
[2026-05-22 22:49:39] [INFO ] Too many transitions (1995) to apply POR reductions. Disabling POR matrices.
[2026-05-22 22:49:39] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8482442125748893755
Running compilation step : cd /tmp/ltsmin8482442125748893755;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8482442125748893755;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8482442125748893755;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 875 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 875/875 places, 1995/1995 transitions.
Applied a total of 0 rules in 32 ms. Remains 875 /875 variables (removed 0) and now considering 1995/1995 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14947226194706851962.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18037425173805837711.kers'
[2026-05-22 22:49:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14947226194706851962.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18037425173805837711.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1995 rows 875 cols 8043 entries
Finished phase 1 with 264 SingleSign rule and 513 generalized
[2026-05-22 22:49:42] [INFO ] Computed 98 invariants in 19 ms
Computed 98 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-18037425173805837711.kers
Total runtime 36 ms.
[2026-05-22 22:49:43] [INFO ] Implicit Places using invariants in 848 ms returned []
[2026-05-22 22:49:43] [INFO ] Invariant cache hit.
[2026-05-22 22:49:45] [INFO ] Implicit Places using invariants and state equation in 2435 ms returned []
Implicit Place search using SMT with State Equation took 3298 ms to find 0 implicit places.
[2026-05-22 22:49:45] [INFO ] Redundant transitions in 69 ms returned []
Running 1926 sub problems to find dead transitions.
[2026-05-22 22:49:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/864 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/864 variables, 54/75 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 864/2870 variables, and 75 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 21/28 constraints, Generalized P Invariants (flows): 54/70 constraints, State Equation: 0/875 constraints, PredecessorRefiner: 1926/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1926 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/864 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/864 variables, 54/75 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 864/2870 variables, and 75 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 21/28 constraints, Generalized P Invariants (flows): 54/70 constraints, State Equation: 0/875 constraints, PredecessorRefiner: 0/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60736ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 60742ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64177 ms. Remains : 875/875 places, 1995/1995 transitions.
Built C files in :
/tmp/ltsmin7857055094823176207
[2026-05-22 22:50:46] [INFO ] Too many transitions (1995) to apply POR reductions. Disabling POR matrices.
[2026-05-22 22:50:46] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7857055094823176207
Running compilation step : cd /tmp/ltsmin7857055094823176207;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7857055094823176207;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7857055094823176207;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 22:50:49] [INFO ] Flatten gal took : 58 ms
[2026-05-22 22:50:49] [INFO ] Flatten gal took : 100 ms
[2026-05-22 22:50:49] [INFO ] Time to serialize gal into /tmp/LTL3645257733936736001.gal : 40 ms
[2026-05-22 22:50:49] [INFO ] Time to serialize properties into /tmp/LTL6196284743309961758.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/LTL3645257733936736001.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3497556721418547107.hoa' '-atoms' '/tmp/LTL6196284743309961758.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...317
Loading property file /tmp/LTL6196284743309961758.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3497556721418547107.hoa
Detected timeout of ITS tools.
[2026-05-22 22:51:05] [INFO ] Flatten gal took : 45 ms
[2026-05-22 22:51:05] [INFO ] Flatten gal took : 43 ms
[2026-05-22 22:51:05] [INFO ] Time to serialize gal into /tmp/LTL9387564119303809349.gal : 11 ms
[2026-05-22 22:51:05] [INFO ] Time to serialize properties into /tmp/LTL7255239649504201592.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/LTL9387564119303809349.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7255239649504201592.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("((p190==0)||(p2246==1))"))U(X(G("((p1091==0)||(p403==1))")))))
Formula 0 simplified : F!"((p190==0)||(p2246==1))" R XF!"((p1091==0)||(p403==1))"
Detected timeout of ITS tools.
[2026-05-22 22:51:20] [INFO ] Flatten gal took : 41 ms
[2026-05-22 22:51:20] [INFO ] Applying decomposition
[2026-05-22 22:51:20] [INFO ] Flatten gal took : 43 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/graph3581287242465180227.txt' '-o' '/tmp/graph3581287242465180227.bin' '-w' '/tmp/graph3581287242465180227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3581287242465180227.bin' '-l' '-1' '-v' '-w' '/tmp/graph3581287242465180227.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:51:20] [INFO ] Decomposing Gal with order
[2026-05-22 22:51:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:51:21] [INFO ] Removed a total of 3911 redundant transitions.
[2026-05-22 22:51:21] [INFO ] Flatten gal took : 273 ms
[2026-05-22 22:51:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 58 ms.
[2026-05-22 22:51:21] [INFO ] Time to serialize gal into /tmp/LTL2691122129947688426.gal : 44 ms
[2026-05-22 22:51:21] [INFO ] Time to serialize properties into /tmp/LTL6361346619504676141.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/LTL2691122129947688426.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6361346619504676141.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...254
Read 1 LTL properties
Checking formula 0 : !(((G("((i0.u24.p190==0)||(i10.u119.p2246==1))"))U(X(G("((i6.u64.p1091==0)||(i1.u26.p403==1))")))))
Formula 0 simplified : F!"((i0.u24.p190==0)||(i10.u119.p2246==1))" R XF!"((i6.u64.p1091==0)||(i1.u26.p403==1))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-10b-LTLCardinality-10 finished in 360830 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)&&F(p1)&&X(X(G((p2||X(F(p3))))))))'
Support contains 5 out of 3929 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3929/3929 places, 4731/4731 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3925 transition count 4727
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3925 transition count 4727
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 3922 transition count 4724
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 3922 transition count 4724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 3921 transition count 4723
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 3921 transition count 4723
Applied a total of 16 rules in 1372 ms. Remains 3921 /3929 variables (removed 8) and now considering 4723/4731 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12634465900796821706.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7482619330634542047.kers'
[2026-05-22 22:51:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12634465900796821706.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7482619330634542047.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 4723 rows 3921 cols 14557 entries
Finished phase 1 with 2551 SingleSign rule and 948 generalized
[2026-05-22 22:51:38] [INFO ] Computed 422 invariants in 55 ms
Computed 422 P flows in 55 ms.
Exported basis to /tmp/petrispot-output-7482619330634542047.kers
Total runtime 60 ms.
[2026-05-22 22:51:40] [INFO ] Implicit Places using invariants in 3021 ms returned []
[2026-05-22 22:51:41] [INFO ] Invariant cache hit.
[2026-05-22 22:51:58] [INFO ] Implicit Places using invariants and state equation in 17745 ms returned []
Implicit Place search using SMT with State Equation took 20782 ms to find 0 implicit places.
Running 4722 sub problems to find dead transitions.
[2026-05-22 22:51:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3920/8644 variables, and 255 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30140 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 4722/4722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3920/8644 variables, and 255 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, Generalized P Invariants (flows): 255/336 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 0/4722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62797ms problems are : Problem set: 0 solved, 4722 unsolved
Search for dead transitions found 0 dead transitions in 62808ms
Starting structural reductions in LTL mode, iteration 1 : 3921/3929 places, 4723/4731 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84977 ms. Remains : 3921/3929 places, 4723/4731 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)&&F(p1)&&X(X(G((p2||X(F(p3))))))))'
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-15
Stuttering criterion allowed to conclude after 552 steps with 2 reset in 4 ms.
FORMULA ASLink-PT-10b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-LTLCardinality-15 finished in 85344 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))))'
Spot run failed in 112 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-22 22:53:02] [INFO ] Flatten gal took : 104 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1085411890052944754
[2026-05-22 22:53:02] [INFO ] Too many transitions (4731) to apply POR reductions. Disabling POR matrices.
[2026-05-22 22:53:02] [INFO ] Applying decomposition
[2026-05-22 22:53:02] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1085411890052944754
Running compilation step : cd /tmp/ltsmin1085411890052944754;'/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-22 22:53:02] [INFO ] Flatten gal took : 99 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/graph3423713417695307145.txt' '-o' '/tmp/graph3423713417695307145.bin' '-w' '/tmp/graph3423713417695307145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3423713417695307145.bin' '-l' '-1' '-v' '-w' '/tmp/graph3423713417695307145.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:53:02] [INFO ] Decomposing Gal with order
[2026-05-22 22:53:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:53:03] [INFO ] Removed a total of 3442 redundant transitions.
[2026-05-22 22:53:04] [INFO ] Flatten gal took : 188 ms
[2026-05-22 22:53:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 37 ms.
[2026-05-22 22:53:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality7974393022281920308.gal : 38 ms
[2026-05-22 22:53:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality12029428825080858673.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/LTLCardinality7974393022281920308.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12029428825080858673.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("((i0.u66.p190==0)||(i20.i1.i0.i1.u781.p2246==1))"))U(X(G("((i13.u352.p1091==0)||(i3.i1.i3.i0.u69.p403==1))")))))
Formula 0 simplified : F!"((i0.u66.p190==0)||(i20.i1.i0.i1.u781.p2246==1))" R XF!"((i13.u352.p1091==0)||(i3.i1.i3.i0.u69.p403==1))"
Compilation finished in 15654 ms.
Running link step : cd /tmp/ltsmin1085411890052944754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin1085411890052944754;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([]((LTLAPp0==true)) U X([]((LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 23:18:29] [INFO ] Applying decomposition
[2026-05-22 23:18:30] [INFO ] Flatten gal took : 769 ms
[2026-05-22 23:18:30] [INFO ] Decomposing Gal with order
[2026-05-22 23:18:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:18:34] [INFO ] Removed a total of 3166 redundant transitions.
[2026-05-22 23:18:35] [INFO ] Flatten gal took : 1995 ms
[2026-05-22 23:18:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 5473 labels/synchronizations in 895 ms.
[2026-05-22 23:18:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality3062098167203913471.gal : 85 ms
[2026-05-22 23:18:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality3179563558920434302.ltl : 25 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/LTLCardinality3062098167203913471.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3179563558920434302.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...276
Read 1 LTL properties
Checking formula 0 : !(((G("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u26.p190==0)||(i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i1.i0.u267.p2246==1))")...300
Formula 0 simplified : F!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u26.p190==0)||(i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i1.i0.u267.p2246==1))" R ...291

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-10b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-10b.tgz
mv ASLink-PT-10b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;