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.r136-tall-171631132900550.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 DoubleExponent-PT-004, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132900550
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 67K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716387874117

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-22 14:24:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 14:24:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 14:24:35] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-05-22 14:24:35] [INFO ] Transformed 216 places.
[2024-05-22 14:24:35] [INFO ] Transformed 198 transitions.
[2024-05-22 14:24:35] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-05-22 14:24:35] [INFO ] Flatten gal took : 97 ms
[2024-05-22 14:24:35] [INFO ] Flatten gal took : 44 ms
RANDOM walk for 40000 steps (1338 resets) in 1735 ms. (23 steps per ms) remains 16/16 properties
[2024-05-22 14:24:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7817390798051463833.gal : 39 ms
BEST_FIRST walk for 4000 steps (109 resets) in 182 ms. (21 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (117 resets) in 79 ms. (50 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (121 resets) in 92 ms. (43 steps per ms) remains 16/16 properties
[2024-05-22 14:24:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9308139067804368398.prop : 4 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/ReachabilityCardinality7817390798051463833.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9308139067804368398.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4002 steps (110 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (114 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (108 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (107 resets) in 26 ms. (148 steps per ms) remains 16/16 properties

its-reach command run as :

BEST_FIRST walk for 4000 steps (120 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
/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/ReachabilityCardinality9308139067804368398.prop.
BEST_FIRST walk for 4001 steps (113 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (111 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (118 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (115 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 4
BEST_FIRST walk for 4000 steps (106 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :7 after 11
BEST_FIRST walk for 4001 steps (106 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :12 after 25
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :25 after 32
BEST_FIRST walk for 4001 steps (107 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (113 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :32 after 75
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :75 after 154
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :154 after 628
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :628 after 2806
Reachability property DoubleExponent-PT-004-ReachabilityCardinality-2024-15 is true.
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property DoubleExponent-PT-004-ReachabilityCardinality-2024-14 is true.
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property DoubleExponent-PT-004-ReachabilityCardinality-2024-04 is true.
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :2806 after 28502
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :28502 after 119247
Invariant property DoubleExponent-PT-004-ReachabilityCardinality-2024-11 does not hold.
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Interrupted probabilistic random walk after 249055 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :3 out of 16
Probabilistic random walk after 249055 steps, saw 124544 distinct states, run finished after 3014 ms. (steps per millisecond=82 ) properties seen :3
// Phase 1: matrix 198 rows 216 cols
[2024-05-22 14:24:39] [INFO ] Computed 24 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem DoubleExponent-PT-004-ReachabilityCardinality-2024-03 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-004-ReachabilityCardinality-2024-06 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 49/190 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 3/6 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem DoubleExponent-PT-004-ReachabilityCardinality-2024-01 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-004-ReachabilityCardinality-2024-02 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-004-ReachabilityCardinality-2024-10 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-004-ReachabilityCardinality-2024-12 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 26/216 variables, 18/24 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/24 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 198/414 variables, 216/240 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/240 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/414 variables, 0/240 constraints. Problems are: Problem set: 6 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 240 constraints, problems are : Problem set: 6 solved, 6 unsolved in 873 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 87/171 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 1/4 constraints. Problems are: Problem set: 6 solved, 6 unsolved
[2024-05-22 14:24:40] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/5 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 6 unsolved
Problem DoubleExponent-PT-004-ReachabilityCardinality-2024-08 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 45/216 variables, 20/25 constraints. Problems are: Problem set: 7 solved, 5 unsolved
[2024-05-22 14:24:40] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:24:40] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:24:40] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:24:40] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:24:41] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:24:41] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
[2024-05-22 14:24:41] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 1 ms to minimize.
[2024-05-22 14:24:41] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
[2024-05-22 14:24:41] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 1 ms to minimize.
[2024-05-22 14:24:41] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 2 ms to minimize.
[2024-05-22 14:24:41] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 11/36 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/36 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 198/414 variables, 216/252 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 5/257 constraints. Problems are: Problem set: 7 solved, 5 unsolved
[2024-05-22 14:24:41] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 0 ms to minimize.
[2024-05-22 14:24:42] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:24:42] [INFO ] Deduced a trap composed of 62 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:24:42] [INFO ] Deduced a trap composed of 68 places in 37 ms of which 1 ms to minimize.
[2024-05-22 14:24:42] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 5/262 constraints. Problems are: Problem set: 7 solved, 5 unsolved
[2024-05-22 14:24:42] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 1/263 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 0/263 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/414 variables, 0/263 constraints. Problems are: Problem set: 7 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 263 constraints, problems are : Problem set: 7 solved, 5 unsolved in 3282 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 5/12 constraints, Known Traps: 18/18 constraints]
After SMT, in 4262ms problems are : Problem set: 7 solved, 5 unsolved
Reachability property DoubleExponent-PT-004-ReachabilityCardinality-2024-05 is true.
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :119247 after 393595
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :393595 after 681272
Parikh walk visited 0 properties in 30125 ms.
Support contains 69 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 198/198 transitions.
Graph (complete) has 360 edges and 216 vertex of which 213 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 213 transition count 193
Reduce places removed 5 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 13 rules applied. Total rules applied 19 place count 208 transition count 185
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 27 place count 200 transition count 185
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 27 place count 200 transition count 174
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 49 place count 189 transition count 174
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 69 place count 179 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 178 transition count 164
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 178 transition count 161
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 77 place count 175 transition count 161
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 88 place count 175 transition count 150
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 99 place count 164 transition count 150
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 106 place count 164 transition count 150
Applied a total of 106 rules in 96 ms. Remains 164 /216 variables (removed 52) and now considering 150/198 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 164/216 places, 150/198 transitions.
RANDOM walk for 40000 steps (2246 resets) in 474 ms. (84 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1759 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (2000 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1740 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1746 resets) in 229 ms. (173 steps per ms) remains 4/4 properties
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :681272 after 1.28184e+06
Interrupted probabilistic random walk after 329155 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 4
Probabilistic random walk after 329155 steps, saw 164802 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
// Phase 1: matrix 150 rows 164 cols
[2024-05-22 14:25:17] [INFO ] Computed 22 invariants in 4 ms
[2024-05-22 14:25:17] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 88/164 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 150/314 variables, 164/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/314 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 190 constraints, problems are : Problem set: 0 solved, 4 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 88/164 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 14:25:17] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-22 14:25:17] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-22 14:25:17] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-22 14:25:18] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-22 14:25:18] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-22 14:25:18] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:25:18] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:25:18] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 14:25:18] [INFO ] Deduced a trap composed of 70 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:25:18] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-05-22 14:25:18] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:25:18] [INFO ] Deduced a trap composed of 67 places in 45 ms of which 2 ms to minimize.
[2024-05-22 14:25:18] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:25:18] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:25:18] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:25:18] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 4 ms to minimize.
[2024-05-22 14:25:18] [INFO ] Deduced a trap composed of 69 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 150/314 variables, 164/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 14:25:19] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:25:19] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 1 ms to minimize.
[2024-05-22 14:25:19] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-22 14:25:19] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 1 ms to minimize.
[2024-05-22 14:25:19] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 5/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 14:25:19] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-05-22 14:25:19] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 14:25:20] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/314 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 219 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2842 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 25/25 constraints]
After SMT, in 3258ms problems are : Problem set: 0 solved, 4 unsolved
Reachability property DoubleExponent-PT-004-ReachabilityCardinality-2024-09 is true.
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Parikh walk visited 0 properties in 8566 ms.
Support contains 68 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 150/150 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 164 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 163 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 163 transition count 148
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 162 transition count 148
Applied a total of 4 rules in 18 ms. Remains 162 /164 variables (removed 2) and now considering 148/150 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 162/164 places, 148/150 transitions.
RANDOM walk for 40000 steps (2221 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1768 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (2000 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1719 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 458700 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 3
Probabilistic random walk after 458700 steps, saw 229663 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
// Phase 1: matrix 148 rows 162 cols
[2024-05-22 14:25:32] [INFO ] Computed 22 invariants in 23 ms
[2024-05-22 14:25:32] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/116 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 46/162 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 148/310 variables, 162/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/310 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 188 constraints, problems are : Problem set: 0 solved, 3 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 162/162 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/116 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 14:25:32] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 46/162 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 14:25:32] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-22 14:25:33] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-22 14:25:33] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-05-22 14:25:33] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 2 ms to minimize.
[2024-05-22 14:25:33] [INFO ] Deduced a trap composed of 69 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:25:33] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:25:33] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 2 ms to minimize.
[2024-05-22 14:25:33] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 14:25:33] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-05-22 14:25:33] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 148/310 variables, 162/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 14:25:33] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:25:33] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 14:25:34] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-05-22 14:25:34] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 2 ms to minimize.
[2024-05-22 14:25:34] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2024-05-22 14:25:34] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/310 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 208 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1841 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 162/162 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 17/17 constraints]
After SMT, in 2330ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 3236 ms.
Support contains 68 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 148/148 transitions.
Applied a total of 0 rules in 19 ms. Remains 162 /162 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 162/162 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 162 /162 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-22 14:25:37] [INFO ] Invariant cache hit.
[2024-05-22 14:25:37] [INFO ] Implicit Places using invariants in 80 ms returned [45, 69, 79, 87, 107, 115, 150]
[2024-05-22 14:25:37] [INFO ] Actually due to overlaps returned [107, 115, 45]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 88 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 159/162 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 98 ms. Remains : 159/162 places, 148/148 transitions.
RANDOM walk for 40000 steps (2256 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1724 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (2000 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1734 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 457053 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 3
Probabilistic random walk after 457053 steps, saw 228849 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
// Phase 1: matrix 148 rows 159 cols
[2024-05-22 14:25:41] [INFO ] Computed 19 invariants in 4 ms
[2024-05-22 14:25:41] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 57/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 34/159 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 148/307 variables, 159/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 4/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/307 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 182 constraints, problems are : Problem set: 0 solved, 3 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 159/159 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 57/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 14:25:41] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-22 14:25:41] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 34/159 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 14:25:41] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2024-05-22 14:25:41] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 0 ms to minimize.
[2024-05-22 14:25:41] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-05-22 14:25:41] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:25:41] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 148/307 variables, 159/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 14:25:42] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-22 14:25:42] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:25:42] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 2 ms to minimize.
[2024-05-22 14:25:42] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:25:42] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 5/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 14:25:42] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:25:42] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 14:25:43] [INFO ] Deduced a trap composed of 79 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:25:43] [INFO ] Deduced a trap composed of 80 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:25:43] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 1 ms to minimize.
[2024-05-22 14:25:43] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/307 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/307 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 203 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2109 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 159/159 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 18/18 constraints]
After SMT, in 2437ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 3310 ms.
Support contains 68 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 159 /159 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 159/159 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-22 14:25:46] [INFO ] Invariant cache hit.
[2024-05-22 14:25:46] [INFO ] Implicit Places using invariants in 61 ms returned [68, 78, 86, 147]
[2024-05-22 14:25:46] [INFO ] Actually due to overlaps returned [68, 147, 86]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 63 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 156/159 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 71 ms. Remains : 156/159 places, 148/148 transitions.
RANDOM walk for 40000 steps (2232 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1741 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (2000 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1727 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 457170 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 3
Probabilistic random walk after 457170 steps, saw 228898 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
// Phase 1: matrix 148 rows 156 cols
[2024-05-22 14:25:50] [INFO ] Computed 16 invariants in 2 ms
[2024-05-22 14:25:50] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 70/138 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 18/156 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 148/304 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 14:25:50] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/304 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/304 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 177 constraints, problems are : Problem set: 0 solved, 3 unsolved in 741 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 70/138 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 14:25:51] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-22 14:25:51] [INFO ] Deduced a trap composed of 85 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:25:51] [INFO ] Deduced a trap composed of 88 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 18/156 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 14:25:51] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-22 14:25:51] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-22 14:25:51] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:25:51] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-05-22 14:25:51] [INFO ] Deduced a trap composed of 82 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:25:51] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:25:51] [INFO ] Deduced a trap composed of 70 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:25:51] [INFO ] Deduced a trap composed of 84 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:25:51] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:25:51] [INFO ] Deduced a trap composed of 78 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:25:51] [INFO ] Deduced a trap composed of 76 places in 47 ms of which 2 ms to minimize.
[2024-05-22 14:25:51] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:25:51] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 2 ms to minimize.
[2024-05-22 14:25:51] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 148/304 variables, 156/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 14:25:52] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-22 14:25:52] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-22 14:25:52] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-05-22 14:25:52] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:25:52] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 5/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/304 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/304 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 202 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2323 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 23/23 constraints]
After SMT, in 3087ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2601 ms.
Support contains 68 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 156/156 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-22 14:25:55] [INFO ] Invariant cache hit.
[2024-05-22 14:25:55] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 14:25:55] [INFO ] Invariant cache hit.
[2024-05-22 14:25:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 14:25:56] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2024-05-22 14:25:56] [INFO ] Redundant transitions in 3 ms returned []
Running 147 sub problems to find dead transitions.
[2024-05-22 14:25:56] [INFO ] Invariant cache hit.
[2024-05-22 14:25:56] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 2/156 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 14:25:57] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2024-05-22 14:25:57] [INFO ] Deduced a trap composed of 90 places in 45 ms of which 2 ms to minimize.
[2024-05-22 14:25:57] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-05-22 14:25:57] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-22 14:25:57] [INFO ] Deduced a trap composed of 84 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:25:57] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 2 ms to minimize.
[2024-05-22 14:25:57] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:25:57] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
Reachability property DoubleExponent-PT-004-ReachabilityCardinality-2024-00 is true.
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :3.29335e+06 after 3.32037e+06
[2024-05-22 14:25:57] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-22 14:25:57] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-22 14:25:57] [INFO ] Deduced a trap composed of 95 places in 41 ms of which 1 ms to minimize.
[2024-05-22 14:25:57] [INFO ] Deduced a trap composed of 100 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:25:57] [INFO ] Deduced a trap composed of 103 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:25:58] [INFO ] Deduced a trap composed of 88 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:25:58] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 0 ms to minimize.
[2024-05-22 14:25:58] [INFO ] Deduced a trap composed of 93 places in 47 ms of which 2 ms to minimize.
[2024-05-22 14:25:58] [INFO ] Deduced a trap composed of 93 places in 52 ms of which 1 ms to minimize.
[2024-05-22 14:25:58] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-05-22 14:25:58] [INFO ] Deduced a trap composed of 84 places in 44 ms of which 1 ms to minimize.
[2024-05-22 14:25:58] [INFO ] Deduced a trap composed of 83 places in 46 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 14:25:59] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 1 ms to minimize.
[2024-05-22 14:25:59] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 2 ms to minimize.
[2024-05-22 14:25:59] [INFO ] Deduced a trap composed of 81 places in 50 ms of which 1 ms to minimize.
[2024-05-22 14:25:59] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-05-22 14:25:59] [INFO ] Deduced a trap composed of 82 places in 49 ms of which 1 ms to minimize.
[2024-05-22 14:25:59] [INFO ] Deduced a trap composed of 87 places in 44 ms of which 1 ms to minimize.
[2024-05-22 14:25:59] [INFO ] Deduced a trap composed of 88 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:25:59] [INFO ] Deduced a trap composed of 93 places in 44 ms of which 1 ms to minimize.
[2024-05-22 14:25:59] [INFO ] Deduced a trap composed of 82 places in 45 ms of which 2 ms to minimize.
[2024-05-22 14:25:59] [INFO ] Deduced a trap composed of 95 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:26:00] [INFO ] Deduced a trap composed of 88 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:26:00] [INFO ] Deduced a trap composed of 90 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:26:00] [INFO ] Deduced a trap composed of 94 places in 48 ms of which 1 ms to minimize.
[2024-05-22 14:26:00] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 1 ms to minimize.
[2024-05-22 14:26:00] [INFO ] Deduced a trap composed of 96 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 14:26:00] [INFO ] Deduced a trap composed of 92 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:26:00] [INFO ] Deduced a trap composed of 103 places in 44 ms of which 1 ms to minimize.
[2024-05-22 14:26:00] [INFO ] Deduced a trap composed of 98 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:26:00] [INFO ] Deduced a trap composed of 100 places in 42 ms of which 1 ms to minimize.
[2024-05-22 14:26:00] [INFO ] Deduced a trap composed of 100 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:26:01] [INFO ] Deduced a trap composed of 106 places in 45 ms of which 2 ms to minimize.
[2024-05-22 14:26:01] [INFO ] Deduced a trap composed of 98 places in 42 ms of which 1 ms to minimize.
[2024-05-22 14:26:01] [INFO ] Deduced a trap composed of 100 places in 45 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 148/304 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 14:26:03] [INFO ] Deduced a trap composed of 86 places in 50 ms of which 1 ms to minimize.
[2024-05-22 14:26:03] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:26:03] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:26:03] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 1 ms to minimize.
[2024-05-22 14:26:03] [INFO ] Deduced a trap composed of 99 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:26:03] [INFO ] Deduced a trap composed of 101 places in 42 ms of which 1 ms to minimize.
[2024-05-22 14:26:03] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2024-05-22 14:26:04] [INFO ] Deduced a trap composed of 68 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:26:04] [INFO ] Deduced a trap composed of 60 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:26:04] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:26:04] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 2 ms to minimize.
[2024-05-22 14:26:04] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-05-22 14:26:04] [INFO ] Deduced a trap composed of 82 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:26:04] [INFO ] Deduced a trap composed of 79 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:26:04] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 1 ms to minimize.
[2024-05-22 14:26:04] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:26:04] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 1 ms to minimize.
[2024-05-22 14:26:04] [INFO ] Deduced a trap composed of 80 places in 44 ms of which 1 ms to minimize.
[2024-05-22 14:26:04] [INFO ] Deduced a trap composed of 81 places in 44 ms of which 1 ms to minimize.
[2024-05-22 14:26:05] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 14:26:06] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:26:06] [INFO ] Deduced a trap composed of 91 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 14:26:07] [INFO ] Deduced a trap composed of 102 places in 49 ms of which 1 ms to minimize.
[2024-05-22 14:26:07] [INFO ] Deduced a trap composed of 87 places in 42 ms of which 1 ms to minimize.
[2024-05-22 14:26:07] [INFO ] Deduced a trap composed of 101 places in 44 ms of which 1 ms to minimize.
[2024-05-22 14:26:07] [INFO ] Deduced a trap composed of 105 places in 44 ms of which 1 ms to minimize.
[2024-05-22 14:26:08] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:26:08] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 1 ms to minimize.
[2024-05-22 14:26:08] [INFO ] Deduced a trap composed of 94 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:26:08] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:26:08] [INFO ] Deduced a trap composed of 96 places in 46 ms of which 2 ms to minimize.
[2024-05-22 14:26:08] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:26:08] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 1 ms to minimize.
[2024-05-22 14:26:08] [INFO ] Deduced a trap composed of 97 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 12/253 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/304 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 13 (OVERLAPS) 0/304 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 253 constraints, problems are : Problem set: 0 solved, 147 unsolved in 16282 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 2/156 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 77/93 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 14:26:13] [INFO ] Deduced a trap composed of 83 places in 51 ms of which 1 ms to minimize.
[2024-05-22 14:26:13] [INFO ] Deduced a trap composed of 111 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:26:13] [INFO ] Deduced a trap composed of 96 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:26:13] [INFO ] Deduced a trap composed of 105 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/304 variables, 156/253 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 4/257 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 147/404 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 14:26:17] [INFO ] Deduced a trap composed of 84 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:26:18] [INFO ] Deduced a trap composed of 80 places in 52 ms of which 1 ms to minimize.
[2024-05-22 14:26:18] [INFO ] Deduced a trap composed of 88 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 3/407 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 11 (OVERLAPS) 0/304 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 407 constraints, problems are : Problem set: 0 solved, 147 unsolved in 15074 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 84/84 constraints]
After SMT, in 31384ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 31386ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31656 ms. Remains : 156/156 places, 148/148 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 156 transition count 144
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 152 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 151 transition count 143
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 10 place count 151 transition count 138
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 20 place count 146 transition count 138
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 38 place count 137 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 136 transition count 129
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 136 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 42 place count 135 transition count 128
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 51 place count 135 transition count 119
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 60 place count 126 transition count 119
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 67 place count 126 transition count 119
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 69 place count 126 transition count 119
Applied a total of 69 rules in 37 ms. Remains 126 /156 variables (removed 30) and now considering 119/148 (removed 29) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 119 rows 126 cols
[2024-05-22 14:26:27] [INFO ] Computed 16 invariants in 6 ms
[2024-05-22 14:26:27] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 14:26:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 14:26:27] [INFO ] [Nat]Absence check using 5 positive and 11 generalized place invariants in 19 ms returned sat
[2024-05-22 14:26:27] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 14:26:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 14:26:27] [INFO ] After 51ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 14:26:27] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:26:27] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-22 14:26:28] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:26:28] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:26:28] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-22 14:26:28] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-22 14:26:28] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-22 14:26:28] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-22 14:26:28] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-22 14:26:28] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 1 ms to minimize.
[2024-05-22 14:26:28] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 1 ms to minimize.
[2024-05-22 14:26:28] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 589 ms
[2024-05-22 14:26:28] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-22 14:26:28] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-22 14:26:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
TRAPS : Iteration 1
[2024-05-22 14:26:28] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-05-22 14:26:28] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
[2024-05-22 14:26:28] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-05-22 14:26:28] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:26:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 236 ms
TRAPS : Iteration 2
[2024-05-22 14:26:28] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-22 14:26:29] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
[2024-05-22 14:26:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
TRAPS : Iteration 3
[2024-05-22 14:26:29] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-22 14:26:29] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-22 14:26:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2024-05-22 14:26:29] [INFO ] Deduced a trap composed of 27 places in 21 ms of which 0 ms to minimize.
[2024-05-22 14:26:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
TRAPS : Iteration 4
[2024-05-22 14:26:29] [INFO ] After 1516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 14:26:29] [INFO ] After 1732ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-22 14:26:29] [INFO ] Flatten gal took : 11 ms
[2024-05-22 14:26:29] [INFO ] Flatten gal took : 11 ms
[2024-05-22 14:26:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2627494799327347538.gal : 6 ms
[2024-05-22 14:26:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10821099148571556023.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/ReachabilityCardinality2627494799327347538.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10821099148571556023.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10821099148571556023.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 16
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :16 after 31
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :31 after 46
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :46 after 96
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :96 after 312
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :312 after 1277
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1277 after 6867
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6867 after 71583
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :71583 after 261055
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :261055 after 657434
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :657434 after 1.47118e+06
Detected timeout of ITS tools.
[2024-05-22 14:26:44] [INFO ] Flatten gal took : 11 ms
[2024-05-22 14:26:44] [INFO ] Applying decomposition
[2024-05-22 14:26:44] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13035868383458942796.txt' '-o' '/tmp/graph13035868383458942796.bin' '-w' '/tmp/graph13035868383458942796.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13035868383458942796.bin' '-l' '-1' '-v' '-w' '/tmp/graph13035868383458942796.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:26:44] [INFO ] Decomposing Gal with order
[2024-05-22 14:26:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:26:44] [INFO ] Removed a total of 53 redundant transitions.
[2024-05-22 14:26:44] [INFO ] Flatten gal took : 44 ms
[2024-05-22 14:26:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 13 ms.
[2024-05-22 14:26:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11442401118038560664.gal : 4 ms
[2024-05-22 14:26:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5023362082375534413.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/ReachabilityCardinality11442401118038560664.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5023362082375534413.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5023362082375534413.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 17
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :17 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 46
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :46 after 90
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :90 after 212
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :212 after 1053
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1053 after 5008
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5008 after 72938
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :72938 after 612134
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.4777e+06 after 1.52411e+06
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.21168e+07 after 1.47666e+07
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32229 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 14:26:59] [INFO ] Flatten gal took : 17 ms
[2024-05-22 14:26:59] [INFO ] Applying decomposition
[2024-05-22 14:26:59] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14224169439984956567.txt' '-o' '/tmp/graph14224169439984956567.bin' '-w' '/tmp/graph14224169439984956567.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14224169439984956567.bin' '-l' '-1' '-v' '-w' '/tmp/graph14224169439984956567.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:26:59] [INFO ] Decomposing Gal with order
[2024-05-22 14:26:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:26:59] [INFO ] Removed a total of 53 redundant transitions.
[2024-05-22 14:26:59] [INFO ] Flatten gal took : 21 ms
[2024-05-22 14:26:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 12 ms.
[2024-05-22 14:26:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7980328117348713995.gal : 5 ms
[2024-05-22 14:26:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7011097980015535333.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/ReachabilityCardinality7980328117348713995.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7011097980015535333.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/ReachabilityCardinality7011097980015535333.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 12
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :12 after 28
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :28 after 46
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :46 after 85
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :85 after 154
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :154 after 514
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :514 after 3362
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3362 after 24183
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :24183 after 151312
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :151312 after 430585
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :430585 after 997025
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :997025 after 2.14385e+06
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :2.13817e+07 after 2.13839e+07
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :8.06212e+07 after 8.28953e+07
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :2.17087e+08 after 2.2074e+08
Detected timeout of ITS tools.
[2024-05-22 14:57:00] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
[2024-05-22 14:57:00] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin8151081273816300002
[2024-05-22 14:57:00] [INFO ] Computing symmetric may disable matrix : 148 transitions.
[2024-05-22 14:57:00] [INFO ] Flatten gal took : 6 ms
[2024-05-22 14:57:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 14:57:00] [INFO ] Computing symmetric may enable matrix : 148 transitions.
[2024-05-22 14:57:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 14:57:00] [INFO ] Computing Do-Not-Accords matrix : 148 transitions.
[2024-05-22 14:57:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph5458387538329259810.txt' '-o' '/tmp/graph5458387538329259810.bin' '-w' '/tmp/graph5458387538329259810.weights'
[2024-05-22 14:57:00] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8151081273816300002
Running compilation step : cd /tmp/ltsmin8151081273816300002;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5458387538329259810.bin' '-l' '-1' '-v' '-w' '/tmp/graph5458387538329259810.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:57:00] [INFO ] Decomposing Gal with order
[2024-05-22 14:57:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:57:00] [INFO ] Removed a total of 56 redundant transitions.
[2024-05-22 14:57:00] [INFO ] Flatten gal took : 14 ms
[2024-05-22 14:57:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 26 ms.
[2024-05-22 14:57:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6281239977687441947.gal : 12 ms
[2024-05-22 14:57:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1058406192045622938.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/ReachabilityCardinality6281239977687441947.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1058406192045622938.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/ReachabilityCardinality1058406192045622938.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 15
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :15 after 24
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :24 after 45
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :45 after 89
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :89 after 200
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :200 after 648
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :648 after 2681
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2681 after 26977
Compilation finished in 655 ms.
Running link step : cd /tmp/ltsmin8151081273816300002;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin8151081273816300002;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT004ReachabilityCardinality202307==true'
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :26977 after 128540
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :128540 after 381410
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :381410 after 853609
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.70998e+06 after 1.76583e+06
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Initializing POR dependencies: labels 150, guards 148
pins2lts-mc-linux64( 6/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.036: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.037: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.037: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.199: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 5/ 8), 0.211: "DoubleExponentPT004ReachabilityCardinality202307==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.212: "DoubleExponentPT004ReachabilityCardinality202307==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.212: "DoubleExponentPT004ReachabilityCardinality202307==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.212: "DoubleExponentPT004ReachabilityCardinality202307==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.213: "DoubleExponentPT004ReachabilityCardinality202307==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.212: "DoubleExponentPT004ReachabilityCardinality202307==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.214: There are 150 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.214: State length is 156, there are 148 groups
pins2lts-mc-linux64( 0/ 8), 0.214: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.214: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.214: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.214: Visible groups: 0 / 148, labels: 1 / 150
pins2lts-mc-linux64( 0/ 8), 0.214: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.214: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.213: "DoubleExponentPT004ReachabilityCardinality202307==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.214: "DoubleExponentPT004ReachabilityCardinality202307==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.225: ~79 levels ~960 states ~976 transitions
pins2lts-mc-linux64( 0/ 8), 0.661: ~115 levels ~1920 states ~1968 transitions
pins2lts-mc-linux64( 5/ 8), 0.701: ~138 levels ~3840 states ~3904 transitions
pins2lts-mc-linux64( 3/ 8), 0.789: ~228 levels ~7680 states ~7728 transitions
pins2lts-mc-linux64( 3/ 8), 0.962: ~289 levels ~15360 states ~15728 transitions
pins2lts-mc-linux64( 5/ 8), 1.120: ~630 levels ~30720 states ~31024 transitions
pins2lts-mc-linux64( 5/ 8), 1.634: ~959 levels ~61440 states ~61608 transitions
pins2lts-mc-linux64( 5/ 8), 2.213: ~2135 levels ~122880 states ~122584 transitions
pins2lts-mc-linux64( 5/ 8), 3.004: ~3254 levels ~245760 states ~246416 transitions
pins2lts-mc-linux64( 5/ 8), 4.140: ~5987 levels ~491520 states ~494472 transitions
pins2lts-mc-linux64( 2/ 8), 6.059: ~11942 levels ~983040 states ~983480 transitions
pins2lts-mc-linux64( 0/ 8), 9.060: ~20982 levels ~1966080 states ~1973968 transitions
pins2lts-mc-linux64( 5/ 8), 13.296: ~22827 levels ~3932160 states ~3923416 transitions
pins2lts-mc-linux64( 2/ 8), 21.395: ~25528 levels ~7864320 states ~7874936 transitions
pins2lts-mc-linux64( 6/ 8), 37.799: ~28219 levels ~15728640 states ~15729504 transitions
pins2lts-mc-linux64( 6/ 8), 70.154: ~38374 levels ~31457280 states ~31398304 transitions
pins2lts-mc-linux64( 3/ 8), 134.948: ~55875 levels ~62914560 states ~62813384 transitions
pins2lts-mc-linux64( 2/ 8), 261.692: ~98217 levels ~125829120 states ~125609384 transitions
pins2lts-mc-linux64( 1/ 8), 288.379: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 288.401:
pins2lts-mc-linux64( 0/ 8), 288.401: mean standard work distribution: 1.1% (states) 0.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 288.401:
pins2lts-mc-linux64( 0/ 8), 288.401: Explored 134061850 states 134217332 transitions, fanout: 1.001
pins2lts-mc-linux64( 0/ 8), 288.401: Total exploration time 288.180 sec (288.160 sec minimum, 288.166 sec on average)
pins2lts-mc-linux64( 0/ 8), 288.401: States per second: 465202, Transitions per second: 465741
pins2lts-mc-linux64( 0/ 8), 288.401: Ignoring proviso: 1
pins2lts-mc-linux64( 0/ 8), 288.401:
pins2lts-mc-linux64( 0/ 8), 288.401: Queue width: 8B, total height: 214542, memory: 1.64MB
pins2lts-mc-linux64( 0/ 8), 288.401: Tree memory: 1040.7MB, 8.1 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 288.401: Tree fill ratio (roots/leafs): 99.0%/6.0%
pins2lts-mc-linux64( 0/ 8), 288.401: Stored 148 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 288.402: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 288.402: Est. total memory use: 1042.3MB (~1025.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8151081273816300002;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT004ReachabilityCardinality202307==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8151081273816300002;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT004ReachabilityCardinality202307==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :2.79063e+07 after 2.86815e+07
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :2.30721e+08 after 2.30722e+08

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="DoubleExponent-PT-004"
export BK_EXAMINATION="ReachabilityCardinality"
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 DoubleExponent-PT-004, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631132900550"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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