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.r180-tall-171640602600091.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 FlexibleBarrier-PT-14b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602600091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 08:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 13 08:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 13 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 13 08:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 726K May 18 16:42 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 FlexibleBarrier-PT-14b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716423187174

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-14b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-23 00:13:08] [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-23 00:13:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:13:08] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-05-23 00:13:08] [INFO ] Transformed 2678 places.
[2024-05-23 00:13:08] [INFO ] Transformed 3085 transitions.
[2024-05-23 00:13:08] [INFO ] Found NUPN structural information;
[2024-05-23 00:13:08] [INFO ] Parsed PT model containing 2678 places and 3085 transitions and 7733 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 2678 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2678/2678 places, 3085/3085 transitions.
Discarding 1077 places :
Symmetric choice reduction at 0 with 1077 rule applications. Total rules 1077 place count 1601 transition count 2008
Iterating global reduction 0 with 1077 rules applied. Total rules applied 2154 place count 1601 transition count 2008
Discarding 502 places :
Symmetric choice reduction at 0 with 502 rule applications. Total rules 2656 place count 1099 transition count 1506
Iterating global reduction 0 with 502 rules applied. Total rules applied 3158 place count 1099 transition count 1506
Discarding 318 places :
Symmetric choice reduction at 0 with 318 rule applications. Total rules 3476 place count 781 transition count 1188
Iterating global reduction 0 with 318 rules applied. Total rules applied 3794 place count 781 transition count 1188
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 0 with 152 rules applied. Total rules applied 3946 place count 781 transition count 1036
Applied a total of 3946 rules in 750 ms. Remains 781 /2678 variables (removed 1897) and now considering 1036/3085 (removed 2049) transitions.
// Phase 1: matrix 1036 rows 781 cols
[2024-05-23 00:13:09] [INFO ] Computed 16 invariants in 37 ms
[2024-05-23 00:13:10] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-05-23 00:13:10] [INFO ] Invariant cache hit.
[2024-05-23 00:13:10] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
Running 1035 sub problems to find dead transitions.
[2024-05-23 00:13:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 1 (OVERLAPS) 1/781 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
[2024-05-23 00:13:33] [INFO ] Deduced a trap composed of 47 places in 249 ms of which 35 ms to minimize.
[2024-05-23 00:13:33] [INFO ] Deduced a trap composed of 130 places in 98 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 781/1817 variables, and 18 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/781 constraints, PredecessorRefiner: 1035/1035 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1035 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 1 (OVERLAPS) 1/781 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/781 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/781 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 4 (OVERLAPS) 1036/1817 variables, 781/799 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1817 variables, 1035/1834 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1817/1817 variables, and 1834 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 781/781 constraints, PredecessorRefiner: 1035/1035 constraints, Known Traps: 2/2 constraints]
After SMT, in 60991ms problems are : Problem set: 0 solved, 1035 unsolved
Search for dead transitions found 0 dead transitions in 61014ms
Starting structural reductions in LTL mode, iteration 1 : 781/2678 places, 1036/3085 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62930 ms. Remains : 781/2678 places, 1036/3085 transitions.
Support contains 30 out of 781 places after structural reductions.
[2024-05-23 00:14:12] [INFO ] Flatten gal took : 86 ms
[2024-05-23 00:14:12] [INFO ] Flatten gal took : 48 ms
[2024-05-23 00:14:12] [INFO ] Input system was already deterministic with 1036 transitions.
RANDOM walk for 40000 steps (397 resets) in 2333 ms. (17 steps per ms) remains 11/15 properties
BEST_FIRST walk for 40003 steps (39 resets) in 150 ms. (264 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (40 resets) in 158 ms. (251 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (38 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (38 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (41 resets) in 122 ms. (325 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (40 resets) in 98 ms. (404 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (39 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (41 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (41 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (38 resets) in 54 ms. (727 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (40 resets) in 44 ms. (888 steps per ms) remains 11/11 properties
[2024-05-23 00:14:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 511/535 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 246/781 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/781 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1036/1817 variables, 781/797 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1817 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/1817 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1817/1817 variables, and 797 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1046 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 781/781 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 511/535 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-23 00:14:14] [INFO ] Deduced a trap composed of 288 places in 166 ms of which 4 ms to minimize.
[2024-05-23 00:14:14] [INFO ] Deduced a trap composed of 223 places in 156 ms of which 3 ms to minimize.
[2024-05-23 00:14:14] [INFO ] Deduced a trap composed of 253 places in 159 ms of which 4 ms to minimize.
[2024-05-23 00:14:15] [INFO ] Deduced a trap composed of 225 places in 155 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/535 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 246/781 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/781 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1036/1817 variables, 781/801 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1817 variables, 11/812 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1817 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/1817 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1817/1817 variables, and 812 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2476 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 781/781 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 4/4 constraints]
After SMT, in 3537ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 8 properties in 3898 ms.
Support contains 9 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Graph (trivial) has 725 edges and 781 vertex of which 86 / 781 are part of one of the 14 SCC in 4 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 709 transition count 881
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 641 transition count 881
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 137 place count 641 transition count 849
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 201 place count 609 transition count 849
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 242 place count 568 transition count 808
Iterating global reduction 2 with 41 rules applied. Total rules applied 283 place count 568 transition count 808
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 285 place count 568 transition count 806
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 294 place count 559 transition count 797
Iterating global reduction 3 with 9 rules applied. Total rules applied 303 place count 559 transition count 797
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 310 place count 559 transition count 790
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 486 place count 471 transition count 702
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 513 place count 471 transition count 675
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 529 place count 455 transition count 659
Iterating global reduction 5 with 16 rules applied. Total rules applied 545 place count 455 transition count 659
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 547 place count 455 transition count 657
Free-agglomeration rule applied 371 times.
Iterating global reduction 6 with 371 rules applied. Total rules applied 918 place count 455 transition count 286
Reduce places removed 371 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Graph (complete) has 231 edges and 84 vertex of which 64 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 540 rules applied. Total rules applied 1458 place count 64 transition count 118
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 1486 place count 64 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1487 place count 63 transition count 89
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 50 edges and 62 vertex of which 20 / 62 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 1490 place count 52 transition count 88
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 1511 place count 51 transition count 68
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 10 Pre rules applied. Total rules applied 1511 place count 51 transition count 58
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 1531 place count 41 transition count 58
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1540 place count 41 transition count 49
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 11 with 18 rules applied. Total rules applied 1558 place count 32 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1559 place count 32 transition count 39
Free-agglomeration rule applied 10 times.
Iterating global reduction 11 with 10 rules applied. Total rules applied 1569 place count 32 transition count 29
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 23 rules applied. Total rules applied 1592 place count 18 transition count 20
Applied a total of 1592 rules in 290 ms. Remains 18 /781 variables (removed 763) and now considering 20/1036 (removed 1016) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 18/781 places, 20/1036 transitions.
RANDOM walk for 565 steps (0 resets) in 7 ms. (70 steps per ms) remains 0/3 properties
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 18 stabilizing places and 18 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' '!(X(X((G(F(p0))||(F(p0)&&F(G((X(!p2)||p1))))))))'
Support contains 5 out of 781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 762 transition count 1017
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 762 transition count 1017
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 762 transition count 1014
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 55 place count 748 transition count 1000
Iterating global reduction 1 with 14 rules applied. Total rules applied 69 place count 748 transition count 1000
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 78 place count 748 transition count 991
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 745 transition count 988
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 745 transition count 988
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 745 transition count 986
Applied a total of 86 rules in 62 ms. Remains 745 /781 variables (removed 36) and now considering 986/1036 (removed 50) transitions.
// Phase 1: matrix 986 rows 745 cols
[2024-05-23 00:14:21] [INFO ] Computed 16 invariants in 9 ms
[2024-05-23 00:14:21] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-23 00:14:21] [INFO ] Invariant cache hit.
[2024-05-23 00:14:22] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
Running 985 sub problems to find dead transitions.
[2024-05-23 00:14:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 985 unsolved
At refinement iteration 1 (OVERLAPS) 1/745 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 985 unsolved
(s3 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0timeout
)
(s4 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 745/1731 variables, and 16 constraints, problems are : Problem set: 0 solved, 985 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/745 constraints, PredecessorRefiner: 985/985 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 985 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 985 unsolved
At refinement iteration 1 (OVERLAPS) 1/745 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 985 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/745 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 985 unsolved
At refinement iteration 3 (OVERLAPS) 986/1731 variables, 745/761 constraints. Problems are: Problem set: 0 solved, 985 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1731 variables, 985/1746 constraints. Problems are: Problem set: 0 solved, 985 unsolved
[2024-05-23 00:15:21] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 4 ms to minimize.
[2024-05-23 00:15:22] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1731/1731 variables, and 1748 constraints, problems are : Problem set: 0 solved, 985 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 745/745 constraints, PredecessorRefiner: 985/985 constraints, Known Traps: 2/2 constraints]
After SMT, in 60826ms problems are : Problem set: 0 solved, 985 unsolved
Search for dead transitions found 0 dead transitions in 60841ms
Starting structural reductions in LTL mode, iteration 1 : 745/781 places, 986/1036 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61755 ms. Remains : 745/781 places, 986/1036 transitions.
Stuttering acceptance computed with spot in 362 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-00
Stuttering criterion allowed to conclude after 114 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-00 finished in 62186 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 4 out of 781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Graph (trivial) has 732 edges and 781 vertex of which 86 / 781 are part of one of the 14 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 708 transition count 891
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 637 transition count 891
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 143 place count 637 transition count 859
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 207 place count 605 transition count 859
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 253 place count 559 transition count 813
Iterating global reduction 2 with 46 rules applied. Total rules applied 299 place count 559 transition count 813
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 302 place count 559 transition count 810
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 302 place count 559 transition count 809
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 304 place count 558 transition count 809
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 313 place count 549 transition count 800
Iterating global reduction 3 with 9 rules applied. Total rules applied 322 place count 549 transition count 800
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 330 place count 549 transition count 792
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 500 place count 464 transition count 707
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 503 place count 461 transition count 704
Iterating global reduction 4 with 3 rules applied. Total rules applied 506 place count 461 transition count 704
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 509 place count 461 transition count 701
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 523 place count 461 transition count 687
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 525 place count 459 transition count 685
Applied a total of 525 rules in 246 ms. Remains 459 /781 variables (removed 322) and now considering 685/1036 (removed 351) transitions.
[2024-05-23 00:15:23] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
// Phase 1: matrix 658 rows 459 cols
[2024-05-23 00:15:23] [INFO ] Computed 16 invariants in 7 ms
[2024-05-23 00:15:23] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-23 00:15:23] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 00:15:23] [INFO ] Invariant cache hit.
[2024-05-23 00:15:24] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2024-05-23 00:15:24] [INFO ] Redundant transitions in 32 ms returned []
Running 302 sub problems to find dead transitions.
[2024-05-23 00:15:24] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 00:15:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 14/459 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 657/1116 variables, 459/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1116/1117 variables, and 475 constraints, problems are : Problem set: 0 solved, 302 unsolved in 18435 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 14/459 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 657/1116 variables, 459/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1116 variables, 302/777 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1116 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 0/1116 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1116/1117 variables, and 777 constraints, problems are : Problem set: 0 solved, 302 unsolved in 22999 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
After SMT, in 41648ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 41650ms
Starting structural reductions in SI_LTL mode, iteration 1 : 459/781 places, 685/1036 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42666 ms. Remains : 459/781 places, 685/1036 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-01
Product exploration explored 100000 steps with 4892 reset in 730 ms.
Product exploration explored 100000 steps with 4860 reset in 656 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1988 resets) in 2148 ms. (18 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (16 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 893299 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :0 out of 1
Probabilistic random walk after 893299 steps, saw 195737 distinct states, run finished after 3004 ms. (steps per millisecond=297 ) properties seen :0
[2024-05-23 00:16:11] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 00:16:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 230/234 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 411/645 variables, 234/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 361/1006 variables, 159/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1006 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1006 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 66/1072 variables, 11/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1072 variables, 22/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1072 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/1116 variables, 44/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1116/1117 variables, and 475 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 230/234 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 411/645 variables, 234/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 361/1006 variables, 159/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1006 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1006 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1006 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/1072 variables, 11/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1072 variables, 22/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1072 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 44/1116 variables, 44/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1116 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1116 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1116/1117 variables, and 476 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 512ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 467 steps, including 18 resets, run visited all 1 properties in 3 ms. (steps per millisecond=155 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 685/685 transitions.
Applied a total of 0 rules in 31 ms. Remains 459 /459 variables (removed 0) and now considering 685/685 (removed 0) transitions.
[2024-05-23 00:16:12] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 00:16:12] [INFO ] Invariant cache hit.
[2024-05-23 00:16:12] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-23 00:16:12] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 00:16:12] [INFO ] Invariant cache hit.
[2024-05-23 00:16:12] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
[2024-05-23 00:16:12] [INFO ] Redundant transitions in 6 ms returned []
Running 302 sub problems to find dead transitions.
[2024-05-23 00:16:12] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 00:16:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 14/459 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 657/1116 variables, 459/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1116/1117 variables, and 475 constraints, problems are : Problem set: 0 solved, 302 unsolved in 18572 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 14/459 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 657/1116 variables, 459/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1116 variables, 302/777 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1116 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 0/1116 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1116/1117 variables, and 777 constraints, problems are : Problem set: 0 solved, 302 unsolved in 22802 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
After SMT, in 41608ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 41611ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42247 ms. Remains : 459/459 places, 685/685 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2010 resets) in 314 ms. (126 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (17 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 906262 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 1
Probabilistic random walk after 906262 steps, saw 198128 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
[2024-05-23 00:16:57] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 00:16:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 230/234 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 411/645 variables, 234/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 361/1006 variables, 159/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1006 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1006 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 66/1072 variables, 11/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1072 variables, 22/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1072 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/1116 variables, 44/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1116/1117 variables, and 475 constraints, problems are : Problem set: 0 solved, 1 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 230/234 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 411/645 variables, 234/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 361/1006 variables, 159/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1006 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1006 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1006 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/1072 variables, 11/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1072 variables, 22/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1072 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 44/1116 variables, 44/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1116 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1116 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1116/1117 variables, and 476 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 503ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 617 steps, including 24 resets, run visited all 1 properties in 5 ms. (steps per millisecond=123 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4905 reset in 627 ms.
Product exploration explored 100000 steps with 4854 reset in 634 ms.
Built C files in :
/tmp/ltsmin1925625704881851475
[2024-05-23 00:16:59] [INFO ] Computing symmetric may disable matrix : 685 transitions.
[2024-05-23 00:16:59] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:16:59] [INFO ] Computing symmetric may enable matrix : 685 transitions.
[2024-05-23 00:16:59] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:16:59] [INFO ] Computing Do-Not-Accords matrix : 685 transitions.
[2024-05-23 00:16:59] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:16:59] [INFO ] Built C files in 165ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1925625704881851475
Running compilation step : cd /tmp/ltsmin1925625704881851475;'/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 2120 ms.
Running link step : cd /tmp/ltsmin1925625704881851475;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin1925625704881851475;'/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/stateBased7791023507008448796.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 685/685 transitions.
Applied a total of 0 rules in 42 ms. Remains 459 /459 variables (removed 0) and now considering 685/685 (removed 0) transitions.
[2024-05-23 00:17:14] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 00:17:14] [INFO ] Invariant cache hit.
[2024-05-23 00:17:15] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-23 00:17:15] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 00:17:15] [INFO ] Invariant cache hit.
[2024-05-23 00:17:15] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
[2024-05-23 00:17:15] [INFO ] Redundant transitions in 4 ms returned []
Running 302 sub problems to find dead transitions.
[2024-05-23 00:17:15] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 00:17:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 14/459 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 657/1116 variables, 459/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1116/1117 variables, and 475 constraints, problems are : Problem set: 0 solved, 302 unsolved in 18845 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 14/459 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 657/1116 variables, 459/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1116 variables, 302/777 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1116 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 0/1116 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1116/1117 variables, and 777 constraints, problems are : Problem set: 0 solved, 302 unsolved in 23563 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
After SMT, in 42646ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 42649ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43274 ms. Remains : 459/459 places, 685/685 transitions.
Built C files in :
/tmp/ltsmin1849281752008863865
[2024-05-23 00:17:58] [INFO ] Computing symmetric may disable matrix : 685 transitions.
[2024-05-23 00:17:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:17:58] [INFO ] Computing symmetric may enable matrix : 685 transitions.
[2024-05-23 00:17:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:17:58] [INFO ] Computing Do-Not-Accords matrix : 685 transitions.
[2024-05-23 00:17:58] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:17:58] [INFO ] Built C files in 130ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1849281752008863865
Running compilation step : cd /tmp/ltsmin1849281752008863865;'/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 1925 ms.
Running link step : cd /tmp/ltsmin1849281752008863865;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1849281752008863865;'/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/stateBased11314485704779439109.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:18:13] [INFO ] Flatten gal took : 27 ms
[2024-05-23 00:18:13] [INFO ] Flatten gal took : 26 ms
[2024-05-23 00:18:13] [INFO ] Time to serialize gal into /tmp/LTL17614980650464836658.gal : 7 ms
[2024-05-23 00:18:13] [INFO ] Time to serialize properties into /tmp/LTL256720383618017103.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17614980650464836658.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3589471752261819318.hoa' '-atoms' '/tmp/LTL256720383618017103.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL256720383618017103.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3589471752261819318.hoa
Detected timeout of ITS tools.
[2024-05-23 00:18:28] [INFO ] Flatten gal took : 24 ms
[2024-05-23 00:18:28] [INFO ] Flatten gal took : 22 ms
[2024-05-23 00:18:28] [INFO ] Time to serialize gal into /tmp/LTL4089271403254872978.gal : 5 ms
[2024-05-23 00:18:28] [INFO ] Time to serialize properties into /tmp/LTL1383837374922053272.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4089271403254872978.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1383837374922053272.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p2395==0)||(p443==1))||((p1363==0)||(p390==1)))"))))
Formula 0 simplified : FG!"(((p2395==0)||(p443==1))||((p1363==0)||(p390==1)))"
Detected timeout of ITS tools.
[2024-05-23 00:18:43] [INFO ] Flatten gal took : 25 ms
[2024-05-23 00:18:43] [INFO ] Applying decomposition
[2024-05-23 00:18:43] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10128155182226811190.txt' '-o' '/tmp/graph10128155182226811190.bin' '-w' '/tmp/graph10128155182226811190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10128155182226811190.bin' '-l' '-1' '-v' '-w' '/tmp/graph10128155182226811190.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:18:43] [INFO ] Decomposing Gal with order
[2024-05-23 00:18:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:18:43] [INFO ] Removed a total of 281 redundant transitions.
[2024-05-23 00:18:43] [INFO ] Flatten gal took : 204 ms
[2024-05-23 00:18:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 37 ms.
[2024-05-23 00:18:43] [INFO ] Time to serialize gal into /tmp/LTL3974926397195298687.gal : 15 ms
[2024-05-23 00:18:43] [INFO ] Time to serialize properties into /tmp/LTL14400112110960872280.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3974926397195298687.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14400112110960872280.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((u41.p2395==0)||(i3.u8.p443==1))||((u31.p1363==0)||(i15.u6.p390==1)))"))))
Formula 0 simplified : FG!"(((u41.p2395==0)||(i3.u8.p443==1))||((u31.p1363==0)||(i15.u6.p390==1)))"
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-01 finished in 215683 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(X(G((p0&&X(p1))))))'
Support contains 3 out of 781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 761 transition count 1016
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 761 transition count 1016
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 761 transition count 1014
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 58 place count 745 transition count 998
Iterating global reduction 1 with 16 rules applied. Total rules applied 74 place count 745 transition count 998
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 85 place count 745 transition count 987
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 743 transition count 985
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 743 transition count 985
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 743 transition count 984
Applied a total of 90 rules in 377 ms. Remains 743 /781 variables (removed 38) and now considering 984/1036 (removed 52) transitions.
// Phase 1: matrix 984 rows 743 cols
[2024-05-23 00:18:59] [INFO ] Computed 16 invariants in 16 ms
[2024-05-23 00:18:59] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-05-23 00:18:59] [INFO ] Invariant cache hit.
[2024-05-23 00:19:00] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
Running 983 sub problems to find dead transitions.
[2024-05-23 00:19:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 1 (OVERLAPS) 1/743 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 743/1727 variables, and 16 constraints, problems are : Problem set: 0 solved, 983 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/743 constraints, PredecessorRefiner: 983/983 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 983 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 1 (OVERLAPS) 1/743 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/743 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 3 (OVERLAPS) 984/1727 variables, 743/759 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1727 variables, 983/1742 constraints. Problems are: Problem set: 0 solved, 983 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1727/1727 variables, and 1742 constraints, problems are : Problem set: 0 solved, 983 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 743/743 constraints, PredecessorRefiner: 983/983 constraints, Known Traps: 0/0 constraints]
After SMT, in 60794ms problems are : Problem set: 0 solved, 983 unsolved
Search for dead transitions found 0 dead transitions in 60803ms
Starting structural reductions in LTL mode, iteration 1 : 743/781 places, 984/1036 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62274 ms. Remains : 743/781 places, 984/1036 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-05 finished in 62451 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(p0)||F(p1)))'
Support contains 3 out of 781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Graph (trivial) has 733 edges and 781 vertex of which 86 / 781 are part of one of the 14 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 708 transition count 892
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 638 transition count 892
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 141 place count 638 transition count 858
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 209 place count 604 transition count 858
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 257 place count 556 transition count 810
Iterating global reduction 2 with 48 rules applied. Total rules applied 305 place count 556 transition count 810
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 308 place count 556 transition count 807
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 308 place count 556 transition count 806
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 310 place count 555 transition count 806
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 321 place count 544 transition count 795
Iterating global reduction 3 with 11 rules applied. Total rules applied 332 place count 544 transition count 795
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 343 place count 544 transition count 784
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 513 place count 459 transition count 699
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 516 place count 456 transition count 696
Iterating global reduction 4 with 3 rules applied. Total rules applied 519 place count 456 transition count 696
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 522 place count 456 transition count 693
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 535 place count 456 transition count 680
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 537 place count 454 transition count 678
Applied a total of 537 rules in 162 ms. Remains 454 /781 variables (removed 327) and now considering 678/1036 (removed 358) transitions.
[2024-05-23 00:20:01] [INFO ] Flow matrix only has 651 transitions (discarded 27 similar events)
// Phase 1: matrix 651 rows 454 cols
[2024-05-23 00:20:01] [INFO ] Computed 16 invariants in 8 ms
[2024-05-23 00:20:02] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-23 00:20:02] [INFO ] Flow matrix only has 651 transitions (discarded 27 similar events)
[2024-05-23 00:20:02] [INFO ] Invariant cache hit.
[2024-05-23 00:20:02] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2024-05-23 00:20:02] [INFO ] Redundant transitions in 4 ms returned []
Running 297 sub problems to find dead transitions.
[2024-05-23 00:20:02] [INFO ] Flow matrix only has 651 transitions (discarded 27 similar events)
[2024-05-23 00:20:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 14/454 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 650/1104 variables, 454/470 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1104 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (OVERLAPS) 0/1104 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1104/1105 variables, and 470 constraints, problems are : Problem set: 0 solved, 297 unsolved in 18112 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 454/454 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 14/454 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 650/1104 variables, 454/470 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1104 variables, 297/767 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1104 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 0/1104 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1104/1105 variables, and 767 constraints, problems are : Problem set: 0 solved, 297 unsolved in 21570 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 454/454 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints]
After SMT, in 39894ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 39897ms
Starting structural reductions in SI_LTL mode, iteration 1 : 454/781 places, 678/1036 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40908 ms. Remains : 454/781 places, 678/1036 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-07
Stuttering criterion allowed to conclude after 387 steps with 19 reset in 6 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-07 finished in 41013 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 1 out of 781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 758 transition count 1013
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 758 transition count 1013
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 758 transition count 1010
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 67 place count 740 transition count 992
Iterating global reduction 1 with 18 rules applied. Total rules applied 85 place count 740 transition count 992
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 97 place count 740 transition count 980
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 100 place count 737 transition count 977
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 737 transition count 977
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 737 transition count 975
Applied a total of 105 rules in 52 ms. Remains 737 /781 variables (removed 44) and now considering 975/1036 (removed 61) transitions.
// Phase 1: matrix 975 rows 737 cols
[2024-05-23 00:20:42] [INFO ] Computed 16 invariants in 16 ms
[2024-05-23 00:20:42] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-23 00:20:42] [INFO ] Invariant cache hit.
[2024-05-23 00:20:43] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
Running 974 sub problems to find dead transitions.
[2024-05-23 00:20:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/736 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 974 unsolved
At refinement iteration 1 (OVERLAPS) 1/737 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 974 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 737/1712 variables, and 16 constraints, problems are : Problem set: 0 solved, 974 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/737 constraints, PredecessorRefiner: 974/974 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 974 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/736 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 974 unsolved
At refinement iteration 1 (OVERLAPS) 1/737 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 974 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/737 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 974 unsolved
At refinement iteration 3 (OVERLAPS) 975/1712 variables, 737/753 constraints. Problems are: Problem set: 0 solved, 974 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1712 variables, 974/1727 constraints. Problems are: Problem set: 0 solved, 974 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1712/1712 variables, and 1727 constraints, problems are : Problem set: 0 solved, 974 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 737/737 constraints, PredecessorRefiner: 974/974 constraints, Known Traps: 0/0 constraints]
After SMT, in 60758ms problems are : Problem set: 0 solved, 974 unsolved
Search for dead transitions found 0 dead transitions in 60769ms
Starting structural reductions in LTL mode, iteration 1 : 737/781 places, 975/1036 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61621 ms. Remains : 737/781 places, 975/1036 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-08
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-08 finished in 61735 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(G(p0)))'
Support contains 2 out of 781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Graph (trivial) has 735 edges and 781 vertex of which 86 / 781 are part of one of the 14 SCC in 2 ms
Free SCC test removed 72 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 708 transition count 891
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 637 transition count 891
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 143 place count 637 transition count 857
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 211 place count 603 transition count 857
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 258 place count 556 transition count 810
Iterating global reduction 2 with 47 rules applied. Total rules applied 305 place count 556 transition count 810
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 308 place count 556 transition count 807
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 308 place count 556 transition count 806
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 310 place count 555 transition count 806
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 320 place count 545 transition count 796
Iterating global reduction 3 with 10 rules applied. Total rules applied 330 place count 545 transition count 796
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 340 place count 545 transition count 786
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 510 place count 460 transition count 701
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 512 place count 458 transition count 699
Iterating global reduction 4 with 2 rules applied. Total rules applied 514 place count 458 transition count 699
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 516 place count 458 transition count 697
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 530 place count 458 transition count 683
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 532 place count 456 transition count 681
Applied a total of 532 rules in 147 ms. Remains 456 /781 variables (removed 325) and now considering 681/1036 (removed 355) transitions.
[2024-05-23 00:21:44] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
// Phase 1: matrix 654 rows 456 cols
[2024-05-23 00:21:44] [INFO ] Computed 16 invariants in 15 ms
[2024-05-23 00:21:44] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-23 00:21:44] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:21:44] [INFO ] Invariant cache hit.
[2024-05-23 00:21:45] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2024-05-23 00:21:45] [INFO ] Redundant transitions in 3 ms returned []
Running 299 sub problems to find dead transitions.
[2024-05-23 00:21:45] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:21:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 0 solved, 299 unsolved in 18130 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 299/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 771 constraints, problems are : Problem set: 0 solved, 299 unsolved in 22263 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
After SMT, in 40602ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 40604ms
Starting structural reductions in SI_LTL mode, iteration 1 : 456/781 places, 681/1036 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41377 ms. Remains : 456/781 places, 681/1036 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-11
Product exploration explored 100000 steps with 4872 reset in 652 ms.
Product exploration explored 100000 steps with 4903 reset in 651 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 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 29 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2002 resets) in 270 ms. (147 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (16 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 910872 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :0 out of 1
Probabilistic random walk after 910872 steps, saw 201264 distinct states, run finished after 3001 ms. (steps per millisecond=303 ) properties seen :0
[2024-05-23 00:22:30] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:22:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/193 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/558 variables, 193/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 421/979 variables, 185/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/979 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/979 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 78/1057 variables, 13/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1057 variables, 26/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1057 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 52/1109 variables, 52/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/193 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/558 variables, 193/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 421/979 variables, 185/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/979 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/979 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/979 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 78/1057 variables, 13/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1057 variables, 26/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1057 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 52/1109 variables, 52/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1109 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1109 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 511ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 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 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 681/681 transitions.
Applied a total of 0 rules in 26 ms. Remains 456 /456 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-05-23 00:22:30] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:22:30] [INFO ] Invariant cache hit.
[2024-05-23 00:22:31] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-23 00:22:31] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:22:31] [INFO ] Invariant cache hit.
[2024-05-23 00:22:31] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2024-05-23 00:22:31] [INFO ] Redundant transitions in 10 ms returned []
Running 299 sub problems to find dead transitions.
[2024-05-23 00:22:31] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:22:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 0 solved, 299 unsolved in 18282 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 299/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 771 constraints, problems are : Problem set: 0 solved, 299 unsolved in 22635 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
After SMT, in 41145ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 41148ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41770 ms. Remains : 456/456 places, 681/681 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 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 45 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2012 resets) in 314 ms. (126 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (17 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 903518 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 1
Probabilistic random walk after 903518 steps, saw 200216 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
[2024-05-23 00:23:16] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:23:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/193 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/558 variables, 193/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 421/979 variables, 185/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/979 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/979 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 78/1057 variables, 13/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1057 variables, 26/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1057 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 52/1109 variables, 52/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/193 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/558 variables, 193/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 421/979 variables, 185/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/979 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/979 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/979 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 78/1057 variables, 13/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1057 variables, 26/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1057 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 52/1109 variables, 52/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1109 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1109 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 502ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 96329 steps with 4683 reset in 639 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-11 finished in 93204 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(G(p0)))'
Support contains 2 out of 781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Graph (trivial) has 733 edges and 781 vertex of which 85 / 781 are part of one of the 14 SCC in 0 ms
Free SCC test removed 71 places
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 709 transition count 894
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 639 transition count 894
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 141 place count 639 transition count 860
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 209 place count 605 transition count 860
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 257 place count 557 transition count 812
Iterating global reduction 2 with 48 rules applied. Total rules applied 305 place count 557 transition count 812
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 308 place count 557 transition count 809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 308 place count 557 transition count 808
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 310 place count 556 transition count 808
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 321 place count 545 transition count 797
Iterating global reduction 3 with 11 rules applied. Total rules applied 332 place count 545 transition count 797
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 343 place count 545 transition count 786
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 513 place count 460 transition count 701
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 516 place count 457 transition count 698
Iterating global reduction 4 with 3 rules applied. Total rules applied 519 place count 457 transition count 698
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 522 place count 457 transition count 695
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 536 place count 457 transition count 681
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 538 place count 455 transition count 679
Applied a total of 538 rules in 124 ms. Remains 455 /781 variables (removed 326) and now considering 679/1036 (removed 357) transitions.
[2024-05-23 00:23:17] [INFO ] Flow matrix only has 652 transitions (discarded 27 similar events)
// Phase 1: matrix 652 rows 455 cols
[2024-05-23 00:23:17] [INFO ] Computed 16 invariants in 14 ms
[2024-05-23 00:23:17] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-23 00:23:17] [INFO ] Flow matrix only has 652 transitions (discarded 27 similar events)
[2024-05-23 00:23:17] [INFO ] Invariant cache hit.
[2024-05-23 00:23:18] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2024-05-23 00:23:18] [INFO ] Redundant transitions in 3 ms returned []
Running 298 sub problems to find dead transitions.
[2024-05-23 00:23:18] [INFO ] Flow matrix only has 652 transitions (discarded 27 similar events)
[2024-05-23 00:23:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 14/455 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 651/1106 variables, 455/471 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1106 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (OVERLAPS) 0/1106 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1106/1107 variables, and 471 constraints, problems are : Problem set: 0 solved, 298 unsolved in 17854 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 455/455 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 14/455 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 651/1106 variables, 455/471 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1106 variables, 298/769 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1106 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 0/1106 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1106/1107 variables, and 769 constraints, problems are : Problem set: 0 solved, 298 unsolved in 22674 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 455/455 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints]
After SMT, in 40742ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 40746ms
Starting structural reductions in SI_LTL mode, iteration 1 : 455/781 places, 679/1036 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41451 ms. Remains : 455/781 places, 679/1036 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-14
Stuttering criterion allowed to conclude after 275 steps with 13 reset in 5 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-14 finished in 41527 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((G(p0)||G(F((X(p2)&&p1))))))'
Support contains 8 out of 781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 765 transition count 1020
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 765 transition count 1020
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 765 transition count 1019
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 46 place count 752 transition count 1006
Iterating global reduction 1 with 13 rules applied. Total rules applied 59 place count 752 transition count 1006
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 69 place count 752 transition count 996
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 751 transition count 995
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 751 transition count 995
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 751 transition count 994
Applied a total of 72 rules in 53 ms. Remains 751 /781 variables (removed 30) and now considering 994/1036 (removed 42) transitions.
// Phase 1: matrix 994 rows 751 cols
[2024-05-23 00:23:59] [INFO ] Computed 16 invariants in 18 ms
[2024-05-23 00:23:59] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-23 00:23:59] [INFO ] Invariant cache hit.
[2024-05-23 00:23:59] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
Running 993 sub problems to find dead transitions.
[2024-05-23 00:23:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 1 (OVERLAPS) 1/751 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 993 unsolved
[2024-05-23 00:24:20] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 4 ms to minimize.
[2024-05-23 00:24:20] [INFO ] Deduced a trap composed of 128 places in 68 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 751/1745 variables, and 18 constraints, problems are : Problem set: 0 solved, 993 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/751 constraints, PredecessorRefiner: 993/993 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 993 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 1 (OVERLAPS) 1/751 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/751 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/751 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 4 (OVERLAPS) 994/1745 variables, 751/769 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1745 variables, 993/1762 constraints. Problems are: Problem set: 0 solved, 993 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 1762 constraints, problems are : Problem set: 0 solved, 993 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 751/751 constraints, PredecessorRefiner: 993/993 constraints, Known Traps: 2/2 constraints]
After SMT, in 60763ms problems are : Problem set: 0 solved, 993 unsolved
Search for dead transitions found 0 dead transitions in 60775ms
Starting structural reductions in LTL mode, iteration 1 : 751/781 places, 994/1036 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61673 ms. Remains : 751/781 places, 994/1036 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-15
Product exploration explored 100000 steps with 998 reset in 205 ms.
Product exploration explored 100000 steps with 991 reset in 204 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 108 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (393 resets) in 885 ms. (45 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (39 resets) in 40 ms. (975 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (38 resets) in 320 ms. (124 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (41 resets) in 218 ms. (182 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (40 resets) in 360 ms. (110 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (39 resets) in 127 ms. (312 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (41 resets) in 146 ms. (272 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (39 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (40 resets) in 132 ms. (300 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (39 resets) in 161 ms. (246 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (38 resets) in 110 ms. (360 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (40 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 179474 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 11
Probabilistic random walk after 179474 steps, saw 71685 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2024-05-23 00:25:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem apf6 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 385/393 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 358/751 variables, 10/16 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/751 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 994/1745 variables, 751/767 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1745 variables, 0/767 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/1745 variables, 0/767 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1745/1745 variables, and 767 constraints, problems are : Problem set: 2 solved, 9 unsolved in 828 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 751/751 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 385/393 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 358/751 variables, 10/16 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-23 00:25:06] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 3 ms to minimize.
[2024-05-23 00:25:06] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 2 ms to minimize.
[2024-05-23 00:25:06] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 2 ms to minimize.
[2024-05-23 00:25:06] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 3 ms to minimize.
[2024-05-23 00:25:07] [INFO ] Deduced a trap composed of 120 places in 180 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/751 variables, 5/21 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/751 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 994/1745 variables, 751/772 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1745 variables, 9/781 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1745 variables, 0/781 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/1745 variables, 0/781 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 781 constraints, problems are : Problem set: 2 solved, 9 unsolved in 2219 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 751/751 constraints, PredecessorRefiner: 9/11 constraints, Known Traps: 5/5 constraints]
After SMT, in 3055ms problems are : Problem set: 2 solved, 9 unsolved
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 5 properties in 1817 ms.
Support contains 8 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 994/994 transitions.
Graph (trivial) has 696 edges and 751 vertex of which 85 / 751 are part of one of the 14 SCC in 1 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 680 transition count 841
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 613 transition count 841
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 135 place count 613 transition count 811
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 195 place count 583 transition count 811
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 222 place count 556 transition count 784
Iterating global reduction 2 with 27 rules applied. Total rules applied 249 place count 556 transition count 784
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 251 place count 554 transition count 782
Iterating global reduction 2 with 2 rules applied. Total rules applied 253 place count 554 transition count 782
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 427 place count 467 transition count 695
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 455 place count 467 transition count 667
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 469 place count 453 transition count 653
Iterating global reduction 3 with 14 rules applied. Total rules applied 483 place count 453 transition count 653
Free-agglomeration rule applied 369 times.
Iterating global reduction 3 with 369 rules applied. Total rules applied 852 place count 453 transition count 284
Reduce places removed 369 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Graph (complete) has 225 edges and 84 vertex of which 64 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 538 rules applied. Total rules applied 1390 place count 64 transition count 116
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 1418 place count 64 transition count 88
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1419 place count 64 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1420 place count 63 transition count 87
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 50 edges and 62 vertex of which 20 / 62 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 1423 place count 52 transition count 86
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1444 place count 51 transition count 66
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 1444 place count 51 transition count 57
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 1462 place count 42 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1471 place count 42 transition count 48
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 1489 place count 33 transition count 39
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 8 with 2 rules applied. Total rules applied 1491 place count 32 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1492 place count 32 transition count 37
Free-agglomeration rule applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 1501 place count 32 transition count 28
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 1525 place count 17 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1526 place count 17 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1527 place count 16 transition count 18
Applied a total of 1527 rules in 92 ms. Remains 16 /751 variables (removed 735) and now considering 18/994 (removed 976) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 16/751 places, 18/994 transitions.
RANDOM walk for 2201 steps (0 resets) in 5 ms. (366 steps per ms) remains 0/4 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p1))), (G (OR p0 (NOT p1))), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p1))), (F p1), (F (NOT (OR p0 p2 p1))), (F (NOT p0))]
Knowledge based reduction with 25 factoid took 345 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 8 out of 751 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 751/751 places, 994/994 transitions.
Applied a total of 0 rules in 15 ms. Remains 751 /751 variables (removed 0) and now considering 994/994 (removed 0) transitions.
[2024-05-23 00:25:11] [INFO ] Invariant cache hit.
[2024-05-23 00:25:11] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-23 00:25:11] [INFO ] Invariant cache hit.
[2024-05-23 00:25:11] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
Running 993 sub problems to find dead transitions.
[2024-05-23 00:25:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 1 (OVERLAPS) 1/751 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 993 unsolved
[2024-05-23 00:25:33] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 4 ms to minimize.
[2024-05-23 00:25:33] [INFO ] Deduced a trap composed of 128 places in 78 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 751/1745 variables, and 18 constraints, problems are : Problem set: 0 solved, 993 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/751 constraints, PredecessorRefiner: 993/993 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 993 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 1 (OVERLAPS) 1/751 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/751 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/751 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 4 (OVERLAPS) 994/1745 variables, 751/769 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1745 variables, 993/1762 constraints. Problems are: Problem set: 0 solved, 993 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 1762 constraints, problems are : Problem set: 0 solved, 993 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 751/751 constraints, PredecessorRefiner: 993/993 constraints, Known Traps: 2/2 constraints]
After SMT, in 60779ms problems are : Problem set: 0 solved, 993 unsolved
Search for dead transitions found 0 dead transitions in 60792ms
Finished structural reductions in LTL mode , in 1 iterations and 61703 ms. Remains : 751/751 places, 994/994 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 138 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (398 resets) in 627 ms. (63 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (41 resets) in 112 ms. (354 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (38 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (41 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (40 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (41 resets) in 105 ms. (377 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (40 resets) in 69 ms. (571 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (39 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (42 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 214689 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 8
Probabilistic random walk after 214689 steps, saw 85605 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2024-05-23 00:26:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 385/393 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 358/751 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/751 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 994/1745 variables, 751/767 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1745 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/1745 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1745/1745 variables, and 767 constraints, problems are : Problem set: 0 solved, 8 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 751/751 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 385/393 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 358/751 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/751 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 994/1745 variables, 751/767 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1745 variables, 8/775 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1745 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/1745 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 775 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1118 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 751/751 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 1848ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 2 properties in 2454 ms.
Support contains 8 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 994/994 transitions.
Graph (trivial) has 696 edges and 751 vertex of which 85 / 751 are part of one of the 14 SCC in 0 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 680 transition count 841
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 613 transition count 841
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 135 place count 613 transition count 811
Deduced a syphon composed of 30 places in 13 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 195 place count 583 transition count 811
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 222 place count 556 transition count 784
Iterating global reduction 2 with 27 rules applied. Total rules applied 249 place count 556 transition count 784
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 251 place count 554 transition count 782
Iterating global reduction 2 with 2 rules applied. Total rules applied 253 place count 554 transition count 782
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 427 place count 467 transition count 695
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 455 place count 467 transition count 667
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 469 place count 453 transition count 653
Iterating global reduction 3 with 14 rules applied. Total rules applied 483 place count 453 transition count 653
Free-agglomeration rule applied 369 times.
Iterating global reduction 3 with 369 rules applied. Total rules applied 852 place count 453 transition count 284
Reduce places removed 369 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Graph (complete) has 225 edges and 84 vertex of which 64 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 538 rules applied. Total rules applied 1390 place count 64 transition count 116
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 1418 place count 64 transition count 88
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1419 place count 64 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1420 place count 63 transition count 87
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 50 edges and 62 vertex of which 20 / 62 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 1423 place count 52 transition count 86
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1444 place count 51 transition count 66
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 1444 place count 51 transition count 57
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 1462 place count 42 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1471 place count 42 transition count 48
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 1489 place count 33 transition count 39
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 8 with 2 rules applied. Total rules applied 1491 place count 32 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1492 place count 32 transition count 37
Free-agglomeration rule applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 1501 place count 32 transition count 28
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 1525 place count 17 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1526 place count 17 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1527 place count 16 transition count 18
Applied a total of 1527 rules in 97 ms. Remains 16 /751 variables (removed 735) and now considering 18/994 (removed 976) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 16/751 places, 18/994 transitions.
RANDOM walk for 1520 steps (0 resets) in 4 ms. (304 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1 p2))), (F p1)]
Knowledge based reduction with 13 factoid took 396 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 992 reset in 194 ms.
Product exploration explored 100000 steps with 995 reset in 197 ms.
Built C files in :
/tmp/ltsmin4081457476885951902
[2024-05-23 00:26:22] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4081457476885951902
Running compilation step : cd /tmp/ltsmin4081457476885951902;'/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 1871 ms.
Running link step : cd /tmp/ltsmin4081457476885951902;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin4081457476885951902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9365006929488652337.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 751 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 751/751 places, 994/994 transitions.
Applied a total of 0 rules in 17 ms. Remains 751 /751 variables (removed 0) and now considering 994/994 (removed 0) transitions.
[2024-05-23 00:26:37] [INFO ] Invariant cache hit.
[2024-05-23 00:26:37] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-23 00:26:37] [INFO ] Invariant cache hit.
[2024-05-23 00:26:38] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
Running 993 sub problems to find dead transitions.
[2024-05-23 00:26:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 1 (OVERLAPS) 1/751 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 993 unsolved
[2024-05-23 00:26:58] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 4 ms to minimize.
[2024-05-23 00:26:59] [INFO ] Deduced a trap composed of 128 places in 85 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 751/1745 variables, and 18 constraints, problems are : Problem set: 0 solved, 993 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/751 constraints, PredecessorRefiner: 993/993 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 993 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 1 (OVERLAPS) 1/751 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/751 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/751 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 4 (OVERLAPS) 994/1745 variables, 751/769 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1745 variables, 993/1762 constraints. Problems are: Problem set: 0 solved, 993 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 1762 constraints, problems are : Problem set: 0 solved, 993 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 751/751 constraints, PredecessorRefiner: 993/993 constraints, Known Traps: 2/2 constraints]
After SMT, in 60741ms problems are : Problem set: 0 solved, 993 unsolved
Search for dead transitions found 0 dead transitions in 60751ms
Finished structural reductions in LTL mode , in 1 iterations and 61616 ms. Remains : 751/751 places, 994/994 transitions.
Built C files in :
/tmp/ltsmin8405870482935204284
[2024-05-23 00:27:39] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8405870482935204284
Running compilation step : cd /tmp/ltsmin8405870482935204284;'/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 1820 ms.
Running link step : cd /tmp/ltsmin8405870482935204284;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8405870482935204284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15847084283006088182.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:27:54] [INFO ] Flatten gal took : 24 ms
[2024-05-23 00:27:54] [INFO ] Flatten gal took : 23 ms
[2024-05-23 00:27:54] [INFO ] Time to serialize gal into /tmp/LTL17015195309241077727.gal : 4 ms
[2024-05-23 00:27:54] [INFO ] Time to serialize properties into /tmp/LTL13008414668657262161.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17015195309241077727.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7426255332279134919.hoa' '-atoms' '/tmp/LTL13008414668657262161.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13008414668657262161.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7426255332279134919.hoa
Detected timeout of ITS tools.
[2024-05-23 00:28:09] [INFO ] Flatten gal took : 21 ms
[2024-05-23 00:28:09] [INFO ] Flatten gal took : 22 ms
[2024-05-23 00:28:09] [INFO ] Time to serialize gal into /tmp/LTL7111458564258694987.gal : 6 ms
[2024-05-23 00:28:09] [INFO ] Time to serialize properties into /tmp/LTL14439547047276680824.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7111458564258694987.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14439547047276680824.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(((p1140==0)||(p229==1))||((p1645==0)||(p2186==1)))"))||(G(F(("((p541==0)&&(p1104==1))")&&(X("((p1795==0)||(p235==1))")))))))...156
Formula 0 simplified : G(F!"(((p1140==0)||(p229==1))||((p1645==0)||(p2186==1)))" & FG(!"((p541==0)&&(p1104==1))" | X!"((p1795==0)||(p235==1))"))
Detected timeout of ITS tools.
[2024-05-23 00:28:24] [INFO ] Flatten gal took : 21 ms
[2024-05-23 00:28:24] [INFO ] Applying decomposition
[2024-05-23 00:28:24] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2318543535555412167.txt' '-o' '/tmp/graph2318543535555412167.bin' '-w' '/tmp/graph2318543535555412167.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2318543535555412167.bin' '-l' '-1' '-v' '-w' '/tmp/graph2318543535555412167.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:28:24] [INFO ] Decomposing Gal with order
[2024-05-23 00:28:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:28:24] [INFO ] Removed a total of 287 redundant transitions.
[2024-05-23 00:28:24] [INFO ] Flatten gal took : 85 ms
[2024-05-23 00:28:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 20 ms.
[2024-05-23 00:28:24] [INFO ] Time to serialize gal into /tmp/LTL8236490166870646122.gal : 21 ms
[2024-05-23 00:28:24] [INFO ] Time to serialize properties into /tmp/LTL6901683899972620226.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8236490166870646122.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6901683899972620226.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i16.i0.i0.u93.p1140==0)||(i2.i0.i0.u19.p229==1))||((i14.u135.p1645==0)||(i4.u152.p2186==1)))"))||(G(F(("((i6.u38.p541==0)&...243
Formula 0 simplified : G(F!"(((i16.i0.i0.u93.p1140==0)||(i2.i0.i0.u19.p229==1))||((i14.u135.p1645==0)||(i4.u152.p2186==1)))" & FG(!"((i6.u38.p541==0)&&(i16...231
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-15 finished in 280769 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)))'
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((G(p0)||G(F((X(p2)&&p1))))))'
Found a Shortening insensitive property : FlexibleBarrier-PT-14b-LTLCardinality-15
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 8 out of 781 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Graph (trivial) has 726 edges and 781 vertex of which 86 / 781 are part of one of the 14 SCC in 0 ms
Free SCC test removed 72 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 708 transition count 895
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 641 transition count 895
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 135 place count 641 transition count 862
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 201 place count 608 transition count 862
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 243 place count 566 transition count 820
Iterating global reduction 2 with 42 rules applied. Total rules applied 285 place count 566 transition count 820
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 286 place count 566 transition count 819
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 297 place count 555 transition count 808
Iterating global reduction 3 with 11 rules applied. Total rules applied 308 place count 555 transition count 808
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 317 place count 555 transition count 799
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 487 place count 470 transition count 714
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 489 place count 468 transition count 712
Iterating global reduction 4 with 2 rules applied. Total rules applied 491 place count 468 transition count 712
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 493 place count 468 transition count 710
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 507 place count 468 transition count 696
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 508 place count 468 transition count 696
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 510 place count 466 transition count 694
Applied a total of 510 rules in 89 ms. Remains 466 /781 variables (removed 315) and now considering 694/1036 (removed 342) transitions.
[2024-05-23 00:28:40] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
// Phase 1: matrix 667 rows 466 cols
[2024-05-23 00:28:40] [INFO ] Computed 16 invariants in 14 ms
[2024-05-23 00:28:40] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-23 00:28:40] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 00:28:40] [INFO ] Invariant cache hit.
[2024-05-23 00:28:40] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2024-05-23 00:28:40] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 00:28:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 14/466 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 666/1132 variables, 466/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (OVERLAPS) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1132/1133 variables, and 482 constraints, problems are : Problem set: 0 solved, 323 unsolved in 19859 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 323 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 14/466 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 666/1132 variables, 466/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1132 variables, 323/805 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1132 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 7 (OVERLAPS) 0/1132 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1132/1133 variables, and 805 constraints, problems are : Problem set: 0 solved, 323 unsolved in 24686 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints]
After SMT, in 44782ms problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 44785ms
Starting structural reductions in LI_LTL mode, iteration 1 : 466/781 places, 694/1036 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 45473 ms. Remains : 466/781 places, 694/1036 transitions.
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-15
Product exploration explored 100000 steps with 4440 reset in 589 ms.
Product exploration explored 100000 steps with 4454 reset in 614 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 p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 109 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (1819 resets) in 462 ms. (86 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 23 ms. (1666 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 30 ms. (1290 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (19 resets) in 44 ms. (888 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (19 resets) in 32 ms. (1212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (19 resets) in 73 ms. (540 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (18 resets) in 40 ms. (975 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 43 ms. (909 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (17 resets) in 47 ms. (833 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (19 resets) in 48 ms. (816 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (19 resets) in 44 ms. (888 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 39 ms. (1000 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 242613 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :2 out of 11
Probabilistic random walk after 242613 steps, saw 80155 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :2
[2024-05-23 00:29:30] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 00:29:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf6 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 274/282 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 465/747 variables, 282/288 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/747 variables, 0/288 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 295/1042 variables, 130/418 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1042 variables, 1/419 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1042 variables, 0/419 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 54/1096 variables, 9/428 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1096 variables, 18/446 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1096 variables, 0/446 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 36/1132 variables, 36/482 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1132/1133 variables, and 482 constraints, problems are : Problem set: 2 solved, 7 unsolved in 611 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 274/282 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 465/747 variables, 282/288 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/747 variables, 1/289 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 0/289 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 295/1042 variables, 130/419 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1042 variables, 1/420 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1042 variables, 6/426 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1042 variables, 0/426 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 54/1096 variables, 9/435 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1096 variables, 18/453 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1096 variables, 0/453 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 36/1132 variables, 36/489 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1132 variables, 0/489 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/1132 variables, 0/489 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1132/1133 variables, and 489 constraints, problems are : Problem set: 2 solved, 7 unsolved in 769 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 7/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 1390ms problems are : Problem set: 2 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 858 steps, including 27 resets, run visited all 3 properties in 4 ms. (steps per millisecond=214 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 78 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p1))), (G (OR p0 (NOT p1))), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 25 factoid took 391 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 8 out of 466 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 466/466 places, 694/694 transitions.
Applied a total of 0 rules in 8 ms. Remains 466 /466 variables (removed 0) and now considering 694/694 (removed 0) transitions.
[2024-05-23 00:29:32] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 00:29:32] [INFO ] Invariant cache hit.
[2024-05-23 00:29:32] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-23 00:29:32] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 00:29:32] [INFO ] Invariant cache hit.
[2024-05-23 00:29:33] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2024-05-23 00:29:33] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 00:29:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 14/466 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 666/1132 variables, 466/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (OVERLAPS) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1132/1133 variables, and 482 constraints, problems are : Problem set: 0 solved, 323 unsolved in 19864 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 323 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 14/466 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 666/1132 variables, 466/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1132 variables, 323/805 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1132 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 7 (OVERLAPS) 0/1132 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1132/1133 variables, and 805 constraints, problems are : Problem set: 0 solved, 323 unsolved in 25068 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints]
After SMT, in 45198ms problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 45201ms
Finished structural reductions in LTL mode , in 1 iterations and 45777 ms. Remains : 466/466 places, 694/694 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 p0 (NOT p1) p2), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 127 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (1829 resets) in 1363 ms. (29 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (19 resets) in 33 ms. (1176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (19 resets) in 44 ms. (888 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (19 resets) in 38 ms. (1025 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (20 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (20 resets) in 45 ms. (869 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (18 resets) in 27 ms. (1428 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (20 resets) in 38 ms. (1025 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (19 resets) in 34 ms. (1142 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 282766 steps, run timeout after 3002 ms. (steps per millisecond=94 ) properties seen :2 out of 8
Probabilistic random walk after 282766 steps, saw 92668 distinct states, run finished after 3002 ms. (steps per millisecond=94 ) properties seen :2
[2024-05-23 00:30:22] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 00:30:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 274/282 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 465/747 variables, 282/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/747 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 295/1042 variables, 130/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1042 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1042 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 54/1096 variables, 9/428 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1096 variables, 18/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1096 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 36/1132 variables, 36/482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1132/1133 variables, and 482 constraints, problems are : Problem set: 0 solved, 6 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 274/282 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 465/747 variables, 282/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/747 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 295/1042 variables, 130/419 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1042 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1042 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1042 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 54/1096 variables, 9/434 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1096 variables, 18/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1096 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 36/1132 variables, 36/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1132 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1132 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1132/1133 variables, and 488 constraints, problems are : Problem set: 0 solved, 6 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1254ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 5 properties in 102 ms.
Support contains 8 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 694/694 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 466 transition count 666
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 42 place count 452 transition count 652
Iterating global reduction 1 with 14 rules applied. Total rules applied 56 place count 452 transition count 652
Free-agglomeration rule applied 369 times.
Iterating global reduction 1 with 369 rules applied. Total rules applied 425 place count 452 transition count 283
Reduce places removed 370 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Graph (complete) has 154 edges and 82 vertex of which 62 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Graph (trivial) has 57 edges and 62 vertex of which 20 / 62 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Iterating post reduction 1 with 540 rules applied. Total rules applied 965 place count 52 transition count 95
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 993 place count 52 transition count 67
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 993 place count 52 transition count 57
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1013 place count 42 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1023 place count 42 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1023 place count 42 transition count 46
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 1025 place count 41 transition count 46
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 1043 place count 32 transition count 37
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 1052 place count 32 transition count 28
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 1076 place count 17 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1077 place count 17 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1078 place count 16 transition count 18
Applied a total of 1078 rules in 35 ms. Remains 16 /466 variables (removed 450) and now considering 18/694 (removed 676) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 16/466 places, 18/694 transitions.
RANDOM walk for 338 steps (0 resets) in 4 ms. (67 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1 p2))), (F p1)]
Knowledge based reduction with 13 factoid took 399 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 4428 reset in 570 ms.
Product exploration explored 100000 steps with 4451 reset in 581 ms.
Built C files in :
/tmp/ltsmin16722277885999055512
[2024-05-23 00:30:25] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16722277885999055512
Running compilation step : cd /tmp/ltsmin16722277885999055512;'/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 1208 ms.
Running link step : cd /tmp/ltsmin16722277885999055512;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16722277885999055512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9292104529606685068.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 466 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 466/466 places, 694/694 transitions.
Applied a total of 0 rules in 7 ms. Remains 466 /466 variables (removed 0) and now considering 694/694 (removed 0) transitions.
[2024-05-23 00:30:40] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 00:30:40] [INFO ] Invariant cache hit.
[2024-05-23 00:30:41] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-23 00:30:41] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 00:30:41] [INFO ] Invariant cache hit.
[2024-05-23 00:30:41] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2024-05-23 00:30:41] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 00:30:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 14/466 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 666/1132 variables, 466/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (OVERLAPS) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1132/1133 variables, and 482 constraints, problems are : Problem set: 0 solved, 323 unsolved in 19953 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 323 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 14/466 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 666/1132 variables, 466/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1132 variables, 323/805 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1132 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 7 (OVERLAPS) 0/1132 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1132/1133 variables, and 805 constraints, problems are : Problem set: 0 solved, 323 unsolved in 24864 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints]
After SMT, in 45045ms problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 45048ms
Finished structural reductions in LTL mode , in 1 iterations and 45618 ms. Remains : 466/466 places, 694/694 transitions.
Built C files in :
/tmp/ltsmin7082708655667890129
[2024-05-23 00:31:26] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7082708655667890129
Running compilation step : cd /tmp/ltsmin7082708655667890129;'/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 1207 ms.
Running link step : cd /tmp/ltsmin7082708655667890129;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7082708655667890129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1770154340947745052.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:31:41] [INFO ] Flatten gal took : 14 ms
[2024-05-23 00:31:41] [INFO ] Flatten gal took : 14 ms
[2024-05-23 00:31:41] [INFO ] Time to serialize gal into /tmp/LTL4290075801997630843.gal : 3 ms
[2024-05-23 00:31:41] [INFO ] Time to serialize properties into /tmp/LTL13886452354825671721.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4290075801997630843.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12807567040716737916.hoa' '-atoms' '/tmp/LTL13886452354825671721.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13886452354825671721.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12807567040716737916.hoa
Detected timeout of ITS tools.
[2024-05-23 00:31:56] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:31:56] [INFO ] Flatten gal took : 14 ms
[2024-05-23 00:31:56] [INFO ] Time to serialize gal into /tmp/LTL17186294085679943584.gal : 3 ms
[2024-05-23 00:31:56] [INFO ] Time to serialize properties into /tmp/LTL12575892309948367854.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17186294085679943584.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12575892309948367854.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("(((p1140==0)||(p229==1))||((p1645==0)||(p2186==1)))"))||(G(F(("((p541==0)&&(p1104==1))")&&(X("((p1795==0)||(p235==1))")))))))...156
Formula 0 simplified : G(F!"(((p1140==0)||(p229==1))||((p1645==0)||(p2186==1)))" & FG(!"((p541==0)&&(p1104==1))" | X!"((p1795==0)||(p235==1))"))
Detected timeout of ITS tools.
[2024-05-23 00:32:11] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:32:11] [INFO ] Applying decomposition
[2024-05-23 00:32:11] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5096636962347962351.txt' '-o' '/tmp/graph5096636962347962351.bin' '-w' '/tmp/graph5096636962347962351.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5096636962347962351.bin' '-l' '-1' '-v' '-w' '/tmp/graph5096636962347962351.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:32:11] [INFO ] Decomposing Gal with order
[2024-05-23 00:32:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:32:11] [INFO ] Removed a total of 289 redundant transitions.
[2024-05-23 00:32:11] [INFO ] Flatten gal took : 44 ms
[2024-05-23 00:32:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 7 ms.
[2024-05-23 00:32:11] [INFO ] Time to serialize gal into /tmp/LTL6591699973962794790.gal : 5 ms
[2024-05-23 00:32:11] [INFO ] Time to serialize properties into /tmp/LTL6328750221434438115.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6591699973962794790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6328750221434438115.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i9.u28.p1140==0)||(i1.u5.p229==1))||((i13.u40.p1645==0)||(u44.p2186==1)))"))||(G(F(("((i4.u9.p541==0)&&(i9.u25.p1104==1))"...208
Formula 0 simplified : G(F!"(((i9.u28.p1140==0)||(i1.u5.p229==1))||((i13.u40.p1645==0)||(u44.p2186==1)))" & FG(!"((i4.u9.p541==0)&&(i9.u25.p1104==1))" | X!...196
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-15 finished in 227156 ms.
[2024-05-23 00:32:27] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12474700331338886771
[2024-05-23 00:32:27] [INFO ] Computing symmetric may disable matrix : 1036 transitions.
[2024-05-23 00:32:27] [INFO ] Applying decomposition
[2024-05-23 00:32:27] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:32:27] [INFO ] Computing symmetric may enable matrix : 1036 transitions.
[2024-05-23 00:32:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:32:27] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8200357564903369681.txt' '-o' '/tmp/graph8200357564903369681.bin' '-w' '/tmp/graph8200357564903369681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8200357564903369681.bin' '-l' '-1' '-v' '-w' '/tmp/graph8200357564903369681.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:32:27] [INFO ] Decomposing Gal with order
[2024-05-23 00:32:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:32:27] [INFO ] Computing Do-Not-Accords matrix : 1036 transitions.
[2024-05-23 00:32:27] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:32:27] [INFO ] Built C files in 196ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12474700331338886771
Running compilation step : cd /tmp/ltsmin12474700331338886771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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'
[2024-05-23 00:32:27] [INFO ] Removed a total of 319 redundant transitions.
[2024-05-23 00:32:27] [INFO ] Flatten gal took : 57 ms
[2024-05-23 00:32:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 24 ms.
[2024-05-23 00:32:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality3653346146104732296.gal : 19 ms
[2024-05-23 00:32:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality2421406375980565349.ltl : 93 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3653346146104732296.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2421406375980565349.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((G(F("(((i1.u150.p2395==0)||(i4.u37.p443==1))||((i11.i0.i0.u109.p1363==0)||(i3.u30.p390==1)))"))))
Formula 0 simplified : FG!"(((i1.u150.p2395==0)||(i4.u37.p443==1))||((i11.i0.i0.u109.p1363==0)||(i3.u30.p390==1)))"
Compilation finished in 3341 ms.
Running link step : cd /tmp/ltsmin12474700331338886771;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin12474700331338886771;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin12474700331338886771;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12474700331338886771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp1==true))||[](<>((X((LTLAPp3==true))&&(LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 00:58:54] [INFO ] Applying decomposition
[2024-05-23 00:58:54] [INFO ] Flatten gal took : 60 ms
[2024-05-23 00:58:54] [INFO ] Decomposing Gal with order
[2024-05-23 00:58:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:58:54] [INFO ] Removed a total of 271 redundant transitions.
[2024-05-23 00:58:54] [INFO ] Flatten gal took : 110 ms
[2024-05-23 00:58:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 880 labels/synchronizations in 175 ms.
[2024-05-23 00:58:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality5271193566837207057.gal : 25 ms
[2024-05-23 00:58:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality11514202089130490520.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5271193566837207057.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11514202089130490520.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(F("(((i1.u29.p2395==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u17.p443==1))||((i0.i0.i0.i0.u24.p1363==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0...184
Formula 0 simplified : FG!"(((i1.u29.p2395==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u17.p443==1))||((i0.i0.i0.i0.u24.p1363==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i...178
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin12474700331338886771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp1==true))||[](<>((X((LTLAPp3==true))&&(LTLAPp2==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin12474700331338886771;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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="FlexibleBarrier-PT-14b"
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 FlexibleBarrier-PT-14b, 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 r180-tall-171640602600091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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