Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690531800187.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is StigmergyCommit-PT-08a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531800187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 11 17:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 17:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 17:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 17M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716992080229

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 14:14:41] [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]
[2024-05-29 14:14:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:14:42] [INFO ] Load time of PNML (sax parser for PT used): 859 ms
[2024-05-29 14:14:42] [INFO ] Transformed 328 places.
[2024-05-29 14:14:42] [INFO ] Transformed 18744 transitions.
[2024-05-29 14:14:42] [INFO ] Found NUPN structural information;
[2024-05-29 14:14:42] [INFO ] Parsed PT model containing 328 places and 18744 transitions and 330279 arcs in 1078 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 328/328 places, 1449/1449 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 265 transition count 1377
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 265 transition count 1377
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 133 place count 265 transition count 1370
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 159 place count 239 transition count 1337
Iterating global reduction 1 with 26 rules applied. Total rules applied 185 place count 239 transition count 1337
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 191 place count 239 transition count 1331
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 195 place count 235 transition count 1327
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 235 transition count 1327
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 203 place count 231 transition count 1323
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 231 transition count 1323
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 211 place count 227 transition count 1319
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 227 transition count 1319
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 219 place count 223 transition count 1315
Iterating global reduction 2 with 4 rules applied. Total rules applied 223 place count 223 transition count 1315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 227 place count 223 transition count 1311
Applied a total of 227 rules in 104 ms. Remains 223 /328 variables (removed 105) and now considering 1311/1449 (removed 138) transitions.
[2024-05-29 14:14:42] [INFO ] Flow matrix only has 1299 transitions (discarded 12 similar events)
// Phase 1: matrix 1299 rows 223 cols
[2024-05-29 14:14:42] [INFO ] Computed 4 invariants in 28 ms
[2024-05-29 14:14:43] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-05-29 14:14:43] [INFO ] Flow matrix only has 1299 transitions (discarded 12 similar events)
[2024-05-29 14:14:43] [INFO ] Invariant cache hit.
[2024-05-29 14:14:43] [INFO ] State equation strengthened by 1120 read => feed constraints.
[2024-05-29 14:14:45] [INFO ] Implicit Places using invariants and state equation in 2603 ms returned [222]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3194 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 222/328 places, 1311/1449 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 204 transition count 1293
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 204 transition count 1293
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 204 transition count 1287
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 49 place count 197 transition count 1280
Iterating global reduction 1 with 7 rules applied. Total rules applied 56 place count 197 transition count 1280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 193 transition count 1276
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 193 transition count 1276
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 190 transition count 1273
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 190 transition count 1273
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 187 transition count 1270
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 187 transition count 1270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 184 transition count 1267
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 184 transition count 1267
Applied a total of 82 rules in 46 ms. Remains 184 /222 variables (removed 38) and now considering 1267/1311 (removed 44) transitions.
[2024-05-29 14:14:46] [INFO ] Flow matrix only has 1255 transitions (discarded 12 similar events)
// Phase 1: matrix 1255 rows 184 cols
[2024-05-29 14:14:46] [INFO ] Computed 3 invariants in 6 ms
[2024-05-29 14:14:46] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-29 14:14:46] [INFO ] Flow matrix only has 1255 transitions (discarded 12 similar events)
[2024-05-29 14:14:46] [INFO ] Invariant cache hit.
[2024-05-29 14:14:46] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:14:47] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/328 places, 1267/1449 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4489 ms. Remains : 184/328 places, 1267/1449 transitions.
Support contains 40 out of 184 places after structural reductions.
[2024-05-29 14:14:47] [INFO ] Flatten gal took : 193 ms
[2024-05-29 14:14:47] [INFO ] Flatten gal took : 98 ms
[2024-05-29 14:14:47] [INFO ] Input system was already deterministic with 1267 transitions.
RANDOM walk for 40000 steps (12 resets) in 4446 ms. (8 steps per ms) remains 7/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 7/7 properties
[2024-05-29 14:14:49] [INFO ] Flow matrix only has 1255 transitions (discarded 12 similar events)
[2024-05-29 14:14:49] [INFO ] Invariant cache hit.
[2024-05-29 14:14:49] [INFO ] State equation strengthened by 1030 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 167/184 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1254/1438 variables, 184/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1438 variables, 1029/1216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1438 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1/1439 variables, 1/1217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1439 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/1439 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1439/1439 variables, and 1217 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1237 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 184/184 constraints, ReadFeed: 1030/1030 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 167/184 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 14:14:51] [INFO ] Deduced a trap composed of 15 places in 381 ms of which 16 ms to minimize.
[2024-05-29 14:14:51] [INFO ] Deduced a trap composed of 13 places in 403 ms of which 2 ms to minimize.
[2024-05-29 14:14:52] [INFO ] Deduced a trap composed of 16 places in 456 ms of which 2 ms to minimize.
[2024-05-29 14:14:52] [INFO ] Deduced a trap composed of 16 places in 357 ms of which 6 ms to minimize.
[2024-05-29 14:14:52] [INFO ] Deduced a trap composed of 13 places in 323 ms of which 1 ms to minimize.
[2024-05-29 14:14:53] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 2 ms to minimize.
[2024-05-29 14:14:53] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 4 ms to minimize.
[2024-05-29 14:14:53] [INFO ] Deduced a trap composed of 13 places in 277 ms of which 4 ms to minimize.
[2024-05-29 14:14:54] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 5 ms to minimize.
[2024-05-29 14:14:54] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 1 ms to minimize.
[2024-05-29 14:14:54] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 0 ms to minimize.
[2024-05-29 14:14:54] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:14:54] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:14:55] [INFO ] Deduced a trap composed of 17 places in 245 ms of which 1 ms to minimize.
[2024-05-29 14:14:55] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 1 ms to minimize.
[2024-05-29 14:14:55] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 1 ms to minimize.
[2024-05-29 14:14:55] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 1 ms to minimize.
[2024-05-29 14:14:55] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 1 ms to minimize.
[2024-05-29 14:14:55] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
SMT process timed out in 6501ms, 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 17 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Graph (complete) has 474 edges and 184 vertex of which 182 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 182 transition count 1171
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 93 rules applied. Total rules applied 188 place count 106 transition count 1154
Reduce places removed 5 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 12 rules applied. Total rules applied 200 place count 101 transition count 1147
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 209 place count 94 transition count 1145
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 212 place count 93 transition count 1143
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 214 place count 92 transition count 1142
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 214 place count 92 transition count 1138
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 222 place count 88 transition count 1138
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 235 place count 75 transition count 1123
Iterating global reduction 6 with 13 rules applied. Total rules applied 248 place count 75 transition count 1123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 251 place count 75 transition count 1120
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 257 place count 69 transition count 1114
Iterating global reduction 7 with 6 rules applied. Total rules applied 263 place count 69 transition count 1114
Performed 27 Post agglomeration using F-continuation condition with reduction of 939 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 317 place count 42 transition count 148
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 7 with 87 rules applied. Total rules applied 404 place count 42 transition count 61
Performed 2 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 408 place count 40 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 413 place count 40 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 417 place count 40 transition count 48
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 420 place count 40 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 423 place count 37 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 424 place count 37 transition count 44
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 425 place count 37 transition count 44
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 426 place count 37 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 427 place count 36 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 428 place count 35 transition count 42
Applied a total of 428 rules in 152 ms. Remains 35 /184 variables (removed 149) and now considering 42/1267 (removed 1225) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 35/184 places, 42/1267 transitions.
RANDOM walk for 40000 steps (1832 resets) in 256 ms. (155 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (361 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
// Phase 1: matrix 42 rows 35 cols
[2024-05-29 14:14:56] [INFO ] Computed 7 invariants in 0 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/66 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/66 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/77 variables, and 36 constraints, problems are : Problem set: 0 solved, 2 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 6/7 constraints, State Equation: 30/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 14:14:56] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
[2024-05-29 14:14:56] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem AtomicPropp3 is UNSAT
[2024-05-29 14:14:56] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Int declared 30/77 variables, and 9 constraints, problems are : Problem set: 2 solved, 0 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 6/7 constraints, State Equation: 0/35 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 159ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 30 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F(p1))||G(p2))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 183 transition count 1180
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 99 rules applied. Total rules applied 185 place count 97 transition count 1167
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 6 rules applied. Total rules applied 191 place count 95 transition count 1163
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 195 place count 93 transition count 1161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 196 place count 92 transition count 1161
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 196 place count 92 transition count 1152
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 214 place count 83 transition count 1152
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 218 place count 79 transition count 1147
Iterating global reduction 5 with 4 rules applied. Total rules applied 222 place count 79 transition count 1147
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 225 place count 79 transition count 1144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 225 place count 79 transition count 1143
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 227 place count 78 transition count 1143
Performed 30 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 287 place count 48 transition count 1102
Ensure Unique test removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Iterating post reduction 6 with 133 rules applied. Total rules applied 420 place count 48 transition count 969
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 426 place count 45 transition count 966
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 429 place count 45 transition count 963
Drop transitions (Redundant composition of simpler transitions.) removed 895 transitions
Redundant transition composition rules discarded 895 transitions
Iterating global reduction 8 with 895 rules applied. Total rules applied 1324 place count 45 transition count 68
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1342 place count 36 transition count 59
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 8 with 5 rules applied. Total rules applied 1347 place count 31 transition count 54
Applied a total of 1347 rules in 297 ms. Remains 31 /184 variables (removed 153) and now considering 54/1267 (removed 1213) transitions.
[2024-05-29 14:14:57] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
// Phase 1: matrix 45 rows 31 cols
[2024-05-29 14:14:57] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 14:14:57] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-29 14:14:57] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
[2024-05-29 14:14:57] [INFO ] Invariant cache hit.
[2024-05-29 14:14:57] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-29 14:14:57] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-05-29 14:14:57] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-29 14:14:57] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
[2024-05-29 14:14:57] [INFO ] Invariant cache hit.
[2024-05-29 14:14:57] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 14:14:57] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:14:57] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 14:14:57] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-05-29 14:14:57] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:14:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:14:57] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:14:57] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-29 14:14:57] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:14:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:14:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 14:14:59] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 44/75 variables, 31/98 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 12/110 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/75 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 1/76 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/76 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 15 (OVERLAPS) 0/76 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 111 constraints, problems are : Problem set: 0 solved, 53 unsolved in 3067 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 14:15:00] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:15:00] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:15:00] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 14:15:00] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:15:01] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 14:15:01] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:15:01] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:15:01] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 44/75 variables, 31/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 53/171 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 1/76 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/76 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/76 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 172 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2098 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 74/74 constraints]
After SMT, in 5197ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 5198ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/184 places, 54/1267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6061 ms. Remains : 31/184 places, 54/1267 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLCardinality-00
Product exploration explored 100000 steps with 33236 reset in 265 ms.
Product exploration explored 100000 steps with 33201 reset in 164 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (NOT p0)), (X (NOT (AND p0 p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 133 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
RANDOM walk for 40000 steps (2515 resets) in 167 ms. (238 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (333 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (342 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
[2024-05-29 14:15:03] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
[2024-05-29 14:15:03] [INFO ] Invariant cache hit.
[2024-05-29 14:15:03] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 75/76 variables, and 32 constraints, problems are : Problem set: 2 solved, 0 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (NOT p0)), (X (NOT (AND p0 p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1))))), (G (OR (NOT p2) p1 (NOT p0))), (G (OR p2 p1 (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p2 (NOT p0)))), (F p0), (F (NOT p2)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 13 factoid took 297 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 54/54 transitions.
Applied a total of 0 rules in 6 ms. Remains 31 /31 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-05-29 14:15:04] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
[2024-05-29 14:15:04] [INFO ] Invariant cache hit.
[2024-05-29 14:15:04] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 14:15:04] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
[2024-05-29 14:15:04] [INFO ] Invariant cache hit.
[2024-05-29 14:15:04] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-29 14:15:04] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-29 14:15:04] [INFO ] Redundant transitions in 0 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-29 14:15:04] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
[2024-05-29 14:15:04] [INFO ] Invariant cache hit.
[2024-05-29 14:15:04] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:15:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 3 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 44/75 variables, 31/98 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 12/110 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/75 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 1/76 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/76 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 15 (OVERLAPS) 0/76 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 111 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2840 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 14:15:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 14:15:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:15:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:15:07] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 14:15:07] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 14:15:07] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:15:07] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:15:07] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 44/75 variables, 31/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 53/171 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 1/76 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/76 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/76 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 172 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1904 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 74/74 constraints]
After SMT, in 4769ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 4770ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4856 ms. Remains : 31/31 places, 54/54 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
RANDOM walk for 1371 steps (86 resets) in 13 ms. (97 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 3 factoid took 316 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 69 ms.
Product exploration explored 100000 steps with 0 reset in 186 ms.
Built C files in :
/tmp/ltsmin7833288755160413277
[2024-05-29 14:15:10] [INFO ] Computing symmetric may disable matrix : 54 transitions.
[2024-05-29 14:15:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:15:10] [INFO ] Computing symmetric may enable matrix : 54 transitions.
[2024-05-29 14:15:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:15:10] [INFO ] Computing Do-Not-Accords matrix : 54 transitions.
[2024-05-29 14:15:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:15:10] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7833288755160413277
Running compilation step : cd /tmp/ltsmin7833288755160413277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 311 ms.
Running link step : cd /tmp/ltsmin7833288755160413277;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin7833288755160413277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3116619460117595226.hoa' '--buchi-type=spotba'
LTSmin run took 251 ms.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-08a-LTLCardinality-00 finished in 14229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 183 transition count 1170
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 111 rules applied. Total rules applied 207 place count 87 transition count 1155
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 6 rules applied. Total rules applied 213 place count 85 transition count 1151
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 217 place count 83 transition count 1149
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 217 place count 83 transition count 1140
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 235 place count 74 transition count 1140
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 240 place count 69 transition count 1133
Iterating global reduction 4 with 5 rules applied. Total rules applied 245 place count 69 transition count 1133
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 252 place count 69 transition count 1126
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 252 place count 69 transition count 1125
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 254 place count 68 transition count 1125
Performed 29 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 312 place count 39 transition count 1085
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 5 with 256 rules applied. Total rules applied 568 place count 39 transition count 829
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 574 place count 36 transition count 826
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 577 place count 36 transition count 823
Drop transitions (Redundant composition of simpler transitions.) removed 757 transitions
Redundant transition composition rules discarded 757 transitions
Iterating global reduction 7 with 757 rules applied. Total rules applied 1334 place count 36 transition count 66
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1352 place count 27 transition count 57
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1358 place count 21 transition count 51
Applied a total of 1358 rules in 170 ms. Remains 21 /184 variables (removed 163) and now considering 51/1267 (removed 1216) transitions.
[2024-05-29 14:15:11] [INFO ] Flow matrix only has 42 transitions (discarded 9 similar events)
// Phase 1: matrix 42 rows 21 cols
[2024-05-29 14:15:11] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 14:15:11] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 14:15:11] [INFO ] Flow matrix only has 42 transitions (discarded 9 similar events)
[2024-05-29 14:15:11] [INFO ] Invariant cache hit.
[2024-05-29 14:15:11] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 14:15:11] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-29 14:15:11] [INFO ] Redundant transitions in 1 ms returned []
Running 50 sub problems to find dead transitions.
[2024-05-29 14:15:11] [INFO ] Flow matrix only has 42 transitions (discarded 9 similar events)
[2024-05-29 14:15:11] [INFO ] Invariant cache hit.
[2024-05-29 14:15:11] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 3 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 41/62 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 1/63 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/63 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 13 (OVERLAPS) 0/63 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 102 constraints, problems are : Problem set: 0 solved, 50 unsolved in 2278 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-29 14:15:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:15:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:15:13] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:15:13] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:15:13] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:15:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 14:15:13] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:15:13] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 41/62 variables, 21/91 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 18/109 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 50/159 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (OVERLAPS) 1/63 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/63 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 12 (OVERLAPS) 0/63 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 160 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1560 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 69/69 constraints]
After SMT, in 3878ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 3880ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/184 places, 51/1267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4147 ms. Remains : 21/184 places, 51/1267 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLCardinality-02
Stuttering criterion allowed to conclude after 6 steps with 2 reset in 0 ms.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-08a-LTLCardinality-02 finished in 4410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 162 transition count 1243
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 162 transition count 1243
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 49 place count 162 transition count 1238
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 62 place count 149 transition count 1225
Iterating global reduction 1 with 13 rules applied. Total rules applied 75 place count 149 transition count 1225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 77 place count 149 transition count 1223
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 86 place count 140 transition count 1214
Iterating global reduction 2 with 9 rules applied. Total rules applied 95 place count 140 transition count 1214
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 104 place count 131 transition count 1205
Iterating global reduction 2 with 9 rules applied. Total rules applied 113 place count 131 transition count 1205
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 119 place count 125 transition count 1199
Iterating global reduction 2 with 6 rules applied. Total rules applied 125 place count 125 transition count 1199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 125 transition count 1197
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 130 place count 122 transition count 1194
Iterating global reduction 3 with 3 rules applied. Total rules applied 133 place count 122 transition count 1194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 135 place count 122 transition count 1192
Applied a total of 135 rules in 39 ms. Remains 122 /184 variables (removed 62) and now considering 1192/1267 (removed 75) transitions.
[2024-05-29 14:15:15] [INFO ] Flow matrix only has 1182 transitions (discarded 10 similar events)
// Phase 1: matrix 1182 rows 122 cols
[2024-05-29 14:15:15] [INFO ] Computed 1 invariants in 11 ms
[2024-05-29 14:15:15] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-29 14:15:15] [INFO ] Flow matrix only has 1182 transitions (discarded 10 similar events)
[2024-05-29 14:15:15] [INFO ] Invariant cache hit.
[2024-05-29 14:15:15] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:15:16] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 993 ms to find 0 implicit places.
Running 1191 sub problems to find dead transitions.
[2024-05-29 14:15:16] [INFO ] Flow matrix only has 1182 transitions (discarded 10 similar events)
[2024-05-29 14:15:16] [INFO ] Invariant cache hit.
[2024-05-29 14:15:16] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-29 14:15:37] [INFO ] Deduced a trap composed of 13 places in 282 ms of which 1 ms to minimize.
[2024-05-29 14:15:37] [INFO ] Deduced a trap composed of 13 places in 286 ms of which 1 ms to minimize.
[2024-05-29 14:15:38] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 0 ms to minimize.
[2024-05-29 14:15:38] [INFO ] Deduced a trap composed of 13 places in 272 ms of which 1 ms to minimize.
[2024-05-29 14:15:38] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 0 ms to minimize.
[2024-05-29 14:15:39] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2024-05-29 14:15:39] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 1 ms to minimize.
[2024-05-29 14:15:39] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 1 ms to minimize.
[2024-05-29 14:15:39] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 1 ms to minimize.
[2024-05-29 14:15:39] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 4 ms to minimize.
[2024-05-29 14:15:40] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 1 ms to minimize.
[2024-05-29 14:15:40] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 1 ms to minimize.
[2024-05-29 14:15:40] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 1 ms to minimize.
[2024-05-29 14:15:40] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 1 ms to minimize.
[2024-05-29 14:15:40] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:15:40] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 2 ms to minimize.
[2024-05-29 14:15:41] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 4 ms to minimize.
[2024-05-29 14:15:41] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-05-29 14:15:41] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 1 ms to minimize.
[2024-05-29 14:15:41] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-29 14:15:41] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:15:42] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 0 ms to minimize.
[2024-05-29 14:15:42] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2024-05-29 14:15:42] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-29 14:15:42] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 14:15:42] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:15:42] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 14:15:42] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2024-05-29 14:15:42] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:15:42] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2024-05-29 14:15:43] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 0 ms to minimize.
[2024-05-29 14:15:43] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 0 ms to minimize.
[2024-05-29 14:15:43] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2024-05-29 14:15:43] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-29 14:15:43] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:15:43] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:15:43] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2024-05-29 14:15:43] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2024-05-29 14:15:44] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2024-05-29 14:15:44] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-29 14:15:47] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 1 ms to minimize.
[2024-05-29 14:15:47] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:15:47] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:15:47] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:15:48] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:15:48] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2024-05-29 14:15:48] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-29 14:15:48] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2024-05-29 14:15:48] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-29 14:15:48] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-29 14:15:48] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-29 14:15:52] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-29 14:15:53] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-29 14:15:53] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-29 14:15:53] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
[2024-05-29 14:15:53] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:15:53] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2024-05-29 14:15:53] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 14:15:53] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-05-29 14:15:53] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-29 14:15:53] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 14:15:54] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-05-29 14:15:54] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 14:15:54] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2024-05-29 14:15:54] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2024-05-29 14:15:54] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 0 ms to minimize.
[2024-05-29 14:15:54] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 0 ms to minimize.
[2024-05-29 14:15:55] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 14:15:55] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 14:15:55] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2024-05-29 14:15:55] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 14:15:55] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 14:15:55] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:15:55] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:15:55] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 14:15:55] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2024-05-29 14:15:56] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 14:15:56] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 14:15:56] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 0 ms to minimize.
[2024-05-29 14:15:56] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-29 14:15:57] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:15:57] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-29 14:15:57] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:15:57] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2024-05-29 14:15:57] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:15:57] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-29 14:15:57] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:15:58] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 1 ms to minimize.
[2024-05-29 14:15:58] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 0 ms to minimize.
[2024-05-29 14:15:58] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 0 ms to minimize.
[2024-05-29 14:15:58] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:15:58] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 0 ms to minimize.
[2024-05-29 14:15:58] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 14:15:58] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 0 ms to minimize.
[2024-05-29 14:15:58] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-05-29 14:15:59] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-29 14:15:59] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:15:59] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-05-29 14:15:59] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:15:59] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 122/1304 variables, and 101 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/122 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1191/159 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-29 14:16:09] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-29 14:16:09] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-29 14:16:10] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 0 ms to minimize.
[2024-05-29 14:16:10] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:16:10] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 14:16:10] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:16:10] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2024-05-29 14:16:10] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:16:10] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 14:16:10] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:16:11] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:16:11] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-05-29 14:16:12] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 14:16:12] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 14/115 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-29 14:16:22] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 122/1304 variables, and 116 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/122 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/159 constraints, Known Traps: 115/115 constraints]
After SMT, in 75474ms problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 75488ms
Starting structural reductions in LTL mode, iteration 1 : 122/184 places, 1192/1267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76527 ms. Remains : 122/184 places, 1192/1267 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-08a-LTLCardinality-03 finished in 76683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 161 transition count 1242
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 161 transition count 1242
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 161 transition count 1236
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 65 place count 148 transition count 1223
Iterating global reduction 1 with 13 rules applied. Total rules applied 78 place count 148 transition count 1223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 148 transition count 1222
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 90 place count 137 transition count 1211
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 137 transition count 1211
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 111 place count 127 transition count 1201
Iterating global reduction 2 with 10 rules applied. Total rules applied 121 place count 127 transition count 1201
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 128 place count 120 transition count 1194
Iterating global reduction 2 with 7 rules applied. Total rules applied 135 place count 120 transition count 1194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 138 place count 120 transition count 1191
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 117 transition count 1188
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 117 transition count 1188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 145 place count 117 transition count 1187
Applied a total of 145 rules in 36 ms. Remains 117 /184 variables (removed 67) and now considering 1187/1267 (removed 80) transitions.
[2024-05-29 14:16:32] [INFO ] Flow matrix only has 1177 transitions (discarded 10 similar events)
// Phase 1: matrix 1177 rows 117 cols
[2024-05-29 14:16:32] [INFO ] Computed 1 invariants in 16 ms
[2024-05-29 14:16:32] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-29 14:16:32] [INFO ] Flow matrix only has 1177 transitions (discarded 10 similar events)
[2024-05-29 14:16:32] [INFO ] Invariant cache hit.
[2024-05-29 14:16:32] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:16:33] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
Running 1186 sub problems to find dead transitions.
[2024-05-29 14:16:33] [INFO ] Flow matrix only has 1177 transitions (discarded 10 similar events)
[2024-05-29 14:16:33] [INFO ] Invariant cache hit.
[2024-05-29 14:16:33] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
[2024-05-29 14:16:53] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 1 ms to minimize.
[2024-05-29 14:16:54] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 1 ms to minimize.
[2024-05-29 14:16:54] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 1 ms to minimize.
[2024-05-29 14:16:54] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 1 ms to minimize.
[2024-05-29 14:16:54] [INFO ] Deduced a trap composed of 18 places in 213 ms of which 0 ms to minimize.
[2024-05-29 14:16:54] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 0 ms to minimize.
[2024-05-29 14:16:55] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2024-05-29 14:16:55] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:16:55] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 0 ms to minimize.
[2024-05-29 14:16:55] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 1 ms to minimize.
[2024-05-29 14:16:55] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 1 ms to minimize.
[2024-05-29 14:16:56] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 0 ms to minimize.
[2024-05-29 14:16:56] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 0 ms to minimize.
[2024-05-29 14:16:56] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 0 ms to minimize.
[2024-05-29 14:16:56] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:16:56] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:16:56] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:16:57] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2024-05-29 14:16:57] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 1 ms to minimize.
[2024-05-29 14:16:57] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
[2024-05-29 14:16:57] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:16:58] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 1 ms to minimize.
[2024-05-29 14:16:58] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 1 ms to minimize.
[2024-05-29 14:16:58] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:16:58] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:16:58] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:16:58] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 0 ms to minimize.
[2024-05-29 14:16:58] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-29 14:16:59] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-29 14:16:59] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2024-05-29 14:16:59] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-29 14:16:59] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2024-05-29 14:16:59] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:16:59] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:16:59] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:16:59] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:17:00] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2024-05-29 14:17:00] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
[2024-05-29 14:17:00] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 14:17:00] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
[2024-05-29 14:17:03] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-05-29 14:17:03] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-29 14:17:03] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-29 14:17:03] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-29 14:17:03] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2024-05-29 14:17:03] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2024-05-29 14:17:04] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2024-05-29 14:17:04] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2024-05-29 14:17:04] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-05-29 14:17:04] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2024-05-29 14:17:04] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 14:17:04] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2024-05-29 14:17:04] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:17:04] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 14:17:05] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 0 ms to minimize.
[2024-05-29 14:17:05] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:17:05] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:17:05] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:17:05] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:17:06] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
[2024-05-29 14:17:06] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:17:06] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 0 ms to minimize.
[2024-05-29 14:17:06] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:17:06] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:17:06] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:17:06] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-29 14:17:06] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-29 14:17:07] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:17:07] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:17:07] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 14:17:07] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-29 14:17:07] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 0 ms to minimize.
[2024-05-29 14:17:07] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2024-05-29 14:17:07] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2024-05-29 14:17:07] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 0 ms to minimize.
[2024-05-29 14:17:07] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2024-05-29 14:17:07] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:17:08] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 1 ms to minimize.
[2024-05-29 14:17:08] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2024-05-29 14:17:08] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
[2024-05-29 14:17:08] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 1 ms to minimize.
[2024-05-29 14:17:09] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:17:09] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-29 14:17:09] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-29 14:17:09] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:17:09] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-05-29 14:17:09] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 0 ms to minimize.
[2024-05-29 14:17:09] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 0 ms to minimize.
[2024-05-29 14:17:09] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2024-05-29 14:17:10] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-05-29 14:17:10] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:17:10] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 1 ms to minimize.
[2024-05-29 14:17:10] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:17:10] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 1 ms to minimize.
[2024-05-29 14:17:11] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 1 ms to minimize.
[2024-05-29 14:17:11] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 1 ms to minimize.
[2024-05-29 14:17:11] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 1 ms to minimize.
[2024-05-29 14:17:11] [INFO ] Deduced a trap composed of 17 places in 228 ms of which 1 ms to minimize.
[2024-05-29 14:17:11] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2024-05-29 14:17:11] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
[2024-05-29 14:17:15] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2024-05-29 14:17:15] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2024-05-29 14:17:15] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 0 ms to minimize.
[2024-05-29 14:17:15] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:17:15] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:17:16] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 14:17:16] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:17:16] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 1 ms to minimize.
[2024-05-29 14:17:16] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 1 ms to minimize.
[2024-05-29 14:17:16] [INFO ] Deduced a trap composed of 17 places in 228 ms of which 1 ms to minimize.
[2024-05-29 14:17:17] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 117/1294 variables, and 112 constraints, problems are : Problem set: 0 solved, 1186 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/117 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1186/154 constraints, Known Traps: 111/111 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 111/112 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
[2024-05-29 14:17:22] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-29 14:17:22] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2024-05-29 14:17:22] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2024-05-29 14:17:22] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 0 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-29 14:17:24] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:17:24] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 14:17:24] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 1 ms to minimize.
[2024-05-29 14:17:25] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 1 ms to minimize.
[2024-05-29 14:17:25] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:17:25] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-29 14:17:26] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
[2024-05-29 14:17:31] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:17:32] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:17:39] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 117/1294 variables, and 135 constraints, problems are : Problem set: 0 solved, 1186 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/117 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/154 constraints, Known Traps: 134/134 constraints]
After SMT, in 75113ms problems are : Problem set: 0 solved, 1186 unsolved
Search for dead transitions found 0 dead transitions in 75125ms
Starting structural reductions in LTL mode, iteration 1 : 117/184 places, 1187/1267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76127 ms. Remains : 117/184 places, 1187/1267 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 257 ms.
Product exploration explored 100000 steps with 0 reset in 426 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
RANDOM walk for 40000 steps (10 resets) in 1909 ms. (20 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1398 steps, run visited all 1 properties in 19 ms. (steps per millisecond=73 )
Probabilistic random walk after 1398 steps, saw 1326 distinct states, run finished after 22 ms. (steps per millisecond=63 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Support contains 2 out of 117 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 1187/1187 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 116 transition count 1158
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 88 transition count 1158
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 56 place count 88 transition count 1151
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 70 place count 81 transition count 1151
Performed 37 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 144 place count 44 transition count 1105
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 280 place count 44 transition count 969
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 296 place count 36 transition count 961
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 304 place count 36 transition count 953
Drop transitions (Redundant composition of simpler transitions.) removed 895 transitions
Redundant transition composition rules discarded 895 transitions
Iterating global reduction 4 with 895 rules applied. Total rules applied 1199 place count 36 transition count 58
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 1217 place count 27 transition count 49
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1219 place count 27 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1220 place count 26 transition count 48
Applied a total of 1220 rules in 139 ms. Remains 26 /117 variables (removed 91) and now considering 48/1187 (removed 1139) transitions.
[2024-05-29 14:17:50] [INFO ] Flow matrix only has 38 transitions (discarded 10 similar events)
// Phase 1: matrix 38 rows 26 cols
[2024-05-29 14:17:50] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 14:17:50] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 14:17:50] [INFO ] Flow matrix only has 38 transitions (discarded 10 similar events)
[2024-05-29 14:17:50] [INFO ] Invariant cache hit.
[2024-05-29 14:17:50] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-29 14:17:50] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2024-05-29 14:17:50] [INFO ] Flow matrix only has 38 transitions (discarded 10 similar events)
[2024-05-29 14:17:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 9/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 8 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 37/63 variables, 26/57 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/63 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/64 variables, and 72 constraints, problems are : Problem set: 0 solved, 26 unsolved in 1378 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 9/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:17:52] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 14:17:52] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 37/63 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 26/118 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-29 14:17:52] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-29 14:17:52] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/63 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 0/63 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/64 variables, and 120 constraints, problems are : Problem set: 0 solved, 26 unsolved in 1177 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 67/67 constraints]
After SMT, in 2567ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 2567ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/117 places, 48/1187 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2785 ms. Remains : 26/117 places, 48/1187 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p1)]
RANDOM walk for 302 steps (34 resets) in 4 ms. (60 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 43 ms.
Product exploration explored 100000 steps with 0 reset in 52 ms.
Built C files in :
/tmp/ltsmin13246551758620489802
[2024-05-29 14:17:53] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2024-05-29 14:17:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:17:53] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2024-05-29 14:17:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:17:53] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2024-05-29 14:17:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:17:53] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13246551758620489802
Running compilation step : cd /tmp/ltsmin13246551758620489802;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 162 ms.
Running link step : cd /tmp/ltsmin13246551758620489802;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13246551758620489802;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1950178415553480313.hoa' '--buchi-type=spotba'
LTSmin run took 337 ms.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-08a-LTLCardinality-05 finished in 81820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 161 transition count 1242
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 161 transition count 1242
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 161 transition count 1236
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 65 place count 148 transition count 1223
Iterating global reduction 1 with 13 rules applied. Total rules applied 78 place count 148 transition count 1223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 80 place count 148 transition count 1221
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 89 place count 139 transition count 1212
Iterating global reduction 2 with 9 rules applied. Total rules applied 98 place count 139 transition count 1212
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 106 place count 131 transition count 1204
Iterating global reduction 2 with 8 rules applied. Total rules applied 114 place count 131 transition count 1204
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 119 place count 126 transition count 1199
Iterating global reduction 2 with 5 rules applied. Total rules applied 124 place count 126 transition count 1199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 126 transition count 1197
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 123 transition count 1194
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 123 transition count 1194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 123 transition count 1193
Applied a total of 133 rules in 29 ms. Remains 123 /184 variables (removed 61) and now considering 1193/1267 (removed 74) transitions.
[2024-05-29 14:17:53] [INFO ] Flow matrix only has 1183 transitions (discarded 10 similar events)
// Phase 1: matrix 1183 rows 123 cols
[2024-05-29 14:17:53] [INFO ] Computed 1 invariants in 12 ms
[2024-05-29 14:17:54] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-29 14:17:54] [INFO ] Flow matrix only has 1183 transitions (discarded 10 similar events)
[2024-05-29 14:17:54] [INFO ] Invariant cache hit.
[2024-05-29 14:17:54] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:17:54] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
Running 1192 sub problems to find dead transitions.
[2024-05-29 14:17:54] [INFO ] Flow matrix only has 1183 transitions (discarded 10 similar events)
[2024-05-29 14:17:54] [INFO ] Invariant cache hit.
[2024-05-29 14:17:54] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-05-29 14:18:15] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 1 ms to minimize.
[2024-05-29 14:18:16] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 0 ms to minimize.
[2024-05-29 14:18:16] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 1 ms to minimize.
[2024-05-29 14:18:16] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 1 ms to minimize.
[2024-05-29 14:18:17] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 0 ms to minimize.
[2024-05-29 14:18:17] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 1 ms to minimize.
[2024-05-29 14:18:17] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 1 ms to minimize.
[2024-05-29 14:18:17] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 1 ms to minimize.
[2024-05-29 14:18:17] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 1 ms to minimize.
[2024-05-29 14:18:18] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2024-05-29 14:18:18] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 1 ms to minimize.
[2024-05-29 14:18:18] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 1 ms to minimize.
[2024-05-29 14:18:18] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 1 ms to minimize.
[2024-05-29 14:18:18] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 1 ms to minimize.
[2024-05-29 14:18:19] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 1 ms to minimize.
[2024-05-29 14:18:19] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 1 ms to minimize.
[2024-05-29 14:18:19] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:18:19] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2024-05-29 14:18:19] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 1 ms to minimize.
[2024-05-29 14:18:20] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-05-29 14:18:20] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:18:20] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 1 ms to minimize.
[2024-05-29 14:18:20] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:18:20] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 0 ms to minimize.
[2024-05-29 14:18:21] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 1 ms to minimize.
[2024-05-29 14:18:21] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 0 ms to minimize.
[2024-05-29 14:18:21] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2024-05-29 14:18:21] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 1 ms to minimize.
[2024-05-29 14:18:21] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2024-05-29 14:18:21] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 14:18:21] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:18:22] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:18:22] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 0 ms to minimize.
[2024-05-29 14:18:22] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 14:18:22] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:18:22] [INFO ] Deduced a trap composed of 13 places in 284 ms of which 0 ms to minimize.
[2024-05-29 14:18:22] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 1 ms to minimize.
[2024-05-29 14:18:23] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 1 ms to minimize.
[2024-05-29 14:18:23] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 1 ms to minimize.
[2024-05-29 14:18:23] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-05-29 14:18:26] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-29 14:18:26] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-05-29 14:18:26] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 1 ms to minimize.
[2024-05-29 14:18:26] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:18:27] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 1 ms to minimize.
[2024-05-29 14:18:27] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 0 ms to minimize.
[2024-05-29 14:18:27] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:18:27] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-29 14:18:32] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:18:32] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-29 14:18:32] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:18:32] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-05-29 14:18:32] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:18:32] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 14:18:32] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 14:18:32] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2024-05-29 14:18:32] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-29 14:18:32] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 14:18:33] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2024-05-29 14:18:33] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-05-29 14:18:33] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-29 14:18:33] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:18:33] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-29 14:18:34] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 14:18:34] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-29 14:18:34] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-05-29 14:18:34] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 0 ms to minimize.
[2024-05-29 14:18:34] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 14:18:35] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 14:18:35] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 14:18:35] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-29 14:18:35] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:18:35] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:18:39] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-29 14:18:39] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:18:39] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 14:18:39] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 14:18:39] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/1306 variables, and 79 constraints, problems are : Problem set: 0 solved, 1192 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/123 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1192/160 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 78/79 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-05-29 14:18:43] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-29 14:18:43] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:18:43] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 14:18:43] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-29 14:18:44] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 14:18:44] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2024-05-29 14:18:44] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:18:44] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:18:44] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:18:44] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 14:18:44] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:18:44] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 14:18:44] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:18:45] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 14:18:45] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:18:45] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2024-05-29 14:18:46] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 14:18:46] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:18:46] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:18:46] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-05-29 14:18:54] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-05-29 14:18:55] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-05-29 14:19:03] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:19:03] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 123/1306 variables, and 103 constraints, problems are : Problem set: 0 solved, 1192 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/123 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/160 constraints, Known Traps: 102/102 constraints]
After SMT, in 74987ms problems are : Problem set: 0 solved, 1192 unsolved
Search for dead transitions found 0 dead transitions in 75003ms
Starting structural reductions in LTL mode, iteration 1 : 123/184 places, 1193/1267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75972 ms. Remains : 123/184 places, 1193/1267 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-08a-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-08a-LTLCardinality-09 finished in 76479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1 U X(G(!p1))))))'
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 160 transition count 1242
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 160 transition count 1242
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 160 transition count 1236
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 68 place count 146 transition count 1222
Iterating global reduction 1 with 14 rules applied. Total rules applied 82 place count 146 transition count 1222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 84 place count 146 transition count 1220
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 95 place count 135 transition count 1209
Iterating global reduction 2 with 11 rules applied. Total rules applied 106 place count 135 transition count 1209
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 116 place count 125 transition count 1199
Iterating global reduction 2 with 10 rules applied. Total rules applied 126 place count 125 transition count 1199
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 133 place count 118 transition count 1192
Iterating global reduction 2 with 7 rules applied. Total rules applied 140 place count 118 transition count 1192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 143 place count 118 transition count 1189
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 147 place count 114 transition count 1185
Iterating global reduction 3 with 4 rules applied. Total rules applied 151 place count 114 transition count 1185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 153 place count 114 transition count 1183
Applied a total of 153 rules in 35 ms. Remains 114 /184 variables (removed 70) and now considering 1183/1267 (removed 84) transitions.
[2024-05-29 14:19:10] [INFO ] Flow matrix only has 1173 transitions (discarded 10 similar events)
// Phase 1: matrix 1173 rows 114 cols
[2024-05-29 14:19:10] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 14:19:10] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-29 14:19:10] [INFO ] Flow matrix only has 1173 transitions (discarded 10 similar events)
[2024-05-29 14:19:10] [INFO ] Invariant cache hit.
[2024-05-29 14:19:10] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:19:11] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
Running 1182 sub problems to find dead transitions.
[2024-05-29 14:19:11] [INFO ] Flow matrix only has 1173 transitions (discarded 10 similar events)
[2024-05-29 14:19:11] [INFO ] Invariant cache hit.
[2024-05-29 14:19:11] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-05-29 14:19:31] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 1 ms to minimize.
[2024-05-29 14:19:31] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 1 ms to minimize.
[2024-05-29 14:19:32] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 1 ms to minimize.
[2024-05-29 14:19:32] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2024-05-29 14:19:32] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 1 ms to minimize.
[2024-05-29 14:19:32] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2024-05-29 14:19:32] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 1 ms to minimize.
[2024-05-29 14:19:33] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 1 ms to minimize.
[2024-05-29 14:19:33] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 0 ms to minimize.
[2024-05-29 14:19:33] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 0 ms to minimize.
[2024-05-29 14:19:33] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 0 ms to minimize.
[2024-05-29 14:19:33] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2024-05-29 14:19:34] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:19:34] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:19:34] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-05-29 14:19:34] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 1 ms to minimize.
[2024-05-29 14:19:34] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 1 ms to minimize.
[2024-05-29 14:19:34] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:19:35] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:19:35] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-05-29 14:19:35] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 0 ms to minimize.
[2024-05-29 14:19:35] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 1 ms to minimize.
[2024-05-29 14:19:35] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:19:36] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:19:36] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 0 ms to minimize.
[2024-05-29 14:19:36] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 1 ms to minimize.
[2024-05-29 14:19:36] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:19:36] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:19:36] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2024-05-29 14:19:37] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 1 ms to minimize.
[2024-05-29 14:19:37] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 0 ms to minimize.
[2024-05-29 14:19:37] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 0 ms to minimize.
[2024-05-29 14:19:37] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 0 ms to minimize.
[2024-05-29 14:19:37] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:19:38] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 1 ms to minimize.
[2024-05-29 14:19:38] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 0 ms to minimize.
[2024-05-29 14:19:38] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:19:38] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:19:38] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-29 14:19:38] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-05-29 14:19:41] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2024-05-29 14:19:41] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-05-29 14:19:41] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 14:19:42] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:19:42] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:19:42] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:19:42] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2024-05-29 14:19:42] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:19:42] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2024-05-29 14:19:42] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2024-05-29 14:19:43] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 2 ms to minimize.
[2024-05-29 14:19:43] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 0 ms to minimize.
[2024-05-29 14:19:43] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 0 ms to minimize.
[2024-05-29 14:19:43] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 0 ms to minimize.
[2024-05-29 14:19:43] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 1 ms to minimize.
[2024-05-29 14:19:44] [INFO ] Deduced a trap composed of 16 places in 248 ms of which 1 ms to minimize.
[2024-05-29 14:19:44] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 0 ms to minimize.
[2024-05-29 14:19:44] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 0 ms to minimize.
[2024-05-29 14:19:44] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 1 ms to minimize.
[2024-05-29 14:19:45] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-05-29 14:19:45] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:19:45] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2024-05-29 14:19:45] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2024-05-29 14:19:45] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 14:19:45] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 0 ms to minimize.
[2024-05-29 14:19:46] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2024-05-29 14:19:46] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2024-05-29 14:19:46] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:19:46] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2024-05-29 14:19:46] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 14:19:46] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:19:46] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 1 ms to minimize.
[2024-05-29 14:19:47] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 1 ms to minimize.
[2024-05-29 14:19:47] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:19:47] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2024-05-29 14:19:47] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:19:47] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2024-05-29 14:19:47] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2024-05-29 14:19:47] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2024-05-29 14:19:47] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-05-29 14:19:48] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-05-29 14:19:48] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 1 ms to minimize.
[2024-05-29 14:19:49] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 1 ms to minimize.
[2024-05-29 14:19:49] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 0 ms to minimize.
[2024-05-29 14:19:49] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2024-05-29 14:19:49] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2024-05-29 14:19:49] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:19:49] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:19:54] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-29 14:19:54] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-29 14:19:54] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2024-05-29 14:19:54] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-29 14:19:55] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 114/1287 variables, and 101 constraints, problems are : Problem set: 0 solved, 1182 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/114 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1182/150 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:20:03] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 1 ms to minimize.
[2024-05-29 14:20:03] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-05-29 14:20:05] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:20:05] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-05-29 14:20:14] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-05-29 14:20:20] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-05-29 14:20:23] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 114/1287 variables, and 126 constraints, problems are : Problem set: 0 solved, 1182 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/114 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/150 constraints, Known Traps: 125/125 constraints]
After SMT, in 74875ms problems are : Problem set: 0 solved, 1182 unsolved
Search for dead transitions found 0 dead transitions in 74888ms
Starting structural reductions in LTL mode, iteration 1 : 114/184 places, 1183/1267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75829 ms. Remains : 114/184 places, 1183/1267 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1, true]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLCardinality-10
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-08a-LTLCardinality-10 finished in 75995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1&&F(p2))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 183 transition count 1181
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 1 with 96 rules applied. Total rules applied 181 place count 98 transition count 1170
Reduce places removed 1 places and 0 transitions.
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 2 with 3 rules applied. Total rules applied 184 place count 97 transition count 1168
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 187 place count 96 transition count 1166
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 191 place count 94 transition count 1164
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 194 place count 93 transition count 1162
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 196 place count 92 transition count 1161
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 10 Pre rules applied. Total rules applied 196 place count 92 transition count 1151
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 216 place count 82 transition count 1151
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 222 place count 76 transition count 1143
Iterating global reduction 7 with 6 rules applied. Total rules applied 228 place count 76 transition count 1143
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 243 place count 76 transition count 1128
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 243 place count 76 transition count 1126
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 247 place count 74 transition count 1126
Performed 27 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 8 with 54 rules applied. Total rules applied 301 place count 47 transition count 1091
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Iterating post reduction 8 with 505 rules applied. Total rules applied 806 place count 47 transition count 586
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 812 place count 44 transition count 583
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 815 place count 44 transition count 580
Drop transitions (Redundant composition of simpler transitions.) removed 519 transitions
Redundant transition composition rules discarded 519 transitions
Iterating global reduction 10 with 519 rules applied. Total rules applied 1334 place count 44 transition count 61
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 18 rules applied. Total rules applied 1352 place count 35 transition count 52
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1354 place count 35 transition count 52
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 10 with 5 rules applied. Total rules applied 1359 place count 30 transition count 47
Applied a total of 1359 rules in 111 ms. Remains 30 /184 variables (removed 154) and now considering 47/1267 (removed 1220) transitions.
[2024-05-29 14:20:26] [INFO ] Flow matrix only has 37 transitions (discarded 10 similar events)
// Phase 1: matrix 37 rows 30 cols
[2024-05-29 14:20:26] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 14:20:26] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 14:20:26] [INFO ] Flow matrix only has 37 transitions (discarded 10 similar events)
[2024-05-29 14:20:26] [INFO ] Invariant cache hit.
[2024-05-29 14:20:26] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-29 14:20:26] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-29 14:20:26] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-29 14:20:26] [INFO ] Flow matrix only has 37 transitions (discarded 10 similar events)
[2024-05-29 14:20:26] [INFO ] Invariant cache hit.
[2024-05-29 14:20:26] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:20:27] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-29 14:20:28] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/30 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 12 (OVERLAPS) 36/66 variables, 30/96 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 15 (OVERLAPS) 1/67 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/67 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 17 (OVERLAPS) 0/67 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/67 variables, and 108 constraints, problems are : Problem set: 0 solved, 46 unsolved in 3029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-29 14:20:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:20:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:20:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 36/66 variables, 30/99 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 46/156 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 1/67 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 12 (OVERLAPS) 0/67 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/67 variables, and 157 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1420 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 68/68 constraints]
After SMT, in 4465ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 4467ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/184 places, 47/1267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4660 ms. Remains : 30/184 places, 47/1267 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLCardinality-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-08a-LTLCardinality-12 finished in 4798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 162 transition count 1243
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 162 transition count 1243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 162 transition count 1239
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 62 place count 148 transition count 1225
Iterating global reduction 1 with 14 rules applied. Total rules applied 76 place count 148 transition count 1225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 78 place count 148 transition count 1223
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 138 transition count 1213
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 138 transition count 1213
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 107 place count 129 transition count 1204
Iterating global reduction 2 with 9 rules applied. Total rules applied 116 place count 129 transition count 1204
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 121 place count 124 transition count 1199
Iterating global reduction 2 with 5 rules applied. Total rules applied 126 place count 124 transition count 1199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 129 place count 124 transition count 1196
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 122 transition count 1194
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 122 transition count 1194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 135 place count 122 transition count 1192
Applied a total of 135 rules in 36 ms. Remains 122 /184 variables (removed 62) and now considering 1192/1267 (removed 75) transitions.
[2024-05-29 14:20:31] [INFO ] Flow matrix only has 1182 transitions (discarded 10 similar events)
// Phase 1: matrix 1182 rows 122 cols
[2024-05-29 14:20:31] [INFO ] Computed 1 invariants in 10 ms
[2024-05-29 14:20:31] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-29 14:20:31] [INFO ] Flow matrix only has 1182 transitions (discarded 10 similar events)
[2024-05-29 14:20:31] [INFO ] Invariant cache hit.
[2024-05-29 14:20:31] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:20:32] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
Running 1191 sub problems to find dead transitions.
[2024-05-29 14:20:32] [INFO ] Flow matrix only has 1182 transitions (discarded 10 similar events)
[2024-05-29 14:20:32] [INFO ] Invariant cache hit.
[2024-05-29 14:20:32] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-29 14:20:52] [INFO ] Deduced a trap composed of 13 places in 277 ms of which 1 ms to minimize.
[2024-05-29 14:20:53] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 1 ms to minimize.
[2024-05-29 14:20:53] [INFO ] Deduced a trap composed of 13 places in 308 ms of which 1 ms to minimize.
[2024-05-29 14:20:53] [INFO ] Deduced a trap composed of 13 places in 277 ms of which 1 ms to minimize.
[2024-05-29 14:20:53] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 0 ms to minimize.
[2024-05-29 14:20:54] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 1 ms to minimize.
[2024-05-29 14:20:54] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 1 ms to minimize.
[2024-05-29 14:20:54] [INFO ] Deduced a trap composed of 15 places in 268 ms of which 1 ms to minimize.
[2024-05-29 14:20:54] [INFO ] Deduced a trap composed of 13 places in 266 ms of which 1 ms to minimize.
[2024-05-29 14:20:55] [INFO ] Deduced a trap composed of 17 places in 265 ms of which 1 ms to minimize.
[2024-05-29 14:20:55] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 1 ms to minimize.
[2024-05-29 14:20:55] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 1 ms to minimize.
[2024-05-29 14:20:55] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 1 ms to minimize.
[2024-05-29 14:20:56] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 0 ms to minimize.
[2024-05-29 14:20:56] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 1 ms to minimize.
[2024-05-29 14:20:56] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 0 ms to minimize.
[2024-05-29 14:20:56] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 0 ms to minimize.
[2024-05-29 14:20:57] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 1 ms to minimize.
[2024-05-29 14:20:57] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:20:57] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-29 14:20:57] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:20:57] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:20:58] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:20:58] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2024-05-29 14:20:58] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 0 ms to minimize.
[2024-05-29 14:20:58] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 14:20:58] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-29 14:20:58] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:20:58] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2024-05-29 14:20:58] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:20:59] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2024-05-29 14:20:59] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:20:59] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-29 14:20:59] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:20:59] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 0 ms to minimize.
[2024-05-29 14:20:59] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:20:59] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2024-05-29 14:21:00] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2024-05-29 14:21:00] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 5 ms to minimize.
[2024-05-29 14:21:00] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-29 14:21:03] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 0 ms to minimize.
[2024-05-29 14:21:04] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 1 ms to minimize.
[2024-05-29 14:21:04] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 0 ms to minimize.
[2024-05-29 14:21:04] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 0 ms to minimize.
[2024-05-29 14:21:04] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2024-05-29 14:21:04] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:21:04] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:21:04] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 14:21:05] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:21:05] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:21:05] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:21:05] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2024-05-29 14:21:05] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-05-29 14:21:05] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-05-29 14:21:05] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-29 14:21:05] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-05-29 14:21:06] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2024-05-29 14:21:06] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2024-05-29 14:21:06] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 14:21:06] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-29 14:21:06] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 14:21:06] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-29 14:21:06] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2024-05-29 14:21:06] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:21:07] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:21:07] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:21:07] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2024-05-29 14:21:07] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2024-05-29 14:21:07] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2024-05-29 14:21:07] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-05-29 14:21:07] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 14:21:07] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 14:21:07] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2024-05-29 14:21:08] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:21:08] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 0 ms to minimize.
[2024-05-29 14:21:08] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2024-05-29 14:21:08] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:21:08] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:21:08] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:21:09] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-29 14:21:09] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:21:09] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 1 ms to minimize.
[2024-05-29 14:21:09] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:21:09] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 0 ms to minimize.
[2024-05-29 14:21:10] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2024-05-29 14:21:10] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2024-05-29 14:21:10] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 14:21:10] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 14:21:10] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-05-29 14:21:14] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-05-29 14:21:14] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:21:14] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-29 14:21:14] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2024-05-29 14:21:14] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-29 14:21:15] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-29 14:21:15] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:21:15] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2024-05-29 14:21:15] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2024-05-29 14:21:15] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2024-05-29 14:21:15] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 122/1304 variables, and 101 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/122 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1191/159 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-29 14:21:21] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2024-05-29 14:21:21] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 14:21:21] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 14:21:22] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:21:22] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:21:22] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:21:22] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:21:26] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:21:26] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-29 14:21:28] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:21:33] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 14:21:33] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-05-29 14:21:40] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 122/1304 variables, and 114 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/122 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/159 constraints, Known Traps: 113/113 constraints]
After SMT, in 74858ms problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 74871ms
Starting structural reductions in LTL mode, iteration 1 : 122/184 places, 1192/1267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75847 ms. Remains : 122/184 places, 1192/1267 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLCardinality-13
Stuttering criterion allowed to conclude after 2230 steps with 53 reset in 7 ms.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-08a-LTLCardinality-13 finished in 75961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p1)&&p0))||X(X(G(p2)))))'
Support contains 5 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 163 transition count 1245
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 163 transition count 1245
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 163 transition count 1241
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 60 place count 149 transition count 1227
Iterating global reduction 1 with 14 rules applied. Total rules applied 74 place count 149 transition count 1227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 76 place count 149 transition count 1225
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 87 place count 138 transition count 1214
Iterating global reduction 2 with 11 rules applied. Total rules applied 98 place count 138 transition count 1214
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 108 place count 128 transition count 1204
Iterating global reduction 2 with 10 rules applied. Total rules applied 118 place count 128 transition count 1204
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 122 transition count 1198
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 122 transition count 1198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 132 place count 122 transition count 1196
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 136 place count 118 transition count 1192
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 118 transition count 1192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 142 place count 118 transition count 1190
Applied a total of 142 rules in 35 ms. Remains 118 /184 variables (removed 66) and now considering 1190/1267 (removed 77) transitions.
[2024-05-29 14:21:47] [INFO ] Flow matrix only has 1179 transitions (discarded 11 similar events)
// Phase 1: matrix 1179 rows 118 cols
[2024-05-29 14:21:47] [INFO ] Computed 2 invariants in 10 ms
[2024-05-29 14:21:47] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-29 14:21:47] [INFO ] Flow matrix only has 1179 transitions (discarded 11 similar events)
[2024-05-29 14:21:47] [INFO ] Invariant cache hit.
[2024-05-29 14:21:47] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:21:47] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 881 ms to find 0 implicit places.
Running 1189 sub problems to find dead transitions.
[2024-05-29 14:21:48] [INFO ] Flow matrix only has 1179 transitions (discarded 11 similar events)
[2024-05-29 14:21:48] [INFO ] Invariant cache hit.
[2024-05-29 14:21:48] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-05-29 14:22:08] [INFO ] Deduced a trap composed of 17 places in 270 ms of which 0 ms to minimize.
[2024-05-29 14:22:08] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 1 ms to minimize.
[2024-05-29 14:22:09] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 1 ms to minimize.
[2024-05-29 14:22:09] [INFO ] Deduced a trap composed of 13 places in 272 ms of which 0 ms to minimize.
[2024-05-29 14:22:09] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 1 ms to minimize.
[2024-05-29 14:22:09] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 1 ms to minimize.
[2024-05-29 14:22:10] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2024-05-29 14:22:10] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 1 ms to minimize.
[2024-05-29 14:22:10] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 1 ms to minimize.
[2024-05-29 14:22:10] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 1 ms to minimize.
[2024-05-29 14:22:11] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 1 ms to minimize.
[2024-05-29 14:22:11] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:22:11] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2024-05-29 14:22:11] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 1 ms to minimize.
[2024-05-29 14:22:11] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 1 ms to minimize.
[2024-05-29 14:22:11] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:22:12] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 1 ms to minimize.
[2024-05-29 14:22:12] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
[2024-05-29 14:22:12] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 0 ms to minimize.
[2024-05-29 14:22:12] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-05-29 14:22:13] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 1 ms to minimize.
[2024-05-29 14:22:13] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2024-05-29 14:22:13] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:22:13] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 14:22:13] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:22:14] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 0 ms to minimize.
[2024-05-29 14:22:14] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 1 ms to minimize.
[2024-05-29 14:22:14] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 1 ms to minimize.
[2024-05-29 14:22:14] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 1 ms to minimize.
[2024-05-29 14:22:14] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 1 ms to minimize.
[2024-05-29 14:22:15] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 1 ms to minimize.
[2024-05-29 14:22:15] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:22:15] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 0 ms to minimize.
[2024-05-29 14:22:15] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 1 ms to minimize.
[2024-05-29 14:22:15] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:22:16] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 0 ms to minimize.
[2024-05-29 14:22:16] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 1 ms to minimize.
[2024-05-29 14:22:16] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 1 ms to minimize.
[2024-05-29 14:22:16] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 1 ms to minimize.
[2024-05-29 14:22:16] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-05-29 14:22:20] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2024-05-29 14:22:20] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:22:20] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 0 ms to minimize.
[2024-05-29 14:22:20] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 0 ms to minimize.
[2024-05-29 14:22:20] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:22:20] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:22:24] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-29 14:22:24] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-29 14:22:24] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:22:24] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2024-05-29 14:22:24] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-29 14:22:25] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 0 ms to minimize.
[2024-05-29 14:22:25] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-05-29 14:22:25] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2024-05-29 14:22:25] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 14:22:25] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:22:25] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 0 ms to minimize.
[2024-05-29 14:22:25] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 1 ms to minimize.
[2024-05-29 14:22:26] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 0 ms to minimize.
[2024-05-29 14:22:26] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-05-29 14:22:26] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 0 ms to minimize.
[2024-05-29 14:22:26] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:22:27] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2024-05-29 14:22:27] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 0 ms to minimize.
[2024-05-29 14:22:27] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-05-29 14:22:27] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2024-05-29 14:22:27] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 0 ms to minimize.
[2024-05-29 14:22:27] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 0 ms to minimize.
[2024-05-29 14:22:28] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2024-05-29 14:22:28] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:22:28] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-29 14:22:28] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:22:28] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 14:22:28] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2024-05-29 14:22:28] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:22:28] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:22:28] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-29 14:22:29] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2024-05-29 14:22:29] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 0 ms to minimize.
[2024-05-29 14:22:29] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-05-29 14:22:29] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-29 14:22:29] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:22:30] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 0 ms to minimize.
[2024-05-29 14:22:30] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2024-05-29 14:22:30] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 14:22:30] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 14:22:30] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 14:22:30] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:22:30] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 14:22:30] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 1 ms to minimize.
[2024-05-29 14:22:31] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2024-05-29 14:22:31] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:22:31] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 14:22:31] [INFO ] Deduced a trap composed of 17 places in 277 ms of which 1 ms to minimize.
[2024-05-29 14:22:31] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 1 ms to minimize.
[2024-05-29 14:22:32] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2024-05-29 14:22:32] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:22:32] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 14:22:32] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-29 14:22:32] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 118/1297 variables, and 102 constraints, problems are : Problem set: 0 solved, 1189 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/118 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1189/157 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-05-29 14:22:37] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-29 14:22:37] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-29 14:22:37] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-29 14:22:37] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:22:37] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-29 14:22:37] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:22:37] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-05-29 14:22:37] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:22:37] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-05-29 14:22:37] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:22:38] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 14:22:38] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-29 14:22:38] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 1 ms to minimize.
[2024-05-29 14:22:38] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:22:38] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:22:38] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:22:39] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-05-29 14:22:44] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 18/120 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-05-29 14:22:45] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:22:46] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-29 14:22:46] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-29 14:22:46] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:22:47] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-05-29 14:22:47] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:22:47] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:22:53] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-05-29 14:22:55] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-29 14:22:55] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2024-05-29 14:22:55] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2024-05-29 14:22:55] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2024-05-29 14:22:56] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:22:56] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 14:23:02] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 7/135 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 118/1297 variables, and 135 constraints, problems are : Problem set: 0 solved, 1189 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/118 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/157 constraints, Known Traps: 133/133 constraints]
After SMT, in 74849ms problems are : Problem set: 0 solved, 1189 unsolved
Search for dead transitions found 0 dead transitions in 74865ms
Starting structural reductions in LTL mode, iteration 1 : 118/184 places, 1190/1267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75787 ms. Remains : 118/184 places, 1190/1267 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 148 ms.
Product exploration explored 100000 steps with 0 reset in 280 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 129 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (9 resets) in 1797 ms. (22 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 37 ms. (1052 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
[2024-05-29 14:23:04] [INFO ] Flow matrix only has 1179 transitions (discarded 11 similar events)
[2024-05-29 14:23:04] [INFO ] Invariant cache hit.
[2024-05-29 14:23:04] [INFO ] State equation strengthened by 1030 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf6 is UNSAT
Problem apf10 is UNSAT
At refinement iteration 1 (OVERLAPS) 113/118 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1178/1296 variables, 118/120 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1296 variables, 1029/1149 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1296 variables, 0/1149 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/1297 variables, 1/1150 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 2 solved, 5 unsolved in 916 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 118/118 constraints, ReadFeed: 1030/1030 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 113/118 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-29 14:23:05] [INFO ] Deduced a trap composed of 13 places in 286 ms of which 1 ms to minimize.
[2024-05-29 14:23:06] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 1 ms to minimize.
[2024-05-29 14:23:06] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 0 ms to minimize.
[2024-05-29 14:23:06] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 1 ms to minimize.
[2024-05-29 14:23:06] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 0 ms to minimize.
[2024-05-29 14:23:07] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 0 ms to minimize.
[2024-05-29 14:23:07] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 0 ms to minimize.
[2024-05-29 14:23:07] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 1 ms to minimize.
[2024-05-29 14:23:07] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 0 ms to minimize.
[2024-05-29 14:23:07] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 1 ms to minimize.
[2024-05-29 14:23:08] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 1 ms to minimize.
[2024-05-29 14:23:08] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 1 ms to minimize.
[2024-05-29 14:23:08] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:23:08] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 4 ms to minimize.
[2024-05-29 14:23:08] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:23:08] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2024-05-29 14:23:08] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 14:23:09] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2024-05-29 14:23:09] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf7 is UNSAT
[2024-05-29 14:23:09] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 20/22 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-05-29 14:23:09] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/23 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1178/1296 variables, 118/141 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1296 variables, 1029/1170 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1296 variables, 2/1172 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-05-29 14:23:09] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1296 variables, 1/1173 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1296 variables, 0/1173 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1297 variables, 1/1174 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1297 variables, 0/1174 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1297 variables, 0/1174 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1174 constraints, problems are : Problem set: 5 solved, 2 unsolved in 4493 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 118/118 constraints, ReadFeed: 1030/1030 constraints, PredecessorRefiner: 2/7 constraints, Known Traps: 22/22 constraints]
After SMT, in 5442ms problems are : Problem set: 5 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 78 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=19 )
Parikh walk visited 2 properties in 19 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1)), (G (OR p0 p1 p2)), (G (OR (NOT p0) p1 p2)), (G (OR (NOT p0) p1 (NOT p2))), (G (OR (NOT p0) p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p2))), (F (NOT p2)), (F p0)]
Knowledge based reduction with 21 factoid took 411 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 1190/1190 transitions.
Applied a total of 0 rules in 5 ms. Remains 118 /118 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2024-05-29 14:23:11] [INFO ] Flow matrix only has 1179 transitions (discarded 11 similar events)
[2024-05-29 14:23:11] [INFO ] Invariant cache hit.
[2024-05-29 14:23:11] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-29 14:23:11] [INFO ] Flow matrix only has 1179 transitions (discarded 11 similar events)
[2024-05-29 14:23:11] [INFO ] Invariant cache hit.
[2024-05-29 14:23:11] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:23:11] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
Running 1189 sub problems to find dead transitions.
[2024-05-29 14:23:11] [INFO ] Flow matrix only has 1179 transitions (discarded 11 similar events)
[2024-05-29 14:23:11] [INFO ] Invariant cache hit.
[2024-05-29 14:23:11] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-05-29 14:23:32] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 1 ms to minimize.
[2024-05-29 14:23:32] [INFO ] Deduced a trap composed of 13 places in 286 ms of which 1 ms to minimize.
[2024-05-29 14:23:33] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 1 ms to minimize.
[2024-05-29 14:23:33] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 1 ms to minimize.
[2024-05-29 14:23:33] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 0 ms to minimize.
[2024-05-29 14:23:33] [INFO ] Deduced a trap composed of 15 places in 264 ms of which 1 ms to minimize.
[2024-05-29 14:23:34] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 1 ms to minimize.
[2024-05-29 14:23:34] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 1 ms to minimize.
[2024-05-29 14:23:34] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 1 ms to minimize.
[2024-05-29 14:23:34] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 0 ms to minimize.
[2024-05-29 14:23:35] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2024-05-29 14:23:35] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:23:35] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 1 ms to minimize.
[2024-05-29 14:23:35] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 1 ms to minimize.
[2024-05-29 14:23:35] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 0 ms to minimize.
[2024-05-29 14:23:36] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:23:36] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2024-05-29 14:23:36] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 0 ms to minimize.
[2024-05-29 14:23:36] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 1 ms to minimize.
[2024-05-29 14:23:36] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-05-29 14:23:37] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 1 ms to minimize.
[2024-05-29 14:23:37] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:23:37] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2024-05-29 14:23:37] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 14:23:37] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:23:38] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 0 ms to minimize.
[2024-05-29 14:23:38] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 0 ms to minimize.
[2024-05-29 14:23:38] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 0 ms to minimize.
[2024-05-29 14:23:38] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 1 ms to minimize.
[2024-05-29 14:23:39] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 0 ms to minimize.
[2024-05-29 14:23:39] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 0 ms to minimize.
[2024-05-29 14:23:39] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:23:39] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 0 ms to minimize.
[2024-05-29 14:23:39] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 1 ms to minimize.
[2024-05-29 14:23:39] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:23:40] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 1 ms to minimize.
[2024-05-29 14:23:40] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 1 ms to minimize.
[2024-05-29 14:23:40] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 1 ms to minimize.
[2024-05-29 14:23:40] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:23:40] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-05-29 14:23:43] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-29 14:23:43] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:23:44] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 0 ms to minimize.
[2024-05-29 14:23:44] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2024-05-29 14:23:44] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 14:23:44] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 14:23:48] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-29 14:23:48] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-29 14:23:48] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:23:48] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 14:23:48] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2024-05-29 14:23:49] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:23:49] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2024-05-29 14:23:49] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2024-05-29 14:23:49] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-05-29 14:23:49] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 0 ms to minimize.
[2024-05-29 14:23:49] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:23:49] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 1 ms to minimize.
[2024-05-29 14:23:50] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 0 ms to minimize.
[2024-05-29 14:23:50] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-05-29 14:23:50] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 0 ms to minimize.
[2024-05-29 14:23:50] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:23:50] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2024-05-29 14:23:51] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2024-05-29 14:23:51] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:23:51] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-05-29 14:23:51] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-29 14:23:51] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 0 ms to minimize.
[2024-05-29 14:23:52] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 14:23:52] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:23:52] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2024-05-29 14:23:52] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:23:52] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 14:23:52] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-29 14:23:52] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2024-05-29 14:23:52] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:23:52] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:23:53] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:23:53] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:23:53] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-05-29 14:23:53] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2024-05-29 14:23:53] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 14:23:54] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:23:54] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:23:54] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:23:54] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-29 14:23:54] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2024-05-29 14:23:54] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 14:23:54] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:23:54] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 1 ms to minimize.
[2024-05-29 14:23:54] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2024-05-29 14:23:55] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:23:55] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 14:23:55] [INFO ] Deduced a trap composed of 17 places in 279 ms of which 1 ms to minimize.
[2024-05-29 14:23:55] [INFO ] Deduced a trap composed of 17 places in 265 ms of which 0 ms to minimize.
[2024-05-29 14:23:56] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-05-29 14:23:56] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 14:23:56] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 14:23:56] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-29 14:23:56] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 118/1297 variables, and 102 constraints, problems are : Problem set: 0 solved, 1189 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/118 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1189/157 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-05-29 14:24:00] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-29 14:24:01] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:24:01] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:24:01] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-29 14:24:01] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-29 14:24:01] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-05-29 14:24:01] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:24:01] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2024-05-29 14:24:01] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:24:01] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:24:01] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:24:02] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:24:02] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 1 ms to minimize.
[2024-05-29 14:24:02] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:24:02] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:24:02] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:24:02] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2024-05-29 14:24:08] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 18/120 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-05-29 14:24:09] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:24:09] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:24:10] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2024-05-29 14:24:10] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2024-05-29 14:24:10] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2024-05-29 14:24:11] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:24:11] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:24:16] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-05-29 14:24:18] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2024-05-29 14:24:18] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-29 14:24:19] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2024-05-29 14:24:19] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 0 ms to minimize.
[2024-05-29 14:24:19] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:24:20] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-05-29 14:24:25] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 7/135 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 118/1297 variables, and 135 constraints, problems are : Problem set: 0 solved, 1189 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/118 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/157 constraints, Known Traps: 133/133 constraints]
After SMT, in 74988ms problems are : Problem set: 0 solved, 1189 unsolved
Search for dead transitions found 0 dead transitions in 75002ms
Finished structural reductions in LTL mode , in 1 iterations and 75889 ms. Remains : 118/118 places, 1190/1190 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (9 resets) in 1769 ms. (22 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
[2024-05-29 14:24:27] [INFO ] Flow matrix only has 1179 transitions (discarded 11 similar events)
[2024-05-29 14:24:27] [INFO ] Invariant cache hit.
[2024-05-29 14:24:28] [INFO ] State equation strengthened by 1030 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 115/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1178/1296 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1296 variables, 1029/1149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1296 variables, 0/1149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/1297 variables, 1/1150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 118/118 constraints, ReadFeed: 1030/1030 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 115/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 14:24:28] [INFO ] Deduced a trap composed of 13 places in 329 ms of which 1 ms to minimize.
[2024-05-29 14:24:29] [INFO ] Deduced a trap composed of 13 places in 328 ms of which 1 ms to minimize.
[2024-05-29 14:24:29] [INFO ] Deduced a trap composed of 13 places in 316 ms of which 1 ms to minimize.
[2024-05-29 14:24:29] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 1 ms to minimize.
[2024-05-29 14:24:30] [INFO ] Deduced a trap composed of 13 places in 272 ms of which 1 ms to minimize.
[2024-05-29 14:24:30] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 1 ms to minimize.
[2024-05-29 14:24:30] [INFO ] Deduced a trap composed of 13 places in 323 ms of which 0 ms to minimize.
[2024-05-29 14:24:30] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 1 ms to minimize.
[2024-05-29 14:24:31] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 1 ms to minimize.
[2024-05-29 14:24:31] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 0 ms to minimize.
[2024-05-29 14:24:31] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 0 ms to minimize.
[2024-05-29 14:24:32] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 0 ms to minimize.
[2024-05-29 14:24:32] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 1 ms to minimize.
[2024-05-29 14:24:32] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 1 ms to minimize.
[2024-05-29 14:24:32] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2024-05-29 14:24:32] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:24:32] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:24:33] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2024-05-29 14:24:33] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 1 ms to minimize.
[2024-05-29 14:24:33] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 14:24:33] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:24:33] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
SMT process timed out in 5648ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 1190/1190 transitions.
Graph (complete) has 398 edges and 118 vertex of which 117 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 117 transition count 1132
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
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 1 with 56 rules applied. Total rules applied 114 place count 79 transition count 1114
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 122 place count 71 transition count 1114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 122 place count 71 transition count 1113
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 70 transition count 1113
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 133 place count 61 transition count 1104
Iterating global reduction 3 with 9 rules applied. Total rules applied 142 place count 61 transition count 1104
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 150 place count 53 transition count 1096
Iterating global reduction 3 with 8 rules applied. Total rules applied 158 place count 53 transition count 1096
Performed 36 Post agglomeration using F-continuation condition with reduction of 1002 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 77 rules applied. Total rules applied 235 place count 12 transition count 58
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 280 place count 12 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 282 place count 11 transition count 12
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 283 place count 11 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 284 place count 11 transition count 10
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 285 place count 11 transition count 10
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 286 place count 11 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 287 place count 10 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 288 place count 9 transition count 8
Applied a total of 288 rules in 57 ms. Remains 9 /118 variables (removed 109) and now considering 8/1190 (removed 1182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 9/118 places, 8/1190 transitions.
RANDOM walk for 83 steps (2 resets) in 4 ms. (16 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (NOT p1)), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering criterion allowed to conclude after 8175 steps with 0 reset in 236 ms.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-08a-LTLCardinality-14 finished in 167914 ms.
All properties solved by simple procedures.
Total runtime 593642 ms.

BK_STOP 1716992675048

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="StigmergyCommit-PT-08a"
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-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-08a, 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 r400-tall-171690531800187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-08a.tgz
mv StigmergyCommit-PT-08a 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;