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.r224-tall-171649612000061.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 JoinFreeModules-PT-0200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-171649612000061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 11 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:50 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 613K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716538868085

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 08:21:09] [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-24 08:21:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 08:21:09] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2024-05-24 08:21:09] [INFO ] Transformed 1001 places.
[2024-05-24 08:21:09] [INFO ] Transformed 1601 transitions.
[2024-05-24 08:21:09] [INFO ] Parsed PT model containing 1001 places and 1601 transitions and 4602 arcs in 261 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[1, 200, 0, 200, 2, 200, 1, 2, 2, 0, 0, 0, 0, 0, 0, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 200, 0, 200, 2, 200, 1, 2, 2, 0, 0, 0, 0, 0, 0, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 1601 rows 1000 cols
[2024-05-24 08:21:09] [INFO ] Computed 200 invariants in 38 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 200, 0, 200, 2, 200, 1, 2, 2, 0, 0, 0, 0, 0, 0, 2] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 10029 steps (2 resets) in 125 ms. (79 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 1557 ms. (102 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 200, 12, 200, 2, 200, 10, 2, 2, 12, 9, 12, 12, 9, 12, 2] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2024-05-24 08:21:11] [INFO ] Invariant cache hit.
[2024-05-24 08:21:11] [INFO ] [Real]Absence check using 200 positive place invariants in 49 ms returned sat
[2024-05-24 08:21:12] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2024-05-24 08:21:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:21:12] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2024-05-24 08:21:12] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2024-05-24 08:21:12] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-24 08:21:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 08:21:13] [INFO ] [Nat]Added 200 Read/Feed constraints in 521 ms returned sat
[2024-05-24 08:21:13] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 90 ms.
1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-24 08:21:17] [INFO ] [Real]Absence check using 200 positive place invariants in 38 ms returned sat
[2024-05-24 08:21:17] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2024-05-24 08:21:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:21:18] [INFO ] [Nat]Absence check using 200 positive place invariants in 43 ms returned sat
[2024-05-24 08:21:19] [INFO ] [Nat]Absence check using state equation in 1041 ms returned sat
[2024-05-24 08:21:19] [INFO ] [Nat]Added 200 Read/Feed constraints in 128 ms returned sat
[2024-05-24 08:21:19] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 83 ms.
[2024-05-24 08:21:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 08:21:23] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2024-05-24 08:21:23] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2024-05-24 08:21:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:21:23] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-24 08:21:24] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2024-05-24 08:21:24] [INFO ] [Nat]Added 200 Read/Feed constraints in 248 ms returned sat
[2024-05-24 08:21:24] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 82 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-24 08:21:28] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-24 08:21:29] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2024-05-24 08:21:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:21:29] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2024-05-24 08:21:29] [INFO ] [Nat]Absence check using state equation in 756 ms returned sat
[2024-05-24 08:21:30] [INFO ] [Nat]Added 200 Read/Feed constraints in 164 ms returned sat
[2024-05-24 08:21:30] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 92 ms.
[2024-05-24 08:21:34] [INFO ] Added : 260 causal constraints over 52 iterations in 3893 ms. Result :unknown
[2024-05-24 08:21:34] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-24 08:21:34] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2024-05-24 08:21:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:21:34] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2024-05-24 08:21:35] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2024-05-24 08:21:35] [INFO ] [Nat]Added 200 Read/Feed constraints in 254 ms returned sat
[2024-05-24 08:21:35] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 68 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-24 08:21:39] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-24 08:21:40] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2024-05-24 08:21:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:21:40] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2024-05-24 08:21:40] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2024-05-24 08:21:41] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 08:21:41] [INFO ] [Nat]Added 200 Read/Feed constraints in 566 ms returned sat
[2024-05-24 08:21:41] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 69 ms.
[2024-05-24 08:21:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 08:21:45] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2024-05-24 08:21:45] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2024-05-24 08:21:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:21:45] [INFO ] [Nat]Absence check using 200 positive place invariants in 40 ms returned sat
[2024-05-24 08:21:46] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2024-05-24 08:21:46] [INFO ] [Nat]Added 200 Read/Feed constraints in 461 ms returned sat
[2024-05-24 08:21:46] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 71 ms.
[2024-05-24 08:21:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 08:21:50] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-24 08:21:51] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2024-05-24 08:21:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:21:51] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2024-05-24 08:21:51] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2024-05-24 08:21:52] [INFO ] [Nat]Added 200 Read/Feed constraints in 462 ms returned sat
[2024-05-24 08:21:52] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 73 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-24 08:21:56] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2024-05-24 08:21:56] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2024-05-24 08:21:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:21:57] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-24 08:21:57] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2024-05-24 08:21:57] [INFO ] [Nat]Added 200 Read/Feed constraints in 248 ms returned sat
[2024-05-24 08:21:57] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 76 ms.
[2024-05-24 08:22:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 08:22:02] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-24 08:22:02] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2024-05-24 08:22:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:22:02] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2024-05-24 08:22:03] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2024-05-24 08:22:03] [INFO ] [Nat]Added 200 Read/Feed constraints in 246 ms returned sat
[2024-05-24 08:22:03] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 69 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-24 08:22:07] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2024-05-24 08:22:08] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2024-05-24 08:22:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:22:08] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-24 08:22:09] [INFO ] [Nat]Absence check using state equation in 1060 ms returned sat
[2024-05-24 08:22:09] [INFO ] [Nat]Added 200 Read/Feed constraints in 204 ms returned sat
[2024-05-24 08:22:09] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 71 ms.
[2024-05-24 08:22:13] [INFO ] Added : 217 causal constraints over 45 iterations in 3498 ms. Result :sat
Minimization took 43 ms.
[2024-05-24 08:22:13] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2024-05-24 08:22:13] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2024-05-24 08:22:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:22:13] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-24 08:22:14] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2024-05-24 08:22:14] [INFO ] [Nat]Added 200 Read/Feed constraints in 239 ms returned sat
[2024-05-24 08:22:14] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 68 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-24 08:22:18] [INFO ] [Real]Absence check using 200 positive place invariants in 31 ms returned sat
[2024-05-24 08:22:19] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2024-05-24 08:22:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:22:19] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2024-05-24 08:22:19] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2024-05-24 08:22:19] [INFO ] [Nat]Added 200 Read/Feed constraints in 241 ms returned sat
[2024-05-24 08:22:20] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 68 ms.
Maximisation of solution failed !
Minimization took 3 ms.
[2024-05-24 08:22:24] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-24 08:22:24] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2024-05-24 08:22:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:22:24] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-24 08:22:25] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2024-05-24 08:22:25] [INFO ] [Nat]Added 200 Read/Feed constraints in 383 ms returned sat
[2024-05-24 08:22:25] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 70 ms.
[2024-05-24 08:22:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 08:22:29] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-24 08:22:30] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2024-05-24 08:22:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:22:30] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2024-05-24 08:22:30] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2024-05-24 08:22:31] [INFO ] [Nat]Added 200 Read/Feed constraints in 246 ms returned sat
[2024-05-24 08:22:31] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 68 ms.
[2024-05-24 08:22:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 08:22:35] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2024-05-24 08:22:35] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2024-05-24 08:22:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:22:36] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2024-05-24 08:22:36] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2024-05-24 08:22:36] [INFO ] [Nat]Added 200 Read/Feed constraints in 338 ms returned sat
[2024-05-24 08:22:36] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 70 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 200, 12, 200, 2, 200, 10, 2, 2, 12, 9, 12, 12, 9, 12, 2] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 200, 12, 200, 24, 200, 10, 22, 34, 104, 100, 100, 12, 104, 108, 2] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 16 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Graph (complete) has 2400 edges and 1000 vertex of which 80 are kept as prefixes of interest. Removing 920 places using SCC suffix rule.3 ms
Discarding 920 places :
Also discarding 1472 output transitions
Drop transitions (Output transitions of discarded places.) removed 1472 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 128
Applied a total of 2 rules in 34 ms. Remains 80 /1000 variables (removed 920) and now considering 128/1601 (removed 1473) transitions.
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 80 cols
[2024-05-24 08:23:04] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 08:23:04] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1936 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 08:23:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 3 ms to minimize.
[2024-05-24 08:23:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
[2024-05-24 08:23:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 08:23:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-24 08:23:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/208 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 7000 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 5/5 constraints]
After SMT, in 8983ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8997ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9045 ms. Remains : 80/1000 places, 128/1601 transitions.
[2024-05-24 08:23:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10, 200, 12, 200, 24, 200, 10, 22, 34, 104, 100, 100, 12, 104, 108, 2] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000037 steps (2 resets) in 1154 ms. (865 steps per ms)
FORMULA JoinFreeModules-PT-0200-UpperBounds-14 203 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-02 203 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 14000014 steps (28 resets) in 16574 ms. (844 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201, 200, 200, 195, 200, 201, 198, 200, 202, 200, 202, 202, 199, 192] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2024-05-24 08:23:30] [INFO ] Invariant cache hit.
[2024-05-24 08:23:30] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 08:23:30] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-24 08:23:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:31] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-24 08:23:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-24 08:23:31] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 08:23:31] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-24 08:23:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-24 08:23:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-24 08:23:31] [INFO ] Added : 52 causal constraints over 11 iterations in 185 ms. Result :sat
Minimization took 35 ms.
[2024-05-24 08:23:31] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:31] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 08:23:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:31] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-24 08:23:31] [INFO ] [Nat]Added 16 Read/Feed constraints in 62 ms returned sat
[2024-05-24 08:23:31] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-24 08:23:31] [INFO ] Added : 70 causal constraints over 15 iterations in 134 ms. Result :sat
Minimization took 36 ms.
[2024-05-24 08:23:31] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:31] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-24 08:23:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:31] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-24 08:23:31] [INFO ] [Nat]Added 16 Read/Feed constraints in 42 ms returned sat
[2024-05-24 08:23:31] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-24 08:23:31] [INFO ] Added : 48 causal constraints over 12 iterations in 103 ms. Result :sat
Minimization took 31 ms.
[2024-05-24 08:23:31] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:31] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-24 08:23:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 08:23:32] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-24 08:23:32] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 08:23:32] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 08:23:32] [INFO ] Added : 53 causal constraints over 12 iterations in 176 ms. Result :sat
Minimization took 45 ms.
[2024-05-24 08:23:32] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:32] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-24 08:23:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:32] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-24 08:23:32] [INFO ] [Nat]Added 16 Read/Feed constraints in 41 ms returned sat
[2024-05-24 08:23:32] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-24 08:23:32] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-24 08:23:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-24 08:23:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2024-05-24 08:23:32] [INFO ] Added : 74 causal constraints over 15 iterations in 239 ms. Result :sat
Minimization took 43 ms.
[2024-05-24 08:23:32] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 08:23:32] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-24 08:23:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 08:23:32] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-24 08:23:32] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2024-05-24 08:23:32] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-24 08:23:32] [INFO ] Added : 54 causal constraints over 11 iterations in 94 ms. Result :sat
Minimization took 33 ms.
[2024-05-24 08:23:33] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:33] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 08:23:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:33] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:33] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-24 08:23:33] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 08:23:33] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-24 08:23:33] [INFO ] Added : 73 causal constraints over 16 iterations in 214 ms. Result :sat
Minimization took 42 ms.
[2024-05-24 08:23:33] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 08:23:33] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 08:23:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:33] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:33] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-24 08:23:33] [INFO ] [Nat]Added 16 Read/Feed constraints in 22 ms returned sat
[2024-05-24 08:23:33] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-24 08:23:33] [INFO ] Added : 41 causal constraints over 10 iterations in 85 ms. Result :sat
Minimization took 30 ms.
[2024-05-24 08:23:33] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:33] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 08:23:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:33] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:33] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-24 08:23:33] [INFO ] [Nat]Added 16 Read/Feed constraints in 59 ms returned sat
[2024-05-24 08:23:33] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-24 08:23:34] [INFO ] Added : 64 causal constraints over 15 iterations in 124 ms. Result :sat
Minimization took 24 ms.
[2024-05-24 08:23:34] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 08:23:34] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-24 08:23:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:34] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:34] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-24 08:23:34] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 08:23:34] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 08:23:34] [INFO ] Added : 61 causal constraints over 13 iterations in 147 ms. Result :sat
Minimization took 44 ms.
[2024-05-24 08:23:34] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 08:23:34] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 08:23:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:34] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:34] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-24 08:23:34] [INFO ] [Nat]Added 16 Read/Feed constraints in 60 ms returned sat
[2024-05-24 08:23:34] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-24 08:23:34] [INFO ] Added : 51 causal constraints over 11 iterations in 92 ms. Result :sat
Minimization took 22 ms.
[2024-05-24 08:23:34] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:34] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-24 08:23:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:34] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:34] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-24 08:23:34] [INFO ] [Nat]Added 16 Read/Feed constraints in 68 ms returned sat
[2024-05-24 08:23:34] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-24 08:23:34] [INFO ] Added : 63 causal constraints over 13 iterations in 109 ms. Result :sat
Minimization took 31 ms.
[2024-05-24 08:23:35] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:35] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 08:23:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:35] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-24 08:23:35] [INFO ] [Nat]Added 16 Read/Feed constraints in 39 ms returned sat
[2024-05-24 08:23:35] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 08:23:35] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-24 08:23:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-24 08:23:35] [INFO ] Added : 77 causal constraints over 16 iterations in 203 ms. Result :sat
Minimization took 51 ms.
[2024-05-24 08:23:35] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:35] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-24 08:23:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:35] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-24 08:23:35] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2024-05-24 08:23:35] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 08:23:35] [INFO ] Added : 61 causal constraints over 15 iterations in 143 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201, 200, 200, 195, 200, 201, 198, 200, 202, 200, 202, 202, 199, 192] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201, 200, 200, 202, 200, 201, 202, 202, 202, 201, 202, 202, 201, 202] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 14 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 70 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 3 ms. Remains 70 /80 variables (removed 10) and now considering 112/128 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 70/80 places, 112/128 transitions.
// Phase 1: matrix 112 rows 70 cols
[2024-05-24 08:23:45] [INFO ] Computed 14 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[201, 200, 200, 202, 200, 201, 202, 202, 202, 201, 202, 202, 201, 202] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000078 steps (2 resets) in 982 ms. (1017 steps per ms)
FORMULA JoinFreeModules-PT-0200-UpperBounds-11 203 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-09 203 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 12000012 steps (24 resets) in 12562 ms. (955 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201, 200, 200, 202, 200, 201, 202, 202, 201, 202, 201, 202] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2024-05-24 08:23:58] [INFO ] Invariant cache hit.
[2024-05-24 08:23:58] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:58] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 08:23:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:58] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-24 08:23:58] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 08:23:58] [INFO ] [Nat]Added 14 Read/Feed constraints in 3 ms returned sat
[2024-05-24 08:23:58] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 08:23:58] [INFO ] Added : 49 causal constraints over 11 iterations in 80 ms. Result :sat
Minimization took 35 ms.
[2024-05-24 08:23:58] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 08:23:58] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 08:23:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 08:23:59] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-24 08:23:59] [INFO ] [Nat]Added 14 Read/Feed constraints in 25 ms returned sat
[2024-05-24 08:23:59] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 08:23:59] [INFO ] Added : 41 causal constraints over 9 iterations in 98 ms. Result :sat
Minimization took 31 ms.
[2024-05-24 08:23:59] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:59] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 08:23:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 08:23:59] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-24 08:23:59] [INFO ] [Nat]Added 14 Read/Feed constraints in 45 ms returned sat
[2024-05-24 08:23:59] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 08:23:59] [INFO ] Added : 31 causal constraints over 8 iterations in 62 ms. Result :sat
Minimization took 28 ms.
[2024-05-24 08:23:59] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:59] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-24 08:23:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 08:23:59] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-24 08:23:59] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2024-05-24 08:23:59] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 08:23:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-24 08:23:59] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-24 08:23:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 55 ms
Minimization took 12 ms.
[2024-05-24 08:23:59] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:59] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-24 08:23:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:59] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-24 08:23:59] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2024-05-24 08:23:59] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 08:23:59] [INFO ] Added : 27 causal constraints over 9 iterations in 67 ms. Result :sat
Minimization took 24 ms.
[2024-05-24 08:23:59] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 08:23:59] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 08:23:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 08:24:00] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-24 08:24:00] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2024-05-24 08:24:00] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 08:24:00] [INFO ] Added : 39 causal constraints over 9 iterations in 71 ms. Result :sat
Minimization took 20 ms.
[2024-05-24 08:24:00] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:00] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 08:24:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 08:24:00] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-24 08:24:00] [INFO ] [Nat]Added 14 Read/Feed constraints in 71 ms returned sat
[2024-05-24 08:24:00] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-24 08:24:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2024-05-24 08:24:00] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:00] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 08:24:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 08:24:00] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-24 08:24:00] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2024-05-24 08:24:00] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 08:24:00] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-24 08:24:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
Minimization took 13 ms.
[2024-05-24 08:24:00] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 08:24:00] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 08:24:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 08:24:00] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-24 08:24:00] [INFO ] [Nat]Added 14 Read/Feed constraints in 64 ms returned sat
[2024-05-24 08:24:00] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-24 08:24:00] [INFO ] Added : 41 causal constraints over 9 iterations in 66 ms. Result :sat
Minimization took 28 ms.
[2024-05-24 08:24:00] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 08:24:00] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-24 08:24:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 08:24:00] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-24 08:24:01] [INFO ] [Nat]Added 14 Read/Feed constraints in 53 ms returned sat
[2024-05-24 08:24:01] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 08:24:01] [INFO ] Added : 63 causal constraints over 14 iterations in 108 ms. Result :sat
Minimization took 28 ms.
[2024-05-24 08:24:01] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:01] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 08:24:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:01] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-24 08:24:01] [INFO ] [Nat]Added 14 Read/Feed constraints in 46 ms returned sat
[2024-05-24 08:24:01] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-24 08:24:01] [INFO ] Added : 29 causal constraints over 7 iterations in 65 ms. Result :sat
Minimization took 27 ms.
[2024-05-24 08:24:01] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:01] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 08:24:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:01] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-24 08:24:01] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2024-05-24 08:24:01] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 08:24:01] [INFO ] Added : 46 causal constraints over 10 iterations in 75 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201, 200, 200, 202, 200, 201, 202, 202, 201, 202, 201, 202] Max Struct:[203, 203, 203, 202, 203, 203, 202, 202, 203, 203, 203, 203]
FORMULA JoinFreeModules-PT-0200-UpperBounds-08 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-07 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-04 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201, 200, 200, 200, 201, 201, 202, 201, 202] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 9 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 45 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 3 ms. Remains 45 /70 variables (removed 25) and now considering 72/112 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 45/70 places, 72/112 transitions.
// Phase 1: matrix 72 rows 45 cols
[2024-05-24 08:24:05] [INFO ] Computed 9 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[201, 200, 200, 200, 201, 201, 202, 201, 202] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000023 steps (2 resets) in 605 ms. (1650 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 5965 ms. (1508 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201, 200, 200, 200, 201, 201, 202, 201, 202] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203]
[2024-05-24 08:24:12] [INFO ] Invariant cache hit.
[2024-05-24 08:24:12] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:12] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 08:24:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-24 08:24:12] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 08:24:12] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 08:24:12] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-05-24 08:24:12] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 08:24:12] [INFO ] Added : 42 causal constraints over 10 iterations in 48 ms. Result :sat
Minimization took 21 ms.
[2024-05-24 08:24:12] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:12] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 08:24:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-24 08:24:12] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-24 08:24:12] [INFO ] [Nat]Added 9 Read/Feed constraints in 127 ms returned sat
[2024-05-24 08:24:12] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-24 08:24:12] [INFO ] Added : 23 causal constraints over 7 iterations in 44 ms. Result :sat
Minimization took 28 ms.
[2024-05-24 08:24:12] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:12] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 08:24:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:12] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 08:24:12] [INFO ] [Nat]Added 9 Read/Feed constraints in 68 ms returned sat
[2024-05-24 08:24:12] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 08:24:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-24 08:24:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-24 08:24:12] [INFO ] Added : 41 causal constraints over 11 iterations in 93 ms. Result :sat
Minimization took 22 ms.
[2024-05-24 08:24:12] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:12] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-24 08:24:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:13] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2024-05-24 08:24:13] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2024-05-24 08:24:13] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 08:24:13] [INFO ] Added : 27 causal constraints over 6 iterations in 34 ms. Result :sat
Minimization took 17 ms.
[2024-05-24 08:24:13] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-24 08:24:13] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 08:24:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-24 08:24:13] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-24 08:24:13] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-24 08:24:13] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 08:24:13] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-24 08:24:13] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-24 08:24:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 50 ms
[2024-05-24 08:24:13] [INFO ] Added : 42 causal constraints over 11 iterations in 131 ms. Result :sat
Minimization took 15 ms.
[2024-05-24 08:24:13] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-24 08:24:13] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-24 08:24:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:13] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-24 08:24:13] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-05-24 08:24:13] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 08:24:13] [INFO ] Added : 46 causal constraints over 11 iterations in 57 ms. Result :sat
Minimization took 22 ms.
[2024-05-24 08:24:13] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:13] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-24 08:24:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:13] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-24 08:24:13] [INFO ] [Nat]Added 9 Read/Feed constraints in 28 ms returned sat
[2024-05-24 08:24:13] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 08:24:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-24 08:24:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-24 08:24:13] [INFO ] Added : 37 causal constraints over 8 iterations in 279 ms. Result :sat
Minimization took 17 ms.
[2024-05-24 08:24:13] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:13] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-24 08:24:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:13] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-24 08:24:13] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-24 08:24:13] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 08:24:14] [INFO ] Added : 36 causal constraints over 8 iterations in 40 ms. Result :sat
Minimization took 20 ms.
[2024-05-24 08:24:14] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-24 08:24:14] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-24 08:24:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-24 08:24:14] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 08:24:14] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-05-24 08:24:14] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 08:24:14] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-24 08:24:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201, 200, 200, 200, 201, 201, 202, 201, 202] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 202]
FORMULA JoinFreeModules-PT-0200-UpperBounds-15 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-12 203 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201, 200, 200, 200, 201, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203]
Support contains 7 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 35 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 2 ms. Remains 35 /45 variables (removed 10) and now considering 56/72 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 35/45 places, 56/72 transitions.
// Phase 1: matrix 56 rows 35 cols
[2024-05-24 08:24:15] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[201, 200, 200, 200, 201, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000044 steps (2 resets) in 516 ms. (1934 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 3813 ms. (1835 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201, 200, 200, 200, 201, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203]
[2024-05-24 08:24:20] [INFO ] Invariant cache hit.
[2024-05-24 08:24:20] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-24 08:24:20] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 08:24:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:20] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 08:24:20] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 08:24:20] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-24 08:24:20] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 08:24:20] [INFO ] Added : 26 causal constraints over 7 iterations in 60 ms. Result :sat
Minimization took 17 ms.
[2024-05-24 08:24:20] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-24 08:24:20] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 08:24:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-24 08:24:20] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 08:24:20] [INFO ] [Nat]Added 7 Read/Feed constraints in 25 ms returned sat
[2024-05-24 08:24:20] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 08:24:20] [INFO ] Added : 17 causal constraints over 6 iterations in 34 ms. Result :sat
Minimization took 16 ms.
[2024-05-24 08:24:20] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:20] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-24 08:24:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-24 08:24:20] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-24 08:24:20] [INFO ] [Nat]Added 7 Read/Feed constraints in 8 ms returned sat
[2024-05-24 08:24:20] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 08:24:20] [INFO ] Added : 14 causal constraints over 6 iterations in 29 ms. Result :sat
Minimization took 14 ms.
[2024-05-24 08:24:20] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:20] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-24 08:24:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:20] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 08:24:20] [INFO ] [Nat]Added 7 Read/Feed constraints in 15 ms returned sat
[2024-05-24 08:24:20] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 08:24:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-24 08:24:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2024-05-24 08:24:20] [INFO ] Added : 29 causal constraints over 7 iterations in 74 ms. Result :sat
Minimization took 16 ms.
[2024-05-24 08:24:20] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:20] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 08:24:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:20] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-24 08:24:20] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-05-24 08:24:20] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 08:24:20] [INFO ] Added : 26 causal constraints over 6 iterations in 27 ms. Result :sat
Minimization took 24 ms.
[2024-05-24 08:24:20] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-24 08:24:20] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 08:24:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-24 08:24:21] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 08:24:21] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-24 08:24:21] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 08:24:21] [INFO ] Added : 26 causal constraints over 7 iterations in 28 ms. Result :sat
Minimization took 18 ms.
[2024-05-24 08:24:21] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-24 08:24:21] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-24 08:24:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-24 08:24:21] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-24 08:24:21] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-24 08:24:21] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 08:24:21] [INFO ] Added : 29 causal constraints over 6 iterations in 29 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201, 200, 200, 200, 201, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201, 200, 200, 200, 201, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203]
Support contains 7 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 35/35 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-24 08:24:22] [INFO ] Invariant cache hit.
[2024-05-24 08:24:22] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 08:24:22] [INFO ] Invariant cache hit.
[2024-05-24 08:24:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 08:24:22] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-24 08:24:22] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2024-05-24 08:24:22] [INFO ] Invariant cache hit.
[2024-05-24 08:24:22] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 42 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 91 constraints, problems are : Problem set: 0 solved, 42 unsolved in 654 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 1052ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1052ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1127 ms. Remains : 35/35 places, 56/56 transitions.
RANDOM walk for 40145 steps (8 resets) in 310 ms. (129 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 77 ms. (512 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 14/14 properties
[2024-05-24 08:24:23] [INFO ] Flatten gal took : 47 ms
[2024-05-24 08:24:23] [INFO ] Flatten gal took : 7 ms
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 14/14 properties
[2024-05-24 08:24:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6361394306847891231.gal : 5 ms
[2024-05-24 08:24:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10238870435375423883.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/ReachabilityCardinality6361394306847891231.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10238870435375423883.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 14/14 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 ...329
Loading property file /tmp/ReachabilityCardinality10238870435375423883.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :25 after 76
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :246 after 851
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 124 ms. (320 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :3104 after 10755
Interrupted probabilistic random walk after 152344 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 14
Probabilistic random walk after 152344 steps, saw 132146 distinct states, run finished after 3005 ms. (steps per millisecond=50 ) properties seen :0
[2024-05-24 08:24:27] [INFO ] Invariant cache hit.
[2024-05-24 08:24:27] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-24 08:24:27] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-24 08:24:27] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-24 08:24:27] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-24 08:24:27] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-24 08:24:27] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-24 08:24:27] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-24 08:24:27] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 7/14 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 56/91 variables, 35/49 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 7/56 constraints. Problems are: Problem set: 7 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/56 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/56 constraints. Problems are: Problem set: 7 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 56 constraints, problems are : Problem set: 7 solved, 7 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 7 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 7/14 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 56/91 variables, 35/49 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 7/56 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 7/63 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/63 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/63 constraints. Problems are: Problem set: 7 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 63 constraints, problems are : Problem set: 7 solved, 7 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 7/14 constraints, Known Traps: 7/7 constraints]
After SMT, in 617ms problems are : Problem set: 7 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :10755 after 19900
Parikh walk visited 2 properties in 2070 ms.
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 25 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 2 ms. Remains 25 /35 variables (removed 10) and now considering 40/56 (removed 16) transitions.
Running 30 sub problems to find dead transitions.
// Phase 1: matrix 40 rows 25 cols
[2024-05-24 08:24:29] [INFO ] Computed 5 invariants in 0 ms
[2024-05-24 08:24:29] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :19900 after 4.87563e+06
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 35 constraints, problems are : Problem set: 0 solved, 30 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 30/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 65 constraints, problems are : Problem set: 0 solved, 30 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 619ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 619ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 623 ms. Remains : 25/35 places, 40/56 transitions.
RANDOM walk for 40106 steps (8 resets) in 54 ms. (729 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 32 ms. (1212 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :4.87563e+06 after 1.45683e+07
Interrupted probabilistic random walk after 342216 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 5
Probabilistic random walk after 342216 steps, saw 282503 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
[2024-05-24 08:24:33] [INFO ] Invariant cache hit.
[2024-05-24 08:24:33] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 20/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 35 constraints, problems are : Problem set: 0 solved, 5 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 20/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 08:24:33] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-24 08:24:33] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-24 08:24:33] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 08:24:33] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-24 08:24:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 45 constraints, problems are : Problem set: 0 solved, 5 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 371ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 959 ms.
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 25/25 places, 40/40 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-05-24 08:24:34] [INFO ] Invariant cache hit.
[2024-05-24 08:24:34] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 08:24:34] [INFO ] Invariant cache hit.
[2024-05-24 08:24:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 08:24:34] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-24 08:24:34] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-24 08:24:34] [INFO ] Invariant cache hit.
[2024-05-24 08:24:34] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 35 constraints, problems are : Problem set: 0 solved, 30 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 30/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 65 constraints, problems are : Problem set: 0 solved, 30 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 697ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 697ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 750 ms. Remains : 25/25 places, 40/40 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 08:24:35] [INFO ] Flatten gal took : 6 ms
[2024-05-24 08:24:35] [INFO ] Applying decomposition
[2024-05-24 08:24:35] [INFO ] Flatten gal took : 5 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/graph7247400478232163184.txt' '-o' '/tmp/graph7247400478232163184.bin' '-w' '/tmp/graph7247400478232163184.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7247400478232163184.bin' '-l' '-1' '-v' '-w' '/tmp/graph7247400478232163184.weights' '-q' '0' '-e' '0.001'
[2024-05-24 08:24:35] [INFO ] Decomposing Gal with order
[2024-05-24 08:24:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 08:24:35] [INFO ] Flatten gal took : 5 ms
[2024-05-24 08:24:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 08:24:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17861769840814440625.gal : 1 ms
[2024-05-24 08:24:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10898890108984134812.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/ReachabilityCardinality17861769840814440625.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10898890108984134812.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/ReachabilityCardinality10898890108984134812.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :3104 after 10755
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :10755 after 19900
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :19900 after 4.87563e+06
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :4.87563e+06 after 1.45683e+07
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1.45683e+07 after 3.62125e+14
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.24987e+55,7.56923,118820,9,1419,112,339652,41,0,61,399420,0
Total reachable state count : 1.249874059497916122052768872891816647802e+55

Verifying 5 reachability properties.
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,7.57414,118820,1,0,112,339652,43,0,63,399420,0
Invariant property MIN1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,0,7.5801,118820,1,0,112,339652,45,0,64,399420,0
Invariant property MIN2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,0,7.58024,118820,1,0,112,339652,46,0,64,399420,0
Invariant property MIN3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,0,7.58035,118820,1,0,112,339652,47,0,64,399420,0
Invariant property MIN4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,0,7.58042,118820,1,0,112,339652,48,0,64,399420,0
FORMULA JoinFreeModules-PT-0200-UpperBounds-06 201 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-05 200 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-03 200 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-01 200 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-00 201 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 5 queries.) : Max Seen:[201, 201] Max Struct:[203, 203]
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-10
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:[203]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[203]
// Phase 1: matrix 56 rows 35 cols
[2024-05-24 08:24:43] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[203]
RANDOM walk for 10004 steps (2 resets) in 10 ms. (909 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:[142] Max Struct:[203]
[2024-05-24 08:24:43] [INFO ] Invariant cache hit.
[2024-05-24 08:24:43] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:43] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 08:24:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 08:24:43] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-24 08:24:43] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 08:24:43] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-24 08:24:43] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 08:24:43] [INFO ] Added : 27 causal constraints over 7 iterations in 41 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[142] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-24 08:24:43] [INFO ] Computed 1 invariants in 1 ms
[2024-05-24 08:24:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 96ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-24 08:24:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201] Max Struct:[203]
RANDOM walk for 1000025 steps (2 resets) in 123 ms. (8064 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 144 ms. (6896 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[203]
[2024-05-24 08:24:43] [INFO ] Invariant cache hit.
[2024-05-24 08:24:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 08:24:44] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-24 08:24:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 08:24:44] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-24 08:24:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 08:24:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 08:24:44] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 08:24:44] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-24 08:24:44] [INFO ] Invariant cache hit.
[2024-05-24 08:24:44] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 08:24:44] [INFO ] Invariant cache hit.
[2024-05-24 08:24:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 08:24:44] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-24 08:24:44] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 08:24:44] [INFO ] Invariant cache hit.
[2024-05-24 08:24:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 5/5 places, 8/8 transitions.
[2024-05-24 08:24:44] [INFO ] Flatten gal took : 1 ms
[2024-05-24 08:24:44] [INFO ] Flatten gal took : 1 ms
[2024-05-24 08:24:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7910532787905568391.gal : 0 ms
[2024-05-24 08:24:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3487895999366659385.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/ReachabilityCardinality7910532787905568391.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3487895999366659385.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/ReachabilityCardinality3487895999366659385.prop.
RANDOM walk for 40094 steps (8 resets) in 15 ms. (2505 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 17 ms. (2222 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 10755
Interrupted probabilistic random walk after 1007057 steps, run timeout after 3001 ms. (steps per millisecond=335 ) properties seen :0 out of 2
Probabilistic random walk after 1007057 steps, saw 387857 distinct states, run finished after 3001 ms. (steps per millisecond=335 ) properties seen :0
[2024-05-24 08:24:47] [INFO ] Invariant cache hit.
[2024-05-24 08:24:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 08:24:47] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 59ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-24 08:24:47] [INFO ] Invariant cache hit.
[2024-05-24 08:24:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 85ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40041 steps (8 resets) in 11 ms. (3336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 14 ms. (2666 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :10755 after 19900
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.85781e+06 after 4.87563e+06
Interrupted probabilistic random walk after 4217982 steps, run timeout after 3001 ms. (steps per millisecond=1405 ) properties seen :0 out of 1
Probabilistic random walk after 4217982 steps, saw 1456882 distinct states, run finished after 3001 ms. (steps per millisecond=1405 ) properties seen :0
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:[201] Max Struct:[203]
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-10 in 7209 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-13
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:[203]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[203]
// Phase 1: matrix 56 rows 35 cols
[2024-05-24 08:24:50] [INFO ] Computed 7 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[203]
RANDOM walk for 10034 steps (2 resets) in 7 ms. (1254 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:[113] Max Struct:[203]
[2024-05-24 08:24:50] [INFO ] Invariant cache hit.
[2024-05-24 08:24:50] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-05-24 08:24:50] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-24 08:24:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-24 08:24:50] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-24 08:24:50] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 08:24:50] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-24 08:24:50] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 08:24:50] [INFO ] Added : 28 causal constraints over 6 iterations in 37 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[113] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-24 08:24:50] [INFO ] Computed 1 invariants in 1 ms
[2024-05-24 08:24:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 96ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-24 08:24:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201] Max Struct:[203]
RANDOM walk for 1000042 steps (2 resets) in 148 ms. (6711 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 162 ms. (6134 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[203]
[2024-05-24 08:24:51] [INFO ] Invariant cache hit.
[2024-05-24 08:24:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 08:24:51] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-24 08:24:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 08:24:51] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-24 08:24:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 08:24:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 08:24:51] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 08:24:51] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-24 08:24:51] [INFO ] Invariant cache hit.
[2024-05-24 08:24:51] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 08:24:51] [INFO ] Invariant cache hit.
[2024-05-24 08:24:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 08:24:51] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-24 08:24:51] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 08:24:51] [INFO ] Invariant cache hit.
[2024-05-24 08:24:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 94ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 5/5 places, 8/8 transitions.
[2024-05-24 08:24:51] [INFO ] Flatten gal took : 1 ms
[2024-05-24 08:24:51] [INFO ] Flatten gal took : 1 ms
[2024-05-24 08:24:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9606937591421766254.gal : 0 ms
[2024-05-24 08:24:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10042002107247815633.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/ReachabilityCardinality9606937591421766254.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10042002107247815633.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40072 steps (8 resets) in 22 ms. (1742 steps per ms) remains 2/2 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 ...329
Loading property file /tmp/ReachabilityCardinality10042002107247815633.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40000 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 20 ms. (1904 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 10755
Interrupted probabilistic random walk after 1554267 steps, run timeout after 3001 ms. (steps per millisecond=517 ) properties seen :0 out of 2
Probabilistic random walk after 1554267 steps, saw 511081 distinct states, run finished after 3001 ms. (steps per millisecond=517 ) properties seen :0
[2024-05-24 08:24:54] [INFO ] Invariant cache hit.
[2024-05-24 08:24:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 08:24:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 61ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-24 08:24:54] [INFO ] Invariant cache hit.
[2024-05-24 08:24:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 86ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 87ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40162 steps (8 resets) in 13 ms. (2868 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :10755 after 19900
Interrupted probabilistic random walk after 4447320 steps, run timeout after 3001 ms. (steps per millisecond=1481 ) properties seen :0 out of 1
Probabilistic random walk after 4447320 steps, saw 1536677 distinct states, run finished after 3001 ms. (steps per millisecond=1481 ) properties seen :0
[2024-05-24 08:24:57] [INFO ] Invariant cache hit.
[2024-05-24 08:24:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 60ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-24 08:24:57] [INFO ] Invariant cache hit.
[2024-05-24 08:24:57] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 08:24:57] [INFO ] Invariant cache hit.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.85781e+06 after 4.87563e+06
[2024-05-24 08:24:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 08:24:57] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-24 08:24:57] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 08:24:57] [INFO ] Invariant cache hit.
[2024-05-24 08:24:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 5/5 places, 8/8 transitions.
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:[201] Max Struct:[203]
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-13 in 7503 ms.
[2024-05-24 08:24:57] [INFO ] Flatten gal took : 7 ms
[2024-05-24 08:24:57] [INFO ] Applying decomposition
[2024-05-24 08:24:57] [INFO ] Flatten gal took : 12 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/graph16004377485396943370.txt' '-o' '/tmp/graph16004377485396943370.bin' '-w' '/tmp/graph16004377485396943370.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16004377485396943370.bin' '-l' '-1' '-v' '-w' '/tmp/graph16004377485396943370.weights' '-q' '0' '-e' '0.001'
[2024-05-24 08:24:58] [INFO ] Decomposing Gal with order
[2024-05-24 08:24:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 08:24:58] [INFO ] Flatten gal took : 3 ms
[2024-05-24 08:24:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 08:24:58] [INFO ] Time to serialize gal into /tmp/UpperBounds5028058559883958579.gal : 1 ms
[2024-05-24 08:24:58] [INFO ] Time to serialize properties into /tmp/UpperBounds8745876302368149605.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/UpperBounds5028058559883958579.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8745876302368149605.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/UpperBounds8745876302368149605.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.24987e+55,7.45437,117672,9,1419,25,339629,37,0,60,399420,0
Total reachable state count : 1.249874059497916122052768872891816647802e+55

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property JoinFreeModules-PT-0200-UpperBounds-10 :0 <= u3.p729 <= 202
FORMULA JoinFreeModules-PT-0200-UpperBounds-10 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-10,0,7.4748,117672,1,0,44,339629,79,8,275,399420,65
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property JoinFreeModules-PT-0200-UpperBounds-13 :0 <= u5.p779 <= 202
FORMULA JoinFreeModules-PT-0200-UpperBounds-13 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-13,0,7.47534,117672,1,0,48,339629,96,8,275,399420,75
Total runtime 236223 ms.

BK_STOP 1716539105571

--------------------
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="JoinFreeModules-PT-0200"
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 JoinFreeModules-PT-0200, 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 r224-tall-171649612000061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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