Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r075-tall-162039097100064.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is DES-PT-40b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097100064
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.4K Mar 22 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 115K May 5 16:51 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 DES-PT-40b-ReachabilityFireability-00
FORMULA_NAME DES-PT-40b-ReachabilityFireability-01
FORMULA_NAME DES-PT-40b-ReachabilityFireability-02
FORMULA_NAME DES-PT-40b-ReachabilityFireability-03
FORMULA_NAME DES-PT-40b-ReachabilityFireability-04
FORMULA_NAME DES-PT-40b-ReachabilityFireability-05
FORMULA_NAME DES-PT-40b-ReachabilityFireability-06
FORMULA_NAME DES-PT-40b-ReachabilityFireability-07
FORMULA_NAME DES-PT-40b-ReachabilityFireability-08
FORMULA_NAME DES-PT-40b-ReachabilityFireability-09
FORMULA_NAME DES-PT-40b-ReachabilityFireability-10
FORMULA_NAME DES-PT-40b-ReachabilityFireability-11
FORMULA_NAME DES-PT-40b-ReachabilityFireability-12
FORMULA_NAME DES-PT-40b-ReachabilityFireability-13
FORMULA_NAME DES-PT-40b-ReachabilityFireability-14
FORMULA_NAME DES-PT-40b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620513106114

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 22:31:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-08 22:31:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 22:31:48] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2021-05-08 22:31:48] [INFO ] Transformed 439 places.
[2021-05-08 22:31:48] [INFO ] Transformed 390 transitions.
[2021-05-08 22:31:48] [INFO ] Found NUPN structural information;
[2021-05-08 22:31:48] [INFO ] Parsed PT model containing 439 places and 390 transitions in 126 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 81 resets, run finished after 68 ms. (steps per millisecond=147 ) properties seen :[1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1]
FORMULA DES-PT-40b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 390 rows 439 cols
[2021-05-08 22:31:48] [INFO ] Computed 65 place invariants in 31 ms
[2021-05-08 22:31:48] [INFO ] [Real]Absence check using 39 positive place invariants in 37 ms returned sat
[2021-05-08 22:31:48] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 30 ms returned sat
[2021-05-08 22:31:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:31:49] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2021-05-08 22:31:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:31:49] [INFO ] [Nat]Absence check using 39 positive place invariants in 50 ms returned sat
[2021-05-08 22:31:49] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 66 ms returned sat
[2021-05-08 22:31:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:31:50] [INFO ] [Nat]Absence check using state equation in 667 ms returned sat
[2021-05-08 22:31:50] [INFO ] Deduced a trap composed of 12 places in 193 ms
[2021-05-08 22:31:50] [INFO ] Deduced a trap composed of 8 places in 112 ms
[2021-05-08 22:31:50] [INFO ] Deduced a trap composed of 21 places in 72 ms
[2021-05-08 22:31:50] [INFO ] Deduced a trap composed of 20 places in 68 ms
[2021-05-08 22:31:50] [INFO ] Deduced a trap composed of 22 places in 99 ms
[2021-05-08 22:31:50] [INFO ] Deduced a trap composed of 24 places in 77 ms
[2021-05-08 22:31:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 754 ms
[2021-05-08 22:31:50] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 32 ms.
[2021-05-08 22:31:53] [INFO ] Added : 304 causal constraints over 62 iterations in 2359 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2021-05-08 22:31:53] [INFO ] [Real]Absence check using 39 positive place invariants in 30 ms returned sat
[2021-05-08 22:31:53] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 26 ms returned sat
[2021-05-08 22:31:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:31:53] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2021-05-08 22:31:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:31:54] [INFO ] [Nat]Absence check using 39 positive place invariants in 43 ms returned sat
[2021-05-08 22:31:54] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 47 ms returned sat
[2021-05-08 22:31:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:31:54] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2021-05-08 22:31:54] [INFO ] Deduced a trap composed of 8 places in 100 ms
[2021-05-08 22:31:54] [INFO ] Deduced a trap composed of 28 places in 59 ms
[2021-05-08 22:31:54] [INFO ] Deduced a trap composed of 19 places in 49 ms
[2021-05-08 22:31:55] [INFO ] Deduced a trap composed of 18 places in 65 ms
[2021-05-08 22:31:55] [INFO ] Deduced a trap composed of 24 places in 46 ms
[2021-05-08 22:31:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 435 ms
[2021-05-08 22:31:55] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 22 ms.
[2021-05-08 22:31:57] [INFO ] Added : 346 causal constraints over 70 iterations in 2303 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
[2021-05-08 22:31:57] [INFO ] [Real]Absence check using 39 positive place invariants in 27 ms returned sat
[2021-05-08 22:31:57] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 31 ms returned sat
[2021-05-08 22:31:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:31:58] [INFO ] [Real]Absence check using state equation in 862 ms returned sat
[2021-05-08 22:31:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:31:58] [INFO ] [Nat]Absence check using 39 positive place invariants in 96 ms returned sat
[2021-05-08 22:31:58] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 57 ms returned sat
[2021-05-08 22:31:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:31:59] [INFO ] [Nat]Absence check using state equation in 688 ms returned sat
[2021-05-08 22:31:59] [INFO ] Deduced a trap composed of 22 places in 106 ms
[2021-05-08 22:31:59] [INFO ] Deduced a trap composed of 17 places in 104 ms
[2021-05-08 22:31:59] [INFO ] Deduced a trap composed of 38 places in 120 ms
[2021-05-08 22:31:59] [INFO ] Deduced a trap composed of 33 places in 102 ms
[2021-05-08 22:32:00] [INFO ] Deduced a trap composed of 60 places in 98 ms
[2021-05-08 22:32:00] [INFO ] Deduced a trap composed of 44 places in 96 ms
[2021-05-08 22:32:00] [INFO ] Deduced a trap composed of 8 places in 53 ms
[2021-05-08 22:32:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 799 ms
[2021-05-08 22:32:00] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 21 ms.
[2021-05-08 22:32:01] [INFO ] Added : 269 causal constraints over 55 iterations in 1520 ms. Result :sat
[2021-05-08 22:32:01] [INFO ] Deduced a trap composed of 36 places in 137 ms
[2021-05-08 22:32:02] [INFO ] Deduced a trap composed of 35 places in 120 ms
[2021-05-08 22:32:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-08 22:32:02] [INFO ] [Real]Absence check using 39 positive place invariants in 24 ms returned sat
[2021-05-08 22:32:02] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 21 ms returned sat
[2021-05-08 22:32:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:32:02] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2021-05-08 22:32:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:32:02] [INFO ] [Nat]Absence check using 39 positive place invariants in 44 ms returned sat
[2021-05-08 22:32:02] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2021-05-08 22:32:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:32:03] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2021-05-08 22:32:03] [INFO ] Deduced a trap composed of 32 places in 145 ms
[2021-05-08 22:32:03] [INFO ] Deduced a trap composed of 14 places in 134 ms
[2021-05-08 22:32:03] [INFO ] Deduced a trap composed of 9 places in 129 ms
[2021-05-08 22:32:03] [INFO ] Deduced a trap composed of 10 places in 127 ms
[2021-05-08 22:32:04] [INFO ] Deduced a trap composed of 16 places in 127 ms
[2021-05-08 22:32:04] [INFO ] Deduced a trap composed of 28 places in 126 ms
[2021-05-08 22:32:04] [INFO ] Deduced a trap composed of 35 places in 115 ms
[2021-05-08 22:32:04] [INFO ] Deduced a trap composed of 27 places in 113 ms
[2021-05-08 22:32:04] [INFO ] Deduced a trap composed of 14 places in 137 ms
[2021-05-08 22:32:04] [INFO ] Deduced a trap composed of 12 places in 142 ms
[2021-05-08 22:32:04] [INFO ] Deduced a trap composed of 13 places in 135 ms
[2021-05-08 22:32:05] [INFO ] Deduced a trap composed of 31 places in 130 ms
[2021-05-08 22:32:05] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1753 ms
[2021-05-08 22:32:05] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 21 ms.
[2021-05-08 22:32:06] [INFO ] Added : 270 causal constraints over 54 iterations in 1800 ms. Result :sat
[2021-05-08 22:32:07] [INFO ] Deduced a trap composed of 29 places in 99 ms
[2021-05-08 22:32:07] [INFO ] Deduced a trap composed of 32 places in 97 ms
[2021-05-08 22:32:07] [INFO ] Deduced a trap composed of 34 places in 66 ms
[2021-05-08 22:32:07] [INFO ] Deduced a trap composed of 35 places in 65 ms
[2021-05-08 22:32:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 462 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-08 22:32:07] [INFO ] [Real]Absence check using 39 positive place invariants in 26 ms returned sat
[2021-05-08 22:32:07] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2021-05-08 22:32:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:32:08] [INFO ] [Real]Absence check using state equation in 860 ms returned sat
[2021-05-08 22:32:08] [INFO ] Deduced a trap composed of 12 places in 68 ms
[2021-05-08 22:32:08] [INFO ] Deduced a trap composed of 12 places in 65 ms
[2021-05-08 22:32:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 174 ms
[2021-05-08 22:32:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:32:08] [INFO ] [Nat]Absence check using 39 positive place invariants in 48 ms returned sat
[2021-05-08 22:32:08] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 57 ms returned sat
[2021-05-08 22:32:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:32:09] [INFO ] [Nat]Absence check using state equation in 772 ms returned sat
[2021-05-08 22:32:09] [INFO ] Deduced a trap composed of 12 places in 63 ms
[2021-05-08 22:32:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2021-05-08 22:32:09] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 20 ms.
[2021-05-08 22:32:11] [INFO ] Added : 383 causal constraints over 78 iterations in 2187 ms. Result :sat
[2021-05-08 22:32:11] [INFO ] Deduced a trap composed of 41 places in 66 ms
[2021-05-08 22:32:12] [INFO ] Deduced a trap composed of 30 places in 35 ms
[2021-05-08 22:32:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-08 22:32:12] [INFO ] [Real]Absence check using 39 positive place invariants in 24 ms returned sat
[2021-05-08 22:32:12] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 23 ms returned sat
[2021-05-08 22:32:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:32:12] [INFO ] [Real]Absence check using state equation in 520 ms returned sat
[2021-05-08 22:32:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:32:12] [INFO ] [Nat]Absence check using 39 positive place invariants in 43 ms returned sat
[2021-05-08 22:32:12] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 39 ms returned sat
[2021-05-08 22:32:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:32:13] [INFO ] [Nat]Absence check using state equation in 619 ms returned sat
[2021-05-08 22:32:13] [INFO ] Deduced a trap composed of 32 places in 136 ms
[2021-05-08 22:32:13] [INFO ] Deduced a trap composed of 31 places in 135 ms
[2021-05-08 22:32:13] [INFO ] Deduced a trap composed of 8 places in 125 ms
[2021-05-08 22:32:13] [INFO ] Deduced a trap composed of 20 places in 54 ms
[2021-05-08 22:32:14] [INFO ] Deduced a trap composed of 27 places in 53 ms
[2021-05-08 22:32:14] [INFO ] Deduced a trap composed of 34 places in 77 ms
[2021-05-08 22:32:14] [INFO ] Deduced a trap composed of 38 places in 53 ms
[2021-05-08 22:32:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 740 ms
[2021-05-08 22:32:14] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 19 ms.
[2021-05-08 22:32:16] [INFO ] Added : 375 causal constraints over 76 iterations in 2445 ms. Result :sat
[2021-05-08 22:32:16] [INFO ] Deduced a trap composed of 58 places in 61 ms
[2021-05-08 22:32:16] [INFO ] Deduced a trap composed of 50 places in 59 ms
[2021-05-08 22:32:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-08 22:32:17] [INFO ] [Real]Absence check using 39 positive place invariants in 33 ms returned sat
[2021-05-08 22:32:17] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 24 ms returned sat
[2021-05-08 22:32:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:32:17] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2021-05-08 22:32:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:32:17] [INFO ] [Nat]Absence check using 39 positive place invariants in 95 ms returned sat
[2021-05-08 22:32:17] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 44 ms returned sat
[2021-05-08 22:32:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:32:18] [INFO ] [Nat]Absence check using state equation in 724 ms returned sat
[2021-05-08 22:32:18] [INFO ] Deduced a trap composed of 16 places in 141 ms
[2021-05-08 22:32:18] [INFO ] Deduced a trap composed of 28 places in 143 ms
[2021-05-08 22:32:18] [INFO ] Deduced a trap composed of 8 places in 134 ms
[2021-05-08 22:32:19] [INFO ] Deduced a trap composed of 34 places in 68 ms
[2021-05-08 22:32:19] [INFO ] Deduced a trap composed of 35 places in 54 ms
[2021-05-08 22:32:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 618 ms
[2021-05-08 22:32:19] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 21 ms.
[2021-05-08 22:32:21] [INFO ] Added : 336 causal constraints over 68 iterations in 2399 ms. Result :sat
[2021-05-08 22:32:21] [INFO ] Deduced a trap composed of 50 places in 108 ms
[2021-05-08 22:32:21] [INFO ] Deduced a trap composed of 27 places in 113 ms
[2021-05-08 22:32:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 325 ms
Attempting to minimize the solution found.
Minimization took 26 ms.
[2021-05-08 22:32:21] [INFO ] [Real]Absence check using 39 positive place invariants in 24 ms returned sat
[2021-05-08 22:32:21] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 24 ms returned sat
[2021-05-08 22:32:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:32:22] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2021-05-08 22:32:22] [INFO ] Deduced a trap composed of 8 places in 63 ms
[2021-05-08 22:32:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2021-05-08 22:32:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:32:22] [INFO ] [Nat]Absence check using 39 positive place invariants in 46 ms returned sat
[2021-05-08 22:32:22] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 25 ms returned sat
[2021-05-08 22:32:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:32:23] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2021-05-08 22:32:23] [INFO ] Deduced a trap composed of 8 places in 123 ms
[2021-05-08 22:32:23] [INFO ] Deduced a trap composed of 17 places in 104 ms
[2021-05-08 22:32:23] [INFO ] Deduced a trap composed of 28 places in 112 ms
[2021-05-08 22:32:23] [INFO ] Deduced a trap composed of 21 places in 84 ms
[2021-05-08 22:32:23] [INFO ] Deduced a trap composed of 12 places in 75 ms
[2021-05-08 22:32:23] [INFO ] Deduced a trap composed of 12 places in 74 ms
[2021-05-08 22:32:23] [INFO ] Deduced a trap composed of 14 places in 69 ms
[2021-05-08 22:32:24] [INFO ] Deduced a trap composed of 10 places in 70 ms
[2021-05-08 22:32:24] [INFO ] Deduced a trap composed of 13 places in 68 ms
[2021-05-08 22:32:24] [INFO ] Deduced a trap composed of 21 places in 82 ms
[2021-05-08 22:32:24] [INFO ] Deduced a trap composed of 32 places in 77 ms
[2021-05-08 22:32:24] [INFO ] Deduced a trap composed of 25 places in 84 ms
[2021-05-08 22:32:24] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1211 ms
[2021-05-08 22:32:24] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 24 ms.
[2021-05-08 22:32:26] [INFO ] Added : 320 causal constraints over 65 iterations in 2065 ms. Result :sat
[2021-05-08 22:32:26] [INFO ] Deduced a trap composed of 62 places in 130 ms
[2021-05-08 22:32:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
Incomplete Parikh walk after 447500 steps, including 4818 resets, run finished after 1393 ms. (steps per millisecond=321 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0] could not realise parikh vector
FORMULA DES-PT-40b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 579100 steps, including 6117 resets, run finished after 1627 ms. (steps per millisecond=355 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 576200 steps, including 6071 resets, run finished after 1641 ms. (steps per millisecond=351 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 584100 steps, including 6180 resets, run finished after 1652 ms. (steps per millisecond=353 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 189700 steps, including 2037 resets, run finished after 541 ms. (steps per millisecond=350 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 346400 steps, including 3623 resets, run finished after 969 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 575300 steps, including 5981 resets, run finished after 1613 ms. (steps per millisecond=356 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 259900 steps, including 2763 resets, run finished after 726 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 22 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 390/390 transitions.
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Graph (complete) has 978 edges and 439 vertex of which 430 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 430 transition count 368
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 38 place count 412 transition count 368
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 38 place count 412 transition count 361
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 52 place count 405 transition count 361
Symmetric choice reduction at 2 with 18 rule applications. Total rules 70 place count 405 transition count 361
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 18 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 106 place count 387 transition count 343
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 106 place count 387 transition count 342
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 108 place count 386 transition count 342
Symmetric choice reduction at 2 with 15 rule applications. Total rules 123 place count 386 transition count 342
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 153 place count 371 transition count 327
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 167 place count 371 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 168 place count 370 transition count 313
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 168 place count 370 transition count 310
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 174 place count 367 transition count 310
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 320 place count 294 transition count 237
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 4 with 2 rules applied. Total rules applied 322 place count 293 transition count 237
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 323 place count 293 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 324 place count 292 transition count 236
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 326 place count 292 transition count 234
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 328 place count 290 transition count 234
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 331 place count 290 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 332 place count 289 transition count 233
Applied a total of 332 rules in 197 ms. Remains 289 /439 variables (removed 150) and now considering 233/390 (removed 157) transitions.
Finished structural reductions, in 1 iterations. Remains : 289/439 places, 233/390 transitions.
Incomplete random walk after 1000000 steps, including 35257 resets, run finished after 3151 ms. (steps per millisecond=317 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7161 resets, run finished after 1172 ms. (steps per millisecond=853 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7235 resets, run finished after 1169 ms. (steps per millisecond=855 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8139 resets, run finished after 1678 ms. (steps per millisecond=595 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7371 resets, run finished after 1326 ms. (steps per millisecond=754 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 9474 resets, run finished after 1228 ms. (steps per millisecond=814 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9450 resets, run finished after 1234 ms. (steps per millisecond=810 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7421 resets, run finished after 1179 ms. (steps per millisecond=848 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 16229311 steps, run timeout after 30001 ms. (steps per millisecond=540 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 16229311 steps, saw 1916846 distinct states, run finished after 30001 ms. (steps per millisecond=540 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 233 rows 289 cols
[2021-05-08 22:33:19] [INFO ] Computed 60 place invariants in 13 ms
[2021-05-08 22:33:19] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned sat
[2021-05-08 22:33:19] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2021-05-08 22:33:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:33:19] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2021-05-08 22:33:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:33:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2021-05-08 22:33:19] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 87 ms returned sat
[2021-05-08 22:33:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:33:20] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2021-05-08 22:33:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-08 22:33:20] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:33:20] [INFO ] Computed and/alt/rep : 231/1083/231 causal constraints in 11 ms.
[2021-05-08 22:33:20] [INFO ] Added : 160 causal constraints over 32 iterations in 792 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-08 22:33:21] [INFO ] [Real]Absence check using 35 positive place invariants in 22 ms returned sat
[2021-05-08 22:33:21] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2021-05-08 22:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:33:21] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2021-05-08 22:33:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:33:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2021-05-08 22:33:21] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:33:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:33:21] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2021-05-08 22:33:21] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:33:21] [INFO ] Computed and/alt/rep : 231/1083/231 causal constraints in 12 ms.
[2021-05-08 22:33:23] [INFO ] Added : 228 causal constraints over 46 iterations in 1756 ms. Result :sat
[2021-05-08 22:33:23] [INFO ] Deduced a trap composed of 16 places in 30 ms
[2021-05-08 22:33:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
Attempting to minimize the solution found.
Minimization took 30 ms.
[2021-05-08 22:33:23] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-08 22:33:23] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 30 ms returned sat
[2021-05-08 22:33:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:33:24] [INFO ] [Real]Absence check using state equation in 743 ms returned sat
[2021-05-08 22:33:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:33:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2021-05-08 22:33:24] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 95 ms returned sat
[2021-05-08 22:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:33:25] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2021-05-08 22:33:25] [INFO ] [Nat]Added 4 Read/Feed constraints in 20 ms returned sat
[2021-05-08 22:33:25] [INFO ] Deduced a trap composed of 17 places in 54 ms
[2021-05-08 22:33:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2021-05-08 22:33:25] [INFO ] Computed and/alt/rep : 231/1083/231 causal constraints in 10 ms.
[2021-05-08 22:33:25] [INFO ] Added : 116 causal constraints over 24 iterations in 625 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-08 22:33:25] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-08 22:33:25] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2021-05-08 22:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:33:26] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2021-05-08 22:33:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:33:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2021-05-08 22:33:26] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:33:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:33:26] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2021-05-08 22:33:26] [INFO ] [Nat]Added 4 Read/Feed constraints in 23 ms returned sat
[2021-05-08 22:33:26] [INFO ] Computed and/alt/rep : 231/1083/231 causal constraints in 13 ms.
[2021-05-08 22:33:27] [INFO ] Added : 110 causal constraints over 22 iterations in 830 ms. Result :sat
[2021-05-08 22:33:27] [INFO ] Deduced a trap composed of 17 places in 38 ms
[2021-05-08 22:33:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-08 22:33:27] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-08 22:33:27] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2021-05-08 22:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:33:27] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2021-05-08 22:33:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:33:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2021-05-08 22:33:28] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 67 ms returned sat
[2021-05-08 22:33:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:33:28] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2021-05-08 22:33:28] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:33:28] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2021-05-08 22:33:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2021-05-08 22:33:28] [INFO ] Computed and/alt/rep : 231/1083/231 causal constraints in 11 ms.
[2021-05-08 22:33:30] [INFO ] Added : 211 causal constraints over 43 iterations in 1225 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-08 22:33:30] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2021-05-08 22:33:30] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2021-05-08 22:33:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:33:30] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2021-05-08 22:33:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:33:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2021-05-08 22:33:30] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 64 ms returned sat
[2021-05-08 22:33:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:33:31] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2021-05-08 22:33:31] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2021-05-08 22:33:31] [INFO ] Computed and/alt/rep : 231/1083/231 causal constraints in 12 ms.
[2021-05-08 22:33:32] [INFO ] Added : 218 causal constraints over 44 iterations in 1197 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 22:33:32] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-08 22:33:32] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2021-05-08 22:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:33:32] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2021-05-08 22:33:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:33:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2021-05-08 22:33:32] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 40 ms returned sat
[2021-05-08 22:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:33:33] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2021-05-08 22:33:33] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:33:33] [INFO ] Computed and/alt/rep : 231/1083/231 causal constraints in 11 ms.
[2021-05-08 22:33:34] [INFO ] Added : 203 causal constraints over 41 iterations in 1222 ms. Result :sat
[2021-05-08 22:33:34] [INFO ] Deduced a trap composed of 15 places in 43 ms
[2021-05-08 22:33:34] [INFO ] Deduced a trap composed of 16 places in 43 ms
[2021-05-08 22:33:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 198500 steps, including 5967 resets, run finished after 646 ms. (steps per millisecond=307 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 195300 steps, including 5760 resets, run finished after 638 ms. (steps per millisecond=306 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 204500 steps, including 6131 resets, run finished after 665 ms. (steps per millisecond=307 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 36700 steps, including 1124 resets, run finished after 122 ms. (steps per millisecond=300 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 122300 steps, including 3562 resets, run finished after 398 ms. (steps per millisecond=307 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 204600 steps, including 6033 resets, run finished after 664 ms. (steps per millisecond=308 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 91500 steps, including 2636 resets, run finished after 297 ms. (steps per millisecond=308 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 22 out of 289 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 289/289 places, 233/233 transitions.
Applied a total of 0 rules in 13 ms. Remains 289 /289 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 289/289 places, 233/233 transitions.
Starting structural reductions, iteration 0 : 289/289 places, 233/233 transitions.
Applied a total of 0 rules in 13 ms. Remains 289 /289 variables (removed 0) and now considering 233/233 (removed 0) transitions.
// Phase 1: matrix 233 rows 289 cols
[2021-05-08 22:33:38] [INFO ] Computed 60 place invariants in 6 ms
[2021-05-08 22:33:38] [INFO ] Implicit Places using invariants in 557 ms returned [174]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 558 ms to find 1 implicit places.
[2021-05-08 22:33:38] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 233 rows 288 cols
[2021-05-08 22:33:38] [INFO ] Computed 59 place invariants in 6 ms
[2021-05-08 22:33:39] [INFO ] Dead Transitions using invariants and state equation in 456 ms returned []
Starting structural reductions, iteration 1 : 288/289 places, 233/233 transitions.
Applied a total of 0 rules in 8 ms. Remains 288 /288 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2021-05-08 22:33:39] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 233 rows 288 cols
[2021-05-08 22:33:39] [INFO ] Computed 59 place invariants in 3 ms
[2021-05-08 22:33:39] [INFO ] Dead Transitions using invariants and state equation in 426 ms returned []
Finished structural reductions, in 2 iterations. Remains : 288/289 places, 233/233 transitions.
Incomplete random walk after 1000000 steps, including 35244 resets, run finished after 3120 ms. (steps per millisecond=320 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7252 resets, run finished after 1157 ms. (steps per millisecond=864 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7234 resets, run finished after 1149 ms. (steps per millisecond=870 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8074 resets, run finished after 1547 ms. (steps per millisecond=646 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7448 resets, run finished after 1231 ms. (steps per millisecond=812 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9441 resets, run finished after 1200 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9488 resets, run finished after 1224 ms. (steps per millisecond=816 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7506 resets, run finished after 1166 ms. (steps per millisecond=857 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 16431881 steps, run timeout after 30001 ms. (steps per millisecond=547 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 16431881 steps, saw 1940318 distinct states, run finished after 30001 ms. (steps per millisecond=547 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 233 rows 288 cols
[2021-05-08 22:34:21] [INFO ] Computed 59 place invariants in 3 ms
[2021-05-08 22:34:21] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:21] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2021-05-08 22:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:21] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2021-05-08 22:34:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:34:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 88 ms returned sat
[2021-05-08 22:34:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:22] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2021-05-08 22:34:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 22:34:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:34:22] [INFO ] Computed and/alt/rep : 231/1079/231 causal constraints in 11 ms.
[2021-05-08 22:34:23] [INFO ] Added : 164 causal constraints over 33 iterations in 943 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-08 22:34:23] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 22:34:23] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2021-05-08 22:34:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:23] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2021-05-08 22:34:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:34:23] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 53 ms returned sat
[2021-05-08 22:34:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:23] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2021-05-08 22:34:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:34:23] [INFO ] Computed and/alt/rep : 231/1079/231 causal constraints in 11 ms.
[2021-05-08 22:34:25] [INFO ] Added : 226 causal constraints over 46 iterations in 1450 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 22:34:25] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:25] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 22:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:25] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2021-05-08 22:34:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:34:26] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 54 ms returned sat
[2021-05-08 22:34:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:26] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2021-05-08 22:34:26] [INFO ] [Nat]Added 3 Read/Feed constraints in 21 ms returned sat
[2021-05-08 22:34:26] [INFO ] Computed and/alt/rep : 231/1079/231 causal constraints in 12 ms.
[2021-05-08 22:34:27] [INFO ] Added : 116 causal constraints over 24 iterations in 608 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-08 22:34:27] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:27] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2021-05-08 22:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:27] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2021-05-08 22:34:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:27] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:34:27] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2021-05-08 22:34:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:27] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2021-05-08 22:34:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-08 22:34:27] [INFO ] Computed and/alt/rep : 231/1079/231 causal constraints in 11 ms.
[2021-05-08 22:34:28] [INFO ] Added : 97 causal constraints over 20 iterations in 511 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-08 22:34:28] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 22:34:28] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2021-05-08 22:34:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:28] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2021-05-08 22:34:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:29] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 80 ms returned sat
[2021-05-08 22:34:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:29] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2021-05-08 22:34:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:34:29] [INFO ] Deduced a trap composed of 17 places in 73 ms
[2021-05-08 22:34:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2021-05-08 22:34:29] [INFO ] Computed and/alt/rep : 231/1079/231 causal constraints in 11 ms.
[2021-05-08 22:34:30] [INFO ] Added : 216 causal constraints over 44 iterations in 1388 ms. Result :sat
[2021-05-08 22:34:31] [INFO ] Deduced a trap composed of 16 places in 63 ms
[2021-05-08 22:34:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-08 22:34:31] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2021-05-08 22:34:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:31] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2021-05-08 22:34:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 50 ms returned sat
[2021-05-08 22:34:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:31] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2021-05-08 22:34:31] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:34:31] [INFO ] Computed and/alt/rep : 231/1079/231 causal constraints in 11 ms.
[2021-05-08 22:34:33] [INFO ] Added : 215 causal constraints over 44 iterations in 1661 ms. Result :sat
[2021-05-08 22:34:33] [INFO ] Deduced a trap composed of 19 places in 53 ms
[2021-05-08 22:34:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-08 22:34:33] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:33] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2021-05-08 22:34:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:34] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2021-05-08 22:34:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:34] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:34] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2021-05-08 22:34:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:34] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2021-05-08 22:34:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:34:34] [INFO ] Computed and/alt/rep : 231/1079/231 causal constraints in 12 ms.
[2021-05-08 22:34:35] [INFO ] Added : 195 causal constraints over 39 iterations in 840 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
Incomplete Parikh walk after 161500 steps, including 4715 resets, run finished after 521 ms. (steps per millisecond=309 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 195600 steps, including 5885 resets, run finished after 632 ms. (steps per millisecond=309 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 198600 steps, including 5660 resets, run finished after 646 ms. (steps per millisecond=307 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 32500 steps, including 1140 resets, run finished after 109 ms. (steps per millisecond=298 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 129700 steps, including 3644 resets, run finished after 417 ms. (steps per millisecond=311 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 210900 steps, including 6125 resets, run finished after 683 ms. (steps per millisecond=308 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 172600 steps, including 5024 resets, run finished after 558 ms. (steps per millisecond=309 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 22 out of 288 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 288/288 places, 233/233 transitions.
Applied a total of 0 rules in 9 ms. Remains 288 /288 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 288/288 places, 233/233 transitions.
Starting structural reductions, iteration 0 : 288/288 places, 233/233 transitions.
Applied a total of 0 rules in 8 ms. Remains 288 /288 variables (removed 0) and now considering 233/233 (removed 0) transitions.
// Phase 1: matrix 233 rows 288 cols
[2021-05-08 22:34:39] [INFO ] Computed 59 place invariants in 2 ms
[2021-05-08 22:34:39] [INFO ] Implicit Places using invariants in 477 ms returned []
// Phase 1: matrix 233 rows 288 cols
[2021-05-08 22:34:39] [INFO ] Computed 59 place invariants in 3 ms
[2021-05-08 22:34:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 22:34:41] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 2040 ms to find 0 implicit places.
[2021-05-08 22:34:41] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 233 rows 288 cols
[2021-05-08 22:34:41] [INFO ] Computed 59 place invariants in 3 ms
[2021-05-08 22:34:41] [INFO ] Dead Transitions using invariants and state equation in 428 ms returned []
Finished structural reductions, in 1 iterations. Remains : 288/288 places, 233/233 transitions.
Incomplete random walk after 100000 steps, including 3573 resets, run finished after 324 ms. (steps per millisecond=308 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 233 rows 288 cols
[2021-05-08 22:34:41] [INFO ] Computed 59 place invariants in 3 ms
[2021-05-08 22:34:41] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:41] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2021-05-08 22:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:42] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2021-05-08 22:34:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:42] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:42] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 87 ms returned sat
[2021-05-08 22:34:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:42] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2021-05-08 22:34:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 22:34:42] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:34:42] [INFO ] Computed and/alt/rep : 231/1079/231 causal constraints in 11 ms.
[2021-05-08 22:34:43] [INFO ] Added : 164 causal constraints over 33 iterations in 926 ms. Result :sat
[2021-05-08 22:34:43] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 22:34:43] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2021-05-08 22:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:43] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2021-05-08 22:34:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:44] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:44] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 52 ms returned sat
[2021-05-08 22:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:44] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2021-05-08 22:34:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:34:44] [INFO ] Computed and/alt/rep : 231/1079/231 causal constraints in 11 ms.
[2021-05-08 22:34:45] [INFO ] Added : 226 causal constraints over 46 iterations in 1435 ms. Result :sat
[2021-05-08 22:34:45] [INFO ] [Real]Absence check using 34 positive place invariants in 20 ms returned sat
[2021-05-08 22:34:45] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 22 ms returned sat
[2021-05-08 22:34:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:46] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2021-05-08 22:34:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:46] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:34:46] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 54 ms returned sat
[2021-05-08 22:34:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:46] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2021-05-08 22:34:46] [INFO ] [Nat]Added 3 Read/Feed constraints in 21 ms returned sat
[2021-05-08 22:34:46] [INFO ] Computed and/alt/rep : 231/1079/231 causal constraints in 11 ms.
[2021-05-08 22:34:47] [INFO ] Added : 116 causal constraints over 24 iterations in 609 ms. Result :sat
[2021-05-08 22:34:47] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 22:34:47] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2021-05-08 22:34:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:47] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2021-05-08 22:34:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:47] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:47] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2021-05-08 22:34:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:48] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2021-05-08 22:34:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-08 22:34:48] [INFO ] Computed and/alt/rep : 231/1079/231 causal constraints in 12 ms.
[2021-05-08 22:34:48] [INFO ] Added : 97 causal constraints over 20 iterations in 514 ms. Result :sat
[2021-05-08 22:34:48] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 22:34:48] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2021-05-08 22:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:49] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2021-05-08 22:34:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:49] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:49] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 81 ms returned sat
[2021-05-08 22:34:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:49] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2021-05-08 22:34:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:34:49] [INFO ] Deduced a trap composed of 17 places in 59 ms
[2021-05-08 22:34:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2021-05-08 22:34:49] [INFO ] Computed and/alt/rep : 231/1079/231 causal constraints in 11 ms.
[2021-05-08 22:34:51] [INFO ] Added : 216 causal constraints over 44 iterations in 1396 ms. Result :sat
[2021-05-08 22:34:51] [INFO ] Deduced a trap composed of 16 places in 63 ms
[2021-05-08 22:34:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2021-05-08 22:34:51] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:51] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2021-05-08 22:34:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:51] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2021-05-08 22:34:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:51] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:51] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 50 ms returned sat
[2021-05-08 22:34:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:52] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2021-05-08 22:34:52] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:34:52] [INFO ] Computed and/alt/rep : 231/1079/231 causal constraints in 12 ms.
[2021-05-08 22:34:53] [INFO ] Added : 215 causal constraints over 44 iterations in 1661 ms. Result :sat
[2021-05-08 22:34:54] [INFO ] Deduced a trap composed of 19 places in 51 ms
[2021-05-08 22:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2021-05-08 22:34:54] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 22:34:54] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2021-05-08 22:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:54] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2021-05-08 22:34:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:54] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:34:54] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2021-05-08 22:34:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:54] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2021-05-08 22:34:54] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:34:54] [INFO ] Computed and/alt/rep : 231/1079/231 causal constraints in 11 ms.
[2021-05-08 22:34:55] [INFO ] Added : 195 causal constraints over 39 iterations in 830 ms. Result :sat
Applied a total of 0 rules in 8 ms. Remains 288 /288 variables (removed 0) and now considering 233/233 (removed 0) transitions.
// Phase 1: matrix 233 rows 288 cols
[2021-05-08 22:34:55] [INFO ] Computed 59 place invariants in 3 ms
[2021-05-08 22:34:55] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:34:55] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2021-05-08 22:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:56] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2021-05-08 22:34:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:56] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:56] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 88 ms returned sat
[2021-05-08 22:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:56] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2021-05-08 22:34:56] [INFO ] Computed and/alt/rep : 231/1069/231 causal constraints in 12 ms.
[2021-05-08 22:34:57] [INFO ] Added : 159 causal constraints over 32 iterations in 998 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-08 22:34:57] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 22:34:57] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2021-05-08 22:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:57] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2021-05-08 22:34:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:58] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 53 ms returned sat
[2021-05-08 22:34:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:58] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2021-05-08 22:34:58] [INFO ] Computed and/alt/rep : 231/1069/231 causal constraints in 9 ms.
[2021-05-08 22:34:59] [INFO ] Added : 227 causal constraints over 46 iterations in 903 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-08 22:34:59] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:59] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2021-05-08 22:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:59] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2021-05-08 22:34:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:59] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:34:59] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 54 ms returned sat
[2021-05-08 22:34:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:00] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2021-05-08 22:35:00] [INFO ] Computed and/alt/rep : 231/1069/231 causal constraints in 11 ms.
[2021-05-08 22:35:00] [INFO ] Added : 116 causal constraints over 24 iterations in 614 ms. Result :sat
[2021-05-08 22:35:00] [INFO ] Deduced a trap composed of 17 places in 37 ms
[2021-05-08 22:35:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
Attempting to minimize the solution found.
Minimization took 8 ms.
[2021-05-08 22:35:01] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:35:01] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2021-05-08 22:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:01] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2021-05-08 22:35:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:35:01] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:35:01] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2021-05-08 22:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:01] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2021-05-08 22:35:01] [INFO ] Computed and/alt/rep : 231/1069/231 causal constraints in 11 ms.
[2021-05-08 22:35:02] [INFO ] Added : 102 causal constraints over 21 iterations in 595 ms. Result :sat
[2021-05-08 22:35:02] [INFO ] Deduced a trap composed of 16 places in 43 ms
[2021-05-08 22:35:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-08 22:35:02] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 22:35:02] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2021-05-08 22:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:02] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2021-05-08 22:35:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:35:03] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:35:03] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 81 ms returned sat
[2021-05-08 22:35:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:03] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2021-05-08 22:35:03] [INFO ] Deduced a trap composed of 17 places in 61 ms
[2021-05-08 22:35:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2021-05-08 22:35:03] [INFO ] Computed and/alt/rep : 231/1069/231 causal constraints in 11 ms.
[2021-05-08 22:35:04] [INFO ] Added : 213 causal constraints over 43 iterations in 1041 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 22:35:04] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 22:35:04] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2021-05-08 22:35:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:05] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2021-05-08 22:35:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:35:05] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:35:05] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 50 ms returned sat
[2021-05-08 22:35:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:05] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2021-05-08 22:35:05] [INFO ] Computed and/alt/rep : 231/1069/231 causal constraints in 12 ms.
[2021-05-08 22:35:06] [INFO ] Added : 219 causal constraints over 44 iterations in 1080 ms. Result :sat
[2021-05-08 22:35:06] [INFO ] Deduced a trap composed of 9 places in 36 ms
[2021-05-08 22:35:06] [INFO ] Deduced a trap composed of 21 places in 34 ms
[2021-05-08 22:35:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-08 22:35:06] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:35:06] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2021-05-08 22:35:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:07] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2021-05-08 22:35:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:35:07] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:35:07] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2021-05-08 22:35:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:07] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2021-05-08 22:35:07] [INFO ] Computed and/alt/rep : 231/1069/231 causal constraints in 14 ms.
[2021-05-08 22:35:08] [INFO ] Added : 202 causal constraints over 41 iterations in 1001 ms. Result :sat
[2021-05-08 22:35:08] [INFO ] Deduced a trap composed of 15 places in 44 ms
[2021-05-08 22:35:08] [INFO ] Deduced a trap composed of 16 places in 44 ms
[2021-05-08 22:35:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-08 22:35:08] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2021-05-08 22:35:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
[2021-05-08 22:35:09] [INFO ] Flatten gal took : 75 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-40b @ 3570 seconds

FORMULA DES-PT-40b-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3317
rslt: Output for ReachabilityFireability @ DES-PT-40b

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 8 22:35:10 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p62) AND (1 <= p283))))",
"processed_size": 36,
"rewrites": 1
},
"result":
{
"edges": 1876252,
"markings": 1646774,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p40) AND (1 <= p283))))",
"processed_size": 36,
"rewrites": 1
},
"result":
{
"edges": 7779468,
"markings": 6674478,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 708
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p125) AND (1 <= p165))))",
"processed_size": 37,
"rewrites": 1
},
"result":
{
"edges": 35723479,
"markings": 22980480,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 860
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p10) AND (1 <= p199))))",
"processed_size": 36,
"rewrites": 1
},
"result":
{
"edges": 11194221,
"markings": 8182741,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1137
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p178) AND (1 <= p126) AND (1 <= p165))))",
"processed_size": 53,
"rewrites": 1
},
"result":
{
"edges": 35642106,
"markings": 23243908,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1658
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p35) AND (1 <= p199) AND ((p182 <= 0)) AND ((p174 <= 0)))))",
"processed_size": 72,
"rewrites": 1
},
"result":
{
"edges": 2966,
"markings": 2827,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3317
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 4,
"aneg": 0,
"comp": 17,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "A (G (((p86 <= 0) OR (p195 <= 0) OR (p157 <= 0) OR (p165 <= 0) OR ((1 <= p19) AND (1 <= p199) AND (1 <= p148) AND (1 <= p165)) OR ((1 <= p265) AND (1 <= p268) AND (((1 <= p168)) OR ((1 <= p4) AND (1 <= p199)))) OR (((p96 <= 0) OR (p195 <= 0)) AND ((p35 <= 0) OR (p199 <= 0))))))",
"processed_size": 287,
"rewrites": 2
},
"result":
{
"edges": 34943,
"markings": 30706,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 152,
"problems": 18
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 29480,
"runtime": 253.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 1073,
"conflict_clusters": 57,
"places": 288,
"places_significant": 229,
"singleton_clusters": 0,
"transitions": 233
},
"result":
{
"preliminary_value": "yes yes no yes yes yes yes ",
"value": "yes yes no yes yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 521/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 288 places, 233 transitions, 229 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p283 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p283 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p182 <= 1)
lola: LP says that atomic proposition is always true: (p174 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: E (F (((1 <= p62) AND (1 <= p283)))) : E (F (((1 <= p40) AND (1 <= p283)))) : A (G (((p86 <= 0) OR (p195 <= 0) OR (p157 <= 0) OR (p165 <= 0) OR ((1 <= p19) AND (1 <= p199) AND (1 <= p148) AND (1 <= p165)) OR ((1 <= p265) AND (1 <= p268) AND (((1 <= p168)) OR ((1 <= p4) AND (1 <= p199)))) OR (((p96 <= 0) OR (p195 <= 0)) AND ((p35 <= 0) OR (p199 <= 0)))))) : E (F (((1 <= p35) AND (1 <= p199) AND ((p182 <= 0)) AND ((p174 <= 0))))) : E (F (((1 <= p125) AND (1 <= p165)))) : E (F (((1 <= p178) AND (1 <= p126) AND (1 <= p165)))) : E (F (((1 <= p10) AND (1 <= p199))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p62) AND (1 <= p283))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p62) AND (1 <= p283))))
lola: processed formula length: 36
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p62) AND (1 <= p283))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: error: :1017: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 1591928 markings, 1812956 edges, 318386 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1646774 markings, 1876252 edges
lola: ========================================
lola: subprocess 1 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p40) AND (1 <= p283))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p40) AND (1 <= p283))))
lola: processed formula length: 36
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p40) AND (1 <= p283))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: error: :1017: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 1595666 markings, 1817097 edges, 319133 markings/sec, 0 secs
lola: sara is running 5 secs || 3138747 markings, 3629526 edges, 308616 markings/sec, 5 secs
lola: sara is running 10 secs || 4687313 markings, 5446939 edges, 309713 markings/sec, 10 secs
lola: sara is running 15 secs || 6245657 markings, 7274125 edges, 311669 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6674478 markings, 7779468 edges
lola: ========================================
lola: subprocess 2 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p125) AND (1 <= p165))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p125) AND (1 <= p165))))
lola: processed formula length: 37
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p125) AND (1 <= p165))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-2-0.sara.
sara: error: :1017: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 1307841 markings, 1863843 edges, 261568 markings/sec, 0 secs
lola: sara is running 5 secs || 2541149 markings, 3731887 edges, 246662 markings/sec, 5 secs
lola: sara is running 10 secs || 3741083 markings, 5595889 edges, 239987 markings/sec, 10 secs
lola: sara is running 15 secs || 4928514 markings, 7447734 edges, 237486 markings/sec, 15 secs
lola: sara is running 20 secs || 6117377 markings, 9304737 edges, 237773 markings/sec, 20 secs
lola: sara is running 25 secs || 7289734 markings, 11151918 edges, 234471 markings/sec, 25 secs
lola: sara is running 30 secs || 8470051 markings, 13004004 edges, 236063 markings/sec, 30 secs
lola: sara is running 35 secs || 9643363 markings, 14845408 edges, 234662 markings/sec, 35 secs
lola: sara is running 40 secs || 10831697 markings, 16690261 edges, 237667 markings/sec, 40 secs
lola: sara is running 45 secs || 12012899 markings, 18540077 edges, 236240 markings/sec, 45 secs
lola: sara is running 50 secs || 13196545 markings, 20395034 edges, 236729 markings/sec, 50 secs
lola: sara is running 55 secs || 14370388 markings, 22243723 edges, 234769 markings/sec, 55 secs
lola: sara is running 60 secs || 15547601 markings, 24095499 edges, 235443 markings/sec, 60 secs
lola: sara is running 65 secs || 16731802 markings, 25935638 edges, 236840 markings/sec, 65 secs
lola: sara is running 70 secs || 17911948 markings, 27780456 edges, 236029 markings/sec, 70 secs
lola: sara is running 75 secs || 19094612 markings, 29631587 edges, 236533 markings/sec, 75 secs
lola: sara is running 80 secs || 20278267 markings, 31482708 edges, 236731 markings/sec, 80 secs
lola: sara is running 85 secs || 21455589 markings, 33337203 edges, 235464 markings/sec, 85 secs
lola: sara is running 90 secs || 22620385 markings, 35183646 edges, 232959 markings/sec, 90 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22980480 markings, 35723479 edges
lola: ========================================
lola: subprocess 3 will run for 860 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p10) AND (1 <= p199))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p10) AND (1 <= p199))))
lola: processed formula length: 36
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p10) AND (1 <= p199))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-3-0.sara.
sara: error: :1017: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 1371068 markings, 1836919 edges, 274214 markings/sec, 0 secs
lola: sara is running 5 secs || 2695722 markings, 3655198 edges, 264931 markings/sec, 5 secs
lola: sara is running 10 secs || 4020291 markings, 5467758 edges, 264914 markings/sec, 10 secs
lola: sara is running 15 secs || 5335996 markings, 7281104 edges, 263141 markings/sec, 15 secs
lola: sara is running 20 secs || 6655173 markings, 9095743 edges, 263835 markings/sec, 20 secs
lola: sara is running 25 secs || 7983909 markings, 10913073 edges, 265747 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8182741 markings, 11194221 edges
lola: ========================================
lola: subprocess 4 will run for 1137 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p178) AND (1 <= p126) AND (1 <= p165))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p178) AND (1 <= p126) AND (1 <= p165))))
lola: processed formula length: 53
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p178) AND (1 <= p126) AND (1 <= p165))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-4-0.sara.
sara: error: :1017: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 1323047 markings, 1868882 edges, 264609 markings/sec, 0 secs
lola: sara is running 5 secs || 2551924 markings, 3746900 edges, 245775 markings/sec, 5 secs
lola: sara is running 10 secs || 3787654 markings, 5620820 edges, 247146 markings/sec, 10 secs
lola: sara is running 15 secs || 5029816 markings, 7488343 edges, 248432 markings/sec, 15 secs
lola: sara is running 20 secs || 6271077 markings, 9359798 edges, 248252 markings/sec, 20 secs
lola: sara is running 25 secs || 7507695 markings, 11230986 edges, 247324 markings/sec, 25 secs
lola: sara is running 30 secs || 8744392 markings, 13103309 edges, 247339 markings/sec, 30 secs
lola: sara is running 35 secs || 9983297 markings, 14973857 edges, 247781 markings/sec, 35 secs
lola: sara is running 40 secs || 11212834 markings, 16840388 edges, 245907 markings/sec, 40 secs
lola: sara is running 45 secs || 12449077 markings, 18710851 edges, 247249 markings/sec, 45 secs
lola: sara is running 50 secs || 13685193 markings, 20580056 edges, 247223 markings/sec, 50 secs
lola: sara is running 55 secs || 14901740 markings, 22448991 edges, 243309 markings/sec, 55 secs
lola: sara is running 60 secs || 16102474 markings, 24305838 edges, 240147 markings/sec, 60 secs
lola: sara is running 65 secs || 17296897 markings, 26162370 edges, 238885 markings/sec, 65 secs
lola: sara is running 70 secs || 18488811 markings, 28026546 edges, 238383 markings/sec, 70 secs
lola: sara is running 75 secs || 19669729 markings, 29889652 edges, 236184 markings/sec, 75 secs
lola: sara is running 80 secs || 20852838 markings, 31752709 edges, 236622 markings/sec, 80 secs
lola: sara is running 85 secs || 22017961 markings, 33638320 edges, 233025 markings/sec, 85 secs
lola: sara is running 90 secs || 23190472 markings, 35539830 edges, 234502 markings/sec, 90 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23243908 markings, 35642106 edges
lola: ========================================
lola: subprocess 5 will run for 1658 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p35) AND (1 <= p199) AND ((p182 <= 0)) AND ((p174 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p35) AND (1 <= p199) AND ((p182 <= 0)) AND ((p174 <= 0)))))
lola: processed formula length: 72
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p35) AND (1 <= p199) AND ((p182 <= 0)) AND ((p174 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-5-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2827 markings, 2966 edges
lola: ========================================
lola: subprocess 6 will run for 3317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p86 <= 0) OR (p195 <= 0) OR (p157 <= 0) OR (p165 <= 0) OR ((1 <= p19) AND (1 <= p199) AND (1 <= p148) AND (1 <= p165)) OR ((1 <= p265) AND (1 <= p268) AND (((1 <= p168)) OR ((1 <= p4) AND (1 <= p199)))) OR (((p96 <= 0) OR (p195 <= 0)) AND ((p35 <= 0) OR (p199 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p86 <= 0) OR (p195 <= 0) OR (p157 <= 0) OR (p165 <= 0) OR ((1 <= p19) AND (1 <= p199) AND (1 <= p148) AND (1 <= p165)) OR ((1 <= p265) AND (1 <= p268) AND (((1 <= p168)) OR ((1 <= p4) AND (1 <= p199)))) OR (((p96 <= 0) OR (p195 <= 0)) AND ((p35 <= 0) OR (p199 <= 0))))))
lola: processed formula length: 287
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p86) AND (1 <= p195) AND (1 <= p157) AND (1 <= p165) AND ((p19 <= 0) OR (p199 <= 0) OR (p148 <= 0) OR (p165 <= 0)) AND ((p265 <= 0) OR (p268 <= 0) OR (((p168 <= 0)) AND ((p4 <= 0) OR (p199 <= 0)))) AND (((1 <= p96) AND (1 <= p195)) OR ((1 <= p35) AND (1 <= p199))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 152 literals and 18 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-6-0.sara.
sara: error: :1017: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30706 markings, 34943 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes yes yes yes
lola:
preliminary result: yes yes no yes yes yes yes
lola: memory consumption: 29480 KB
lola: time consumption: 253 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

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

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="DES-PT-40b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
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-4028"
echo " Executing tool gold2020"
echo " Input is DES-PT-40b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r075-tall-162039097100064"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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