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.r223-tall-171649610600077.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 greatspnxred
Input is JoinFreeModules-PT-1000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649610600077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 14:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 11 14:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716505081206

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-1000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 22:58:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 22:58:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 22:58:02] [INFO ] Load time of PNML (sax parser for PT used): 306 ms
[2024-05-23 22:58:02] [INFO ] Transformed 5001 places.
[2024-05-23 22:58:02] [INFO ] Transformed 8001 transitions.
[2024-05-23 22:58:02] [INFO ] Parsed PT model containing 5001 places and 8001 transitions and 23002 arcs in 447 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 1000, 2, 1, 0, 1000, 0, 1000, 1, 0, 2, 2, 1000] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 1000, 2, 1, 0, 1000, 0, 1000, 1, 0, 2, 2, 1000] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 8001 rows 5000 cols
[2024-05-23 22:58:02] [INFO ] Computed 1000 invariants in 77 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1000, 2, 1, 0, 1000, 0, 1000, 1, 0, 2, 2, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 10520 steps (2 resets) in 438 ms. (23 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 6409 ms. (24 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2, 2, 1000, 2, 3, 2, 1000, 2, 1000, 3, 2, 2, 2, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2024-05-23 22:58:09] [INFO ] Invariant cache hit.
[2024-05-23 22:58:10] [INFO ] [Real]Absence check using 1000 positive place invariants in 277 ms returned sat
[2024-05-23 22:58:13] [INFO ] [Real]Absence check using state equation in 2837 ms returned sat
[2024-05-23 22:58:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:58:14] [INFO ] [Nat]Absence check using 1000 positive place invariants in 247 ms returned sat
[2024-05-23 22:58:19] [INFO ] [Nat]Absence check using state equation in 4230 ms returned unknown
[2024-05-23 22:58:19] [INFO ] [Real]Absence check using 1000 positive place invariants in 236 ms returned sat
[2024-05-23 22:58:22] [INFO ] [Real]Absence check using state equation in 2624 ms returned sat
[2024-05-23 22:58:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:58:23] [INFO ] [Nat]Absence check using 1000 positive place invariants in 235 ms returned sat
[2024-05-23 22:58:27] [INFO ] [Nat]Absence check using state equation in 4325 ms returned unknown
[2024-05-23 22:58:28] [INFO ] [Real]Absence check using 1000 positive place invariants in 227 ms returned sat
[2024-05-23 22:58:31] [INFO ] [Real]Absence check using state equation in 2682 ms returned sat
[2024-05-23 22:58:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:58:32] [INFO ] [Nat]Absence check using 1000 positive place invariants in 228 ms returned sat
[2024-05-23 22:58:36] [INFO ] [Nat]Absence check using state equation in 4344 ms returned unknown
[2024-05-23 22:58:37] [INFO ] [Real]Absence check using 1000 positive place invariants in 226 ms returned sat
[2024-05-23 22:58:39] [INFO ] [Real]Absence check using state equation in 2748 ms returned sat
[2024-05-23 22:58:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:58:40] [INFO ] [Nat]Absence check using 1000 positive place invariants in 234 ms returned sat
[2024-05-23 22:58:45] [INFO ] [Nat]Absence check using state equation in 4335 ms returned unknown
[2024-05-23 22:58:45] [INFO ] [Real]Absence check using 1000 positive place invariants in 228 ms returned sat
[2024-05-23 22:58:48] [INFO ] [Real]Absence check using state equation in 2780 ms returned sat
[2024-05-23 22:58:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:58:49] [INFO ] [Nat]Absence check using 1000 positive place invariants in 244 ms returned sat
[2024-05-23 22:58:53] [INFO ] [Nat]Absence check using state equation in 4320 ms returned unknown
[2024-05-23 22:58:54] [INFO ] [Real]Absence check using 1000 positive place invariants in 223 ms returned sat
[2024-05-23 22:58:57] [INFO ] [Real]Absence check using state equation in 2771 ms returned sat
[2024-05-23 22:58:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:58:58] [INFO ] [Nat]Absence check using 1000 positive place invariants in 237 ms returned sat
[2024-05-23 22:59:02] [INFO ] [Nat]Absence check using state equation in 4333 ms returned unknown
[2024-05-23 22:59:03] [INFO ] [Real]Absence check using 1000 positive place invariants in 224 ms returned sat
[2024-05-23 22:59:06] [INFO ] [Real]Absence check using state equation in 2713 ms returned sat
[2024-05-23 22:59:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:59:07] [INFO ] [Nat]Absence check using 1000 positive place invariants in 247 ms returned sat
[2024-05-23 22:59:11] [INFO ] [Nat]Absence check using state equation in 4307 ms returned unknown
[2024-05-23 22:59:12] [INFO ] [Real]Absence check using 1000 positive place invariants in 234 ms returned sat
[2024-05-23 22:59:14] [INFO ] [Real]Absence check using state equation in 2714 ms returned sat
[2024-05-23 22:59:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:59:15] [INFO ] [Nat]Absence check using 1000 positive place invariants in 243 ms returned sat
[2024-05-23 22:59:20] [INFO ] [Nat]Absence check using state equation in 4359 ms returned unknown
[2024-05-23 22:59:20] [INFO ] [Real]Absence check using 1000 positive place invariants in 215 ms returned sat
[2024-05-23 22:59:23] [INFO ] [Real]Absence check using state equation in 2713 ms returned sat
[2024-05-23 22:59:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:59:24] [INFO ] [Nat]Absence check using 1000 positive place invariants in 235 ms returned sat
[2024-05-23 22:59:28] [INFO ] [Nat]Absence check using state equation in 3686 ms returned unknown
[2024-05-23 22:59:28] [INFO ] [Real]Absence check using 1000 positive place invariants in 227 ms returned sat
[2024-05-23 22:59:31] [INFO ] [Real]Absence check using state equation in 2594 ms returned sat
[2024-05-23 22:59:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:59:32] [INFO ] [Nat]Absence check using 1000 positive place invariants in 243 ms returned sat
[2024-05-23 22:59:36] [INFO ] [Nat]Absence check using state equation in 4350 ms returned unknown
[2024-05-23 22:59:37] [INFO ] [Real]Absence check using 1000 positive place invariants in 233 ms returned sat
[2024-05-23 22:59:40] [INFO ] [Real]Absence check using state equation in 2726 ms returned sat
[2024-05-23 22:59:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:59:40] [INFO ] [Nat]Absence check using 1000 positive place invariants in 245 ms returned sat
[2024-05-23 22:59:45] [INFO ] [Nat]Absence check using state equation in 4337 ms returned unknown
[2024-05-23 22:59:45] [INFO ] [Real]Absence check using 1000 positive place invariants in 229 ms returned sat
[2024-05-23 22:59:48] [INFO ] [Real]Absence check using state equation in 2676 ms returned sat
[2024-05-23 22:59:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:59:49] [INFO ] [Nat]Absence check using 1000 positive place invariants in 230 ms returned sat
[2024-05-23 22:59:53] [INFO ] [Nat]Absence check using state equation in 4348 ms returned unknown
[2024-05-23 22:59:54] [INFO ] [Real]Absence check using 1000 positive place invariants in 234 ms returned sat
[2024-05-23 22:59:57] [INFO ] [Real]Absence check using state equation in 2754 ms returned sat
[2024-05-23 22:59:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:59:58] [INFO ] [Nat]Absence check using 1000 positive place invariants in 239 ms returned sat
[2024-05-23 23:00:02] [INFO ] [Nat]Absence check using state equation in 4337 ms returned unknown
[2024-05-23 23:00:03] [INFO ] [Real]Absence check using 1000 positive place invariants in 240 ms returned sat
[2024-05-23 23:00:06] [INFO ] [Real]Absence check using state equation in 2669 ms returned sat
[2024-05-23 23:00:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:00:07] [INFO ] [Nat]Absence check using 1000 positive place invariants in 239 ms returned sat
[2024-05-23 23:00:11] [INFO ] [Nat]Absence check using state equation in 4335 ms returned unknown
[2024-05-23 23:00:12] [INFO ] [Real]Absence check using 1000 positive place invariants in 230 ms returned sat
[2024-05-23 23:00:14] [INFO ] [Real]Absence check using state equation in 2672 ms returned sat
[2024-05-23 23:00:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:00:15] [INFO ] [Nat]Absence check using 1000 positive place invariants in 229 ms returned sat
[2024-05-23 23:00:20] [INFO ] [Nat]Absence check using state equation in 4351 ms returned unknown
[2024-05-23 23:00:20] [INFO ] [Real]Absence check using 1000 positive place invariants in 234 ms returned sat
[2024-05-23 23:00:23] [INFO ] [Real]Absence check using state equation in 2709 ms returned sat
[2024-05-23 23:00:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:00:24] [INFO ] [Nat]Absence check using 1000 positive place invariants in 239 ms returned sat
[2024-05-23 23:00:28] [INFO ] [Nat]Absence check using state equation in 4339 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2, 2, 1000, 2, 3, 2, 1000, 2, 1000, 3, 2, 2, 2, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2, 2, 1000, 2, 3, 2, 1000, 2, 1000, 3, 2, 2, 2, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 16 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 80 are kept as prefixes of interest. Removing 4920 places using SCC suffix rule.12 ms
Discarding 4920 places :
Also discarding 7872 output transitions
Drop transitions (Output transitions of discarded places.) removed 7872 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 128
Applied a total of 2 rules in 70 ms. Remains 80 /5000 variables (removed 4920) and now considering 128/8001 (removed 7873) transitions.
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 80 cols
[2024-05-23 23:00:28] [INFO ] Computed 16 invariants in 1 ms
[2024-05-23 23:00:28] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1863 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-23 23:00:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-23 23:00:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 210 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4623 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 2/2 constraints]
After SMT, in 6528ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 6541ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6626 ms. Remains : 80/5000 places, 128/8001 transitions.
[2024-05-23 23:00:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2, 2, 1000, 2, 3, 2, 1000, 2, 1000, 3, 2, 2, 2, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 1000253 steps (2 resets) in 888 ms. (1125 steps per ms)
BEST_FIRST walk for 16000016 steps (32 resets) in 17290 ms. (925 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1002, 969, 908, 993, 1000, 960, 1001, 944, 1000, 927, 1000, 1001, 850, 913, 936, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2024-05-23 23:00:53] [INFO ] Invariant cache hit.
[2024-05-23 23:00:53] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:00:53] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-23 23:00:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:00:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:00:53] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:00:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-23 23:00:53] [INFO ] [Nat]Added 16 Read/Feed constraints in 63 ms returned sat
[2024-05-23 23:00:53] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 37 ms.
[2024-05-23 23:00:53] [INFO ] Added : 52 causal constraints over 13 iterations in 261 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 23:00:54] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:00:54] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 23:00:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:00:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:00:54] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-23 23:00:54] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2024-05-23 23:00:54] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 23:00:54] [INFO ] Added : 56 causal constraints over 12 iterations in 151 ms. Result :sat
Minimization took 77 ms.
[2024-05-23 23:00:54] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:00:54] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:00:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:00:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-23 23:00:54] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-23 23:00:54] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2024-05-23 23:00:54] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 23:00:54] [INFO ] Added : 61 causal constraints over 13 iterations in 109 ms. Result :sat
Minimization took 94 ms.
[2024-05-23 23:00:54] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:00:54] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 23:00:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:00:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:00:54] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:00:54] [INFO ] [Nat]Added 16 Read/Feed constraints in 1 ms returned sat
[2024-05-23 23:00:54] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 23:00:55] [INFO ] Added : 68 causal constraints over 14 iterations in 210 ms. Result :sat
Minimization took 65 ms.
[2024-05-23 23:00:55] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:00:55] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 23:00:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:00:55] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:00:55] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 23:00:55] [INFO ] [Nat]Added 16 Read/Feed constraints in 40 ms returned sat
[2024-05-23 23:00:55] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 23:00:55] [INFO ] Added : 71 causal constraints over 16 iterations in 158 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 23:00:55] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:00:55] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 23:00:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:00:55] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:00:55] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 23:00:55] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-23 23:00:55] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-23 23:00:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 23:00:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-23 23:00:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-23 23:00:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 99 ms
[2024-05-23 23:00:55] [INFO ] Added : 73 causal constraints over 16 iterations in 302 ms. Result :sat
Minimization took 80 ms.
[2024-05-23 23:00:56] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:00:56] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:00:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:00:56] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:00:56] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 23:00:56] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-23 23:00:56] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 23:00:56] [INFO ] Added : 78 causal constraints over 17 iterations in 200 ms. Result :sat
Minimization took 36 ms.
[2024-05-23 23:00:56] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:00:56] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 23:00:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:00:56] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:00:56] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-23 23:00:56] [INFO ] [Nat]Added 16 Read/Feed constraints in 23 ms returned sat
[2024-05-23 23:00:56] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-23 23:00:56] [INFO ] Added : 63 causal constraints over 14 iterations in 133 ms. Result :sat
Minimization took 106 ms.
[2024-05-23 23:00:56] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:00:56] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 23:00:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:00:56] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:00:56] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 23:00:57] [INFO ] [Nat]Added 16 Read/Feed constraints in 64 ms returned sat
[2024-05-23 23:00:57] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 23:00:57] [INFO ] Added : 56 causal constraints over 12 iterations in 126 ms. Result :sat
Minimization took 35 ms.
[2024-05-23 23:00:57] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:00:57] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 23:00:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:00:57] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-23 23:00:57] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 23:00:57] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2024-05-23 23:00:57] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 23:00:57] [INFO ] Added : 61 causal constraints over 13 iterations in 160 ms. Result :sat
Minimization took 94 ms.
[2024-05-23 23:00:57] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:00:57] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 23:00:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:00:57] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:00:57] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 23:00:57] [INFO ] [Nat]Added 16 Read/Feed constraints in 53 ms returned sat
[2024-05-23 23:00:57] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-23 23:00:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 23:00:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-23 23:00:58] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-23 23:00:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 103 ms
[2024-05-23 23:00:58] [INFO ] Added : 62 causal constraints over 14 iterations in 251 ms. Result :sat
Minimization took 39 ms.
[2024-05-23 23:00:58] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-23 23:00:58] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 23:00:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:00:58] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:00:58] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 23:00:58] [INFO ] [Nat]Added 16 Read/Feed constraints in 61 ms returned sat
[2024-05-23 23:00:58] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 23:00:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-23 23:00:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-23 23:00:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2024-05-23 23:00:58] [INFO ] Added : 61 causal constraints over 14 iterations in 190 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 23:00:58] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:00:58] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 23:00:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:00:58] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:00:58] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:00:58] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-23 23:00:58] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 23:00:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-23 23:00:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-23 23:00:58] [INFO ] Added : 76 causal constraints over 16 iterations in 230 ms. Result :sat
Minimization took 129 ms.
[2024-05-23 23:00:59] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:00:59] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 23:00:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:00:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:00:59] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 23:00:59] [INFO ] [Nat]Added 16 Read/Feed constraints in 41 ms returned sat
[2024-05-23 23:00:59] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-23 23:00:59] [INFO ] Added : 59 causal constraints over 13 iterations in 141 ms. Result :sat
Minimization took 97 ms.
[2024-05-23 23:00:59] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:00:59] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 23:00:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:00:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:00:59] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 23:00:59] [INFO ] [Nat]Added 16 Read/Feed constraints in 61 ms returned sat
[2024-05-23 23:00:59] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-23 23:00:59] [INFO ] Added : 69 causal constraints over 15 iterations in 133 ms. Result :sat
Minimization took 99 ms.
[2024-05-23 23:00:59] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:00:59] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 23:00:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:00:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:00:59] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-23 23:01:00] [INFO ] [Nat]Added 16 Read/Feed constraints in 45 ms returned sat
[2024-05-23 23:01:00] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-23 23:01:00] [INFO ] Added : 53 causal constraints over 11 iterations in 121 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1002, 969, 908, 993, 1000, 960, 1001, 944, 1000, 927, 1000, 1001, 850, 913, 936, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1002, 1001, 1001, 1001, 1000, 1002, 1001, 1001, 1000, 1000, 1000, 1001, 1000, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 80/80 places, 128/128 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-23 23:01:53] [INFO ] Invariant cache hit.
[2024-05-23 23:01:53] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-23 23:01:53] [INFO ] Invariant cache hit.
[2024-05-23 23:01:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-23 23:01:53] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-23 23:01:53] [INFO ] Redundant transitions in 3 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-23 23:01:53] [INFO ] Invariant cache hit.
[2024-05-23 23:01:53] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1745 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 208 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2300 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 4067ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4068ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4179 ms. Remains : 80/80 places, 128/128 transitions.
[2024-05-23 23:01:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1002, 1001, 1001, 1001, 1000, 1002, 1001, 1001, 1000, 1000, 1000, 1001, 1000, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 1000019 steps (2 resets) in 908 ms. (1100 steps per ms)
BEST_FIRST walk for 16000016 steps (32 resets) in 17876 ms. (895 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1002, 1001, 1001, 1001, 1000, 1002, 1001, 1001, 1000, 1000, 1000, 1001, 1000, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2024-05-23 23:02:16] [INFO ] Invariant cache hit.
[2024-05-23 23:02:16] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:16] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:02:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:02:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:16] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 23:02:16] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-23 23:02:16] [INFO ] [Nat]Added 16 Read/Feed constraints in 67 ms returned sat
[2024-05-23 23:02:16] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-23 23:02:16] [INFO ] Added : 52 causal constraints over 13 iterations in 136 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 23:02:16] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:02:16] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 23:02:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:02:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:02:16] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 23:02:16] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-23 23:02:16] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 23:02:16] [INFO ] Added : 48 causal constraints over 10 iterations in 125 ms. Result :sat
Minimization took 42 ms.
[2024-05-23 23:02:17] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:17] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 23:02:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:02:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:17] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 23:02:17] [INFO ] [Nat]Added 16 Read/Feed constraints in 39 ms returned sat
[2024-05-23 23:02:17] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 23:02:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-23 23:02:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-23 23:02:17] [INFO ] Added : 68 causal constraints over 15 iterations in 211 ms. Result :sat
Minimization took 38 ms.
[2024-05-23 23:02:17] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:17] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 23:02:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:02:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:17] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-23 23:02:17] [INFO ] [Nat]Added 16 Read/Feed constraints in 23 ms returned sat
[2024-05-23 23:02:17] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-23 23:02:17] [INFO ] Added : 48 causal constraints over 11 iterations in 92 ms. Result :sat
Minimization took 42 ms.
[2024-05-23 23:02:17] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:17] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:02:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:02:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:17] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 23:02:17] [INFO ] [Nat]Added 16 Read/Feed constraints in 41 ms returned sat
[2024-05-23 23:02:17] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 23:02:18] [INFO ] Added : 71 causal constraints over 16 iterations in 154 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 23:02:18] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:18] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 23:02:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:02:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:18] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:02:18] [INFO ] [Nat]Added 16 Read/Feed constraints in 59 ms returned sat
[2024-05-23 23:02:18] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-23 23:02:18] [INFO ] Added : 58 causal constraints over 12 iterations in 103 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 23:02:18] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:18] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:02:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:02:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:18] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 23:02:18] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-23 23:02:18] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 23:02:18] [INFO ] Added : 78 causal constraints over 17 iterations in 209 ms. Result :sat
Minimization took 37 ms.
[2024-05-23 23:02:18] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-23 23:02:18] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 23:02:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:02:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:02:18] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-23 23:02:18] [INFO ] [Nat]Added 16 Read/Feed constraints in 30 ms returned sat
[2024-05-23 23:02:18] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-23 23:02:19] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-23 23:02:19] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-23 23:02:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 59 ms
[2024-05-23 23:02:19] [INFO ] Added : 72 causal constraints over 16 iterations in 208 ms. Result :sat
Minimization took 38 ms.
[2024-05-23 23:02:19] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:02:19] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 23:02:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:02:19] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:19] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 23:02:19] [INFO ] [Nat]Added 16 Read/Feed constraints in 61 ms returned sat
[2024-05-23 23:02:19] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 23:02:19] [INFO ] Added : 56 causal constraints over 12 iterations in 131 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 23:02:19] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:02:19] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 23:02:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:02:19] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:19] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 23:02:19] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-23 23:02:19] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-23 23:02:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2024-05-23 23:02:19] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 23:02:19] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-23 23:02:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-23 23:02:19] [INFO ] Added : 68 causal constraints over 14 iterations in 193 ms. Result :sat
Minimization took 41 ms.
[2024-05-23 23:02:19] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:02:19] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:02:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:02:19] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:20] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 23:02:20] [INFO ] [Nat]Added 16 Read/Feed constraints in 44 ms returned sat
[2024-05-23 23:02:20] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-23 23:02:20] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-23 23:02:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-23 23:02:20] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-23 23:02:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 83 ms
[2024-05-23 23:02:20] [INFO ] Added : 62 causal constraints over 14 iterations in 224 ms. Result :sat
Minimization took 36 ms.
[2024-05-23 23:02:20] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:20] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 23:02:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:02:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:20] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:02:20] [INFO ] [Nat]Added 16 Read/Feed constraints in 60 ms returned sat
[2024-05-23 23:02:20] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 23:02:20] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-23 23:02:20] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-23 23:02:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 58 ms
[2024-05-23 23:02:20] [INFO ] Added : 61 causal constraints over 14 iterations in 178 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 23:02:20] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:20] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:02:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:02:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:02:20] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-23 23:02:20] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2024-05-23 23:02:20] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 23:02:20] [INFO ] Added : 44 causal constraints over 10 iterations in 118 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 23:02:21] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:21] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 23:02:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:02:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-23 23:02:21] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 23:02:21] [INFO ] [Nat]Added 16 Read/Feed constraints in 41 ms returned sat
[2024-05-23 23:02:21] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 23:02:21] [INFO ] Added : 70 causal constraints over 15 iterations in 126 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 23:02:21] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:21] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:02:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:02:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-23 23:02:21] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2024-05-23 23:02:21] [INFO ] [Nat]Added 16 Read/Feed constraints in 7 ms returned sat
[2024-05-23 23:02:21] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 23:02:21] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-23 23:02:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-23 23:02:21] [INFO ] Added : 43 causal constraints over 9 iterations in 123 ms. Result :sat
Minimization took 21 ms.
[2024-05-23 23:02:21] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:02:21] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:02:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:02:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:02:21] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-23 23:02:21] [INFO ] [Nat]Added 16 Read/Feed constraints in 44 ms returned sat
[2024-05-23 23:02:21] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-23 23:02:22] [INFO ] Added : 53 causal constraints over 11 iterations in 126 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1002, 1001, 1001, 1001, 1000, 1002, 1001, 1001, 1000, 1000, 1000, 1001, 1000, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1002, 1001, 1002, 1002, 1000, 1002, 1001, 1002, 1000, 1002, 1000, 1001, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 12 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 80/80 places, 128/128 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-23 23:03:13] [INFO ] Invariant cache hit.
[2024-05-23 23:03:13] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-23 23:03:13] [INFO ] Invariant cache hit.
[2024-05-23 23:03:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-23 23:03:13] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-23 23:03:13] [INFO ] Redundant transitions in 3 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-23 23:03:13] [INFO ] Invariant cache hit.
[2024-05-23 23:03:13] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1790 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 208 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2189 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 3993ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 3994ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4083 ms. Remains : 80/80 places, 128/128 transitions.
[2024-05-23 23:03:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1002, 1001, 1002, 1002, 1000, 1002, 1001, 1002, 1000, 1002, 1000, 1001, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 1000022 steps (2 resets) in 895 ms. (1116 steps per ms)
FORMULA JoinFreeModules-PT-1000-UpperBounds-00 1003 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 15000014 steps (30 resets) in 16395 ms. (914 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1001, 1002, 1002, 1000, 1002, 1001, 1002, 1000, 1002, 1000, 1001, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2024-05-23 23:03:34] [INFO ] Invariant cache hit.
[2024-05-23 23:03:34] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:03:34] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 23:03:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:03:34] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:03:34] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:03:34] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-23 23:03:34] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-23 23:03:34] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 23:03:34] [INFO ] Added : 48 causal constraints over 10 iterations in 128 ms. Result :sat
Minimization took 45 ms.
[2024-05-23 23:03:34] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:03:34] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 23:03:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:03:34] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-23 23:03:34] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 23:03:34] [INFO ] [Nat]Added 16 Read/Feed constraints in 39 ms returned sat
[2024-05-23 23:03:34] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 23:03:35] [INFO ] Added : 70 causal constraints over 15 iterations in 138 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 23:03:35] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:03:35] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:03:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:03:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:03:35] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 23:03:35] [INFO ] [Nat]Added 16 Read/Feed constraints in 21 ms returned sat
[2024-05-23 23:03:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-23 23:03:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2024-05-23 23:03:35] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:03:35] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 23:03:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:03:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:03:35] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:03:35] [INFO ] [Nat]Added 16 Read/Feed constraints in 41 ms returned sat
[2024-05-23 23:03:35] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 23:03:35] [INFO ] Added : 71 causal constraints over 16 iterations in 153 ms. Result :sat
Minimization took 35 ms.
[2024-05-23 23:03:35] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:03:35] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 23:03:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:03:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:03:35] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:03:35] [INFO ] [Nat]Added 16 Read/Feed constraints in 60 ms returned sat
[2024-05-23 23:03:35] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-23 23:03:35] [INFO ] Added : 58 causal constraints over 12 iterations in 100 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 23:03:35] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:03:36] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 23:03:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:03:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:03:36] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:03:36] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-23 23:03:36] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-23 23:03:36] [INFO ] Added : 78 causal constraints over 17 iterations in 205 ms. Result :sat
Minimization took 43 ms.
[2024-05-23 23:03:36] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:03:36] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 23:03:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:03:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:03:36] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 23:03:36] [INFO ] [Nat]Added 16 Read/Feed constraints in 60 ms returned sat
[2024-05-23 23:03:36] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 23:03:36] [INFO ] Added : 79 causal constraints over 18 iterations in 166 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 23:03:36] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:03:36] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 23:03:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:03:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:03:36] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 23:03:36] [INFO ] [Nat]Added 16 Read/Feed constraints in 61 ms returned sat
[2024-05-23 23:03:36] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-23 23:03:37] [INFO ] Added : 56 causal constraints over 12 iterations in 129 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 23:03:37] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:03:37] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 23:03:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:03:37] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:03:37] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 23:03:37] [INFO ] [Nat]Added 16 Read/Feed constraints in 20 ms returned sat
[2024-05-23 23:03:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-23 23:03:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2024-05-23 23:03:37] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-23 23:03:37] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 23:03:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:03:37] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-23 23:03:37] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 23:03:37] [INFO ] [Nat]Added 16 Read/Feed constraints in 45 ms returned sat
[2024-05-23 23:03:37] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 23:03:37] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-23 23:03:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 23:03:37] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-23 23:03:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 91 ms
[2024-05-23 23:03:37] [INFO ] Added : 62 causal constraints over 14 iterations in 236 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 23:03:37] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:03:37] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 23:03:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:03:37] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:03:37] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 23:03:37] [INFO ] [Nat]Added 16 Read/Feed constraints in 57 ms returned sat
[2024-05-23 23:03:37] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 23:03:37] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-23 23:03:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-23 23:03:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 55 ms
[2024-05-23 23:03:37] [INFO ] Added : 61 causal constraints over 14 iterations in 173 ms. Result :sat
Minimization took 24 ms.
[2024-05-23 23:03:38] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:03:38] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 23:03:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:03:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:03:38] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-23 23:03:38] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2024-05-23 23:03:38] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 23:03:38] [INFO ] Added : 50 causal constraints over 10 iterations in 87 ms. Result :sat
Minimization took 37 ms.
[2024-05-23 23:03:38] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:03:38] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 23:03:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:03:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:03:38] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 23:03:38] [INFO ] [Nat]Added 16 Read/Feed constraints in 42 ms returned sat
[2024-05-23 23:03:38] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 23:03:38] [INFO ] Added : 70 causal constraints over 15 iterations in 123 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 23:03:38] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:03:38] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-23 23:03:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:03:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:03:38] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-05-23 23:03:38] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2024-05-23 23:03:38] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 23:03:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 23:03:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-23 23:03:38] [INFO ] Added : 43 causal constraints over 9 iterations in 119 ms. Result :sat
Minimization took 21 ms.
[2024-05-23 23:03:38] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-23 23:03:39] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 23:03:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:03:39] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-23 23:03:39] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-23 23:03:39] [INFO ] [Nat]Added 16 Read/Feed constraints in 42 ms returned sat
[2024-05-23 23:03:39] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-23 23:03:39] [INFO ] Added : 53 causal constraints over 11 iterations in 115 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1001, 1002, 1002, 1000, 1002, 1001, 1002, 1000, 1002, 1000, 1001, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1002, 1003, 1003, 1003, 1003, 1003, 1002, 1003, 1003, 1003, 1003, 1003, 1003]
FORMULA JoinFreeModules-PT-1000-UpperBounds-09 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-1000-UpperBounds-03 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001, 1002, 1000, 1002, 1001, 1002, 1000, 1000, 1001, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 13 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 65 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 3 ms. Remains 65 /80 variables (removed 15) and now considering 104/128 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 65/80 places, 104/128 transitions.
// Phase 1: matrix 104 rows 65 cols
[2024-05-23 23:04:18] [INFO ] Computed 13 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1001, 1002, 1000, 1002, 1001, 1002, 1000, 1000, 1001, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 1000058 steps (2 resets) in 729 ms. (1369 steps per ms)
BEST_FIRST walk for 13000013 steps (26 resets) in 12042 ms. (1079 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1001, 1002, 1000, 1002, 1001, 1002, 1000, 1000, 1001, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2024-05-23 23:04:31] [INFO ] Invariant cache hit.
[2024-05-23 23:04:31] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 23:04:31] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 23:04:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:04:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 23:04:31] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2024-05-23 23:04:31] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 23:04:31] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-05-23 23:04:31] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 23:04:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-23 23:04:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-23 23:04:31] [INFO ] Added : 50 causal constraints over 11 iterations in 142 ms. Result :sat
Minimization took 19 ms.
[2024-05-23 23:04:31] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 23:04:31] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 23:04:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:04:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 23:04:31] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 23:04:31] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-05-23 23:04:31] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-23 23:04:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-23 23:04:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-23 23:04:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 58 ms
Minimization took 19 ms.
[2024-05-23 23:04:31] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 23:04:31] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 23:04:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:04:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 23:04:31] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 23:04:31] [INFO ] [Nat]Added 13 Read/Feed constraints in 25 ms returned sat
[2024-05-23 23:04:31] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 23:04:32] [INFO ] Added : 47 causal constraints over 10 iterations in 76 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 23:04:32] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 23:04:32] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 23:04:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:04:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 23:04:32] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-23 23:04:32] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2024-05-23 23:04:32] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 2 ms to minimize.
[2024-05-23 23:04:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2024-05-23 23:04:32] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 23:04:32] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 23:04:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:04:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 23:04:32] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2024-05-23 23:04:32] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2024-05-23 23:04:32] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 23:04:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-23 23:04:32] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-23 23:04:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2024-05-23 23:04:32] [INFO ] Added : 57 causal constraints over 12 iterations in 146 ms. Result :sat
Minimization took 24 ms.
[2024-05-23 23:04:32] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 23:04:32] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 23:04:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:04:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 23:04:32] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 23:04:32] [INFO ] [Nat]Added 13 Read/Feed constraints in 67 ms returned sat
[2024-05-23 23:04:32] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 23:04:32] [INFO ] Added : 72 causal constraints over 15 iterations in 130 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 23:04:33] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 23:04:33] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 23:04:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:04:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 23:04:33] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-23 23:04:33] [INFO ] [Nat]Added 13 Read/Feed constraints in 69 ms returned sat
[2024-05-23 23:04:33] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-23 23:04:33] [INFO ] Added : 48 causal constraints over 11 iterations in 119 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 23:04:33] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 23:04:33] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 23:04:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:04:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 23:04:33] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-23 23:04:33] [INFO ] [Nat]Added 13 Read/Feed constraints in 49 ms returned sat
[2024-05-23 23:04:33] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-23 23:04:33] [INFO ] Added : 45 causal constraints over 11 iterations in 85 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 23:04:33] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 23:04:33] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 23:04:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:04:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 23:04:33] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 23:04:33] [INFO ] [Nat]Added 13 Read/Feed constraints in 68 ms returned sat
[2024-05-23 23:04:33] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 23:04:33] [INFO ] Added : 59 causal constraints over 13 iterations in 93 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 23:04:33] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 23:04:33] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 23:04:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:04:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 23:04:34] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 23:04:34] [INFO ] [Nat]Added 13 Read/Feed constraints in 47 ms returned sat
[2024-05-23 23:04:34] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-23 23:04:34] [INFO ] Added : 67 causal constraints over 15 iterations in 122 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 23:04:34] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 23:04:34] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 23:04:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:04:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 23:04:34] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-23 23:04:34] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-05-23 23:04:34] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-23 23:04:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2024-05-23 23:04:34] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 23:04:34] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 23:04:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:04:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 23:04:34] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-23 23:04:34] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-05-23 23:04:34] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 23:04:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-23 23:04:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-23 23:04:34] [INFO ] Added : 62 causal constraints over 14 iterations in 190 ms. Result :sat
Minimization took 22 ms.
[2024-05-23 23:04:34] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 23:04:34] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 23:04:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:04:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 23:04:34] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 23:04:34] [INFO ] [Nat]Added 13 Read/Feed constraints in 79 ms returned sat
[2024-05-23 23:04:34] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 23:04:35] [INFO ] Added : 45 causal constraints over 11 iterations in 110 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1001, 1002, 1000, 1002, 1001, 1002, 1000, 1000, 1001, 1001, 1002, 1002, 1000] Max Struct:[1003, 1002, 1003, 1002, 1003, 1003, 1003, 1003, 1003, 1003, 1002, 1003, 1003]
FORMULA JoinFreeModules-PT-1000-UpperBounds-13 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-1000-UpperBounds-05 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-1000-UpperBounds-02 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1002, 1000, 1001, 1002, 1000, 1000, 1001, 1001, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 10 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 50 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 3 ms. Remains 50 /65 variables (removed 15) and now considering 80/104 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 50/65 places, 80/104 transitions.
// Phase 1: matrix 80 rows 50 cols
[2024-05-23 23:04:56] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1002, 1000, 1001, 1002, 1000, 1000, 1001, 1001, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 1000042 steps (2 resets) in 555 ms. (1798 steps per ms)
BEST_FIRST walk for 10000009 steps (20 resets) in 7349 ms. (1360 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1002, 1000, 1001, 1002, 1000, 1000, 1001, 1001, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2024-05-23 23:05:04] [INFO ] Invariant cache hit.
[2024-05-23 23:05:04] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:04] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 23:05:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:04] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-23 23:05:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-23 23:05:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-23 23:05:04] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-23 23:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2024-05-23 23:05:04] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:04] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 23:05:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:04] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 23:05:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 88 ms returned sat
[2024-05-23 23:05:04] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 23:05:04] [INFO ] Added : 33 causal constraints over 8 iterations in 76 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 23:05:04] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-23 23:05:04] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-23 23:05:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:04] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-23 23:05:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 69 ms returned sat
[2024-05-23 23:05:04] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 23:05:04] [INFO ] Added : 23 causal constraints over 5 iterations in 33 ms. Result :sat
Minimization took 24 ms.
[2024-05-23 23:05:04] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:04] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 23:05:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:04] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-23 23:05:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-23 23:05:05] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2024-05-23 23:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2024-05-23 23:05:05] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:05] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-23 23:05:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-05-23 23:05:05] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 23:05:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 19 ms returned sat
[2024-05-23 23:05:05] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 23:05:05] [INFO ] Added : 23 causal constraints over 6 iterations in 34 ms. Result :sat
Minimization took 23 ms.
[2024-05-23 23:05:05] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:05] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-23 23:05:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:05] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 23:05:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 65 ms returned sat
[2024-05-23 23:05:05] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 23:05:05] [INFO ] Added : 25 causal constraints over 6 iterations in 94 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 23:05:05] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:05] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 23:05:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:05] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-23 23:05:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-23 23:05:05] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 23:05:05] [INFO ] Added : 45 causal constraints over 10 iterations in 109 ms. Result :sat
Minimization took 24 ms.
[2024-05-23 23:05:05] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-05-23 23:05:05] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 23:05:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:05] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-23 23:05:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 37 ms returned sat
[2024-05-23 23:05:05] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 23:05:05] [INFO ] Added : 31 causal constraints over 7 iterations in 43 ms. Result :sat
Minimization took 23 ms.
[2024-05-23 23:05:05] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-05-23 23:05:05] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-23 23:05:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:05] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 23:05:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-23 23:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-23 23:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2024-05-23 23:05:05] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:06] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-23 23:05:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:06] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 23:05:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 105 ms returned sat
[2024-05-23 23:05:06] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 23:05:06] [INFO ] Added : 35 causal constraints over 9 iterations in 56 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1002, 1000, 1001, 1002, 1000, 1000, 1001, 1001, 1002, 1000] Max Struct:[1002, 1003, 1003, 1002, 1003, 1003, 1003, 1003, 1002, 1003]
FORMULA JoinFreeModules-PT-1000-UpperBounds-14 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-1000-UpperBounds-07 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-1000-UpperBounds-01 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000, 1001, 1000, 1000, 1001, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 7 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 35 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 2 ms. Remains 35 /50 variables (removed 15) and now considering 56/80 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 35/50 places, 56/80 transitions.
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 23:05:14] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1000, 1001, 1000, 1000, 1001, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 1000089 steps (2 resets) in 423 ms. (2358 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 3709 ms. (1886 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000, 1001, 1000, 1000, 1001, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2024-05-23 23:05:18] [INFO ] Invariant cache hit.
[2024-05-23 23:05:18] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 23:05:18] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-23 23:05:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 23:05:18] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 23:05:18] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 23:05:18] [INFO ] [Nat]Added 7 Read/Feed constraints in 9 ms returned sat
[2024-05-23 23:05:18] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 23:05:18] [INFO ] Added : 23 causal constraints over 5 iterations in 28 ms. Result :sat
Minimization took 20 ms.
[2024-05-23 23:05:18] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:18] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 23:05:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:18] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 23:05:18] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 23:05:18] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 23:05:18] [INFO ] Added : 27 causal constraints over 6 iterations in 39 ms. Result :sat
Minimization took 18 ms.
[2024-05-23 23:05:18] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:18] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 23:05:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 23:05:18] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 23:05:18] [INFO ] [Nat]Added 7 Read/Feed constraints in 13 ms returned sat
[2024-05-23 23:05:18] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 23:05:18] [INFO ] Added : 17 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 22 ms.
[2024-05-23 23:05:18] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:18] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 23:05:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 23:05:18] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 23:05:18] [INFO ] [Nat]Added 7 Read/Feed constraints in 26 ms returned sat
[2024-05-23 23:05:18] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 23:05:18] [INFO ] Added : 17 causal constraints over 6 iterations in 34 ms. Result :sat
Minimization took 19 ms.
[2024-05-23 23:05:18] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 23:05:18] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 23:05:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 23:05:18] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-23 23:05:18] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-05-23 23:05:18] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 23:05:18] [INFO ] Added : 26 causal constraints over 7 iterations in 63 ms. Result :sat
Minimization took 17 ms.
[2024-05-23 23:05:18] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:18] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 23:05:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 23:05:18] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-23 23:05:18] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 23:05:19] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 23:05:19] [INFO ] Added : 27 causal constraints over 6 iterations in 28 ms. Result :sat
Minimization took 15 ms.
[2024-05-23 23:05:19] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:19] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 23:05:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 23:05:19] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 23:05:19] [INFO ] [Nat]Added 7 Read/Feed constraints in 9 ms returned sat
[2024-05-23 23:05:19] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 23:05:19] [INFO ] Added : 29 causal constraints over 8 iterations in 37 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000, 1001, 1000, 1000, 1001, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000, 1001, 1000, 1000, 1001, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 7 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 35/35 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-23 23:05:23] [INFO ] Invariant cache hit.
[2024-05-23 23:05:23] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-23 23:05:23] [INFO ] Invariant cache hit.
[2024-05-23 23:05:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 23:05:23] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-23 23:05:23] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2024-05-23 23:05:23] [INFO ] Invariant cache hit.
[2024-05-23 23:05:23] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 42 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-23 23:05:24] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 92 constraints, problems are : Problem set: 0 solved, 42 unsolved in 914 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 1/1 constraints]
After SMT, in 1362ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1363ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1450 ms. Remains : 35/35 places, 56/56 transitions.
RANDOM walk for 41257 steps (8 resets) in 75 ms. (542 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 59 ms. (666 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 299776 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 14
Probabilistic random walk after 299776 steps, saw 265596 distinct states, run finished after 3004 ms. (steps per millisecond=99 ) properties seen :0
[2024-05-23 23:05:28] [INFO ] Invariant cache hit.
[2024-05-23 23:05:28] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 23:05:28] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-23 23:05:28] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-23 23:05:28] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-23 23:05:28] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-23 23:05:28] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-23 23:05:28] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-23 23:05:28] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MIN5 is UNSAT
Problem MAX6 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 7/14 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/14 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 56/91 variables, 35/49 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 7/56 constraints. Problems are: Problem set: 8 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/56 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/56 constraints. Problems are: Problem set: 8 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 56 constraints, problems are : Problem set: 8 solved, 6 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 8 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 6/12 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/42 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/48 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 6/54 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/54 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/54 constraints. Problems are: Problem set: 8 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/91 variables, and 54 constraints, problems are : Problem set: 8 solved, 6 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 6/7 constraints, State Equation: 30/35 constraints, ReadFeed: 6/7 constraints, PredecessorRefiner: 6/14 constraints, Known Traps: 6/7 constraints]
After SMT, in 440ms problems are : Problem set: 8 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3619 ms.
Support contains 6 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 30 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 13 ms. Remains 30 /35 variables (removed 5) and now considering 48/56 (removed 8) transitions.
Running 36 sub problems to find dead transitions.
// Phase 1: matrix 48 rows 30 cols
[2024-05-23 23:05:32] [INFO ] Computed 6 invariants in 0 ms
[2024-05-23 23:05:32] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 36 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 78 constraints, problems are : Problem set: 0 solved, 36 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 901ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 901ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 917 ms. Remains : 30/35 places, 48/56 transitions.
RANDOM walk for 41370 steps (8 resets) in 31 ms. (1292 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 29 ms. (1333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 33 ms. (1176 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 523464 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 6
Probabilistic random walk after 523464 steps, saw 451675 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
[2024-05-23 23:05:36] [INFO ] Invariant cache hit.
[2024-05-23 23:05:36] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 6 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 23:05:36] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-23 23:05:36] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-23 23:05:36] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 51 constraints, problems are : Problem set: 0 solved, 6 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 316ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2598 ms.
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 30/30 places, 48/48 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-23 23:05:39] [INFO ] Invariant cache hit.
[2024-05-23 23:05:39] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-23 23:05:39] [INFO ] Invariant cache hit.
[2024-05-23 23:05:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 23:05:39] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-23 23:05:39] [INFO ] Redundant transitions in 1 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-23 23:05:39] [INFO ] Invariant cache hit.
[2024-05-23 23:05:39] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 36 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 78 constraints, problems are : Problem set: 0 solved, 36 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 808ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 809ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 861 ms. Remains : 30/30 places, 48/48 transitions.
FORMULA JoinFreeModules-PT-1000-UpperBounds-12 1002 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[1000, 1001, 1000, 1000, 1001, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003]
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[1000] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1000] Max Struct:[1003]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 23:05:40] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 10344 steps (2 resets) in 5 ms. (1724 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2024-05-23 23:05:40] [INFO ] Invariant cache hit.
[2024-05-23 23:05:40] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 23:05:40] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 23:05:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 23:05:40] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 23:05:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 23:05:40] [INFO ] [Nat]Added 7 Read/Feed constraints in 9 ms returned sat
[2024-05-23 23:05:40] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 23:05:40] [INFO ] Added : 23 causal constraints over 5 iterations in 24 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 23:05:41] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 23:05:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 120ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 23:05:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 1000000 steps (2 resets) in 100 ms. (9900 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 149 ms. (6666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2024-05-23 23:05:41] [INFO ] Invariant cache hit.
[2024-05-23 23:05:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 23:05:41] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-23 23:05:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:05:41] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 23:05:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 23:05:41] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 23:05:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 23:05:41] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-23 23:05:41] [INFO ] Added : 5 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 23:05:41] [INFO ] Invariant cache hit.
[2024-05-23 23:05:41] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-23 23:05:41] [INFO ] Invariant cache hit.
[2024-05-23 23:05:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:05:41] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2024-05-23 23:05:41] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 23:05:41] [INFO ] Invariant cache hit.
[2024-05-23 23:05:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40625 steps (8 resets) in 13 ms. (2901 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1661253 steps, run timeout after 3001 ms. (steps per millisecond=553 ) properties seen :0 out of 2
Probabilistic random walk after 1661253 steps, saw 579908 distinct states, run finished after 3001 ms. (steps per millisecond=553 ) properties seen :0
[2024-05-23 23:05:44] [INFO ] Invariant cache hit.
[2024-05-23 23:05:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 23:05:44] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 73ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-23 23:05:44] [INFO ] Invariant cache hit.
[2024-05-23 23:05:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 41139 steps (8 resets) in 8 ms. (4571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 13 ms. (2857 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4425159 steps, run timeout after 3001 ms. (steps per millisecond=1474 ) properties seen :0 out of 1
Probabilistic random walk after 4425159 steps, saw 1557961 distinct states, run finished after 3001 ms. (steps per millisecond=1474 ) properties seen :0
[2024-05-23 23:05:48] [INFO ] Invariant cache hit.
[2024-05-23 23:05:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 54ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 23:05:48] [INFO ] Invariant cache hit.
[2024-05-23 23:05:48] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-23 23:05:48] [INFO ] Invariant cache hit.
[2024-05-23 23:05:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:05:48] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-23 23:05:48] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 23:05:48] [INFO ] Invariant cache hit.
[2024-05-23 23:05:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 95ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 95ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1000] Max Struct:[1003]
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-04 in 7701 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[1003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[1003]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 23:05:48] [INFO ] Computed 7 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1003]
RANDOM walk for 10808 steps (2 resets) in 8 ms. (1200 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1001] Max Struct:[1003]
[2024-05-23 23:05:48] [INFO ] Invariant cache hit.
[2024-05-23 23:05:48] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 23:05:48] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 23:05:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 23:05:48] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 23:05:48] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 23:05:48] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 23:05:48] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 23:05:48] [INFO ] Added : 27 causal constraints over 6 iterations in 27 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1001] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001] Max Struct:[1003]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 23:05:49] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 23:05:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 100ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 23:05:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1001] Max Struct:[1003]
RANDOM walk for 1000085 steps (2 resets) in 103 ms. (9616 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 224 ms. (4444 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1001] Max Struct:[1003]
[2024-05-23 23:05:49] [INFO ] Invariant cache hit.
[2024-05-23 23:05:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 23:05:49] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-23 23:05:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 23:05:49] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-23 23:05:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:05:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-23 23:05:49] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 23:05:49] [INFO ] Added : 6 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1001] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001] Max Struct:[1003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 23:05:49] [INFO ] Invariant cache hit.
[2024-05-23 23:05:49] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-23 23:05:49] [INFO ] Invariant cache hit.
[2024-05-23 23:05:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:05:49] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-23 23:05:49] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 23:05:49] [INFO ] Invariant cache hit.
[2024-05-23 23:05:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 91ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 41352 steps (8 resets) in 27 ms. (1476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1617154 steps, run timeout after 3001 ms. (steps per millisecond=538 ) properties seen :0 out of 2
Probabilistic random walk after 1617154 steps, saw 564504 distinct states, run finished after 3001 ms. (steps per millisecond=538 ) properties seen :0
[2024-05-23 23:05:52] [INFO ] Invariant cache hit.
[2024-05-23 23:05:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 23:05:52] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 64ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-23 23:05:52] [INFO ] Invariant cache hit.
[2024-05-23 23:05:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 97ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 98ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 41262 steps (8 resets) in 11 ms. (3438 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4551232 steps, run timeout after 3001 ms. (steps per millisecond=1516 ) properties seen :0 out of 1
Probabilistic random walk after 4551232 steps, saw 1602876 distinct states, run finished after 3001 ms. (steps per millisecond=1516 ) properties seen :0
[2024-05-23 23:05:55] [INFO ] Invariant cache hit.
[2024-05-23 23:05:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 60ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 23:05:56] [INFO ] Invariant cache hit.
[2024-05-23 23:05:56] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-23 23:05:56] [INFO ] Invariant cache hit.
[2024-05-23 23:05:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:05:56] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-23 23:05:56] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 23:05:56] [INFO ] Invariant cache hit.
[2024-05-23 23:05:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 90ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1001] Max Struct:[1003]
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-06 in 7960 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[1000] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1000] Max Struct:[1003]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 23:05:56] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 10885 steps (2 resets) in 8 ms. (1209 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2024-05-23 23:05:56] [INFO ] Invariant cache hit.
[2024-05-23 23:05:56] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 23:05:56] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 23:05:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 23:05:56] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 23:05:56] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 23:05:56] [INFO ] [Nat]Added 7 Read/Feed constraints in 8 ms returned sat
[2024-05-23 23:05:56] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 23:05:56] [INFO ] Added : 17 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 23:05:56] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 23:05:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 23:05:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 1000058 steps (2 resets) in 98 ms. (10101 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 147 ms. (6756 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2024-05-23 23:05:57] [INFO ] Invariant cache hit.
[2024-05-23 23:05:57] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 23:05:57] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 23:05:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:05:57] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 23:05:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:05:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 23:05:57] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 23:05:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 23:05:57] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 23:05:57] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 23:05:57] [INFO ] Invariant cache hit.
[2024-05-23 23:05:57] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-23 23:05:57] [INFO ] Invariant cache hit.
[2024-05-23 23:05:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:05:57] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2024-05-23 23:05:57] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 23:05:57] [INFO ] Invariant cache hit.
[2024-05-23 23:05:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 99ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 41023 steps (8 resets) in 11 ms. (3418 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1716700 steps, run timeout after 3001 ms. (steps per millisecond=572 ) properties seen :0 out of 2
Probabilistic random walk after 1716700 steps, saw 600398 distinct states, run finished after 3003 ms. (steps per millisecond=571 ) properties seen :0
[2024-05-23 23:06:00] [INFO ] Invariant cache hit.
[2024-05-23 23:06:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 23:06:00] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 76ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-23 23:06:00] [INFO ] Invariant cache hit.
[2024-05-23 23:06:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 108ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40225 steps (8 resets) in 10 ms. (3656 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 5083095 steps, run timeout after 3001 ms. (steps per millisecond=1693 ) properties seen :0 out of 1
Probabilistic random walk after 5083095 steps, saw 1792152 distinct states, run finished after 3001 ms. (steps per millisecond=1693 ) properties seen :0
[2024-05-23 23:06:03] [INFO ] Invariant cache hit.
[2024-05-23 23:06:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 23:06:03] [INFO ] Invariant cache hit.
[2024-05-23 23:06:03] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-23 23:06:03] [INFO ] Invariant cache hit.
[2024-05-23 23:06:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:06:03] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-23 23:06:03] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 23:06:03] [INFO ] Invariant cache hit.
[2024-05-23 23:06:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1000] Max Struct:[1003]
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-08 in 7679 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[1000] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1000] Max Struct:[1003]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 23:06:03] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 10159 steps (2 resets) in 7 ms. (1269 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2024-05-23 23:06:03] [INFO ] Invariant cache hit.
[2024-05-23 23:06:03] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 23:06:03] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 23:06:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:06:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 23:06:03] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 23:06:03] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 23:06:03] [INFO ] [Nat]Added 7 Read/Feed constraints in 24 ms returned sat
[2024-05-23 23:06:03] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 23:06:04] [INFO ] Added : 17 causal constraints over 6 iterations in 35 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 23:06:04] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 23:06:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 23:06:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 1000164 steps (2 resets) in 137 ms. (7247 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 149 ms. (6666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2024-05-23 23:06:04] [INFO ] Invariant cache hit.
[2024-05-23 23:06:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 23:06:04] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-23 23:06:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:06:04] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 23:06:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:06:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 23:06:04] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 23:06:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 23:06:04] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 23:06:04] [INFO ] Added : 5 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 23:06:04] [INFO ] Invariant cache hit.
[2024-05-23 23:06:04] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-23 23:06:04] [INFO ] Invariant cache hit.
[2024-05-23 23:06:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:06:05] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2024-05-23 23:06:05] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 23:06:05] [INFO ] Invariant cache hit.
[2024-05-23 23:06:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 91ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40583 steps (8 resets) in 11 ms. (3381 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 19 ms. (2000 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1638777 steps, run timeout after 3001 ms. (steps per millisecond=546 ) properties seen :0 out of 2
Probabilistic random walk after 1638777 steps, saw 572186 distinct states, run finished after 3001 ms. (steps per millisecond=546 ) properties seen :0
[2024-05-23 23:06:08] [INFO ] Invariant cache hit.
[2024-05-23 23:06:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 23:06:08] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 67ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-23 23:06:08] [INFO ] Invariant cache hit.
[2024-05-23 23:06:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 97ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 97ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40489 steps (8 resets) in 12 ms. (3114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4702991 steps, run timeout after 3001 ms. (steps per millisecond=1567 ) properties seen :0 out of 1
Probabilistic random walk after 4702991 steps, saw 1655009 distinct states, run finished after 3001 ms. (steps per millisecond=1567 ) properties seen :0
[2024-05-23 23:06:11] [INFO ] Invariant cache hit.
[2024-05-23 23:06:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 53ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 23:06:11] [INFO ] Invariant cache hit.
[2024-05-23 23:06:11] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-23 23:06:11] [INFO ] Invariant cache hit.
[2024-05-23 23:06:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:06:11] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-23 23:06:11] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 23:06:11] [INFO ] Invariant cache hit.
[2024-05-23 23:06:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 100ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1000] Max Struct:[1003]
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-10 in 7659 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[1003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[1003]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 23:06:11] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1003]
RANDOM walk for 10184 steps (2 resets) in 5 ms. (1697 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[210] Max Struct:[1003]
[2024-05-23 23:06:11] [INFO ] Invariant cache hit.
[2024-05-23 23:06:11] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 23:06:11] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 23:06:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:06:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 23:06:11] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 23:06:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 23:06:11] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 23:06:11] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 23:06:11] [INFO ] Added : 28 causal constraints over 6 iterations in 28 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[210] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[999] Max Struct:[1003]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 23:06:12] [INFO ] Computed 1 invariants in 2 ms
[2024-05-23 23:06:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 23:06:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[999] Max Struct:[1003]
RANDOM walk for 1000082 steps (2 resets) in 120 ms. (8265 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 166 ms. (5988 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1001] Max Struct:[1003]
[2024-05-23 23:06:12] [INFO ] Invariant cache hit.
[2024-05-23 23:06:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 23:06:12] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 23:06:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:06:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 23:06:12] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 23:06:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:06:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 23:06:12] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 23:06:12] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1001] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001] Max Struct:[1003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 23:06:12] [INFO ] Invariant cache hit.
[2024-05-23 23:06:12] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 23:06:12] [INFO ] Invariant cache hit.
[2024-05-23 23:06:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:06:12] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-23 23:06:12] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 23:06:12] [INFO ] Invariant cache hit.
[2024-05-23 23:06:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 93ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 93ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 5/5 places, 8/8 transitions.
[2024-05-23 23:06:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1001] Max Struct:[1003]
RANDOM walk for 1000237 steps (2 resets) in 100 ms. (9903 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 167 ms. (5952 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1001] Max Struct:[1003]
[2024-05-23 23:06:13] [INFO ] Invariant cache hit.
[2024-05-23 23:06:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 23:06:13] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 23:06:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:06:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 23:06:13] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-23 23:06:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:06:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 23:06:13] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-23 23:06:13] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1001] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001] Max Struct:[1003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 23:06:13] [INFO ] Invariant cache hit.
[2024-05-23 23:06:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-23 23:06:13] [INFO ] Invariant cache hit.
[2024-05-23 23:06:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:06:13] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-23 23:06:13] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 23:06:13] [INFO ] Invariant cache hit.
[2024-05-23 23:06:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40309 steps (8 resets) in 11 ms. (3359 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1623760 steps, run timeout after 3001 ms. (steps per millisecond=541 ) properties seen :0 out of 2
Probabilistic random walk after 1623760 steps, saw 566816 distinct states, run finished after 3001 ms. (steps per millisecond=541 ) properties seen :0
[2024-05-23 23:06:16] [INFO ] Invariant cache hit.
[2024-05-23 23:06:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 23:06:16] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 73ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-23 23:06:16] [INFO ] Invariant cache hit.
[2024-05-23 23:06:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 94ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40538 steps (8 resets) in 10 ms. (3685 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4486648 steps, run timeout after 3001 ms. (steps per millisecond=1495 ) properties seen :0 out of 1
Probabilistic random walk after 4486648 steps, saw 1579159 distinct states, run finished after 3001 ms. (steps per millisecond=1495 ) properties seen :0
[2024-05-23 23:06:19] [INFO ] Invariant cache hit.
[2024-05-23 23:06:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 23:06:19] [INFO ] Invariant cache hit.
[2024-05-23 23:06:19] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-23 23:06:19] [INFO ] Invariant cache hit.
[2024-05-23 23:06:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:06:19] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-23 23:06:19] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 23:06:19] [INFO ] Invariant cache hit.
[2024-05-23 23:06:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 99ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1001] Max Struct:[1003]
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-11 in 8470 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[1000] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1000] Max Struct:[1003]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 23:06:20] [INFO ] Computed 7 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 10079 steps (2 resets) in 6 ms. (1439 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2024-05-23 23:06:20] [INFO ] Invariant cache hit.
[2024-05-23 23:06:20] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 23:06:20] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 23:06:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:06:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 23:06:20] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 23:06:20] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 23:06:20] [INFO ] [Nat]Added 7 Read/Feed constraints in 8 ms returned sat
[2024-05-23 23:06:20] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 23:06:20] [INFO ] Added : 29 causal constraints over 8 iterations in 35 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 23:06:20] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 23:06:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 23:06:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 1000187 steps (2 resets) in 160 ms. (6212 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 151 ms. (6578 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2024-05-23 23:06:21] [INFO ] Invariant cache hit.
[2024-05-23 23:06:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 23:06:21] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-23 23:06:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:06:21] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 23:06:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 23:06:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 23:06:21] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-23 23:06:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 23:06:21] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 23:06:21] [INFO ] Added : 5 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 23:06:21] [INFO ] Invariant cache hit.
[2024-05-23 23:06:21] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-23 23:06:21] [INFO ] Invariant cache hit.
[2024-05-23 23:06:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:06:21] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2024-05-23 23:06:21] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 23:06:21] [INFO ] Invariant cache hit.
[2024-05-23 23:06:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 99ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40193 steps (8 resets) in 11 ms. (3349 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1425576 steps, run timeout after 3001 ms. (steps per millisecond=475 ) properties seen :0 out of 2
Probabilistic random walk after 1425576 steps, saw 495387 distinct states, run finished after 3001 ms. (steps per millisecond=475 ) properties seen :0
[2024-05-23 23:06:24] [INFO ] Invariant cache hit.
[2024-05-23 23:06:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 23:06:24] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 80ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-23 23:06:24] [INFO ] Invariant cache hit.
[2024-05-23 23:06:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 91ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40249 steps (8 resets) in 11 ms. (3354 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4525845 steps, run timeout after 3001 ms. (steps per millisecond=1508 ) properties seen :0 out of 1
Probabilistic random walk after 4525845 steps, saw 1593713 distinct states, run finished after 3001 ms. (steps per millisecond=1508 ) properties seen :0
[2024-05-23 23:06:27] [INFO ] Invariant cache hit.
[2024-05-23 23:06:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 56ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 23:06:27] [INFO ] Invariant cache hit.
[2024-05-23 23:06:27] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-23 23:06:27] [INFO ] Invariant cache hit.
[2024-05-23 23:06:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:06:27] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2024-05-23 23:06:27] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 23:06:27] [INFO ] Invariant cache hit.
[2024-05-23 23:06:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 110ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 5/5 places, 8/8 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1000] Max Struct:[1003]
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-15 in 7709 ms.
[2024-05-23 23:06:27] [INFO ] Flatten gal took : 36 ms
[2024-05-23 23:06:27] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-23 23:06:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 35 places, 56 transitions and 147 arcs took 3 ms.
Total runtime 505614 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running JoinFreeModules-PT-1000

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 35
TRANSITIONS: 56
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.001s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1932
MODEL NAME: /home/mcc/execution/412/model
35 places, 56 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA JoinFreeModules-PT-1000-UpperBounds-04 1000 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-1000-UpperBounds-10 1000 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-1000-UpperBounds-06 1001 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-1000-UpperBounds-08 1000 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-1000-UpperBounds-11 1001 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA JoinFreeModules-PT-1000-UpperBounds-15 1000 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716507334298

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="JoinFreeModules-PT-1000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is JoinFreeModules-PT-1000, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-tall-171649610600077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-1000.tgz
mv JoinFreeModules-PT-1000 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;