Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r180-tall-171640603000253.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is FunctionPointer-PT-b032, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603000253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 888K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:04 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:26 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 391K 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 FunctionPointer-PT-b032-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-b032-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-b032-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-b032-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-b032-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-b032-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-b032-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-b032-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-b032-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-b032-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-b032-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-b032-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-b032-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-b032-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-b032-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-b032-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716468261144

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b032
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-23 12:44:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 12:44:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 12:44:22] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-23 12:44:22] [INFO ] Transformed 306 places.
[2024-05-23 12:44:22] [INFO ] Transformed 840 transitions.
[2024-05-23 12:44:22] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 84 places in 11 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b032-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:44:22] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2024-05-23 12:44:22] [INFO ] Computed 4 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 32, 1, +inf, +inf, +inf, 32, 32, +inf, +inf]
RANDOM walk for 10000 steps (6 resets) in 44 ms. (222 steps per ms)
FORMULA FunctionPointer-PT-b032-UpperBounds-10 32 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120011 steps (50 resets) in 127 ms. (937 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 38, 1, 31, 0, 8, 5, 1, 6, 4, 6] Max Struct:[+inf, +inf, +inf, +inf, 32, 1, +inf, +inf, +inf, 32, +inf, +inf]
[2024-05-23 12:44:22] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
[2024-05-23 12:44:22] [INFO ] Invariant cache hit.
[2024-05-23 12:44:22] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 12:44:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 12:44:23] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-23 12:44:23] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-23 12:44:23] [INFO ] [Real]Added 65 Read/Feed constraints in 11 ms returned sat
[2024-05-23 12:44:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 12:44:23] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 12:44:23] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-23 12:44:23] [INFO ] [Nat]Added 65 Read/Feed constraints in 14 ms returned sat
[2024-05-23 12:44:23] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 59 ms.
[2024-05-23 12:44:23] [INFO ] Added : 1 causal constraints over 1 iterations in 134 ms. Result :sat
Minimization took 89 ms.
[2024-05-23 12:44:23] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 12:44:23] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-23 12:44:23] [INFO ] [Real]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-23 12:44:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:23] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 12:44:23] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-23 12:44:23] [INFO ] [Nat]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-23 12:44:24] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 18 ms to minimize.
[2024-05-23 12:44:24] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 3 ms to minimize.
[2024-05-23 12:44:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 401 ms
[2024-05-23 12:44:24] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 47 ms.
[2024-05-23 12:44:24] [INFO ] Added : 2 causal constraints over 1 iterations in 103 ms. Result :sat
Minimization took 81 ms.
[2024-05-23 12:44:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 9 ms returned sat
[2024-05-23 12:44:24] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-23 12:44:24] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-23 12:44:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 12:44:24] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-23 12:44:24] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-23 12:44:24] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 2 ms to minimize.
[2024-05-23 12:44:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2024-05-23 12:44:24] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 38 ms.
[2024-05-23 12:44:24] [INFO ] Added : 2 causal constraints over 1 iterations in 91 ms. Result :sat
Minimization took 78 ms.
[2024-05-23 12:44:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 12:44:25] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-23 12:44:25] [INFO ] [Real]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-23 12:44:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 12:44:25] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-23 12:44:25] [INFO ] [Nat]Added 65 Read/Feed constraints in 13 ms returned sat
[2024-05-23 12:44:25] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 41 ms.
[2024-05-23 12:44:25] [INFO ] Added : 2 causal constraints over 1 iterations in 86 ms. Result :sat
Minimization took 78 ms.
[2024-05-23 12:44:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 12:44:25] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-23 12:44:25] [INFO ] [Real]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-23 12:44:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 12:44:25] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-23 12:44:25] [INFO ] [Nat]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-23 12:44:25] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 36 ms.
[2024-05-23 12:44:25] [INFO ] Added : 0 causal constraints over 0 iterations in 70 ms. Result :sat
Minimization took 82 ms.
[2024-05-23 12:44:26] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 12:44:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 12:44:26] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-23 12:44:26] [INFO ] [Real]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-23 12:44:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 12:44:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 12:44:26] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-23 12:44:26] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-23 12:44:26] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 31 ms.
[2024-05-23 12:44:26] [INFO ] Added : 1 causal constraints over 1 iterations in 90 ms. Result :sat
Minimization took 79 ms.
[2024-05-23 12:44:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 12:44:26] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-23 12:44:26] [INFO ] [Real]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-23 12:44:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 12:44:26] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-23 12:44:26] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-23 12:44:26] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-23 12:44:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-05-23 12:44:26] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 28 ms.
[2024-05-23 12:44:26] [INFO ] Added : 2 causal constraints over 1 iterations in 79 ms. Result :sat
Minimization took 81 ms.
[2024-05-23 12:44:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:27] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 12:44:27] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-23 12:44:27] [INFO ] [Real]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-23 12:44:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:27] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 12:44:27] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-23 12:44:27] [INFO ] [Nat]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-23 12:44:27] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 1 ms to minimize.
[2024-05-23 12:44:27] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-23 12:44:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 232 ms
[2024-05-23 12:44:27] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 26 ms.
[2024-05-23 12:44:27] [INFO ] Added : 1 causal constraints over 1 iterations in 82 ms. Result :sat
Minimization took 76 ms.
[2024-05-23 12:44:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:27] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 12:44:28] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-23 12:44:28] [INFO ] [Real]Added 65 Read/Feed constraints in 19 ms returned sat
[2024-05-23 12:44:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 12:44:28] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-23 12:44:28] [INFO ] [Nat]Added 65 Read/Feed constraints in 17 ms returned sat
[2024-05-23 12:44:28] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 27 ms.
[2024-05-23 12:44:28] [INFO ] Added : 2 causal constraints over 1 iterations in 72 ms. Result :sat
Minimization took 80 ms.
[2024-05-23 12:44:28] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 12:44:28] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-23 12:44:28] [INFO ] [Real]Added 65 Read/Feed constraints in 6 ms returned sat
[2024-05-23 12:44:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 12:44:28] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-23 12:44:28] [INFO ] [Nat]Added 65 Read/Feed constraints in 6 ms returned sat
[2024-05-23 12:44:28] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 25 ms.
[2024-05-23 12:44:28] [INFO ] Added : 0 causal constraints over 0 iterations in 49 ms. Result :sat
Minimization took 77 ms.
[2024-05-23 12:44:28] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 12:44:28] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-23 12:44:28] [INFO ] [Real]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-23 12:44:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 12:44:29] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-23 12:44:29] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-23 12:44:29] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 31 ms.
[2024-05-23 12:44:29] [INFO ] Added : 1 causal constraints over 1 iterations in 74 ms. Result :sat
Minimization took 74 ms.
[2024-05-23 12:44:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:29] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 12:44:29] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-23 12:44:29] [INFO ] [Real]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-23 12:44:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 12:44:29] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 12:44:29] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-23 12:44:29] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-23 12:44:29] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 34 ms.
[2024-05-23 12:44:29] [INFO ] Added : 1 causal constraints over 1 iterations in 77 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 38, 1, 31, 0, 8, 5, 1, 6, 4, 6] Max Struct:[+inf, +inf, +inf, +inf, 32, 1, +inf, +inf, +inf, 32, +inf, +inf]
FORMULA FunctionPointer-PT-b032-UpperBounds-11 32 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-b032-UpperBounds-05 32 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 38, 1, 0, 31, 5, 1, 4, 6] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 194 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 194 transition count 610
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 66 place count 167 transition count 464
Iterating global reduction 1 with 27 rules applied. Total rules applied 93 place count 167 transition count 464
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 133 place count 167 transition count 424
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 147 place count 153 transition count 396
Iterating global reduction 2 with 14 rules applied. Total rules applied 161 place count 153 transition count 396
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 169 place count 153 transition count 388
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 174 place count 148 transition count 378
Iterating global reduction 3 with 5 rules applied. Total rules applied 179 place count 148 transition count 378
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 184 place count 143 transition count 358
Iterating global reduction 3 with 5 rules applied. Total rules applied 189 place count 143 transition count 358
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 194 place count 138 transition count 348
Iterating global reduction 3 with 5 rules applied. Total rules applied 199 place count 138 transition count 348
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 204 place count 133 transition count 328
Iterating global reduction 3 with 5 rules applied. Total rules applied 209 place count 133 transition count 328
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 214 place count 128 transition count 308
Iterating global reduction 3 with 5 rules applied. Total rules applied 219 place count 128 transition count 308
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 224 place count 123 transition count 298
Iterating global reduction 3 with 5 rules applied. Total rules applied 229 place count 123 transition count 298
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 234 place count 118 transition count 288
Iterating global reduction 3 with 5 rules applied. Total rules applied 239 place count 118 transition count 288
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 244 place count 113 transition count 278
Iterating global reduction 3 with 5 rules applied. Total rules applied 249 place count 113 transition count 278
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 254 place count 108 transition count 268
Iterating global reduction 3 with 5 rules applied. Total rules applied 259 place count 108 transition count 268
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 261 place count 106 transition count 264
Iterating global reduction 3 with 2 rules applied. Total rules applied 263 place count 106 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 269 place count 106 transition count 258
Applied a total of 269 rules in 123 ms. Remains 106 /222 variables (removed 116) and now considering 258/648 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 106/222 places, 258/648 transitions.
[2024-05-23 12:44:30] [INFO ] Flow matrix only has 172 transitions (discarded 86 similar events)
Found an invariant !
This invariant on transitions {30=1, 80=1, 133=1, 171=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {28=1, 78=1, 115=1, 159=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :[5, 3, 8, 3, 1, 5, 8, 4, 10, 7]
Current structural bounds on expressions (after cover walk) : Max Seen:[5, 3, 38, 3, 1, 31, 8, 4, 10, 7] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:44:30] [INFO ] Flow matrix only has 172 transitions (discarded 86 similar events)
// Phase 1: matrix 172 rows 106 cols
[2024-05-23 12:44:30] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5, 3, 38, 3, 1, 31, 8, 4, 10, 7] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf, +inf, +inf, +inf, +inf]
FORMULA FunctionPointer-PT-b032-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1147 ms. (871 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 7168 ms. (1255 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[685, 76, 38, 183, 31, 211, 63, 640, 628] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:44:38] [INFO ] Flow matrix only has 172 transitions (discarded 86 similar events)
[2024-05-23 12:44:38] [INFO ] Invariant cache hit.
[2024-05-23 12:44:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:38] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:44:38] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-23 12:44:38] [INFO ] [Real]Added 34 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:44:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:38] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:44:38] [INFO ] [Nat]Added 34 Read/Feed constraints in 7 ms returned sat
[2024-05-23 12:44:38] [INFO ] Computed and/alt/rep : 38/107/36 causal constraints (skipped 134 transitions) in 22 ms.
[2024-05-23 12:44:38] [INFO ] Added : 1 causal constraints over 1 iterations in 54 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 12:44:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:38] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-23 12:44:38] [INFO ] [Real]Added 34 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:44:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:38] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-23 12:44:38] [INFO ] [Nat]Added 34 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:44:38] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-23 12:44:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-05-23 12:44:38] [INFO ] Computed and/alt/rep : 38/107/36 causal constraints (skipped 134 transitions) in 9 ms.
[2024-05-23 12:44:39] [INFO ] Added : 8 causal constraints over 3 iterations in 60 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 12:44:39] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:39] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 12:44:39] [INFO ] [Real]Added 34 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:44:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:39] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 12:44:39] [INFO ] [Nat]Added 34 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:44:39] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-23 12:44:39] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-23 12:44:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
[2024-05-23 12:44:39] [INFO ] Computed and/alt/rep : 38/107/36 causal constraints (skipped 134 transitions) in 9 ms.
[2024-05-23 12:44:39] [INFO ] Added : 2 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 24 ms.
[2024-05-23 12:44:39] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:39] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 12:44:39] [INFO ] [Real]Added 34 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:44:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:39] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:44:39] [INFO ] [Nat]Added 34 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:44:39] [INFO ] Computed and/alt/rep : 38/107/36 causal constraints (skipped 134 transitions) in 9 ms.
[2024-05-23 12:44:39] [INFO ] Added : 12 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 12:44:39] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:39] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:44:39] [INFO ] [Real]Added 34 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:44:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:39] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:44:39] [INFO ] [Nat]Added 34 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:44:39] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-23 12:44:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-23 12:44:39] [INFO ] Computed and/alt/rep : 38/107/36 causal constraints (skipped 134 transitions) in 9 ms.
[2024-05-23 12:44:39] [INFO ] Added : 2 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 12:44:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 12:44:39] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-23 12:44:40] [INFO ] [Real]Added 34 Read/Feed constraints in 13 ms returned sat
[2024-05-23 12:44:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:40] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:44:40] [INFO ] [Nat]Added 34 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:44:40] [INFO ] Computed and/alt/rep : 38/107/36 causal constraints (skipped 134 transitions) in 10 ms.
[2024-05-23 12:44:40] [INFO ] Added : 1 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 22 ms.
[2024-05-23 12:44:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:40] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-23 12:44:40] [INFO ] [Real]Added 34 Read/Feed constraints in 8 ms returned sat
[2024-05-23 12:44:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:40] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-23 12:44:40] [INFO ] [Nat]Added 34 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:44:40] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2024-05-23 12:44:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-05-23 12:44:40] [INFO ] Computed and/alt/rep : 38/107/36 causal constraints (skipped 134 transitions) in 14 ms.
[2024-05-23 12:44:40] [INFO ] Added : 12 causal constraints over 4 iterations in 82 ms. Result :sat
Minimization took 45 ms.
[2024-05-23 12:44:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:40] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-23 12:44:40] [INFO ] [Real]Added 34 Read/Feed constraints in 6 ms returned sat
[2024-05-23 12:44:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:40] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-23 12:44:40] [INFO ] [Nat]Added 34 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:44:40] [INFO ] Computed and/alt/rep : 38/107/36 causal constraints (skipped 134 transitions) in 14 ms.
[2024-05-23 12:44:40] [INFO ] Added : 1 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 12:44:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:40] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 12:44:41] [INFO ] [Real]Added 34 Read/Feed constraints in 6 ms returned sat
[2024-05-23 12:44:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:41] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-23 12:44:41] [INFO ] [Nat]Added 34 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:44:41] [INFO ] Computed and/alt/rep : 38/107/36 causal constraints (skipped 134 transitions) in 10 ms.
[2024-05-23 12:44:41] [INFO ] Added : 1 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[685, 76, 38, 183, 31, 211, 63, 640, 628] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[685, 76, 38, 183, 31, 211, 63, 640, 628] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 258/258 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 104 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 104 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 103 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 103 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 102 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 102 transition count 248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 101 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 101 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 100 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 99 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 98 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 97 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 97 transition count 236
Applied a total of 18 rules in 29 ms. Remains 97 /106 variables (removed 9) and now considering 236/258 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 97/106 places, 236/258 transitions.
[2024-05-23 12:44:42] [INFO ] Flow matrix only has 157 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {24=1, 33=1, 76=1, 88=1, 111=1, 140=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {28=1, 71=1, 122=1, 152=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 9) seen :[6, 3, 9, 3, 8, 11, 5, 11, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[685, 76, 38, 183, 31, 211, 63, 640, 628] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:44:42] [INFO ] Flow matrix only has 157 transitions (discarded 79 similar events)
// Phase 1: matrix 157 rows 97 cols
[2024-05-23 12:44:42] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[685, 76, 38, 183, 31, 211, 63, 640, 628] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1143 ms. (874 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 6998 ms. (1285 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[691, 100, 38, 216, 31, 211, 71, 640, 628] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:44:50] [INFO ] Flow matrix only has 157 transitions (discarded 79 similar events)
[2024-05-23 12:44:50] [INFO ] Invariant cache hit.
[2024-05-23 12:44:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:50] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:44:50] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-23 12:44:50] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:44:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:50] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:44:50] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:44:50] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-23 12:44:50] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-23 12:44:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2024-05-23 12:44:50] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 8 ms.
[2024-05-23 12:44:50] [INFO ] Added : 1 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 24 ms.
[2024-05-23 12:44:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:50] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:44:50] [INFO ] [Real]Added 32 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:44:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:50] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:44:50] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:44:50] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-23 12:44:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-23 12:44:51] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 10 ms.
[2024-05-23 12:44:51] [INFO ] Added : 8 causal constraints over 3 iterations in 43 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 12:44:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:51] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:44:51] [INFO ] [Real]Added 32 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:44:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:51] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:44:51] [INFO ] [Nat]Added 32 Read/Feed constraints in 7 ms returned sat
[2024-05-23 12:44:51] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-23 12:44:51] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-23 12:44:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2024-05-23 12:44:51] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 13 ms.
[2024-05-23 12:44:51] [INFO ] Added : 2 causal constraints over 1 iterations in 33 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 12:44:51] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:51] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:44:51] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:44:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:51] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:44:51] [INFO ] [Nat]Added 32 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:44:51] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2024-05-23 12:44:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-23 12:44:51] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 8 ms.
[2024-05-23 12:44:51] [INFO ] Added : 8 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 12:44:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:51] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:44:51] [INFO ] [Real]Added 32 Read/Feed constraints in 6 ms returned sat
[2024-05-23 12:44:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:51] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:44:51] [INFO ] [Nat]Added 32 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:44:51] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2024-05-23 12:44:51] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2024-05-23 12:44:51] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-23 12:44:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 170 ms
[2024-05-23 12:44:51] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 8 ms.
[2024-05-23 12:44:51] [INFO ] Added : 2 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 12:44:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:52] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:44:52] [INFO ] [Real]Added 32 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:44:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:52] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 12:44:52] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:44:52] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-23 12:44:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-05-23 12:44:52] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 12 ms.
[2024-05-23 12:44:52] [INFO ] Added : 1 causal constraints over 1 iterations in 35 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 12:44:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:52] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 12:44:52] [INFO ] [Real]Added 32 Read/Feed constraints in 6 ms returned sat
[2024-05-23 12:44:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:52] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 12:44:52] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:44:52] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-23 12:44:52] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-23 12:44:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2024-05-23 12:44:52] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 10 ms.
[2024-05-23 12:44:52] [INFO ] Added : 7 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 12:44:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:52] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:44:52] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:44:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:44:52] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:44:52] [INFO ] [Nat]Added 32 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:44:52] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-23 12:44:52] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-23 12:44:52] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-23 12:44:52] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-23 12:44:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 214 ms
[2024-05-23 12:44:53] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 11 ms.
[2024-05-23 12:44:53] [INFO ] Added : 1 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:44:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:53] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:44:53] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:44:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:44:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:44:53] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:44:53] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:44:53] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-23 12:44:53] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-23 12:44:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2024-05-23 12:44:53] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 10 ms.
[2024-05-23 12:44:53] [INFO ] Added : 1 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[691, 100, 38, 216, 31, 211, 71, 640, 628] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[691, 100, 38, 216, 32, 211, 71, 640, 628] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 236/236 transitions.
Applied a total of 0 rules in 16 ms. Remains 97 /97 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 97/97 places, 236/236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 236/236 transitions.
Applied a total of 0 rules in 6 ms. Remains 97 /97 variables (removed 0) and now considering 236/236 (removed 0) transitions.
[2024-05-23 12:44:53] [INFO ] Flow matrix only has 157 transitions (discarded 79 similar events)
[2024-05-23 12:44:53] [INFO ] Invariant cache hit.
[2024-05-23 12:44:53] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-23 12:44:53] [INFO ] Flow matrix only has 157 transitions (discarded 79 similar events)
[2024-05-23 12:44:53] [INFO ] Invariant cache hit.
[2024-05-23 12:44:53] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-23 12:44:53] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-23 12:44:53] [INFO ] Redundant transitions in 8 ms returned []
Running 234 sub problems to find dead transitions.
[2024-05-23 12:44:53] [INFO ] Flow matrix only has 157 transitions (discarded 79 similar events)
[2024-05-23 12:44:53] [INFO ] Invariant cache hit.
[2024-05-23 12:44:53] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 157/254 variables, 97/100 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 32/132 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 0/254 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 132 constraints, problems are : Problem set: 0 solved, 234 unsolved in 4068 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 157/254 variables, 97/100 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 32/132 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 234/366 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 0/254 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 366 constraints, problems are : Problem set: 0 solved, 234 unsolved in 7049 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 11400ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 11409ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11626 ms. Remains : 97/97 places, 236/236 transitions.
[2024-05-23 12:45:05] [INFO ] Flow matrix only has 157 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {24=1, 33=1, 76=1, 88=1, 111=1, 140=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {28=1, 71=1, 122=1, 152=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :[9, 2, 5, 4, 8, 8, 6, 13, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[691, 100, 38, 216, 32, 211, 71, 640, 628] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:45:05] [INFO ] Flow matrix only has 157 transitions (discarded 79 similar events)
[2024-05-23 12:45:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[691, 100, 38, 216, 32, 211, 71, 640, 628] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1179 ms. (847 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 6849 ms. (1313 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[765, 100, 38, 216, 32, 214, 86, 832, 779] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:45:13] [INFO ] Flow matrix only has 157 transitions (discarded 79 similar events)
[2024-05-23 12:45:13] [INFO ] Invariant cache hit.
[2024-05-23 12:45:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:13] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:45:13] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-23 12:45:13] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:13] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:45:13] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:13] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-23 12:45:13] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-23 12:45:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2024-05-23 12:45:13] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 12 ms.
[2024-05-23 12:45:13] [INFO ] Added : 1 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 12:45:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:13] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:45:13] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:13] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:45:13] [INFO ] [Nat]Added 32 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:45:13] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-23 12:45:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-23 12:45:13] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 8 ms.
[2024-05-23 12:45:13] [INFO ] Added : 8 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 12:45:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:13] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:45:13] [INFO ] [Real]Added 32 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:45:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:13] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:45:13] [INFO ] [Nat]Added 32 Read/Feed constraints in 10 ms returned sat
[2024-05-23 12:45:14] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-23 12:45:14] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 2 ms to minimize.
[2024-05-23 12:45:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2024-05-23 12:45:14] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 8 ms.
[2024-05-23 12:45:14] [INFO ] Added : 2 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 12:45:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:14] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:45:14] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:14] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:45:14] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:14] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 4 ms to minimize.
[2024-05-23 12:45:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-23 12:45:14] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 9 ms.
[2024-05-23 12:45:14] [INFO ] Added : 8 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 12:45:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:14] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:45:14] [INFO ] [Real]Added 32 Read/Feed constraints in 6 ms returned sat
[2024-05-23 12:45:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:14] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:45:14] [INFO ] [Nat]Added 32 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:45:14] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-23 12:45:14] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-23 12:45:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2024-05-23 12:45:14] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 10 ms.
[2024-05-23 12:45:14] [INFO ] Added : 3 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 12:45:14] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:14] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:45:14] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:14] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:45:14] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:14] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-23 12:45:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-23 12:45:14] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 8 ms.
[2024-05-23 12:45:14] [INFO ] Added : 1 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 12:45:15] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:15] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:45:15] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:15] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:45:15] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:15] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-23 12:45:15] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-23 12:45:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2024-05-23 12:45:15] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 8 ms.
[2024-05-23 12:45:15] [INFO ] Added : 7 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:45:15] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:15] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 12:45:15] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:15] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:45:15] [INFO ] [Nat]Added 32 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:45:15] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-23 12:45:15] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-23 12:45:15] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-23 12:45:15] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-23 12:45:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 224 ms
[2024-05-23 12:45:15] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 8 ms.
[2024-05-23 12:45:15] [INFO ] Added : 1 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 12:45:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:15] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 12:45:15] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:15] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:45:15] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:15] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-23 12:45:15] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-23 12:45:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2024-05-23 12:45:15] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 9 ms.
[2024-05-23 12:45:16] [INFO ] Added : 1 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[765, 100, 38, 216, 32, 214, 86, 832, 779] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[765, 100, 38, 216, 32, 214, 86, 832, 779] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 236/236 transitions.
Applied a total of 0 rules in 7 ms. Remains 97 /97 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 97/97 places, 236/236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 236/236 transitions.
Applied a total of 0 rules in 7 ms. Remains 97 /97 variables (removed 0) and now considering 236/236 (removed 0) transitions.
[2024-05-23 12:45:16] [INFO ] Flow matrix only has 157 transitions (discarded 79 similar events)
[2024-05-23 12:45:16] [INFO ] Invariant cache hit.
[2024-05-23 12:45:16] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-23 12:45:16] [INFO ] Flow matrix only has 157 transitions (discarded 79 similar events)
[2024-05-23 12:45:16] [INFO ] Invariant cache hit.
[2024-05-23 12:45:16] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-23 12:45:16] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-23 12:45:16] [INFO ] Redundant transitions in 10 ms returned []
Running 234 sub problems to find dead transitions.
[2024-05-23 12:45:16] [INFO ] Flow matrix only has 157 transitions (discarded 79 similar events)
[2024-05-23 12:45:16] [INFO ] Invariant cache hit.
[2024-05-23 12:45:16] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 157/254 variables, 97/100 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 32/132 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 0/254 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 132 constraints, problems are : Problem set: 0 solved, 234 unsolved in 3975 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 157/254 variables, 97/100 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 32/132 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 234/366 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 0/254 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 366 constraints, problems are : Problem set: 0 solved, 234 unsolved in 7091 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 11252ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 11255ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11482 ms. Remains : 97/97 places, 236/236 transitions.
[2024-05-23 12:45:27] [INFO ] Flow matrix only has 157 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {24=1, 33=1, 76=1, 88=1, 111=1, 140=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {28=1, 71=1, 122=1, 152=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :[11, 6, 6, 4, 2147483647, 7, 3, 7, 7]
Current structural bounds on expressions (after cover walk) : Max Seen:[765, 100, 38, 216, +inf, 214, 86, 832, 779] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:45:27] [INFO ] Flow matrix only has 157 transitions (discarded 79 similar events)
[2024-05-23 12:45:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[765, 100, 38, 216, +inf, 214, 86, 832, 779] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1249 ms. (800 steps per ms)
FORMULA FunctionPointer-PT-b032-UpperBounds-07 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 8000008 steps (16 resets) in 5857 ms. (1365 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[765, 100, 38, 216, 214, 86, 832, 779] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:45:34] [INFO ] Flow matrix only has 157 transitions (discarded 79 similar events)
[2024-05-23 12:45:34] [INFO ] Invariant cache hit.
[2024-05-23 12:45:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:34] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:45:34] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-23 12:45:34] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:34] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:45:34] [INFO ] [Nat]Added 32 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:45:34] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-23 12:45:35] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-23 12:45:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2024-05-23 12:45:35] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 8 ms.
[2024-05-23 12:45:35] [INFO ] Added : 1 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 12:45:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:35] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:45:35] [INFO ] [Real]Added 32 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:45:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:35] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-23 12:45:35] [INFO ] [Nat]Added 32 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:45:35] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-05-23 12:45:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-23 12:45:35] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 11 ms.
[2024-05-23 12:45:35] [INFO ] Added : 8 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 12:45:35] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:35] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:45:35] [INFO ] [Real]Added 32 Read/Feed constraints in 6 ms returned sat
[2024-05-23 12:45:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:35] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:45:35] [INFO ] [Nat]Added 32 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:45:35] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-23 12:45:35] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-23 12:45:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2024-05-23 12:45:35] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 8 ms.
[2024-05-23 12:45:35] [INFO ] Added : 2 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:45:35] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:35] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:45:35] [INFO ] [Real]Added 32 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:45:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:35] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-23 12:45:35] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:35] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2024-05-23 12:45:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-23 12:45:35] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 8 ms.
[2024-05-23 12:45:35] [INFO ] Added : 8 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 12:45:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:35] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 12:45:35] [INFO ] [Real]Added 32 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:45:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:36] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:45:36] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:36] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-23 12:45:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-23 12:45:36] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 8 ms.
[2024-05-23 12:45:36] [INFO ] Added : 1 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 12:45:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:36] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:45:36] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:36] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:45:36] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:36] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-23 12:45:36] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-23 12:45:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2024-05-23 12:45:36] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 7 ms.
[2024-05-23 12:45:36] [INFO ] Added : 7 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:45:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:36] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:45:36] [INFO ] [Real]Added 32 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:45:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:36] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:45:36] [INFO ] [Nat]Added 32 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:45:36] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-23 12:45:36] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
[2024-05-23 12:45:36] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-23 12:45:36] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-23 12:45:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 188 ms
[2024-05-23 12:45:36] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 7 ms.
[2024-05-23 12:45:36] [INFO ] Added : 1 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 12:45:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:36] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:45:36] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:36] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:45:36] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:36] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-23 12:45:37] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-23 12:45:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2024-05-23 12:45:37] [INFO ] Computed and/alt/rep : 32/69/30 causal constraints (skipped 125 transitions) in 8 ms.
[2024-05-23 12:45:37] [INFO ] Added : 1 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[765, 100, 38, 216, 214, 86, 832, 779] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[765, 100, 38, 216, 214, 86, 832, 779] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 236/236 transitions.
Graph (complete) has 408 edges and 97 vertex of which 94 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 94 transition count 231
Applied a total of 6 rules in 6 ms. Remains 94 /97 variables (removed 3) and now considering 231/236 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 94/97 places, 231/236 transitions.
[2024-05-23 12:45:37] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {24=1, 31=1, 74=1, 86=1, 124=1, 145=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 69=1, 119=1, 147=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :[15, 4, 4, 3, 8, 4, 7, 7]
Current structural bounds on expressions (after cover walk) : Max Seen:[765, 100, 38, 216, 214, 86, 832, 779] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:45:37] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
// Phase 1: matrix 152 rows 94 cols
[2024-05-23 12:45:37] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[765, 100, 38, 216, 214, 86, 832, 779] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1077 ms. (927 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 5637 ms. (1418 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[792, 101, 38, 219, 214, 86, 832, 779] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:45:43] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:45:43] [INFO ] Invariant cache hit.
[2024-05-23 12:45:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:43] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:45:43] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-23 12:45:43] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:45:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:44] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:45:44] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:45:44] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-23 12:45:44] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-23 12:45:44] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-23 12:45:44] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:45:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 195 ms
[2024-05-23 12:45:44] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 10 ms.
[2024-05-23 12:45:44] [INFO ] Added : 6 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 12:45:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:44] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:45:44] [INFO ] [Real]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:44] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:45:44] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:45:44] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 10 ms.
[2024-05-23 12:45:44] [INFO ] Added : 10 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 12:45:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:44] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:45:44] [INFO ] [Real]Added 29 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:45:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:44] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:45:44] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:45:44] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:45:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-23 12:45:44] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:45:44] [INFO ] Added : 5 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:45:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:44] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:45:44] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:45:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:44] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:45:44] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:45:44] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:45:44] [INFO ] Added : 19 causal constraints over 5 iterations in 57 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 12:45:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:45] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-23 12:45:45] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:45:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:45] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:45:45] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:45:45] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-23 12:45:45] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-23 12:45:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2024-05-23 12:45:45] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 9 ms.
[2024-05-23 12:45:45] [INFO ] Added : 10 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 12:45:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:45] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:45:45] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:45:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:45] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:45:45] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:45:45] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-23 12:45:45] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-23 12:45:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2024-05-23 12:45:45] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 9 ms.
[2024-05-23 12:45:45] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2024-05-23 12:45:45] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:45:45] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2024-05-23 12:45:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 162 ms
[2024-05-23 12:45:45] [INFO ] Added : 27 causal constraints over 6 iterations in 236 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 12:45:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:45] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:45:45] [INFO ] [Real]Added 29 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:45:45] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:45:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:45] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:45:45] [INFO ] [Nat]Added 29 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:45:45] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:45:46] [INFO ] Added : 25 causal constraints over 8 iterations in 80 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 12:45:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:45:46] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 12:45:46] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:45:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:45:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:45:46] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:45:46] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:45:46] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2024-05-23 12:45:46] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-23 12:45:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-05-23 12:45:46] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 7 ms.
[2024-05-23 12:45:46] [INFO ] Added : 9 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[792, 101, 38, 219, 214, 86, 832, 779] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[792, 101, 38, 219, 214, 86, 832, 779] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 231/231 transitions.
Applied a total of 0 rules in 12 ms. Remains 94 /94 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 94/94 places, 231/231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 231/231 transitions.
Applied a total of 0 rules in 4 ms. Remains 94 /94 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2024-05-23 12:45:50] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:45:50] [INFO ] Invariant cache hit.
[2024-05-23 12:45:50] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 12:45:50] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:45:50] [INFO ] Invariant cache hit.
[2024-05-23 12:45:50] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-23 12:45:50] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-23 12:45:50] [INFO ] Redundant transitions in 3 ms returned []
Running 229 sub problems to find dead transitions.
[2024-05-23 12:45:50] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:45:50] [INFO ] Invariant cache hit.
[2024-05-23 12:45:50] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 152/246 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 229 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 29/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 0/246 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 126 constraints, problems are : Problem set: 0 solved, 229 unsolved in 3774 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 152/246 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 29/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 229/355 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 355 constraints, problems are : Problem set: 0 solved, 229 unsolved in 6468 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
After SMT, in 10415ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 10417ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10621 ms. Remains : 94/94 places, 231/231 transitions.
[2024-05-23 12:46:00] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {24=1, 31=1, 74=1, 86=1, 124=1, 145=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 69=1, 119=1, 147=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :[11, 2, 6, 4, 20, 2, 8, 10]
Current structural bounds on expressions (after cover walk) : Max Seen:[792, 101, 38, 219, 214, 86, 832, 779] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:46:00] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:46:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[792, 101, 38, 219, 214, 86, 832, 779] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 925 ms. (1079 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 5631 ms. (1420 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[792, 118, 38, 231, 307, 98, 832, 875] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:46:07] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:46:07] [INFO ] Invariant cache hit.
[2024-05-23 12:46:07] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:46:07] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:46:07] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-23 12:46:07] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:46:07] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:46:07] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:07] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-23 12:46:07] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-23 12:46:07] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:46:07] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-23 12:46:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 183 ms
[2024-05-23 12:46:07] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 7 ms.
[2024-05-23 12:46:07] [INFO ] Added : 6 causal constraints over 4 iterations in 46 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:46:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:07] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:46:07] [INFO ] [Real]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:46:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:08] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:46:08] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:46:08] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 9 ms.
[2024-05-23 12:46:08] [INFO ] Added : 10 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:46:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:08] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:46:08] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:46:08] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:46:08] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:08] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-23 12:46:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-23 12:46:08] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:46:08] [INFO ] Added : 5 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 12:46:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:46:08] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:46:08] [INFO ] [Real]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:46:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:08] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:46:08] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:46:08] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:46:08] [INFO ] Added : 19 causal constraints over 5 iterations in 54 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 12:46:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:46:08] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:46:08] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:08] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:46:08] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:08] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-23 12:46:08] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-23 12:46:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2024-05-23 12:46:08] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 7 ms.
[2024-05-23 12:46:08] [INFO ] Added : 10 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 12:46:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:46:08] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:46:08] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:08] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:46:08] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:09] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:46:09] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-23 12:46:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2024-05-23 12:46:09] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:46:09] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-23 12:46:09] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-23 12:46:09] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-23 12:46:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 144 ms
[2024-05-23 12:46:09] [INFO ] Added : 27 causal constraints over 6 iterations in 220 ms. Result :sat
Minimization took 37 ms.
[2024-05-23 12:46:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:09] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:46:09] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:09] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 9 ms.
[2024-05-23 12:46:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:09] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:46:09] [INFO ] [Nat]Added 29 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:46:09] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 7 ms.
[2024-05-23 12:46:09] [INFO ] Added : 25 causal constraints over 8 iterations in 82 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 12:46:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:46:09] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:46:09] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:46:09] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:46:09] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:09] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2024-05-23 12:46:09] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-23 12:46:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2024-05-23 12:46:09] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:46:09] [INFO ] Added : 9 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[792, 118, 38, 231, 307, 98, 832, 875] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[792, 118, 38, 231, 307, 98, 832, 875] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 231/231 transitions.
Applied a total of 0 rules in 4 ms. Remains 94 /94 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 94/94 places, 231/231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 231/231 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2024-05-23 12:46:14] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:46:14] [INFO ] Invariant cache hit.
[2024-05-23 12:46:14] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-23 12:46:14] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:46:14] [INFO ] Invariant cache hit.
[2024-05-23 12:46:14] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-23 12:46:14] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-23 12:46:14] [INFO ] Redundant transitions in 3 ms returned []
Running 229 sub problems to find dead transitions.
[2024-05-23 12:46:14] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:46:14] [INFO ] Invariant cache hit.
[2024-05-23 12:46:14] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 152/246 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 229 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 29/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 0/246 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 126 constraints, problems are : Problem set: 0 solved, 229 unsolved in 3771 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 152/246 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 29/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 229/355 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 355 constraints, problems are : Problem set: 0 solved, 229 unsolved in 6598 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
After SMT, in 10499ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 10501ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10689 ms. Remains : 94/94 places, 231/231 transitions.
[2024-05-23 12:46:24] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {24=1, 31=1, 74=1, 86=1, 124=1, 145=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 69=1, 119=1, 147=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :[8, 2, 5, 5, 5, 3, 8, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[792, 118, 38, 231, 307, 98, 832, 875] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:46:25] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:46:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[792, 118, 38, 231, 307, 98, 832, 875] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1034 ms. (966 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 5685 ms. (1406 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[792, 118, 38, 231, 307, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:46:31] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:46:31] [INFO ] Invariant cache hit.
[2024-05-23 12:46:31] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:46:31] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 12:46:31] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-23 12:46:31] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:46:31] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:46:31] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:46:31] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-23 12:46:32] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-23 12:46:32] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-23 12:46:32] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:46:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 184 ms
[2024-05-23 12:46:32] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 7 ms.
[2024-05-23 12:46:32] [INFO ] Added : 6 causal constraints over 4 iterations in 46 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 12:46:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:32] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 12:46:32] [INFO ] [Real]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:46:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:32] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:46:32] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:46:32] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 10 ms.
[2024-05-23 12:46:32] [INFO ] Added : 10 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 12:46:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:32] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:46:32] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:32] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:46:32] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:46:32] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-23 12:46:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-23 12:46:32] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 11 ms.
[2024-05-23 12:46:32] [INFO ] Added : 5 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 12:46:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:46:32] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:46:32] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:32] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:46:32] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:32] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:46:32] [INFO ] Added : 19 causal constraints over 5 iterations in 56 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 12:46:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:32] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:46:32] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:33] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:46:33] [INFO ] [Nat]Added 29 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:46:33] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-23 12:46:33] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-23 12:46:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2024-05-23 12:46:33] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 7 ms.
[2024-05-23 12:46:33] [INFO ] Added : 10 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 35 ms.
[2024-05-23 12:46:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:33] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 12:46:33] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:33] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:46:33] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:33] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-23 12:46:33] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-23 12:46:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2024-05-23 12:46:33] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:46:33] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-23 12:46:33] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-23 12:46:33] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:46:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 149 ms
[2024-05-23 12:46:33] [INFO ] Added : 27 causal constraints over 6 iterations in 221 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 12:46:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:46:33] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:46:33] [INFO ] [Real]Added 29 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:46:33] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:46:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:46:33] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:46:33] [INFO ] [Nat]Added 29 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:46:33] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 9 ms.
[2024-05-23 12:46:33] [INFO ] Added : 25 causal constraints over 8 iterations in 81 ms. Result :sat
Minimization took 36 ms.
[2024-05-23 12:46:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:34] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:46:34] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:46:34] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:46:34] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:46:34] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-23 12:46:34] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-23 12:46:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-05-23 12:46:34] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:46:34] [INFO ] Added : 9 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[792, 118, 38, 231, 307, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[792, 118, 38, 231, 307, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 231/231 transitions.
Applied a total of 0 rules in 4 ms. Remains 94 /94 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 94/94 places, 231/231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 231/231 transitions.
Applied a total of 0 rules in 4 ms. Remains 94 /94 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2024-05-23 12:46:38] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:46:38] [INFO ] Invariant cache hit.
[2024-05-23 12:46:38] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-23 12:46:38] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:46:38] [INFO ] Invariant cache hit.
[2024-05-23 12:46:38] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-23 12:46:38] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-23 12:46:38] [INFO ] Redundant transitions in 1 ms returned []
Running 229 sub problems to find dead transitions.
[2024-05-23 12:46:38] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:46:38] [INFO ] Invariant cache hit.
[2024-05-23 12:46:38] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 152/246 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 229 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 29/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 0/246 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 126 constraints, problems are : Problem set: 0 solved, 229 unsolved in 3837 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 152/246 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 29/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 229/355 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 355 constraints, problems are : Problem set: 0 solved, 229 unsolved in 6458 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
After SMT, in 10426ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 10429ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10635 ms. Remains : 94/94 places, 231/231 transitions.
[2024-05-23 12:46:49] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {24=1, 31=1, 74=1, 86=1, 124=1, 145=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 69=1, 119=1, 147=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :[13, 4, 6, 4, 7, 3, 6, 12]
Current structural bounds on expressions (after cover walk) : Max Seen:[792, 118, 38, 231, 307, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:46:49] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:46:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[792, 118, 38, 231, 307, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000004 steps (2 resets) in 1118 ms. (893 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 5642 ms. (1417 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[823, 118, 38, 231, 378, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:46:56] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:46:56] [INFO ] Invariant cache hit.
[2024-05-23 12:46:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:46:56] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:46:56] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-23 12:46:56] [INFO ] [Real]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:46:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:56] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:46:56] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:56] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2024-05-23 12:46:56] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-23 12:46:56] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:46:56] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-23 12:46:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 193 ms
[2024-05-23 12:46:56] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 7 ms.
[2024-05-23 12:46:56] [INFO ] Added : 6 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:46:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:56] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:46:56] [INFO ] [Real]Added 29 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:46:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:46:56] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:46:56] [INFO ] [Nat]Added 29 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:46:56] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:46:56] [INFO ] Added : 10 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 12:46:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:46:56] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:46:56] [INFO ] [Real]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:46:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:56] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:46:56] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:46:56] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-23 12:46:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-23 12:46:56] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 9 ms.
[2024-05-23 12:46:56] [INFO ] Added : 5 causal constraints over 3 iterations in 47 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 12:46:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:57] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:46:57] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:57] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 12:46:57] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:57] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:46:57] [INFO ] Added : 19 causal constraints over 5 iterations in 60 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 12:46:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:46:57] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:46:57] [INFO ] [Real]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:46:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:57] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:46:57] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:46:57] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-23 12:46:57] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-23 12:46:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2024-05-23 12:46:57] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 11 ms.
[2024-05-23 12:46:57] [INFO ] Added : 10 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 12:46:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:57] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:46:57] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:57] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:46:57] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:57] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-23 12:46:57] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 0 ms to minimize.
[2024-05-23 12:46:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2024-05-23 12:46:57] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 9 ms.
[2024-05-23 12:46:57] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-23 12:46:58] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-05-23 12:46:58] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-23 12:46:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 172 ms
[2024-05-23 12:46:58] [INFO ] Added : 27 causal constraints over 6 iterations in 246 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 12:46:58] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:46:58] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:46:58] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:58] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:46:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:58] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 12:46:58] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:58] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:46:58] [INFO ] Added : 25 causal constraints over 8 iterations in 75 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 12:46:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:58] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:46:58] [INFO ] [Real]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:46:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:46:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:46:58] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-23 12:46:58] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:46:58] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-23 12:46:58] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-23 12:46:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2024-05-23 12:46:58] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 7 ms.
[2024-05-23 12:46:58] [INFO ] Added : 9 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[823, 118, 38, 231, 378, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[823, 118, 38, 231, 378, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 231/231 transitions.
Applied a total of 0 rules in 4 ms. Remains 94 /94 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 94/94 places, 231/231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 231/231 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2024-05-23 12:47:03] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:47:03] [INFO ] Invariant cache hit.
[2024-05-23 12:47:03] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-23 12:47:03] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:47:03] [INFO ] Invariant cache hit.
[2024-05-23 12:47:03] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-23 12:47:03] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-23 12:47:03] [INFO ] Redundant transitions in 1 ms returned []
Running 229 sub problems to find dead transitions.
[2024-05-23 12:47:03] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:47:03] [INFO ] Invariant cache hit.
[2024-05-23 12:47:03] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 152/246 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 229 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 29/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 0/246 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 126 constraints, problems are : Problem set: 0 solved, 229 unsolved in 3710 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 152/246 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 29/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 229/355 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 355 constraints, problems are : Problem set: 0 solved, 229 unsolved in 6656 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
After SMT, in 10497ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 10499ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10696 ms. Remains : 94/94 places, 231/231 transitions.
[2024-05-23 12:47:13] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {24=1, 31=1, 74=1, 86=1, 124=1, 145=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 69=1, 119=1, 147=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :[10, 3, 8, 4, 9, 4, 8, 10]
Current structural bounds on expressions (after cover walk) : Max Seen:[823, 118, 38, 231, 378, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:47:14] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:47:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[823, 118, 38, 231, 378, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1036 ms. (964 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 5681 ms. (1407 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[823, 118, 38, 231, 378, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:47:20] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:47:20] [INFO ] Invariant cache hit.
[2024-05-23 12:47:20] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:47:20] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:47:20] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-23 12:47:20] [INFO ] [Real]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:47:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:20] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:47:20] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:20] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-23 12:47:21] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-23 12:47:21] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-23 12:47:21] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-23 12:47:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 220 ms
[2024-05-23 12:47:21] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 11 ms.
[2024-05-23 12:47:21] [INFO ] Added : 6 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 12:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:47:21] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:47:21] [INFO ] [Real]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:47:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:21] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:47:21] [INFO ] [Nat]Added 29 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:47:21] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 9 ms.
[2024-05-23 12:47:21] [INFO ] Added : 10 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:21] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:47:21] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:21] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:47:21] [INFO ] [Nat]Added 29 Read/Feed constraints in 7 ms returned sat
[2024-05-23 12:47:21] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2024-05-23 12:47:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-05-23 12:47:21] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 10 ms.
[2024-05-23 12:47:21] [INFO ] Added : 5 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 12:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:21] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:47:21] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:21] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 12:47:21] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:21] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 9 ms.
[2024-05-23 12:47:21] [INFO ] Added : 19 causal constraints over 5 iterations in 59 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 12:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:21] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:47:21] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:22] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-23 12:47:22] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:47:22] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-23 12:47:22] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-23 12:47:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2024-05-23 12:47:22] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 9 ms.
[2024-05-23 12:47:22] [INFO ] Added : 10 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 12:47:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:22] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:47:22] [INFO ] [Real]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:47:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:22] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:47:22] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:22] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-23 12:47:22] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-23 12:47:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
[2024-05-23 12:47:22] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:47:22] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-23 12:47:22] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-23 12:47:22] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-23 12:47:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 169 ms
[2024-05-23 12:47:22] [INFO ] Added : 27 causal constraints over 6 iterations in 245 ms. Result :sat
Minimization took 35 ms.
[2024-05-23 12:47:22] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:47:22] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:47:22] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:22] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 9 ms.
[2024-05-23 12:47:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:22] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:47:22] [INFO ] [Nat]Added 29 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:47:22] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:47:23] [INFO ] Added : 25 causal constraints over 8 iterations in 90 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 12:47:23] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:47:23] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 12:47:23] [INFO ] [Real]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:47:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:47:23] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:47:23] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:47:23] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-23 12:47:23] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2024-05-23 12:47:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2024-05-23 12:47:23] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 9 ms.
[2024-05-23 12:47:23] [INFO ] Added : 9 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[823, 118, 38, 231, 378, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[823, 118, 38, 231, 378, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 231/231 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 94/94 places, 231/231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 231/231 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2024-05-23 12:47:27] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:47:27] [INFO ] Invariant cache hit.
[2024-05-23 12:47:28] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-23 12:47:28] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:47:28] [INFO ] Invariant cache hit.
[2024-05-23 12:47:28] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-23 12:47:28] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-23 12:47:28] [INFO ] Redundant transitions in 1 ms returned []
Running 229 sub problems to find dead transitions.
[2024-05-23 12:47:28] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:47:28] [INFO ] Invariant cache hit.
[2024-05-23 12:47:28] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 152/246 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 229 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 29/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 0/246 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 126 constraints, problems are : Problem set: 0 solved, 229 unsolved in 3741 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 152/246 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 29/126 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 229/355 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 355 constraints, problems are : Problem set: 0 solved, 229 unsolved in 6809 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
After SMT, in 10680ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 10682ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10875 ms. Remains : 94/94 places, 231/231 transitions.
[2024-05-23 12:47:38] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {24=1, 31=1, 74=1, 86=1, 124=1, 145=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 69=1, 119=1, 147=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :[7, 4, 5, 4, 2147483647, 5, 11, 8]
Current structural bounds on expressions (after cover walk) : Max Seen:[823, 118, 38, 231, +inf, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:47:38] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:47:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[823, 118, 38, 231, +inf, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1143 ms. (874 steps per ms)
FORMULA FunctionPointer-PT-b032-UpperBounds-08 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 7000006 steps (14 resets) in 4970 ms. (1408 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[823, 118, 38, 234, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:47:45] [INFO ] Flow matrix only has 152 transitions (discarded 79 similar events)
[2024-05-23 12:47:45] [INFO ] Invariant cache hit.
[2024-05-23 12:47:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:47:45] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:47:45] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-23 12:47:45] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:47:45] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:47:45] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:45] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-23 12:47:45] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-23 12:47:45] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-23 12:47:45] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-05-23 12:47:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 199 ms
[2024-05-23 12:47:45] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:47:45] [INFO ] Added : 6 causal constraints over 4 iterations in 46 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 12:47:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:45] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:47:45] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:45] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:47:45] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:47:45] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 7 ms.
[2024-05-23 12:47:45] [INFO ] Added : 10 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:47:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:47:45] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:47:45] [INFO ] [Real]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:47:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:45] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:47:45] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:47:45] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-23 12:47:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-23 12:47:45] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 10 ms.
[2024-05-23 12:47:45] [INFO ] Added : 5 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:47:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:45] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:47:45] [INFO ] [Real]Added 29 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:47:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:46] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:47:46] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:46] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 9 ms.
[2024-05-23 12:47:46] [INFO ] Added : 19 causal constraints over 5 iterations in 60 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 12:47:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:46] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:47:46] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:46] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:47:46] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:46] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-23 12:47:46] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-23 12:47:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2024-05-23 12:47:46] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:47:46] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-23 12:47:46] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-23 12:47:46] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:47:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 166 ms
[2024-05-23 12:47:46] [INFO ] Added : 27 causal constraints over 6 iterations in 239 ms. Result :sat
Minimization took 35 ms.
[2024-05-23 12:47:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:46] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:47:46] [INFO ] [Real]Added 29 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:47:46] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 9 ms.
[2024-05-23 12:47:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:46] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:47:46] [INFO ] [Nat]Added 29 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:47:46] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 7 ms.
[2024-05-23 12:47:46] [INFO ] Added : 25 causal constraints over 8 iterations in 76 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 12:47:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:47] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:47:47] [INFO ] [Real]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:47:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:47] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 12:47:47] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:47:47] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-05-23 12:47:47] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
[2024-05-23 12:47:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2024-05-23 12:47:47] [INFO ] Computed and/alt/rep : 47/211/45 causal constraints (skipped 105 transitions) in 8 ms.
[2024-05-23 12:47:47] [INFO ] Added : 9 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[823, 118, 38, 234, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[823, 118, 38, 234, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 231/231 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 92 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 92 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 91 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 91 transition count 225
Applied a total of 6 rules in 25 ms. Remains 91 /94 variables (removed 3) and now considering 225/231 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 91/94 places, 225/231 transitions.
[2024-05-23 12:47:51] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {26=1, 66=1, 115=1, 144=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 70=1, 103=1, 133=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :[7, 3, 5, 4, 2, 10, 7]
Current structural bounds on expressions (after cover walk) : Max Seen:[823, 118, 38, 234, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:47:51] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
// Phase 1: matrix 146 rows 91 cols
[2024-05-23 12:47:51] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[823, 118, 38, 234, 98, 832, 876] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1051 ms. (950 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 4723 ms. (1481 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[989, 119, 38, 313, 110, 832, 979] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:47:57] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:47:57] [INFO ] Invariant cache hit.
[2024-05-23 12:47:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:47:57] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 12:47:57] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 12:47:57] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:47:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:57] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:47:57] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:57] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-23 12:47:57] [INFO ] Added : 10 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 12:47:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:47:57] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:47:57] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:47:57] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-23 12:47:57] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:57] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-23 12:47:57] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-23 12:47:57] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-23 12:47:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 159 ms
[2024-05-23 12:47:57] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 9 ms.
[2024-05-23 12:47:57] [INFO ] Added : 27 causal constraints over 8 iterations in 83 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 12:47:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:47:57] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:47:57] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:47:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:57] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:47:57] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:57] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-23 12:47:57] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-23 12:47:57] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:47:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 143 ms
[2024-05-23 12:47:57] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-23 12:47:58] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-23 12:47:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-23 12:47:58] [INFO ] Added : 11 causal constraints over 4 iterations in 110 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 12:47:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:58] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:47:58] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:47:58] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:47:58] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:58] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-23 12:47:58] [INFO ] Added : 22 causal constraints over 7 iterations in 68 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 12:47:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:58] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:47:58] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:47:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:47:58] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 12:47:58] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:47:58] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-23 12:47:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-23 12:47:58] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 9 ms.
[2024-05-23 12:47:58] [INFO ] Added : 14 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 12:47:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:58] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:47:58] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:58] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:47:58] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:58] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-23 12:47:58] [INFO ] Added : 14 causal constraints over 5 iterations in 51 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:47:58] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:47:58] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 12:47:58] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:47:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:47:58] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 12:47:58] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:47:58] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-23 12:47:59] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:47:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-05-23 12:47:59] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-23 12:47:59] [INFO ] Added : 13 causal constraints over 5 iterations in 51 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[989, 119, 38, 313, 110, 832, 979] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[989, 119, 38, 313, 110, 832, 979] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 91/91 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-23 12:48:03] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:48:03] [INFO ] Invariant cache hit.
[2024-05-23 12:48:03] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 12:48:03] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:48:03] [INFO ] Invariant cache hit.
[2024-05-23 12:48:03] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 12:48:03] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-23 12:48:03] [INFO ] Redundant transitions in 0 ms returned []
Running 223 sub problems to find dead transitions.
[2024-05-23 12:48:03] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:48:03] [INFO ] Invariant cache hit.
[2024-05-23 12:48:03] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 146/237 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 223 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 27/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 0/237 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 121 constraints, problems are : Problem set: 0 solved, 223 unsolved in 3548 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 146/237 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 27/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 223/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 344 constraints, problems are : Problem set: 0 solved, 223 unsolved in 6353 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints]
After SMT, in 10024ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 10027ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10196 ms. Remains : 91/91 places, 225/225 transitions.
[2024-05-23 12:48:13] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {26=1, 66=1, 115=1, 144=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {30=1, 70=1, 103=1, 133=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :[14, 3, 7, 4, 5, 8, 9]
Current structural bounds on expressions (after cover walk) : Max Seen:[989, 119, 38, 313, 110, 832, 979] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:48:13] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:48:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[989, 119, 38, 313, 110, 832, 979] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1131 ms. (883 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 4660 ms. (1501 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[989, 129, 38, 313, 110, 976, 979] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:48:19] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:48:19] [INFO ] Invariant cache hit.
[2024-05-23 12:48:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:48:19] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:48:19] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 12:48:19] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:48:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:48:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:48:19] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:48:19] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2024-05-23 12:48:19] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-23 12:48:19] [INFO ] Added : 10 causal constraints over 4 iterations in 46 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 12:48:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:48:19] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:48:19] [INFO ] [Real]Added 27 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:48:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:48:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:48:19] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:48:19] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:48:19] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-23 12:48:20] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:48:20] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-23 12:48:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 147 ms
[2024-05-23 12:48:20] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-23 12:48:20] [INFO ] Added : 27 causal constraints over 8 iterations in 81 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 12:48:20] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:48:20] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:48:20] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:48:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:48:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:48:20] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:48:20] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:48:20] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-23 12:48:20] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-23 12:48:20] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-23 12:48:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 141 ms
[2024-05-23 12:48:20] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-23 12:48:20] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-23 12:48:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-23 12:48:20] [INFO ] Added : 11 causal constraints over 4 iterations in 108 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 12:48:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:48:20] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:48:20] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:48:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:48:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:48:20] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:48:20] [INFO ] [Nat]Added 27 Read/Feed constraints in 7 ms returned sat
[2024-05-23 12:48:20] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 10 ms.
[2024-05-23 12:48:20] [INFO ] Added : 22 causal constraints over 7 iterations in 71 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 12:48:20] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:48:20] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:48:20] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:48:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:48:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:48:20] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:48:20] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:48:20] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-23 12:48:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-23 12:48:21] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 11 ms.
[2024-05-23 12:48:21] [INFO ] Added : 14 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:48:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:48:21] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:48:21] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:48:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:48:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:48:21] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:48:21] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:48:21] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-23 12:48:21] [INFO ] Added : 14 causal constraints over 5 iterations in 49 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 12:48:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:48:21] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:48:21] [INFO ] [Real]Added 27 Read/Feed constraints in 7 ms returned sat
[2024-05-23 12:48:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:48:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:48:21] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:48:21] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:48:21] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-23 12:48:21] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-23 12:48:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2024-05-23 12:48:21] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-23 12:48:21] [INFO ] Added : 13 causal constraints over 5 iterations in 65 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[989, 129, 38, 313, 110, 976, 979] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[989, 129, 38, 313, 110, 976, 979] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 225/225 transitions.
Applied a total of 0 rules in 6 ms. Remains 91 /91 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 91/91 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-23 12:48:26] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:48:26] [INFO ] Invariant cache hit.
[2024-05-23 12:48:26] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-23 12:48:26] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:48:26] [INFO ] Invariant cache hit.
[2024-05-23 12:48:26] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 12:48:26] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-23 12:48:26] [INFO ] Redundant transitions in 1 ms returned []
Running 223 sub problems to find dead transitions.
[2024-05-23 12:48:26] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:48:26] [INFO ] Invariant cache hit.
[2024-05-23 12:48:26] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 146/237 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 223 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 27/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 0/237 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 121 constraints, problems are : Problem set: 0 solved, 223 unsolved in 3529 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 146/237 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 27/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 223/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 344 constraints, problems are : Problem set: 0 solved, 223 unsolved in 6395 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints]
After SMT, in 10046ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 10049ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10223 ms. Remains : 91/91 places, 225/225 transitions.
[2024-05-23 12:48:36] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {26=1, 66=1, 115=1, 144=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 70=1, 103=1, 133=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :[10, 3, 4, 6, 3, 7, 8]
Current structural bounds on expressions (after cover walk) : Max Seen:[989, 129, 38, 313, 110, 976, 979] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:48:36] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:48:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[989, 129, 38, 313, 110, 976, 979] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 883 ms. (1131 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 4712 ms. (1485 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[989, 144, 38, 352, 110, 988, 979] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:48:42] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:48:42] [INFO ] Invariant cache hit.
[2024-05-23 12:48:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:48:42] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:48:42] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 12:48:42] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:48:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:48:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:48:42] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:48:42] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:48:42] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-23 12:48:42] [INFO ] Added : 10 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 12:48:42] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:48:42] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:48:42] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:48:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:48:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:48:42] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:48:42] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:48:42] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-23 12:48:42] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-23 12:48:42] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:48:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 139 ms
[2024-05-23 12:48:42] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-23 12:48:42] [INFO ] Added : 27 causal constraints over 8 iterations in 85 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 12:48:42] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:48:42] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:48:42] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:48:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:48:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:48:42] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:48:42] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:48:42] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-23 12:48:42] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-23 12:48:42] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-23 12:48:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 142 ms
[2024-05-23 12:48:42] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-23 12:48:43] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-23 12:48:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-23 12:48:43] [INFO ] Added : 11 causal constraints over 4 iterations in 105 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 12:48:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:48:43] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:48:43] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:48:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:48:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:48:43] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:48:43] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:48:43] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-23 12:48:43] [INFO ] Added : 22 causal constraints over 7 iterations in 72 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 12:48:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:48:43] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:48:43] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:48:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:48:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:48:43] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:48:43] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:48:43] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-23 12:48:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-23 12:48:43] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-23 12:48:43] [INFO ] Added : 14 causal constraints over 4 iterations in 44 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:48:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:48:43] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:48:43] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:48:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:48:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:48:43] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:48:43] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:48:43] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-23 12:48:43] [INFO ] Added : 14 causal constraints over 5 iterations in 50 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 12:48:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:48:43] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:48:43] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:48:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:48:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:48:43] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:48:43] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:48:43] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-23 12:48:44] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-23 12:48:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2024-05-23 12:48:44] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-23 12:48:44] [INFO ] Added : 13 causal constraints over 5 iterations in 51 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[989, 144, 38, 352, 110, 988, 979] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[989, 144, 38, 352, 110, 988, 979] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 91/91 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-23 12:48:48] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:48:48] [INFO ] Invariant cache hit.
[2024-05-23 12:48:48] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-23 12:48:48] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:48:48] [INFO ] Invariant cache hit.
[2024-05-23 12:48:48] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 12:48:49] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-23 12:48:49] [INFO ] Redundant transitions in 0 ms returned []
Running 223 sub problems to find dead transitions.
[2024-05-23 12:48:49] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:48:49] [INFO ] Invariant cache hit.
[2024-05-23 12:48:49] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 146/237 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 223 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 27/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 0/237 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 121 constraints, problems are : Problem set: 0 solved, 223 unsolved in 3590 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 146/237 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 27/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 223/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 344 constraints, problems are : Problem set: 0 solved, 223 unsolved in 6531 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints]
After SMT, in 10251ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 10253ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10435 ms. Remains : 91/91 places, 225/225 transitions.
[2024-05-23 12:48:59] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {26=1, 66=1, 115=1, 144=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 70=1, 103=1, 133=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :[5, 4, 6, 3, 5, 13, 11]
Current structural bounds on expressions (after cover walk) : Max Seen:[989, 144, 38, 352, 110, 988, 979] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:48:59] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:48:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[989, 144, 38, 352, 110, 988, 979] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000011 steps (2 resets) in 891 ms. (1121 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 4665 ms. (1500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[989, 144, 38, 352, 110, 1363, 1270] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:49:04] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:49:04] [INFO ] Invariant cache hit.
[2024-05-23 12:49:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:04] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:49:04] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 12:49:04] [INFO ] [Real]Added 27 Read/Feed constraints in 8 ms returned sat
[2024-05-23 12:49:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:49:05] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:49:05] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:05] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-23 12:49:05] [INFO ] Added : 10 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 12:49:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:49:05] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:49:05] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:05] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:49:05] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:05] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-23 12:49:05] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-23 12:49:05] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-05-23 12:49:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 161 ms
[2024-05-23 12:49:05] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 9 ms.
[2024-05-23 12:49:05] [INFO ] Added : 27 causal constraints over 8 iterations in 84 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 12:49:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:05] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:49:05] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:49:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:49:05] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:49:05] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:49:05] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-23 12:49:05] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-23 12:49:05] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-23 12:49:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 154 ms
[2024-05-23 12:49:05] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-23 12:49:05] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-23 12:49:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-23 12:49:05] [INFO ] Added : 11 causal constraints over 4 iterations in 103 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 12:49:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:06] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:49:06] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:49:06] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:49:06] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:06] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-23 12:49:06] [INFO ] Added : 22 causal constraints over 7 iterations in 74 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 12:49:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:49:06] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:49:06] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:49:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:06] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:49:06] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:49:06] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2024-05-23 12:49:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-23 12:49:06] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-23 12:49:06] [INFO ] Added : 14 causal constraints over 4 iterations in 55 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 12:49:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:06] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:49:06] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:49:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:06] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:49:06] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:06] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 9 ms.
[2024-05-23 12:49:06] [INFO ] Added : 14 causal constraints over 5 iterations in 53 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 12:49:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:49:06] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:49:06] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:49:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:06] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:49:06] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:06] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-23 12:49:06] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 2 ms to minimize.
[2024-05-23 12:49:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2024-05-23 12:49:06] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 9 ms.
[2024-05-23 12:49:07] [INFO ] Added : 13 causal constraints over 5 iterations in 56 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[989, 144, 38, 352, 110, 1363, 1270] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[989, 144, 38, 352, 110, 1363, 1270] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 225/225 transitions.
Applied a total of 0 rules in 13 ms. Remains 91 /91 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 91/91 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-23 12:49:12] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:49:12] [INFO ] Invariant cache hit.
[2024-05-23 12:49:12] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-23 12:49:12] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:49:12] [INFO ] Invariant cache hit.
[2024-05-23 12:49:12] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 12:49:13] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-23 12:49:13] [INFO ] Redundant transitions in 1 ms returned []
Running 223 sub problems to find dead transitions.
[2024-05-23 12:49:13] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:49:13] [INFO ] Invariant cache hit.
[2024-05-23 12:49:13] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 146/237 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 223 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 27/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 0/237 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 121 constraints, problems are : Problem set: 0 solved, 223 unsolved in 3579 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 146/237 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 27/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 223/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 344 constraints, problems are : Problem set: 0 solved, 223 unsolved in 6481 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints]
After SMT, in 10190ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 10192ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10390 ms. Remains : 91/91 places, 225/225 transitions.
[2024-05-23 12:49:23] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {26=1, 66=1, 115=1, 144=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 70=1, 103=1, 133=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :[24, 3, 4, 4, 5, 9, 11]
Current structural bounds on expressions (after cover walk) : Max Seen:[989, 144, 38, 352, 110, 1363, 1270] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:49:23] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:49:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[989, 144, 38, 352, 110, 1363, 1270] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 893 ms. (1118 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 4775 ms. (1465 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[989, 144, 39, 385, 110, 1363, 1270] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:49:28] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:49:28] [INFO ] Invariant cache hit.
[2024-05-23 12:49:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:49:29] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:49:29] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 12:49:29] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:49:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:49:29] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:49:29] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:29] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-23 12:49:29] [INFO ] Added : 10 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 12:49:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:29] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:49:29] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:29] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:49:29] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:29] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-23 12:49:29] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-23 12:49:29] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:49:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 144 ms
[2024-05-23 12:49:29] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-23 12:49:29] [INFO ] Added : 27 causal constraints over 8 iterations in 83 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 12:49:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:29] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:49:29] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:49:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:29] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:49:29] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:29] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-23 12:49:29] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-23 12:49:29] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:49:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 143 ms
[2024-05-23 12:49:29] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-23 12:49:29] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-23 12:49:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-23 12:49:29] [INFO ] Added : 11 causal constraints over 4 iterations in 96 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:49:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:49:30] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:49:30] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:49:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:30] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:49:30] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:49:30] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-23 12:49:30] [INFO ] Added : 22 causal constraints over 7 iterations in 76 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 12:49:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:49:30] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:49:30] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:30] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:49:30] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:49:30] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2024-05-23 12:49:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-23 12:49:30] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-23 12:49:30] [INFO ] Added : 14 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 12:49:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:30] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:49:30] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:49:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:49:30] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:49:30] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:49:30] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 9 ms.
[2024-05-23 12:49:30] [INFO ] Added : 14 causal constraints over 5 iterations in 55 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 12:49:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:49:30] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:49:30] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:49:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:30] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:49:30] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:30] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-05-23 12:49:30] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:49:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2024-05-23 12:49:30] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-23 12:49:30] [INFO ] Added : 13 causal constraints over 5 iterations in 56 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[989, 144, 39, 385, 110, 1363, 1270] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[989, 144, 39, 385, 110, 1363, 1270] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 91/91 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-23 12:49:36] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:49:36] [INFO ] Invariant cache hit.
[2024-05-23 12:49:36] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 12:49:36] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:49:36] [INFO ] Invariant cache hit.
[2024-05-23 12:49:36] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 12:49:36] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-05-23 12:49:36] [INFO ] Redundant transitions in 1 ms returned []
Running 223 sub problems to find dead transitions.
[2024-05-23 12:49:36] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:49:36] [INFO ] Invariant cache hit.
[2024-05-23 12:49:36] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 146/237 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 223 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 27/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 0/237 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 121 constraints, problems are : Problem set: 0 solved, 223 unsolved in 3572 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 146/237 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 27/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 223/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 344 constraints, problems are : Problem set: 0 solved, 223 unsolved in 6444 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints]
After SMT, in 10138ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 10142ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10324 ms. Remains : 91/91 places, 225/225 transitions.
[2024-05-23 12:49:46] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {26=1, 66=1, 115=1, 144=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 70=1, 103=1, 133=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :[2147483647, 2, 7, 5, 4, 10, 11]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, 144, 39, 385, 110, 1363, 1270] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:49:46] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:49:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, 144, 39, 385, 110, 1363, 1270] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000003 steps (2 resets) in 1057 ms. (945 steps per ms)
FORMULA FunctionPointer-PT-b032-UpperBounds-01 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 6000006 steps (12 resets) in 4108 ms. (1460 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[144, 39, 385, 112, 1363, 1270] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:49:52] [INFO ] Flow matrix only has 146 transitions (discarded 79 similar events)
[2024-05-23 12:49:52] [INFO ] Invariant cache hit.
[2024-05-23 12:49:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:52] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:49:52] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 12:49:52] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:49:52] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-23 12:49:52] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:52] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-23 12:49:52] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-23 12:49:52] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:49:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 133 ms
[2024-05-23 12:49:52] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-23 12:49:52] [INFO ] Added : 27 causal constraints over 8 iterations in 81 ms. Result :sat
Minimization took 38 ms.
[2024-05-23 12:49:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:52] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 12:49:52] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:52] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:49:52] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:52] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-23 12:49:52] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-23 12:49:52] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-23 12:49:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 155 ms
[2024-05-23 12:49:52] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-23 12:49:52] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-23 12:49:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-23 12:49:52] [INFO ] Added : 11 causal constraints over 4 iterations in 113 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:49:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:53] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:49:53] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:49:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:53] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:49:53] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:53] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-23 12:49:53] [INFO ] Added : 22 causal constraints over 7 iterations in 77 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 12:49:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:53] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:49:53] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:49:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:49:53] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:49:53] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:49:53] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-23 12:49:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-23 12:49:53] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-23 12:49:53] [INFO ] Added : 14 causal constraints over 4 iterations in 46 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:49:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 12:49:53] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:49:53] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:49:53] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:49:53] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:53] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-23 12:49:53] [INFO ] Added : 14 causal constraints over 5 iterations in 50 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 12:49:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:49:53] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:49:53] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:49:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:49:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:49:53] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:49:53] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:49:53] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2024-05-23 12:49:53] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-23 12:49:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2024-05-23 12:49:53] [INFO ] Computed and/alt/rep : 62/332/59 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-23 12:49:53] [INFO ] Added : 13 causal constraints over 5 iterations in 57 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[144, 39, 385, 112, 1363, 1270] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[144, 39, 385, 112, 1363, 1270] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 225/225 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 223
Applied a total of 2 rules in 3 ms. Remains 90 /91 variables (removed 1) and now considering 223/225 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 90/91 places, 223/225 transitions.
[2024-05-23 12:49:58] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {29=1, 68=1, 117=1, 138=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {32=1, 71=1, 120=1, 138=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :[3, 6, 6, 4, 15, 7]
Current structural bounds on expressions (after cover walk) : Max Seen:[144, 39, 385, 112, 1363, 1270] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:49:58] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
// Phase 1: matrix 143 rows 90 cols
[2024-05-23 12:49:58] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[144, 39, 385, 112, 1363, 1270] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1030 ms. (969 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 4022 ms. (1491 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[144, 39, 385, 133, 1363, 1270] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:50:03] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:50:03] [INFO ] Invariant cache hit.
[2024-05-23 12:50:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:03] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:50:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 12:50:03] [INFO ] [Real]Added 25 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:50:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:50:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:03] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:50:03] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:50:03] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 10 ms.
[2024-05-23 12:50:03] [INFO ] Added : 17 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 12:50:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:50:03] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 12:50:03] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:50:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:50:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:50:03] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:50:03] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:50:03] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-23 12:50:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-23 12:50:03] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 7 ms.
[2024-05-23 12:50:04] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-23 12:50:04] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-23 12:50:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2024-05-23 12:50:04] [INFO ] Added : 10 causal constraints over 4 iterations in 148 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:50:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:50:04] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:50:04] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:50:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:50:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:50:04] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:50:04] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:50:04] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-23 12:50:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-23 12:50:04] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 7 ms.
[2024-05-23 12:50:04] [INFO ] Added : 15 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 12:50:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:04] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:50:04] [INFO ] [Real]Added 25 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:50:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:50:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:50:04] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:50:04] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:50:04] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 7 ms.
[2024-05-23 12:50:04] [INFO ] Added : 21 causal constraints over 6 iterations in 69 ms. Result :sat
Minimization took 36 ms.
[2024-05-23 12:50:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:50:04] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 12:50:04] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:50:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:50:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:04] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 12:50:04] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:50:04] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 8 ms.
[2024-05-23 12:50:04] [INFO ] Added : 29 causal constraints over 10 iterations in 114 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 12:50:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:04] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 12:50:04] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:50:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:50:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:50:05] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:50:05] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:50:05] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-23 12:50:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-23 12:50:05] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 7 ms.
[2024-05-23 12:50:05] [INFO ] Added : 14 causal constraints over 6 iterations in 55 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[144, 39, 385, 133, 1363, 1270] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[144, 39, 385, 133, 1363, 1373] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 90/90 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-23 12:50:08] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:50:08] [INFO ] Invariant cache hit.
[2024-05-23 12:50:08] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-23 12:50:08] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:50:08] [INFO ] Invariant cache hit.
[2024-05-23 12:50:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 12:50:08] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-23 12:50:08] [INFO ] Redundant transitions in 1 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-23 12:50:08] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:50:08] [INFO ] Invariant cache hit.
[2024-05-23 12:50:08] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 143/233 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 25/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 0/233 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 118 constraints, problems are : Problem set: 0 solved, 221 unsolved in 3392 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 143/233 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 25/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 221/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/233 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 339 constraints, problems are : Problem set: 0 solved, 221 unsolved in 6204 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
After SMT, in 9735ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 9737ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9918 ms. Remains : 90/90 places, 223/223 transitions.
[2024-05-23 12:50:18] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {29=1, 68=1, 117=1, 138=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {32=1, 71=1, 120=1, 138=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :[3, 5, 3, 4, 7, 16]
Current structural bounds on expressions (after cover walk) : Max Seen:[144, 39, 385, 133, 1363, 1373] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:50:18] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:50:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[144, 39, 385, 133, 1363, 1373] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000019 steps (2 resets) in 863 ms. (1157 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 3967 ms. (1512 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[144, 39, 385, 136, 1363, 1543] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:50:23] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:50:23] [INFO ] Invariant cache hit.
[2024-05-23 12:50:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:23] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:50:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 12:50:23] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:50:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:50:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:50:23] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:50:23] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:50:23] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 7 ms.
[2024-05-23 12:50:23] [INFO ] Added : 17 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 12:50:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:23] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:50:23] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:50:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:50:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:50:23] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:50:23] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:50:23] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-23 12:50:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-23 12:50:23] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 8 ms.
[2024-05-23 12:50:23] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-23 12:50:23] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-23 12:50:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2024-05-23 12:50:23] [INFO ] Added : 10 causal constraints over 4 iterations in 157 ms. Result :sat
Minimization took 24 ms.
[2024-05-23 12:50:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:23] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:50:23] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:50:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:50:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:23] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:50:23] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:50:23] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-23 12:50:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-23 12:50:24] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 8 ms.
[2024-05-23 12:50:24] [INFO ] Added : 15 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:50:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:50:24] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:50:24] [INFO ] [Real]Added 25 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:50:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:50:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:24] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:50:24] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:50:24] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 7 ms.
[2024-05-23 12:50:24] [INFO ] Added : 21 causal constraints over 6 iterations in 66 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:50:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:50:24] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:50:24] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:50:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:50:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:50:24] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:50:24] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:50:24] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 7 ms.
[2024-05-23 12:50:24] [INFO ] Added : 29 causal constraints over 10 iterations in 96 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 12:50:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:24] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:50:24] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:50:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:50:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:24] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:50:24] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:50:24] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-23 12:50:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-23 12:50:24] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 8 ms.
[2024-05-23 12:50:24] [INFO ] Added : 14 causal constraints over 6 iterations in 63 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[144, 39, 385, 136, 1363, 1543] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[144, 39, 385, 136, 1363, 1770] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 90/90 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 223/223 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-23 12:50:28] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:50:28] [INFO ] Invariant cache hit.
[2024-05-23 12:50:28] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 12:50:28] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:50:28] [INFO ] Invariant cache hit.
[2024-05-23 12:50:28] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 12:50:28] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-23 12:50:28] [INFO ] Redundant transitions in 0 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-23 12:50:28] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:50:28] [INFO ] Invariant cache hit.
[2024-05-23 12:50:28] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 143/233 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 25/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 0/233 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 118 constraints, problems are : Problem set: 0 solved, 221 unsolved in 3500 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 143/233 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 25/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 221/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/233 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 339 constraints, problems are : Problem set: 0 solved, 221 unsolved in 6187 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
After SMT, in 9806ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 9809ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9980 ms. Remains : 90/90 places, 223/223 transitions.
[2024-05-23 12:50:38] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {29=1, 68=1, 117=1, 138=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {32=1, 71=1, 120=1, 138=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :[3, 6, 6, 3, 9, 10]
Current structural bounds on expressions (after cover walk) : Max Seen:[144, 39, 385, 136, 1363, 1770] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:50:38] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:50:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[144, 39, 385, 136, 1363, 1770] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000002 steps (2 resets) in 856 ms. (1166 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 4017 ms. (1493 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[150, 39, 385, 136, 1363, 1770] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:50:43] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:50:43] [INFO ] Invariant cache hit.
[2024-05-23 12:50:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:43] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:50:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 12:50:43] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:50:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:50:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:43] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:50:43] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:50:43] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 8 ms.
[2024-05-23 12:50:43] [INFO ] Added : 17 causal constraints over 4 iterations in 46 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 12:50:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:43] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:50:43] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:50:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:50:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:43] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:50:43] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:50:43] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-23 12:50:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-23 12:50:43] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 7 ms.
[2024-05-23 12:50:43] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:50:43] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-23 12:50:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2024-05-23 12:50:43] [INFO ] Added : 10 causal constraints over 4 iterations in 141 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 12:50:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:43] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:50:43] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:50:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:50:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:43] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:50:43] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:50:44] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-23 12:50:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-23 12:50:44] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 8 ms.
[2024-05-23 12:50:44] [INFO ] Added : 15 causal constraints over 4 iterations in 46 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 12:50:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:50:44] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:50:44] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:50:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:50:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:50:44] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:50:44] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:50:44] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 10 ms.
[2024-05-23 12:50:44] [INFO ] Added : 21 causal constraints over 6 iterations in 63 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 12:50:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:50:44] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:50:44] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:50:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:50:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:44] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:50:44] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:50:44] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 8 ms.
[2024-05-23 12:50:44] [INFO ] Added : 29 causal constraints over 10 iterations in 99 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 12:50:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:44] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:50:44] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:50:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:50:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:50:44] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:50:44] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:50:44] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-23 12:50:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-23 12:50:44] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 10 ms.
[2024-05-23 12:50:44] [INFO ] Added : 14 causal constraints over 6 iterations in 59 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[150, 39, 385, 136, 1363, 1770] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[150, 39, 385, 136, 1363, 1770] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 90/90 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 223/223 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-23 12:50:48] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:50:48] [INFO ] Invariant cache hit.
[2024-05-23 12:50:48] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-23 12:50:48] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:50:48] [INFO ] Invariant cache hit.
[2024-05-23 12:50:48] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 12:50:48] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-23 12:50:48] [INFO ] Redundant transitions in 1 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-23 12:50:48] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:50:48] [INFO ] Invariant cache hit.
[2024-05-23 12:50:48] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 143/233 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 25/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 0/233 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 118 constraints, problems are : Problem set: 0 solved, 221 unsolved in 3402 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 143/233 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 25/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 221/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/233 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 339 constraints, problems are : Problem set: 0 solved, 221 unsolved in 6394 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
After SMT, in 9936ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 9940ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10144 ms. Remains : 90/90 places, 223/223 transitions.
[2024-05-23 12:50:58] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {29=1, 68=1, 117=1, 138=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {32=1, 71=1, 120=1, 138=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :[4, 4, 4, 3, 9, 9]
Current structural bounds on expressions (after cover walk) : Max Seen:[150, 39, 385, 136, 1363, 1770] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:50:58] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:50:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[150, 39, 385, 136, 1363, 1770] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1021 ms. (978 steps per ms)
BEST_FIRST walk for 6000005 steps (12 resets) in 3978 ms. (1507 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[150, 39, 385, 136, 1363, 1770] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 12:51:03] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:51:03] [INFO ] Invariant cache hit.
[2024-05-23 12:51:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:51:03] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:51:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 12:51:03] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:51:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:51:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:51:03] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:51:03] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:51:03] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 8 ms.
[2024-05-23 12:51:04] [INFO ] Added : 17 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 12:51:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:51:04] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:51:04] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:51:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:51:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:51:04] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:51:04] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:51:04] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:51:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-23 12:51:04] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 10 ms.
[2024-05-23 12:51:04] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-23 12:51:04] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-23 12:51:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2024-05-23 12:51:04] [INFO ] Added : 10 causal constraints over 4 iterations in 148 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 12:51:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:51:04] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:51:04] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:51:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:51:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:51:04] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:51:04] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:51:04] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-23 12:51:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-23 12:51:04] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 7 ms.
[2024-05-23 12:51:04] [INFO ] Added : 15 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 12:51:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:51:04] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:51:04] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:51:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:51:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:51:04] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:51:04] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:51:04] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 7 ms.
[2024-05-23 12:51:04] [INFO ] Added : 21 causal constraints over 6 iterations in 65 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 12:51:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:51:04] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:51:04] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:51:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:51:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:51:05] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:51:05] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:51:05] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 8 ms.
[2024-05-23 12:51:05] [INFO ] Added : 29 causal constraints over 10 iterations in 95 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 12:51:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:51:05] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:51:05] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:51:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:51:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:51:05] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:51:05] [INFO ] [Nat]Added 25 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:51:05] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-23 12:51:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-23 12:51:05] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 7 ms.
[2024-05-23 12:51:05] [INFO ] Added : 14 causal constraints over 6 iterations in 55 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[150, 39, 385, 136, 1363, 1770] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[150, 39, 385, 136, 1363, 1770] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 223/223 transitions.
Applied a total of 0 rules in 12 ms. Remains 90 /90 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 90/90 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 223/223 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-23 12:51:09] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:51:09] [INFO ] Invariant cache hit.
[2024-05-23 12:51:09] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-23 12:51:09] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:51:09] [INFO ] Invariant cache hit.
[2024-05-23 12:51:09] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 12:51:09] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-23 12:51:09] [INFO ] Redundant transitions in 1 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-23 12:51:09] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:51:09] [INFO ] Invariant cache hit.
[2024-05-23 12:51:09] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 143/233 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 25/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 0/233 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 118 constraints, problems are : Problem set: 0 solved, 221 unsolved in 3495 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 143/233 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 25/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 221/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/233 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 339 constraints, problems are : Problem set: 0 solved, 221 unsolved in 6328 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
After SMT, in 9950ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 9953ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10157 ms. Remains : 90/90 places, 223/223 transitions.
[2024-05-23 12:51:19] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {29=1, 68=1, 117=1, 138=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {32=1, 71=1, 120=1, 138=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :[5, 5, 5, 3, 11, 8]
Current structural bounds on expressions (after cover walk) : Max Seen:[150, 39, 385, 136, 1363, 1770] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40004 steps (8 resets) in 740 ms. (53 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
[2024-05-23 12:51:19] [INFO ] Flatten gal took : 78 ms
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
[2024-05-23 12:51:19] [INFO ] Flatten gal took : 53 ms
[2024-05-23 12:51:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11982550109335027022.gal : 10 ms
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
[2024-05-23 12:51:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality418713820407049290.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11982550109335027022.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality418713820407049290.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 6/6 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality418713820407049290.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :31 after 1049
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1049 after 166176
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :166176 after 2.48076e+08
Interrupted probabilistic random walk after 343349 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 6
Probabilistic random walk after 343349 steps, saw 217233 distinct states, run finished after 3006 ms. (steps per millisecond=114 ) properties seen :0
[2024-05-23 12:51:23] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:51:23] [INFO ] Invariant cache hit.
[2024-05-23 12:51:23] [INFO ] State equation strengthened by 25 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) 18/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 87/111 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 5/116 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 100/216 variables, 57/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 23/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 6/222 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 11/233 variables, 11/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/233 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/233 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 118 constraints, problems are : Problem set: 0 solved, 6 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 25/25 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) 18/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 87/111 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 5/116 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 100/216 variables, 57/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 23/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 6/222 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/222 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 11/233 variables, 11/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/233 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/233 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 124 constraints, problems are : Problem set: 0 solved, 6 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 463ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 223/223 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 90/90 places, 223/223 transitions.
RANDOM walk for 40005 steps (8 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :2.48076e+08 after 9.73516e+12
Interrupted probabilistic random walk after 291650 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 6
Probabilistic random walk after 291650 steps, saw 185052 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
[2024-05-23 12:51:26] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:51:26] [INFO ] Invariant cache hit.
[2024-05-23 12:51:26] [INFO ] State equation strengthened by 25 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) 18/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 87/111 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 5/116 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 100/216 variables, 57/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 23/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 6/222 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 11/233 variables, 11/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/233 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/233 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 118 constraints, problems are : Problem set: 0 solved, 6 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 25/25 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) 18/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 87/111 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 5/116 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 100/216 variables, 57/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 23/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 6/222 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/222 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 11/233 variables, 11/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/233 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/233 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 124 constraints, problems are : Problem set: 0 solved, 6 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 444ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 90/90 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-23 12:51:27] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:51:27] [INFO ] Invariant cache hit.
[2024-05-23 12:51:27] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-23 12:51:27] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:51:27] [INFO ] Invariant cache hit.
[2024-05-23 12:51:27] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 12:51:27] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-23 12:51:27] [INFO ] Redundant transitions in 1 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-23 12:51:27] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:51:27] [INFO ] Invariant cache hit.
[2024-05-23 12:51:27] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 143/233 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 25/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 0/233 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 118 constraints, problems are : Problem set: 0 solved, 221 unsolved in 3287 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 143/233 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 25/118 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 221/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/233 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 339 constraints, problems are : Problem set: 0 solved, 221 unsolved in 6394 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
After SMT, in 9848ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 9851ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10070 ms. Remains : 90/90 places, 223/223 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 90 transition count 137
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 93 place count 84 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 83 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 94 place count 83 transition count 120
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 126 place count 67 transition count 120
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 158 place count 51 transition count 104
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 165 place count 44 transition count 90
Iterating global reduction 3 with 7 rules applied. Total rules applied 172 place count 44 transition count 90
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 179 place count 37 transition count 76
Iterating global reduction 3 with 7 rules applied. Total rules applied 186 place count 37 transition count 76
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 193 place count 30 transition count 62
Iterating global reduction 3 with 7 rules applied. Total rules applied 200 place count 30 transition count 62
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 207 place count 30 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 207 place count 30 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 209 place count 29 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 211 place count 28 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 213 place count 28 transition count 52
Applied a total of 213 rules in 30 ms. Remains 28 /90 variables (removed 62) and now considering 52/223 (removed 171) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 52 rows 28 cols
[2024-05-23 12:51:37] [INFO ] Computed 3 invariants in 2 ms
[2024-05-23 12:51:37] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:51:37] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2024-05-23 12:51:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 12:51:37] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 12:51:37] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 12:51:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:51:37] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-23 12:51:37] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-23 12:51:37] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-23 12:51:37] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2024-05-23 12:51:37] [INFO ] Flatten gal took : 6 ms
[2024-05-23 12:51:37] [INFO ] Flatten gal took : 4 ms
[2024-05-23 12:51:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8064527858250387001.gal : 1 ms
[2024-05-23 12:51:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16512785528626899209.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8064527858250387001.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16512785528626899209.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16512785528626899209.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :19 after 126
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :126 after 7095
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :7095 after 1.03182e+09
Invariant property MIN1 does not hold.
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1.03182e+09 after 1.50336e+11
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :1.50336e+11 after 1.71841e+12
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1.71841e+12 after 2.99673e+13
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :2.99673e+13 after 6.77672e+14
Detected timeout of ITS tools.
[2024-05-23 12:51:52] [INFO ] Flatten gal took : 4 ms
[2024-05-23 12:51:52] [INFO ] Applying decomposition
[2024-05-23 12:51:52] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17940884830326909350.txt' '-o' '/tmp/graph17940884830326909350.bin' '-w' '/tmp/graph17940884830326909350.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17940884830326909350.bin' '-l' '-1' '-v' '-w' '/tmp/graph17940884830326909350.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:51:52] [INFO ] Decomposing Gal with order
[2024-05-23 12:51:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:51:52] [INFO ] Removed a total of 50 redundant transitions.
[2024-05-23 12:51:52] [INFO ] Flatten gal took : 32 ms
[2024-05-23 12:51:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-23 12:51:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13532645721753964319.gal : 1 ms
[2024-05-23 12:51:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18432640645874556342.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13532645721753964319.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18432640645874556342.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality18432640645874556342.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :19 after 126
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :126 after 9664
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :9664 after 2.56757e+07
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :2.56757e+07 after 2.26346e+08
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :2.26346e+08 after 1.21966e+09
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1.21966e+09 after 5.56575e+09
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :9.73516e+12 after 1.00565e+19
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30421 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-23 12:52:07] [INFO ] Flatten gal took : 15 ms
[2024-05-23 12:52:07] [INFO ] Applying decomposition
[2024-05-23 12:52:07] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8680576750782393709.txt' '-o' '/tmp/graph8680576750782393709.bin' '-w' '/tmp/graph8680576750782393709.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8680576750782393709.bin' '-l' '-1' '-v' '-w' '/tmp/graph8680576750782393709.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:52:07] [INFO ] Decomposing Gal with order
[2024-05-23 12:52:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:52:07] [INFO ] Removed a total of 377 redundant transitions.
[2024-05-23 12:52:07] [INFO ] Flatten gal took : 24 ms
[2024-05-23 12:52:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 11 ms.
[2024-05-23 12:52:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2802301903543997417.gal : 3 ms
[2024-05-23 12:52:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12051666820091388352.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2802301903543997417.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12051666820091388352.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality12051666820091388352.prop.
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[150, 39, 385, 136, 1363, 1770] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-b032-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 12:52:57] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
// Phase 1: matrix 143 rows 90 cols
[2024-05-23 12:52:57] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 15 ms. (625 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:[2] Max Struct:[+inf]
[2024-05-23 12:52:57] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:52:57] [INFO ] Invariant cache hit.
[2024-05-23 12:52:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:52:57] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:52:57] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 12:52:57] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:52:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:52:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:52:57] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:52:57] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:52:58] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 11 ms.
[2024-05-23 12:52:58] [INFO ] Added : 23 causal constraints over 6 iterations in 77 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 223/223 transitions.
Graph (complete) has 385 edges and 90 vertex of which 87 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 87 transition count 218
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 84 transition count 212
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 84 transition count 212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 83 transition count 208
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 83 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 82 transition count 206
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 82 transition count 206
Applied a total of 16 rules in 9 ms. Remains 82 /90 variables (removed 8) and now considering 206/223 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 82/90 places, 206/223 transitions.
[2024-05-23 12:52:58] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {30=1, 63=1, 93=1, 121=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {24=1, 57=1, 87=1, 122=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 12:52:58] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
// Phase 1: matrix 126 rows 82 cols
[2024-05-23 12:52:58] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 954 ms. (1047 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 618 ms. (1615 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[287] Max Struct:[+inf]
[2024-05-23 12:52:59] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 12:52:59] [INFO ] Invariant cache hit.
[2024-05-23 12:52:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:52:59] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 12:52:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:52:59] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:52:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:52:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:52:59] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-23 12:52:59] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:52:59] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-23 12:53:00] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-23 12:53:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2024-05-23 12:53:00] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 71 transitions) in 7 ms.
[2024-05-23 12:53:00] [INFO ] Added : 9 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[287] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[287] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 206/206 transitions.
Applied a total of 0 rules in 7 ms. Remains 82 /82 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 82/82 places, 206/206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 206/206 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-05-23 12:53:00] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 12:53:00] [INFO ] Invariant cache hit.
[2024-05-23 12:53:00] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-23 12:53:00] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 12:53:00] [INFO ] Invariant cache hit.
[2024-05-23 12:53:00] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:53:00] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-23 12:53:00] [INFO ] Redundant transitions in 0 ms returned []
Running 204 sub problems to find dead transitions.
[2024-05-23 12:53:00] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 12:53:00] [INFO ] Invariant cache hit.
[2024-05-23 12:53:00] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 126/208 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 204 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 103 constraints, problems are : Problem set: 0 solved, 204 unsolved in 3092 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 126/208 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 204/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 307 constraints, problems are : Problem set: 0 solved, 204 unsolved in 5122 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
After SMT, in 8317ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 8319ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8477 ms. Remains : 82/82 places, 206/206 transitions.
[2024-05-23 12:53:08] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {30=1, 63=1, 93=1, 121=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {24=1, 57=1, 87=1, 122=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[287] Max Struct:[+inf]
[2024-05-23 12:53:08] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 12:53:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[287] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1010 ms. (989 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 674 ms. (1481 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[287] Max Struct:[+inf]
[2024-05-23 12:53:10] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 12:53:10] [INFO ] Invariant cache hit.
[2024-05-23 12:53:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:53:10] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:53:10] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:53:10] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:53:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:53:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:53:10] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:53:10] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:53:10] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-23 12:53:10] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-23 12:53:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2024-05-23 12:53:10] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 71 transitions) in 6 ms.
[2024-05-23 12:53:10] [INFO ] Added : 9 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[287] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[287] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 206/206 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 82/82 places, 206/206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 206/206 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-05-23 12:53:10] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 12:53:10] [INFO ] Invariant cache hit.
[2024-05-23 12:53:10] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-23 12:53:10] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 12:53:10] [INFO ] Invariant cache hit.
[2024-05-23 12:53:10] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:53:10] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-23 12:53:10] [INFO ] Redundant transitions in 1 ms returned []
Running 204 sub problems to find dead transitions.
[2024-05-23 12:53:10] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 12:53:10] [INFO ] Invariant cache hit.
[2024-05-23 12:53:10] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 126/208 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 204 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 103 constraints, problems are : Problem set: 0 solved, 204 unsolved in 3552 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 126/208 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 204/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 307 constraints, problems are : Problem set: 0 solved, 204 unsolved in 5074 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
After SMT, in 8751ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 8753ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8925 ms. Remains : 82/82 places, 206/206 transitions.
[2024-05-23 12:53:19] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {30=1, 63=1, 93=1, 121=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {24=1, 57=1, 87=1, 122=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[287] Max Struct:[+inf]
[2024-05-23 12:53:19] [INFO ] Flatten gal took : 14 ms
RANDOM walk for 40000 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
[2024-05-23 12:53:19] [INFO ] Flatten gal took : 10 ms
[2024-05-23 12:53:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9878573456594231490.gal : 2 ms
[2024-05-23 12:53:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5860144018305947759.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9878573456594231490.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5860144018305947759.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5860144018305947759.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1042
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1042 after 156830
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :156830 after 1.80068e+08
Interrupted probabilistic random walk after 1949958 steps, run timeout after 3001 ms. (steps per millisecond=649 ) properties seen :0 out of 1
Probabilistic random walk after 1949958 steps, saw 1213648 distinct states, run finished after 3001 ms. (steps per millisecond=649 ) properties seen :0
[2024-05-23 12:53:22] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 12:53:22] [INFO ] Invariant cache hit.
[2024-05-23 12:53:22] [INFO ] State equation strengthened by 18 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/98 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 7/105 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/105 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/105 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 91/196 variables, 53/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/196 variables, 16/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/196 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/202 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/202 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/208 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/98 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/105 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/105 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/105 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 91/196 variables, 53/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/196 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/196 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/202 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/202 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/208 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/208 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/208 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 215ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 468 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 206/206 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 206/206 transitions.
RANDOM walk for 40002 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.80068e+08 after 2.93374e+12
Interrupted probabilistic random walk after 1900056 steps, run timeout after 3001 ms. (steps per millisecond=633 ) properties seen :0 out of 1
Probabilistic random walk after 1900056 steps, saw 1182587 distinct states, run finished after 3001 ms. (steps per millisecond=633 ) properties seen :0
[2024-05-23 12:53:26] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 12:53:26] [INFO ] Invariant cache hit.
[2024-05-23 12:53:26] [INFO ] State equation strengthened by 18 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/98 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 7/105 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/105 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/105 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 91/196 variables, 53/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/196 variables, 16/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/196 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/202 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/202 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/208 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/98 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/105 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/105 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/105 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 91/196 variables, 53/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/196 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/196 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/202 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/202 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/208 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/208 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/208 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 443 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 206/206 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 206/206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 206/206 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-05-23 12:53:27] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 12:53:27] [INFO ] Invariant cache hit.
[2024-05-23 12:53:27] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-23 12:53:27] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 12:53:27] [INFO ] Invariant cache hit.
[2024-05-23 12:53:27] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:53:27] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-23 12:53:27] [INFO ] Redundant transitions in 1 ms returned []
Running 204 sub problems to find dead transitions.
[2024-05-23 12:53:27] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 12:53:27] [INFO ] Invariant cache hit.
[2024-05-23 12:53:27] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 126/208 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 204 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 103 constraints, problems are : Problem set: 0 solved, 204 unsolved in 3020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 126/208 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 204/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 307 constraints, problems are : Problem set: 0 solved, 204 unsolved in 4913 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
After SMT, in 8037ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 8040ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8202 ms. Remains : 82/82 places, 206/206 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 82 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 92 place count 76 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 92 place count 76 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 126 place count 59 transition count 103
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 156 place count 44 transition count 88
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 163 place count 37 transition count 74
Iterating global reduction 2 with 7 rules applied. Total rules applied 170 place count 37 transition count 74
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 177 place count 30 transition count 60
Iterating global reduction 2 with 7 rules applied. Total rules applied 184 place count 30 transition count 60
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 191 place count 23 transition count 46
Iterating global reduction 2 with 7 rules applied. Total rules applied 198 place count 23 transition count 46
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 205 place count 23 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 205 place count 23 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 207 place count 22 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 20 transition count 38
Applied a total of 211 rules in 14 ms. Remains 20 /82 variables (removed 62) and now considering 38/206 (removed 168) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 38 rows 20 cols
[2024-05-23 12:53:35] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 12:53:35] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 12:53:35] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 12:53:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 12:53:35] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 12:53:35] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 12:53:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 12:53:35] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 12:53:35] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 12:53:35] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 12:53:35] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 12:53:35] [INFO ] Flatten gal took : 2 ms
[2024-05-23 12:53:35] [INFO ] Flatten gal took : 2 ms
[2024-05-23 12:53:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9794020622363719238.gal : 1 ms
[2024-05-23 12:53:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9300847358925349568.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9794020622363719238.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9300847358925349568.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9300847358925349568.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 126
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :126 after 11556
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :11556 after 7.75751e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7.75751e+06 after 6.04406e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.04406e+07 after 3.13809e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.13809e+08 after 1.41049e+09
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.41049e+09 after 5.96009e+09
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.93374e+12 after 3.63685e+17
Detected timeout of ITS tools.
[2024-05-23 12:53:50] [INFO ] Flatten gal took : 3 ms
[2024-05-23 12:53:50] [INFO ] Applying decomposition
[2024-05-23 12:53:50] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1984664531144626288.txt' '-o' '/tmp/graph1984664531144626288.bin' '-w' '/tmp/graph1984664531144626288.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1984664531144626288.bin' '-l' '-1' '-v' '-w' '/tmp/graph1984664531144626288.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:53:50] [INFO ] Decomposing Gal with order
[2024-05-23 12:53:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:53:50] [INFO ] Removed a total of 47 redundant transitions.
[2024-05-23 12:53:50] [INFO ] Flatten gal took : 3 ms
[2024-05-23 12:53:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2024-05-23 12:53:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11689126454640215230.gal : 1 ms
[2024-05-23 12:53:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10018707666390224153.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11689126454640215230.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10018707666390224153.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality10018707666390224153.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 126
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30183 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-23 12:54:05] [INFO ] Flatten gal took : 8 ms
[2024-05-23 12:54:05] [INFO ] Applying decomposition
[2024-05-23 12:54:05] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11755842249687666053.txt' '-o' '/tmp/graph11755842249687666053.bin' '-w' '/tmp/graph11755842249687666053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11755842249687666053.bin' '-l' '-1' '-v' '-w' '/tmp/graph11755842249687666053.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:54:05] [INFO ] Decomposing Gal with order
[2024-05-23 12:54:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:54:05] [INFO ] Removed a total of 351 redundant transitions.
[2024-05-23 12:54:05] [INFO ] Flatten gal took : 16 ms
[2024-05-23 12:54:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 6 ms.
[2024-05-23 12:54:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8825175006948650871.gal : 2 ms
[2024-05-23 12:54:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7775327184572254595.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8825175006948650871.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7775327184572254595.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality7775327184572254595.prop.
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[287] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b032-UpperBounds-02 in 117759 ms.
Starting property specific reduction for FunctionPointer-PT-b032-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 12:54:55] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
// Phase 1: matrix 143 rows 90 cols
[2024-05-23 12:54:55] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10002 steps (2 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[31] Max Struct:[+inf]
[2024-05-23 12:54:55] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:54:55] [INFO ] Invariant cache hit.
[2024-05-23 12:54:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:54:55] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:54:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 12:54:55] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:54:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:54:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:54:55] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:54:55] [INFO ] [Nat]Added 25 Read/Feed constraints in 6 ms returned sat
[2024-05-23 12:54:55] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-23 12:54:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-23 12:54:55] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 10 ms.
[2024-05-23 12:54:55] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-23 12:54:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-23 12:54:55] [INFO ] Added : 7 causal constraints over 4 iterations in 110 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[31] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[31] Max Struct:[+inf]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 223/223 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 86 transition count 215
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 86 transition count 215
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 84 transition count 209
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 84 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 83 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 83 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 82 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 82 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 81 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 81 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 80 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 80 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 79 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 79 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 78 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 78 transition count 195
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 77 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 77 transition count 193
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 76 transition count 191
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 76 transition count 191
Applied a total of 28 rules in 10 ms. Remains 76 /90 variables (removed 14) and now considering 191/223 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 76/90 places, 191/223 transitions.
[2024-05-23 12:54:55] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {31=1, 56=1, 102=1, 115=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {31=1, 56=1, 86=1, 112=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[6]
Current structural bounds on expressions (after cover walk) : Max Seen:[31] Max Struct:[+inf]
[2024-05-23 12:54:56] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2024-05-23 12:54:56] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[31] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 933 ms. (1070 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 517 ms. (1930 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[33] Max Struct:[+inf]
[2024-05-23 12:54:57] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 12:54:57] [INFO ] Invariant cache hit.
[2024-05-23 12:54:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:54:57] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 12:54:57] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:54:57] [INFO ] [Real]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:54:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:54:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:54:57] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 12:54:57] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:54:57] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-23 12:54:57] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-23 12:54:57] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-23 12:54:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 134 ms
[2024-05-23 12:54:57] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 7 ms.
[2024-05-23 12:54:57] [INFO ] Added : 12 causal constraints over 5 iterations in 41 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[33] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[33] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-23 12:54:57] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 12:54:57] [INFO ] Invariant cache hit.
[2024-05-23 12:54:57] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-23 12:54:57] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 12:54:57] [INFO ] Invariant cache hit.
[2024-05-23 12:54:57] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:54:58] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-23 12:54:58] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-23 12:54:58] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 12:54:58] [INFO ] Invariant cache hit.
[2024-05-23 12:54:58] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 189 unsolved in 2677 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 189/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 286 constraints, problems are : Problem set: 0 solved, 189 unsolved in 4740 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 7510ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 7513ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7688 ms. Remains : 76/76 places, 191/191 transitions.
[2024-05-23 12:55:05] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {31=1, 56=1, 102=1, 115=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 56=1, 86=1, 112=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[33] Max Struct:[+inf]
[2024-05-23 12:55:05] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 12:55:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[33] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 764 ms. (1307 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 521 ms. (1915 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[33] Max Struct:[+inf]
[2024-05-23 12:55:06] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 12:55:06] [INFO ] Invariant cache hit.
[2024-05-23 12:55:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:55:06] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:55:06] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:55:06] [INFO ] [Real]Added 18 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:55:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:55:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:55:06] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 12:55:07] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:55:07] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-23 12:55:07] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-23 12:55:07] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-23 12:55:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 141 ms
[2024-05-23 12:55:07] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-23 12:55:07] [INFO ] Added : 12 causal constraints over 5 iterations in 43 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[33] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[33] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-23 12:55:07] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 12:55:07] [INFO ] Invariant cache hit.
[2024-05-23 12:55:07] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-23 12:55:07] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 12:55:07] [INFO ] Invariant cache hit.
[2024-05-23 12:55:07] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:55:07] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-23 12:55:07] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-23 12:55:07] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 12:55:07] [INFO ] Invariant cache hit.
[2024-05-23 12:55:07] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 189 unsolved in 2705 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 189/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 286 constraints, problems are : Problem set: 0 solved, 189 unsolved in 4775 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 7574ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 7578ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7751 ms. Remains : 76/76 places, 191/191 transitions.
[2024-05-23 12:55:14] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {31=1, 56=1, 102=1, 115=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 56=1, 86=1, 112=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[33] Max Struct:[+inf]
[2024-05-23 12:55:15] [INFO ] Flatten gal took : 14 ms
[2024-05-23 12:55:15] [INFO ] Flatten gal took : 17 ms
[2024-05-23 12:55:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18036256153347344234.gal : 1 ms
[2024-05-23 12:55:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2615173002131243931.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18036256153347344234.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2615173002131243931.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2615173002131243931.prop.
RANDOM walk for 37597 steps (8 resets) in 125 ms. (298 steps per ms) remains 0/1 properties
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[33] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b032-UpperBounds-03 in 19541 ms.
Starting property specific reduction for FunctionPointer-PT-b032-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 12:55:15] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
// Phase 1: matrix 143 rows 90 cols
[2024-05-23 12:55:15] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 11 ms. (833 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:[2] Max Struct:[+inf]
[2024-05-23 12:55:15] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:55:15] [INFO ] Invariant cache hit.
[2024-05-23 12:55:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:55:15] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:55:15] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 12:55:15] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:55:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:55:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:55:15] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 12:55:15] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:55:15] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-23 12:55:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-23 12:55:15] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 7 ms.
[2024-05-23 12:55:15] [INFO ] Added : 15 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 223/223 transitions.
Graph (complete) has 385 edges and 90 vertex of which 87 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 87 transition count 218
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 83 transition count 210
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 83 transition count 210
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 81 transition count 204
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 81 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 80 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 80 transition count 202
Applied a total of 20 rules in 8 ms. Remains 80 /90 variables (removed 10) and now considering 202/223 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 80/90 places, 202/223 transitions.
[2024-05-23 12:55:15] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
Found an invariant !
This invariant on transitions {27=1, 58=1, 104=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 60=1, 90=1, 119=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :[6]
Current structural bounds on expressions (after cover walk) : Max Seen:[6] Max Struct:[+inf]
[2024-05-23 12:55:15] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
// Phase 1: matrix 124 rows 80 cols
[2024-05-23 12:55:15] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 950 ms. (1051 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 587 ms. (1700 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[696] Max Struct:[+inf]
[2024-05-23 12:55:17] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-23 12:55:17] [INFO ] Invariant cache hit.
[2024-05-23 12:55:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:55:17] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-23 12:55:17] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:55:17] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:55:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:55:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:55:17] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 12:55:17] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:55:17] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 69 transitions) in 6 ms.
[2024-05-23 12:55:17] [INFO ] Added : 9 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[696] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[696] Max Struct:[+inf]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 7 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 80/80 places, 202/202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 9 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-23 12:55:18] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-23 12:55:18] [INFO ] Invariant cache hit.
[2024-05-23 12:55:18] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-23 12:55:18] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-23 12:55:18] [INFO ] Invariant cache hit.
[2024-05-23 12:55:18] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:55:19] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-23 12:55:19] [INFO ] Redundant transitions in 1 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-23 12:55:19] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-23 12:55:19] [INFO ] Invariant cache hit.
[2024-05-23 12:55:19] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 124/204 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 200 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 101 constraints, problems are : Problem set: 0 solved, 200 unsolved in 2897 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 124/204 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 200/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/204 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 301 constraints, problems are : Problem set: 0 solved, 200 unsolved in 5495 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 8496ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 8501ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8681 ms. Remains : 80/80 places, 202/202 transitions.
[2024-05-23 12:55:27] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
Found an invariant !
This invariant on transitions {27=1, 58=1, 104=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 60=1, 90=1, 119=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-23 12:55:27] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-23 12:55:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 943 ms. (1059 steps per ms)
FORMULA FunctionPointer-PT-b032-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-23 12:55:28] [INFO ] Flatten gal took : 7 ms
[2024-05-23 12:55:28] [INFO ] Flatten gal took : 7 ms
[2024-05-23 12:55:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16047405865815655870.gal : 2 ms
[2024-05-23 12:55:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17361391960524649516.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16047405865815655870.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17361391960524649516.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-b032-UpperBounds-04 in 13443 ms.
Starting property specific reduction for FunctionPointer-PT-b032-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 12:55:28] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
// Phase 1: matrix 143 rows 90 cols
[2024-05-23 12:55:28] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10004 steps (2 resets) in 12 ms. (769 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:[0] Max Struct:[+inf]
[2024-05-23 12:55:28] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:55:28] [INFO ] Invariant cache hit.
[2024-05-23 12:55:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:55:28] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:55:28] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 12:55:28] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:55:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:55:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:55:28] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:55:28] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:55:28] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 7 ms.
[2024-05-23 12:55:28] [INFO ] Added : 21 causal constraints over 6 iterations in 60 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 223/223 transitions.
Graph (complete) has 385 edges and 90 vertex of which 87 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 87 transition count 218
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 84 transition count 212
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 84 transition count 212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 83 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 83 transition count 210
Applied a total of 14 rules in 5 ms. Remains 83 /90 variables (removed 7) and now considering 210/223 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 83/90 places, 210/223 transitions.
[2024-05-23 12:55:28] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {29=1, 64=1, 96=1, 126=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 64=1, 112=1, 128=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 12:55:28] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
// Phase 1: matrix 130 rows 83 cols
[2024-05-23 12:55:28] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 954 ms. (1047 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 634 ms. (1574 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[271] Max Struct:[+inf]
[2024-05-23 12:55:30] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-23 12:55:30] [INFO ] Invariant cache hit.
[2024-05-23 12:55:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:55:30] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 12:55:30] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:55:30] [INFO ] [Real]Added 18 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:55:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:55:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:55:30] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:55:30] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:55:30] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-23 12:55:30] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-23 12:55:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2024-05-23 12:55:30] [INFO ] Computed and/alt/rep : 61/202/55 causal constraints (skipped 73 transitions) in 7 ms.
[2024-05-23 12:55:30] [INFO ] Added : 15 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[271] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[271] Max Struct:[+inf]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 83/83 places, 210/210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-23 12:55:31] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-23 12:55:31] [INFO ] Invariant cache hit.
[2024-05-23 12:55:31] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-23 12:55:31] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-23 12:55:31] [INFO ] Invariant cache hit.
[2024-05-23 12:55:31] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:55:31] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-23 12:55:31] [INFO ] Redundant transitions in 1 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-23 12:55:31] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-23 12:55:31] [INFO ] Invariant cache hit.
[2024-05-23 12:55:31] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 130/213 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 208 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 104 constraints, problems are : Problem set: 0 solved, 208 unsolved in 3430 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 130/213 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 208/312 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/213 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 312 constraints, problems are : Problem set: 0 solved, 208 unsolved in 5931 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 9486ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 9491ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9659 ms. Remains : 83/83 places, 210/210 transitions.
[2024-05-23 12:55:41] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {29=1, 64=1, 96=1, 126=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 64=1, 112=1, 128=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[271] Max Struct:[+inf]
[2024-05-23 12:55:41] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-23 12:55:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[271] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 937 ms. (1066 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 641 ms. (1557 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[271] Max Struct:[+inf]
[2024-05-23 12:55:42] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-23 12:55:42] [INFO ] Invariant cache hit.
[2024-05-23 12:55:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:55:42] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 12:55:42] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:55:42] [INFO ] [Real]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:55:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:55:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:55:43] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:55:43] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:55:43] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-23 12:55:43] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-23 12:55:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-05-23 12:55:43] [INFO ] Computed and/alt/rep : 61/202/55 causal constraints (skipped 73 transitions) in 6 ms.
[2024-05-23 12:55:43] [INFO ] Added : 15 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[271] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[271] Max Struct:[+inf]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 83/83 places, 210/210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-23 12:55:43] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-23 12:55:43] [INFO ] Invariant cache hit.
[2024-05-23 12:55:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-23 12:55:44] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-23 12:55:44] [INFO ] Invariant cache hit.
[2024-05-23 12:55:44] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:55:44] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-23 12:55:44] [INFO ] Redundant transitions in 0 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-23 12:55:44] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-23 12:55:44] [INFO ] Invariant cache hit.
[2024-05-23 12:55:44] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 130/213 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 208 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 104 constraints, problems are : Problem set: 0 solved, 208 unsolved in 3444 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 130/213 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 208/312 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/213 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 312 constraints, problems are : Problem set: 0 solved, 208 unsolved in 5815 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 9372ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 9374ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9547 ms. Remains : 83/83 places, 210/210 transitions.
[2024-05-23 12:55:53] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {29=1, 64=1, 96=1, 126=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {29=1, 64=1, 112=1, 128=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[271] Max Struct:[+inf]
[2024-05-23 12:55:53] [INFO ] Flatten gal took : 7 ms
[2024-05-23 12:55:53] [INFO ] Flatten gal took : 7 ms
[2024-05-23 12:55:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4450223783112467604.gal : 1 ms
RANDOM walk for 40000 steps (8 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
[2024-05-23 12:55:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9400600381721590774.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4450223783112467604.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9400600381721590774.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9400600381721590774.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1047
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1047 after 160980
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :160980 after 2.03573e+08
Interrupted probabilistic random walk after 1867175 steps, run timeout after 3001 ms. (steps per millisecond=622 ) properties seen :0 out of 1
Probabilistic random walk after 1867175 steps, saw 1162126 distinct states, run finished after 3001 ms. (steps per millisecond=622 ) properties seen :0
[2024-05-23 12:55:56] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-23 12:55:56] [INFO ] Invariant cache hit.
[2024-05-23 12:55:56] [INFO ] State equation strengthened by 18 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/84 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 102/186 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 17/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 6/192 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/206 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/206 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/210 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/210 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/213 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 18/18 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/84 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 102/186 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 17/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/192 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/206 variables, 12/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/206 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/210 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/213 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/213 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/213 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 105 constraints, problems are : Problem set: 0 solved, 1 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 185ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 83/83 places, 210/210 transitions.
RANDOM walk for 40005 steps (8 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.03573e+08 after 4.09207e+12
Interrupted probabilistic random walk after 1785596 steps, run timeout after 3001 ms. (steps per millisecond=595 ) properties seen :0 out of 1
Probabilistic random walk after 1785596 steps, saw 1111347 distinct states, run finished after 3002 ms. (steps per millisecond=594 ) properties seen :0
[2024-05-23 12:55:59] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-23 12:55:59] [INFO ] Invariant cache hit.
[2024-05-23 12:55:59] [INFO ] State equation strengthened by 18 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/84 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 102/186 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 17/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 6/192 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/206 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/206 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/210 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/210 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/213 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 18/18 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/84 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 102/186 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 17/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/192 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/206 variables, 12/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/206 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/210 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/213 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/213 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/213 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 105 constraints, problems are : Problem set: 0 solved, 1 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 83/83 places, 210/210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-23 12:56:00] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-23 12:56:00] [INFO ] Invariant cache hit.
[2024-05-23 12:56:00] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 12:56:00] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-23 12:56:00] [INFO ] Invariant cache hit.
[2024-05-23 12:56:00] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:56:00] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-23 12:56:00] [INFO ] Redundant transitions in 0 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-23 12:56:00] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-23 12:56:00] [INFO ] Invariant cache hit.
[2024-05-23 12:56:00] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 130/213 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 208 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 104 constraints, problems are : Problem set: 0 solved, 208 unsolved in 3486 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 130/213 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 208/312 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/213 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 312 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 9640ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 9642ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9807 ms. Remains : 83/83 places, 210/210 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 83 transition count 122
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 96 place count 75 transition count 122
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 96 place count 75 transition count 106
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 128 place count 59 transition count 106
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 158 place count 44 transition count 91
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 165 place count 37 transition count 77
Iterating global reduction 2 with 7 rules applied. Total rules applied 172 place count 37 transition count 77
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 179 place count 30 transition count 63
Iterating global reduction 2 with 7 rules applied. Total rules applied 186 place count 30 transition count 63
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 193 place count 23 transition count 49
Iterating global reduction 2 with 7 rules applied. Total rules applied 200 place count 23 transition count 49
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 207 place count 23 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 207 place count 23 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 209 place count 22 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 213 place count 20 transition count 41
Applied a total of 213 rules in 10 ms. Remains 20 /83 variables (removed 63) and now considering 41/210 (removed 169) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 41 rows 20 cols
[2024-05-23 12:56:09] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 12:56:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:56:09] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 12:56:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 12:56:09] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 12:56:09] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 12:56:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 12:56:09] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 12:56:09] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 12:56:09] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 12:56:09] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 12:56:09] [INFO ] Flatten gal took : 2 ms
[2024-05-23 12:56:09] [INFO ] Flatten gal took : 2 ms
[2024-05-23 12:56:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality747823671009299971.gal : 1 ms
[2024-05-23 12:56:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3599570191964248023.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality747823671009299971.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3599570191964248023.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality3599570191964248023.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 126
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :126 after 11556
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :11556 after 7.75751e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7.75751e+06 after 6.04406e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.04406e+07 after 3.13809e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.13809e+08 after 1.41049e+09
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.41049e+09 after 5.96009e+09
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4.09207e+12 after 8.80518e+17
Detected timeout of ITS tools.
[2024-05-23 12:56:24] [INFO ] Flatten gal took : 2 ms
[2024-05-23 12:56:24] [INFO ] Applying decomposition
[2024-05-23 12:56:24] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph839890520052788655.txt' '-o' '/tmp/graph839890520052788655.bin' '-w' '/tmp/graph839890520052788655.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph839890520052788655.bin' '-l' '-1' '-v' '-w' '/tmp/graph839890520052788655.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:56:24] [INFO ] Decomposing Gal with order
[2024-05-23 12:56:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:56:25] [INFO ] Removed a total of 47 redundant transitions.
[2024-05-23 12:56:25] [INFO ] Flatten gal took : 12 ms
[2024-05-23 12:56:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2024-05-23 12:56:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13789102728156934670.gal : 1 ms
[2024-05-23 12:56:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4004082738243089422.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13789102728156934670.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4004082738243089422.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality4004082738243089422.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 126
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :126 after 4323
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4323 after 414579
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :414579 after 1.18053e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.18053e+06 after 2.71244e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.71244e+06 after 5.77624e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.77624e+06 after 1.19039e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.19039e+07 after 2.41591e+07
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30200 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-23 12:56:40] [INFO ] Flatten gal took : 10 ms
[2024-05-23 12:56:40] [INFO ] Applying decomposition
[2024-05-23 12:56:40] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18394232246774901693.txt' '-o' '/tmp/graph18394232246774901693.bin' '-w' '/tmp/graph18394232246774901693.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18394232246774901693.bin' '-l' '-1' '-v' '-w' '/tmp/graph18394232246774901693.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:56:40] [INFO ] Decomposing Gal with order
[2024-05-23 12:56:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:56:40] [INFO ] Removed a total of 360 redundant transitions.
[2024-05-23 12:56:40] [INFO ] Flatten gal took : 11 ms
[2024-05-23 12:56:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 5 ms.
[2024-05-23 12:56:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15264939043389954123.gal : 1 ms
[2024-05-23 12:56:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10657658427513737170.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15264939043389954123.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10657658427513737170.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality10657658427513737170.prop.
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[271] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b032-UpperBounds-09 in 121620 ms.
Starting property specific reduction for FunctionPointer-PT-b032-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 12:57:30] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
// Phase 1: matrix 143 rows 90 cols
[2024-05-23 12:57:30] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 17 ms. (555 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:[10] Max Struct:[+inf]
[2024-05-23 12:57:30] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:57:30] [INFO ] Invariant cache hit.
[2024-05-23 12:57:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:57:30] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:57:30] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 12:57:30] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:57:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:57:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:57:30] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:57:30] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:57:30] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 7 ms.
[2024-05-23 12:57:30] [INFO ] Added : 29 causal constraints over 10 iterations in 105 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[+inf]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 223/223 transitions.
Graph (complete) has 385 edges and 90 vertex of which 87 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 87 transition count 218
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 84 transition count 212
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 84 transition count 212
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 82 transition count 206
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 82 transition count 206
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 81 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 81 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 80 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 80 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 79 transition count 198
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 79 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 78 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 78 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 77 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 77 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 76 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 76 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 75 transition count 190
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 75 transition count 190
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 74 transition count 188
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 74 transition count 188
Applied a total of 32 rules in 12 ms. Remains 74 /90 variables (removed 16) and now considering 188/223 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 74/90 places, 188/223 transitions.
[2024-05-23 12:57:30] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
Found an invariant !
This invariant on transitions {24=1, 50=1, 95=1, 113=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 55=1, 100=1, 114=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[10] Max Struct:[+inf]
[2024-05-23 12:57:30] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
// Phase 1: matrix 115 rows 74 cols
[2024-05-23 12:57:30] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 964 ms. (1036 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 577 ms. (1730 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2304] Max Struct:[+inf]
[2024-05-23 12:57:32] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 12:57:32] [INFO ] Invariant cache hit.
[2024-05-23 12:57:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:57:32] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:57:32] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 12:57:32] [INFO ] [Real]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:57:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:57:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:57:32] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 12:57:32] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:57:32] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-23 12:57:32] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-23 12:57:32] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-23 12:57:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 136 ms
[2024-05-23 12:57:32] [INFO ] Computed and/alt/rep : 60/195/52 causal constraints (skipped 61 transitions) in 5 ms.
[2024-05-23 12:57:32] [INFO ] Added : 6 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2304] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4392] Max Struct:[+inf]
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 74/74 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-23 12:57:34] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 12:57:34] [INFO ] Invariant cache hit.
[2024-05-23 12:57:34] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 12:57:34] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 12:57:34] [INFO ] Invariant cache hit.
[2024-05-23 12:57:34] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 12:57:34] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-23 12:57:34] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-23 12:57:34] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 12:57:34] [INFO ] Invariant cache hit.
[2024-05-23 12:57:34] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 115/189 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 94 constraints, problems are : Problem set: 0 solved, 186 unsolved in 2636 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 115/189 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 186/280 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/189 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 280 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4546 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 7274ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 7276ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7436 ms. Remains : 74/74 places, 188/188 transitions.
[2024-05-23 12:57:41] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
Found an invariant !
This invariant on transitions {24=1, 50=1, 95=1, 113=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 55=1, 100=1, 114=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[14]
Current structural bounds on expressions (after cover walk) : Max Seen:[4392] Max Struct:[+inf]
[2024-05-23 12:57:41] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 12:57:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4392] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 986 ms. (1013 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 582 ms. (1715 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4392] Max Struct:[+inf]
[2024-05-23 12:57:43] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 12:57:43] [INFO ] Invariant cache hit.
[2024-05-23 12:57:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:57:43] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 12:57:43] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 12:57:43] [INFO ] [Real]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:57:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:57:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:57:43] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 12:57:43] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:57:43] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-23 12:57:43] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-23 12:57:43] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-23 12:57:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 126 ms
[2024-05-23 12:57:43] [INFO ] Computed and/alt/rep : 60/195/52 causal constraints (skipped 61 transitions) in 6 ms.
[2024-05-23 12:57:43] [INFO ] Added : 6 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4392] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4392] Max Struct:[+inf]
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 74/74 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-23 12:57:47] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 12:57:47] [INFO ] Invariant cache hit.
[2024-05-23 12:57:47] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-23 12:57:47] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 12:57:47] [INFO ] Invariant cache hit.
[2024-05-23 12:57:47] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 12:57:47] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-23 12:57:47] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-23 12:57:47] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 12:57:47] [INFO ] Invariant cache hit.
[2024-05-23 12:57:47] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 115/189 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 94 constraints, problems are : Problem set: 0 solved, 186 unsolved in 2602 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 115/189 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 186/280 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/189 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 280 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4543 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 7236ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 7238ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7410 ms. Remains : 74/74 places, 188/188 transitions.
[2024-05-23 12:57:55] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
Found an invariant !
This invariant on transitions {24=1, 50=1, 95=1, 113=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 55=1, 100=1, 114=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[13]
Current structural bounds on expressions (after cover walk) : Max Seen:[4392] Max Struct:[+inf]
[2024-05-23 12:57:55] [INFO ] Flatten gal took : 8 ms
RANDOM walk for 40005 steps (8 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
[2024-05-23 12:57:55] [INFO ] Flatten gal took : 5 ms
[2024-05-23 12:57:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13591244043692601955.gal : 1 ms
[2024-05-23 12:57:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2430444076992367555.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13591244043692601955.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2430444076992367555.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2430444076992367555.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1038
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1038 after 153135
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :153135 after 1.6579e+08
Interrupted probabilistic random walk after 1326713 steps, run timeout after 3001 ms. (steps per millisecond=442 ) properties seen :0 out of 1
Probabilistic random walk after 1326713 steps, saw 823207 distinct states, run finished after 3001 ms. (steps per millisecond=442 ) properties seen :0
[2024-05-23 12:57:58] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 12:57:58] [INFO ] Invariant cache hit.
[2024-05-23 12:57:58] [INFO ] State equation strengthened by 17 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 64/68 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/74 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/166 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 17/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/172 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/182 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/186 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/186 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/189 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 94 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 17/17 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 64/68 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/74 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/166 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 17/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/172 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/182 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/186 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/186 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/189 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/189 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/189 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 140ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 35014 steps, including 1000 resets, run visited all 1 properties in 46 ms. (steps per millisecond=761 )
Parikh walk visited 1 properties in 51 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4392] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b032-UpperBounds-12 in 28248 ms.
Starting property specific reduction for FunctionPointer-PT-b032-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 12:57:58] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
// Phase 1: matrix 143 rows 90 cols
[2024-05-23 12:57:58] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 15 ms. (625 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:[10] Max Struct:[+inf]
[2024-05-23 12:57:58] [INFO ] Flow matrix only has 143 transitions (discarded 80 similar events)
[2024-05-23 12:57:58] [INFO ] Invariant cache hit.
[2024-05-23 12:57:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:57:58] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:57:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 12:57:58] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:57:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:57:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:57:58] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:57:58] [INFO ] [Nat]Added 25 Read/Feed constraints in 5 ms returned sat
[2024-05-23 12:57:58] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-05-23 12:57:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-23 12:57:58] [INFO ] Computed and/alt/rep : 62/300/58 causal constraints (skipped 83 transitions) in 11 ms.
[2024-05-23 12:57:58] [INFO ] Added : 14 causal constraints over 6 iterations in 66 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[+inf]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 223/223 transitions.
Graph (complete) has 385 edges and 90 vertex of which 87 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 87 transition count 218
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 84 transition count 212
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 84 transition count 212
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 82 transition count 206
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 82 transition count 206
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 81 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 81 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 80 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 80 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 79 transition count 198
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 79 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 78 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 78 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 77 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 77 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 76 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 76 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 75 transition count 190
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 75 transition count 190
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 74 transition count 188
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 74 transition count 188
Applied a total of 32 rules in 19 ms. Remains 74 /90 variables (removed 16) and now considering 188/223 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 74/90 places, 188/223 transitions.
[2024-05-23 12:57:58] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
Found an invariant !
This invariant on transitions {24=1, 50=1, 95=1, 113=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 55=1, 100=1, 114=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[6]
Current structural bounds on expressions (after cover walk) : Max Seen:[10] Max Struct:[+inf]
[2024-05-23 12:57:58] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
// Phase 1: matrix 115 rows 74 cols
[2024-05-23 12:57:58] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 928 ms. (1076 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 577 ms. (1730 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2126] Max Struct:[+inf]
[2024-05-23 12:58:00] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 12:58:00] [INFO ] Invariant cache hit.
[2024-05-23 12:58:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:58:00] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 12:58:00] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 12:58:00] [INFO ] [Real]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:58:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:58:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:58:00] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 12:58:00] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:58:00] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
[2024-05-23 12:58:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-23 12:58:00] [INFO ] Computed and/alt/rep : 60/195/52 causal constraints (skipped 61 transitions) in 5 ms.
[2024-05-23 12:58:00] [INFO ] Added : 4 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2126] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[56797] Max Struct:[+inf]
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 74/74 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-23 12:58:02] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 12:58:02] [INFO ] Invariant cache hit.
[2024-05-23 12:58:02] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-23 12:58:02] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 12:58:02] [INFO ] Invariant cache hit.
[2024-05-23 12:58:02] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 12:58:02] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-23 12:58:02] [INFO ] Redundant transitions in 0 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-23 12:58:02] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 12:58:02] [INFO ] Invariant cache hit.
[2024-05-23 12:58:02] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 115/189 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 94 constraints, problems are : Problem set: 0 solved, 186 unsolved in 2697 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 115/189 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 186/280 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/189 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 280 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4841 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 7631ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 7633ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7810 ms. Remains : 74/74 places, 188/188 transitions.
[2024-05-23 12:58:10] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
Found an invariant !
This invariant on transitions {24=1, 50=1, 95=1, 113=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {29=1, 55=1, 100=1, 114=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-23 12:58:10] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 12:58:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 875 ms. (1141 steps per ms)
FORMULA FunctionPointer-PT-b032-UpperBounds-15 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-23 12:58:11] [INFO ] Flatten gal took : 11 ms
[2024-05-23 12:58:11] [INFO ] Flatten gal took : 5 ms
[2024-05-23 12:58:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3258616855450091340.gal : 4 ms
[2024-05-23 12:58:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12980565401638883768.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3258616855450091340.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12980565401638883768.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-b032-UpperBounds-15 in 12950 ms.
[2024-05-23 12:58:11] [INFO ] Flatten gal took : 17 ms
[2024-05-23 12:58:11] [INFO ] Applying decomposition
[2024-05-23 12:58:11] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16255699400045462429.txt' '-o' '/tmp/graph16255699400045462429.bin' '-w' '/tmp/graph16255699400045462429.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16255699400045462429.bin' '-l' '-1' '-v' '-w' '/tmp/graph16255699400045462429.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:58:11] [INFO ] Decomposing Gal with order
[2024-05-23 12:58:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:58:11] [INFO ] Removed a total of 377 redundant transitions.
[2024-05-23 12:58:11] [INFO ] Flatten gal took : 12 ms
[2024-05-23 12:58:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 19 ms.
[2024-05-23 12:58:11] [INFO ] Time to serialize gal into /tmp/UpperBounds589384220750129727.gal : 2 ms
[2024-05-23 12:58:11] [INFO ] Time to serialize properties into /tmp/UpperBounds13668187486644284461.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds589384220750129727.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13668187486644284461.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds13668187486644284461.prop.
ITS-tools command line returned an error code 137
[2024-05-23 13:21:17] [INFO ] Flatten gal took : 7 ms
[2024-05-23 13:21:17] [INFO ] Time to serialize gal into /tmp/UpperBounds1133472165180411231.gal : 14 ms
[2024-05-23 13:21:17] [INFO ] Time to serialize properties into /tmp/UpperBounds10881518860205727560.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1133472165180411231.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10881518860205727560.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds10881518860205727560.prop.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-b032, 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 r180-tall-171640603000253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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