Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151600348.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DoubleExponent-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151600348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 169K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716425799739

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 00:56:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 00:56:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:56:42] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-23 00:56:42] [INFO ] Transformed 534 places.
[2024-05-23 00:56:42] [INFO ] Transformed 498 transitions.
[2024-05-23 00:56:42] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DoubleExponent-PT-010-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 498/498 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 530 transition count 498
Applied a total of 4 rules in 61 ms. Remains 530 /534 variables (removed 4) and now considering 498/498 (removed 0) transitions.
// Phase 1: matrix 498 rows 530 cols
[2024-05-23 00:56:42] [INFO ] Computed 51 invariants in 76 ms
[2024-05-23 00:56:42] [INFO ] Implicit Places using invariants in 402 ms returned [437, 439]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 429 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 528/534 places, 498/498 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 527 transition count 497
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 527 transition count 497
Applied a total of 2 rules in 62 ms. Remains 527 /528 variables (removed 1) and now considering 497/498 (removed 1) transitions.
// Phase 1: matrix 497 rows 527 cols
[2024-05-23 00:56:43] [INFO ] Computed 49 invariants in 42 ms
[2024-05-23 00:56:43] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-23 00:56:43] [INFO ] Invariant cache hit.
[2024-05-23 00:56:45] [INFO ] Implicit Places using invariants and state equation in 1811 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 527/534 places, 497/498 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2605 ms. Remains : 527/534 places, 497/498 transitions.
Support contains 34 out of 527 places after structural reductions.
[2024-05-23 00:56:45] [INFO ] Flatten gal took : 61 ms
[2024-05-23 00:56:45] [INFO ] Flatten gal took : 28 ms
[2024-05-23 00:56:45] [INFO ] Input system was already deterministic with 497 transitions.
Incomplete random walk after 10000 steps, including 334 resets, run finished after 542 ms. (steps per millisecond=18 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 156567 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{3=1, 5=1, 17=1}
Probabilistic random walk after 156567 steps, saw 78296 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :3
Running SMT prover for 17 properties.
[2024-05-23 00:56:49] [INFO ] Invariant cache hit.
[2024-05-23 00:56:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:56:49] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 25 ms returned sat
[2024-05-23 00:56:50] [INFO ] After 1040ms SMT Verify possible using state equation in real domain returned unsat :2 sat :13 real:2
[2024-05-23 00:56:51] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 3 ms to minimize.
[2024-05-23 00:56:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2024-05-23 00:56:51] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 1 ms to minimize.
[2024-05-23 00:56:51] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 1 ms to minimize.
[2024-05-23 00:56:51] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:56:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 472 ms
[2024-05-23 00:56:52] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 1 ms to minimize.
[2024-05-23 00:56:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2024-05-23 00:56:52] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 1 ms to minimize.
[2024-05-23 00:56:52] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 1 ms to minimize.
[2024-05-23 00:56:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2024-05-23 00:56:52] [INFO ] After 3115ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :2 real:13
Attempting to minimize the solution found.
Minimization took 165 ms.
[2024-05-23 00:56:53] [INFO ] After 3728ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :2 real:13
[2024-05-23 00:56:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:56:53] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 11 ms returned sat
[2024-05-23 00:56:54] [INFO ] After 803ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :15
[2024-05-23 00:56:54] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 1 ms to minimize.
[2024-05-23 00:56:54] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 0 ms to minimize.
[2024-05-23 00:56:54] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 0 ms to minimize.
[2024-05-23 00:56:54] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 1 ms to minimize.
[2024-05-23 00:56:54] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 0 ms to minimize.
[2024-05-23 00:56:55] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 1 ms to minimize.
[2024-05-23 00:56:55] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 0 ms to minimize.
[2024-05-23 00:56:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 921 ms
[2024-05-23 00:56:56] [INFO ] Deduced a trap composed of 101 places in 76 ms of which 0 ms to minimize.
[2024-05-23 00:56:56] [INFO ] Deduced a trap composed of 103 places in 79 ms of which 1 ms to minimize.
[2024-05-23 00:56:56] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 0 ms to minimize.
[2024-05-23 00:56:56] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 0 ms to minimize.
[2024-05-23 00:56:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 588 ms
[2024-05-23 00:56:57] [INFO ] After 3647ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :15
Attempting to minimize the solution found.
Minimization took 881 ms.
[2024-05-23 00:56:58] [INFO ] After 4898ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :15
Fused 17 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 5456 ms.
Support contains 22 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 525 transition count 399
Reduce places removed 96 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 108 rules applied. Total rules applied 206 place count 429 transition count 387
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 218 place count 417 transition count 387
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 218 place count 417 transition count 361
Deduced a syphon composed of 26 places in 5 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 270 place count 391 transition count 361
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 3 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 424 place count 314 transition count 284
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 460 place count 296 transition count 284
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 3 with 39 rules applied. Total rules applied 499 place count 296 transition count 245
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 538 place count 257 transition count 245
Partial Free-agglomeration rule applied 37 times.
Drop transitions removed 37 transitions
Iterating global reduction 4 with 37 rules applied. Total rules applied 575 place count 257 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 576 place count 256 transition count 244
Applied a total of 576 rules in 146 ms. Remains 256 /527 variables (removed 271) and now considering 244/497 (removed 253) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 256/527 places, 244/497 transitions.
Incomplete random walk after 10000 steps, including 1304 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 179150 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179150 steps, saw 89605 distinct states, run finished after 3002 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 244 rows 256 cols
[2024-05-23 00:57:07] [INFO ] Computed 49 invariants in 25 ms
[2024-05-23 00:57:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:57:07] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 27 ms returned sat
[2024-05-23 00:57:07] [INFO ] After 365ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:13
[2024-05-23 00:57:07] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-23 00:57:07] [INFO ] After 108ms SMT Verify possible using 32 Read/Feed constraints in real domain returned unsat :0 sat :1 real:14
[2024-05-23 00:57:07] [INFO ] After 139ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-23 00:57:07] [INFO ] After 704ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-23 00:57:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:57:08] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 26 ms returned sat
[2024-05-23 00:57:08] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-23 00:57:08] [INFO ] After 492ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-23 00:57:09] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
[2024-05-23 00:57:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-05-23 00:57:09] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 1 ms to minimize.
[2024-05-23 00:57:09] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 0 ms to minimize.
[2024-05-23 00:57:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2024-05-23 00:57:09] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:57:09] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-23 00:57:09] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 0 ms to minimize.
[2024-05-23 00:57:09] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2024-05-23 00:57:09] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:57:09] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-23 00:57:09] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:57:09] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:57:10] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:57:10] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 0 ms to minimize.
[2024-05-23 00:57:10] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-23 00:57:10] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 5 ms to minimize.
[2024-05-23 00:57:10] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:57:10] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:57:10] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:57:10] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1284 ms
[2024-05-23 00:57:10] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:57:10] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:57:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2024-05-23 00:57:11] [INFO ] After 2755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 261 ms.
[2024-05-23 00:57:11] [INFO ] After 3508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 4004 ms.
Support contains 22 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 244/244 transitions.
Applied a total of 0 rules in 12 ms. Remains 256 /256 variables (removed 0) and now considering 244/244 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 256/256 places, 244/244 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 244/244 transitions.
Applied a total of 0 rules in 9 ms. Remains 256 /256 variables (removed 0) and now considering 244/244 (removed 0) transitions.
[2024-05-23 00:57:15] [INFO ] Invariant cache hit.
[2024-05-23 00:57:15] [INFO ] Implicit Places using invariants in 266 ms returned [28, 51, 57, 88, 111, 117, 146, 147, 169, 175, 199, 206, 213, 247, 253]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 267 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 241/256 places, 244/244 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 241 transition count 240
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 237 transition count 240
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 237 transition count 240
Applied a total of 11 rules in 71 ms. Remains 237 /241 variables (removed 4) and now considering 240/244 (removed 4) transitions.
// Phase 1: matrix 240 rows 237 cols
[2024-05-23 00:57:15] [INFO ] Computed 34 invariants in 15 ms
[2024-05-23 00:57:16] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-23 00:57:16] [INFO ] Invariant cache hit.
[2024-05-23 00:57:16] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-23 00:57:17] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 1541 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 237/256 places, 240/244 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1888 ms. Remains : 237/256 places, 240/244 transitions.
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 97 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 101 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 168325 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 168325 steps, saw 84189 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 15 properties.
[2024-05-23 00:57:20] [INFO ] Invariant cache hit.
[2024-05-23 00:57:20] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:57:20] [INFO ] [Real]Absence check using 4 positive and 30 generalized place invariants in 15 ms returned sat
[2024-05-23 00:57:21] [INFO ] After 381ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:13
[2024-05-23 00:57:21] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-23 00:57:21] [INFO ] After 86ms SMT Verify possible using 32 Read/Feed constraints in real domain returned unsat :0 sat :2 real:13
[2024-05-23 00:57:21] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 0 ms to minimize.
[2024-05-23 00:57:21] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 0 ms to minimize.
[2024-05-23 00:57:21] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 1 ms to minimize.
[2024-05-23 00:57:21] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:57:21] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:57:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 476 ms
[2024-05-23 00:57:21] [INFO ] After 596ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-23 00:57:21] [INFO ] After 1157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-23 00:57:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-23 00:57:22] [INFO ] [Nat]Absence check using 4 positive and 30 generalized place invariants in 16 ms returned sat
[2024-05-23 00:57:22] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-23 00:57:23] [INFO ] After 422ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-23 00:57:23] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2024-05-23 00:57:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-05-23 00:57:23] [INFO ] After 993ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 313 ms.
[2024-05-23 00:57:23] [INFO ] After 1915ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 3693 ms.
Support contains 22 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 240/240 transitions.
Applied a total of 0 rules in 24 ms. Remains 237 /237 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 237/237 places, 240/240 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 240/240 transitions.
Applied a total of 0 rules in 8 ms. Remains 237 /237 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-23 00:57:27] [INFO ] Invariant cache hit.
[2024-05-23 00:57:27] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-23 00:57:27] [INFO ] Invariant cache hit.
[2024-05-23 00:57:27] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-23 00:57:29] [INFO ] Implicit Places using invariants and state equation in 1333 ms returned []
Implicit Place search using SMT with State Equation took 1493 ms to find 0 implicit places.
[2024-05-23 00:57:29] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-23 00:57:29] [INFO ] Invariant cache hit.
[2024-05-23 00:57:29] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1697 ms. Remains : 237/237 places, 240/240 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 237 transition count 226
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 223 transition count 226
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 218 transition count 221
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 218 transition count 221
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 217 transition count 220
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 217 transition count 218
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 215 transition count 218
Applied a total of 44 rules in 35 ms. Remains 215 /237 variables (removed 22) and now considering 218/240 (removed 22) transitions.
Running SMT prover for 15 properties.
// Phase 1: matrix 218 rows 215 cols
[2024-05-23 00:57:29] [INFO ] Computed 34 invariants in 16 ms
[2024-05-23 00:57:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:57:29] [INFO ] [Real]Absence check using 2 positive and 32 generalized place invariants in 11 ms returned sat
[2024-05-23 00:57:30] [INFO ] After 430ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:11
[2024-05-23 00:57:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 00:57:30] [INFO ] After 71ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-23 00:57:30] [INFO ] After 762ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-23 00:57:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:57:30] [INFO ] [Nat]Absence check using 2 positive and 32 generalized place invariants in 12 ms returned sat
[2024-05-23 00:57:30] [INFO ] After 525ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-23 00:57:31] [INFO ] After 268ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-23 00:57:31] [INFO ] After 629ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 217 ms.
[2024-05-23 00:57:31] [INFO ] After 1532ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA DoubleExponent-PT-010-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 525 transition count 374
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 243 place count 404 transition count 374
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 243 place count 404 transition count 353
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 285 place count 383 transition count 353
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 467 place count 292 transition count 262
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 503 place count 274 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 504 place count 273 transition count 261
Applied a total of 504 rules in 52 ms. Remains 273 /527 variables (removed 254) and now considering 261/497 (removed 236) transitions.
// Phase 1: matrix 261 rows 273 cols
[2024-05-23 00:57:31] [INFO ] Computed 49 invariants in 20 ms
[2024-05-23 00:57:32] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-23 00:57:32] [INFO ] Invariant cache hit.
[2024-05-23 00:57:32] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:57:33] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
[2024-05-23 00:57:33] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-23 00:57:33] [INFO ] Invariant cache hit.
[2024-05-23 00:57:33] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 273/527 places, 261/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1449 ms. Remains : 273/527 places, 261/497 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s141 1), p1:(GEQ s180 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 3 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-00 finished in 1791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 525 transition count 373
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 245 place count 403 transition count 373
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 245 place count 403 transition count 354
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 283 place count 384 transition count 354
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 469 place count 291 transition count 261
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 503 place count 274 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 504 place count 273 transition count 260
Applied a total of 504 rules in 48 ms. Remains 273 /527 variables (removed 254) and now considering 260/497 (removed 237) transitions.
// Phase 1: matrix 260 rows 273 cols
[2024-05-23 00:57:33] [INFO ] Computed 49 invariants in 12 ms
[2024-05-23 00:57:33] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-23 00:57:33] [INFO ] Invariant cache hit.
[2024-05-23 00:57:33] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:57:34] [INFO ] Implicit Places using invariants and state equation in 1029 ms returned []
Implicit Place search using SMT with State Equation took 1177 ms to find 0 implicit places.
[2024-05-23 00:57:34] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 00:57:34] [INFO ] Invariant cache hit.
[2024-05-23 00:57:34] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 273/527 places, 260/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1364 ms. Remains : 273/527 places, 260/497 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s100 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9774 reset in 206 ms.
Product exploration explored 100000 steps with 9707 reset in 149 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 260/260 transitions.
Applied a total of 0 rules in 11 ms. Remains 273 /273 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-23 00:57:35] [INFO ] Invariant cache hit.
[2024-05-23 00:57:35] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-23 00:57:35] [INFO ] Invariant cache hit.
[2024-05-23 00:57:35] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:57:36] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
[2024-05-23 00:57:36] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 00:57:36] [INFO ] Invariant cache hit.
[2024-05-23 00:57:36] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1331 ms. Remains : 273/273 places, 260/260 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9679 reset in 119 ms.
Product exploration explored 100000 steps with 9657 reset in 118 ms.
Built C files in :
/tmp/ltsmin5957561923111135107
[2024-05-23 00:57:37] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2024-05-23 00:57:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:57:37] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2024-05-23 00:57:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:57:37] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2024-05-23 00:57:37] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:57:37] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5957561923111135107
Running compilation step : cd /tmp/ltsmin5957561923111135107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 617 ms.
Running link step : cd /tmp/ltsmin5957561923111135107;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin5957561923111135107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3879836808683445141.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 260/260 transitions.
Applied a total of 0 rules in 15 ms. Remains 273 /273 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-23 00:57:52] [INFO ] Invariant cache hit.
[2024-05-23 00:57:52] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-23 00:57:52] [INFO ] Invariant cache hit.
[2024-05-23 00:57:52] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:57:53] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
[2024-05-23 00:57:53] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:57:53] [INFO ] Invariant cache hit.
[2024-05-23 00:57:53] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1291 ms. Remains : 273/273 places, 260/260 transitions.
Built C files in :
/tmp/ltsmin743061225648340427
[2024-05-23 00:57:54] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2024-05-23 00:57:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:57:54] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2024-05-23 00:57:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:57:54] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2024-05-23 00:57:54] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:57:54] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin743061225648340427
Running compilation step : cd /tmp/ltsmin743061225648340427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 504 ms.
Running link step : cd /tmp/ltsmin743061225648340427;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin743061225648340427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8702079459950954664.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:58:09] [INFO ] Flatten gal took : 16 ms
[2024-05-23 00:58:09] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:58:09] [INFO ] Time to serialize gal into /tmp/LTL778317901561676928.gal : 4 ms
[2024-05-23 00:58:09] [INFO ] Time to serialize properties into /tmp/LTL8547478013699087999.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL778317901561676928.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13462702168384632304.hoa' '-atoms' '/tmp/LTL8547478013699087999.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8547478013699087999.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13462702168384632304.hoa
Detected timeout of ITS tools.
[2024-05-23 00:58:24] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:58:24] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:58:24] [INFO ] Time to serialize gal into /tmp/LTL2508365584574273422.gal : 3 ms
[2024-05-23 00:58:24] [INFO ] Time to serialize properties into /tmp/LTL3741934052803889431.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2508365584574273422.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3741934052803889431.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(p27<1)"))))
Formula 0 simplified : GF!"(p27<1)"
Detected timeout of ITS tools.
[2024-05-23 00:58:39] [INFO ] Flatten gal took : 14 ms
[2024-05-23 00:58:39] [INFO ] Applying decomposition
[2024-05-23 00:58:39] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7187547773943517412.txt' '-o' '/tmp/graph7187547773943517412.bin' '-w' '/tmp/graph7187547773943517412.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7187547773943517412.bin' '-l' '-1' '-v' '-w' '/tmp/graph7187547773943517412.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:58:39] [INFO ] Decomposing Gal with order
[2024-05-23 00:58:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:58:39] [INFO ] Removed a total of 191 redundant transitions.
[2024-05-23 00:58:39] [INFO ] Flatten gal took : 55 ms
[2024-05-23 00:58:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 13 ms.
[2024-05-23 00:58:39] [INFO ] Time to serialize gal into /tmp/LTL11586484779640155302.gal : 7 ms
[2024-05-23 00:58:39] [INFO ] Time to serialize properties into /tmp/LTL13767844952184103861.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11586484779640155302.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13767844952184103861.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("(i0.i0.u39.p27<1)"))))
Formula 0 simplified : GF!"(i0.i0.u39.p27<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12523459985791975498
[2024-05-23 00:58:54] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12523459985791975498
Running compilation step : cd /tmp/ltsmin12523459985791975498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 405 ms.
Running link step : cd /tmp/ltsmin12523459985791975498;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12523459985791975498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-010-LTLFireability-01 finished in 96209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(F(p1)||X(F(p2))))))'
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 23 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2024-05-23 00:59:09] [INFO ] Computed 49 invariants in 19 ms
[2024-05-23 00:59:09] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-23 00:59:09] [INFO ] Invariant cache hit.
[2024-05-23 00:59:11] [INFO ] Implicit Places using invariants and state equation in 1946 ms returned []
Implicit Place search using SMT with State Equation took 2139 ms to find 0 implicit places.
[2024-05-23 00:59:11] [INFO ] Invariant cache hit.
[2024-05-23 00:59:12] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2391 ms. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(AND (GEQ s42 1) (GEQ s124 1)), p1:(AND (LT s144 1) (LT s31 1)), p2:(GEQ s144 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-02 finished in 2634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 122 rules applied. Total rules applied 243 place count 405 transition count 373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 245 place count 403 transition count 373
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 245 place count 403 transition count 353
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 285 place count 383 transition count 353
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 469 place count 291 transition count 261
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 505 place count 273 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 506 place count 272 transition count 260
Applied a total of 506 rules in 41 ms. Remains 272 /527 variables (removed 255) and now considering 260/497 (removed 237) transitions.
// Phase 1: matrix 260 rows 272 cols
[2024-05-23 00:59:12] [INFO ] Computed 49 invariants in 11 ms
[2024-05-23 00:59:12] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-23 00:59:12] [INFO ] Invariant cache hit.
[2024-05-23 00:59:12] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:59:13] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
[2024-05-23 00:59:13] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:59:13] [INFO ] Invariant cache hit.
[2024-05-23 00:59:13] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/527 places, 260/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1364 ms. Remains : 272/527 places, 260/497 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s254 1) (LT s262 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13902 reset in 115 ms.
Product exploration explored 100000 steps with 13802 reset in 117 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1386 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 782 steps, run visited all 1 properties in 7 ms. (steps per millisecond=111 )
Probabilistic random walk after 782 steps, saw 400 distinct states, run finished after 7 ms. (steps per millisecond=111 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 260/260 transitions.
Applied a total of 0 rules in 12 ms. Remains 272 /272 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-23 00:59:14] [INFO ] Invariant cache hit.
[2024-05-23 00:59:14] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-23 00:59:14] [INFO ] Invariant cache hit.
[2024-05-23 00:59:14] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:59:15] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
[2024-05-23 00:59:15] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:59:15] [INFO ] Invariant cache hit.
[2024-05-23 00:59:15] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1352 ms. Remains : 272/272 places, 260/260 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1383 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 821 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 782 steps, run visited all 1 properties in 6 ms. (steps per millisecond=130 )
Probabilistic random walk after 782 steps, saw 400 distinct states, run finished after 6 ms. (steps per millisecond=130 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13904 reset in 110 ms.
Product exploration explored 100000 steps with 13867 reset in 121 ms.
Built C files in :
/tmp/ltsmin14214304203846254703
[2024-05-23 00:59:16] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2024-05-23 00:59:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:59:16] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2024-05-23 00:59:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:59:16] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2024-05-23 00:59:16] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:59:16] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14214304203846254703
Running compilation step : cd /tmp/ltsmin14214304203846254703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 506 ms.
Running link step : cd /tmp/ltsmin14214304203846254703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14214304203846254703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6240211501436658847.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 260/260 transitions.
Applied a total of 0 rules in 14 ms. Remains 272 /272 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-23 00:59:31] [INFO ] Invariant cache hit.
[2024-05-23 00:59:31] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-23 00:59:31] [INFO ] Invariant cache hit.
[2024-05-23 00:59:31] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:59:32] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1174 ms to find 0 implicit places.
[2024-05-23 00:59:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:59:32] [INFO ] Invariant cache hit.
[2024-05-23 00:59:32] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1309 ms. Remains : 272/272 places, 260/260 transitions.
Built C files in :
/tmp/ltsmin18175046021533589791
[2024-05-23 00:59:32] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2024-05-23 00:59:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:59:32] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2024-05-23 00:59:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:59:32] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2024-05-23 00:59:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:59:32] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18175046021533589791
Running compilation step : cd /tmp/ltsmin18175046021533589791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 511 ms.
Running link step : cd /tmp/ltsmin18175046021533589791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18175046021533589791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3431582753927184051.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:59:47] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:59:47] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:59:47] [INFO ] Time to serialize gal into /tmp/LTL887970916621262748.gal : 1 ms
[2024-05-23 00:59:47] [INFO ] Time to serialize properties into /tmp/LTL15717537066957860069.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL887970916621262748.gal' '-t' 'CGAL' '-hoa' '/tmp/aut680560093608928735.hoa' '-atoms' '/tmp/LTL15717537066957860069.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL15717537066957860069.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut680560093608928735.hoa
Detected timeout of ITS tools.
[2024-05-23 01:00:02] [INFO ] Flatten gal took : 10 ms
[2024-05-23 01:00:02] [INFO ] Flatten gal took : 10 ms
[2024-05-23 01:00:03] [INFO ] Time to serialize gal into /tmp/LTL6652631531852726440.gal : 4 ms
[2024-05-23 01:00:03] [INFO ] Time to serialize properties into /tmp/LTL9959177211265941278.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6652631531852726440.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9959177211265941278.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((p69<1)||(p84<1))"))))
Formula 0 simplified : GF!"((p69<1)||(p84<1))"
Detected timeout of ITS tools.
[2024-05-23 01:00:18] [INFO ] Flatten gal took : 13 ms
[2024-05-23 01:00:18] [INFO ] Applying decomposition
[2024-05-23 01:00:18] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9402171410304360085.txt' '-o' '/tmp/graph9402171410304360085.bin' '-w' '/tmp/graph9402171410304360085.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9402171410304360085.bin' '-l' '-1' '-v' '-w' '/tmp/graph9402171410304360085.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:00:18] [INFO ] Decomposing Gal with order
[2024-05-23 01:00:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:00:18] [INFO ] Removed a total of 203 redundant transitions.
[2024-05-23 01:00:18] [INFO ] Flatten gal took : 21 ms
[2024-05-23 01:00:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2024-05-23 01:00:18] [INFO ] Time to serialize gal into /tmp/LTL7473377982931499007.gal : 4 ms
[2024-05-23 01:00:18] [INFO ] Time to serialize properties into /tmp/LTL16218793861132959900.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7473377982931499007.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16218793861132959900.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((i6.u98.p69<1)||(i6.u100.p84<1))"))))
Formula 0 simplified : GF!"((i6.u98.p69<1)||(i6.u100.p84<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1359017745491625735
[2024-05-23 01:00:33] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1359017745491625735
Running compilation step : cd /tmp/ltsmin1359017745491625735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 413 ms.
Running link step : cd /tmp/ltsmin1359017745491625735;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1359017745491625735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-010-LTLFireability-03 finished in 95931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(F(p0))||G((G(p0) U p1)))))'
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 525 transition count 379
Reduce places removed 116 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 119 rules applied. Total rules applied 236 place count 409 transition count 376
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 239 place count 406 transition count 376
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 239 place count 406 transition count 355
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 459 place count 296 transition count 266
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 495 place count 278 transition count 266
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 497 place count 278 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 498 place count 277 transition count 265
Applied a total of 498 rules in 73 ms. Remains 277 /527 variables (removed 250) and now considering 265/497 (removed 232) transitions.
// Phase 1: matrix 265 rows 277 cols
[2024-05-23 01:00:48] [INFO ] Computed 49 invariants in 12 ms
[2024-05-23 01:00:48] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-23 01:00:48] [INFO ] Invariant cache hit.
[2024-05-23 01:00:48] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-23 01:00:49] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
[2024-05-23 01:00:49] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:00:49] [INFO ] Invariant cache hit.
[2024-05-23 01:00:49] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 277/527 places, 265/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1329 ms. Remains : 277/527 places, 265/497 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s108 1) (GEQ s112 1)), p1:(AND (GEQ s67 1) (GEQ s126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-05 finished in 1516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&X((F(!p1)||G(!p0)))) U (G((!p0&&X((F(!p1)||G(!p0)))))||(X((F(!p1)||G(!p0)))&&p2))))'
Support contains 5 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 22 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2024-05-23 01:00:49] [INFO ] Computed 49 invariants in 23 ms
[2024-05-23 01:00:50] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-23 01:00:50] [INFO ] Invariant cache hit.
[2024-05-23 01:00:52] [INFO ] Implicit Places using invariants and state equation in 2216 ms returned []
Implicit Place search using SMT with State Equation took 2400 ms to find 0 implicit places.
[2024-05-23 01:00:52] [INFO ] Invariant cache hit.
[2024-05-23 01:00:52] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2638 ms. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), true, (AND p1 p0), p1]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(OR p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (LT s297 1) (NOT (AND (GEQ s277 1) (GEQ s359 1)))), p0:(AND (GEQ s277 1) (GEQ s359 1)), p1:(AND (GEQ s363 1) (GEQ s370 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 507 ms.
Product exploration explored 100000 steps with 50000 reset in 435 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X (OR p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (OR p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 21 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-010-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-010-LTLFireability-06 finished in 3768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0&&F(p1)&&(!p0 U G(p2)))) U p3))'
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 241 place count 405 transition count 375
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 241 place count 405 transition count 355
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 461 place count 295 transition count 265
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 497 place count 277 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 498 place count 276 transition count 264
Applied a total of 498 rules in 39 ms. Remains 276 /527 variables (removed 251) and now considering 264/497 (removed 233) transitions.
// Phase 1: matrix 264 rows 276 cols
[2024-05-23 01:00:53] [INFO ] Computed 49 invariants in 16 ms
[2024-05-23 01:00:53] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-23 01:00:53] [INFO ] Invariant cache hit.
[2024-05-23 01:00:54] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
[2024-05-23 01:00:54] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 01:00:54] [INFO ] Invariant cache hit.
[2024-05-23 01:00:54] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 276/527 places, 264/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 850 ms. Remains : 276/527 places, 264/497 transitions.
Stuttering acceptance computed with spot in 383 ms :[(NOT p3), (OR (NOT p1) (NOT p2) p0), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(GEQ s64 1), p0:(LT s96 1), p1:(GEQ s106 1), p2:(GEQ s183 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-07 finished in 1255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 525 transition count 373
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 245 place count 403 transition count 373
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 245 place count 403 transition count 353
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 285 place count 383 transition count 353
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 467 place count 292 transition count 262
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 503 place count 274 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 504 place count 273 transition count 261
Applied a total of 504 rules in 40 ms. Remains 273 /527 variables (removed 254) and now considering 261/497 (removed 236) transitions.
// Phase 1: matrix 261 rows 273 cols
[2024-05-23 01:00:54] [INFO ] Computed 49 invariants in 14 ms
[2024-05-23 01:00:55] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-23 01:00:55] [INFO ] Invariant cache hit.
[2024-05-23 01:00:55] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:00:56] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
[2024-05-23 01:00:56] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:00:56] [INFO ] Invariant cache hit.
[2024-05-23 01:00:56] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 273/527 places, 261/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1281 ms. Remains : 273/527 places, 261/497 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LT s47 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13962 reset in 102 ms.
Product exploration explored 100000 steps with 13895 reset in 108 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1372 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 795 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 655291 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 655291 steps, saw 327738 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:00:59] [INFO ] Invariant cache hit.
[2024-05-23 01:00:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:00:59] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 13 ms returned sat
[2024-05-23 01:00:59] [INFO ] After 92ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:00:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:00:59] [INFO ] After 58ms SMT Verify possible using 18 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:00:59] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:00:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:00:59] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 11 ms returned sat
[2024-05-23 01:00:59] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:00] [INFO ] After 53ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:00] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-23 01:01:00] [INFO ] After 237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 261/261 transitions.
Graph (complete) has 811 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 260
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 272 transition count 223
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 235 transition count 223
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 2 with 40 rules applied. Total rules applied 116 place count 235 transition count 223
Applied a total of 116 rules in 18 ms. Remains 235 /273 variables (removed 38) and now considering 223/261 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 235/273 places, 223/261 transitions.
Incomplete random walk after 10000 steps, including 1249 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 667552 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 667552 steps, saw 333993 distinct states, run finished after 3002 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 235 cols
[2024-05-23 01:01:03] [INFO ] Computed 49 invariants in 15 ms
[2024-05-23 01:01:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:01:03] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 18 ms returned sat
[2024-05-23 01:01:03] [INFO ] After 69ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:01:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:01:03] [INFO ] After 40ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:01:03] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:01:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 01:01:03] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 16 ms returned sat
[2024-05-23 01:01:03] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:03] [INFO ] After 37ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:03] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-23 01:01:03] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-23 01:01:03] [INFO ] Invariant cache hit.
[2024-05-23 01:01:03] [INFO ] Implicit Places using invariants in 288 ms returned [20, 26, 48, 53, 74, 79, 99, 105, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 290 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 217 transition count 214
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 208 transition count 214
Applied a total of 18 rules in 9 ms. Remains 208 /217 variables (removed 9) and now considering 214/223 (removed 9) transitions.
// Phase 1: matrix 214 rows 208 cols
[2024-05-23 01:01:03] [INFO ] Computed 31 invariants in 14 ms
[2024-05-23 01:01:04] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-23 01:01:04] [INFO ] Invariant cache hit.
[2024-05-23 01:01:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:01:05] [INFO ] Implicit Places using invariants and state equation in 1937 ms returned []
Implicit Place search using SMT with State Equation took 2090 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/235 places, 214/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2394 ms. Remains : 208/235 places, 214/223 transitions.
Incomplete random walk after 10000 steps, including 1424 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 735322 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :{}
Probabilistic random walk after 735322 steps, saw 367741 distinct states, run finished after 3004 ms. (steps per millisecond=244 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:01:09] [INFO ] Invariant cache hit.
[2024-05-23 01:01:09] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-23 01:01:09] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 01:01:09] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:01:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:01:09] [INFO ] After 24ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-23 01:01:09] [INFO ] After 40ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-23 01:01:09] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-23 01:01:09] [INFO ] Invariant cache hit.
[2024-05-23 01:01:09] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-23 01:01:09] [INFO ] Invariant cache hit.
[2024-05-23 01:01:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:01:11] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 1956 ms to find 0 implicit places.
[2024-05-23 01:01:11] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:01:11] [INFO ] Invariant cache hit.
[2024-05-23 01:01:11] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2085 ms. Remains : 208/208 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 13 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2024-05-23 01:01:11] [INFO ] Computed 31 invariants in 10 ms
[2024-05-23 01:01:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-23 01:01:11] [INFO ] [Real]Absence check using 6 positive and 25 generalized place invariants in 5 ms returned sat
[2024-05-23 01:01:11] [INFO ] After 58ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:01:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 01:01:11] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-23 01:01:11] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-23 01:01:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-23 01:01:11] [INFO ] After 89ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:01:11] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:01:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-23 01:01:11] [INFO ] [Nat]Absence check using 6 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-23 01:01:11] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:11] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:11] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-05-23 01:01:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-23 01:01:11] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-23 01:01:11] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 261/261 transitions.
Applied a total of 0 rules in 11 ms. Remains 273 /273 variables (removed 0) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 273 cols
[2024-05-23 01:01:11] [INFO ] Computed 49 invariants in 14 ms
[2024-05-23 01:01:12] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-23 01:01:12] [INFO ] Invariant cache hit.
[2024-05-23 01:01:12] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:01:13] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
[2024-05-23 01:01:13] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:01:13] [INFO ] Invariant cache hit.
[2024-05-23 01:01:13] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1278 ms. Remains : 273/273 places, 261/261 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1412 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 826 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 660519 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 660519 steps, saw 330358 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:01:16] [INFO ] Invariant cache hit.
[2024-05-23 01:01:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:01:16] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 19 ms returned sat
[2024-05-23 01:01:16] [INFO ] After 91ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:01:16] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:01:16] [INFO ] After 58ms SMT Verify possible using 18 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:01:16] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:01:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:01:16] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 12 ms returned sat
[2024-05-23 01:01:16] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:16] [INFO ] After 57ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:16] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-23 01:01:16] [INFO ] After 240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 261/261 transitions.
Graph (complete) has 811 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 260
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 272 transition count 223
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 235 transition count 223
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 2 with 40 rules applied. Total rules applied 116 place count 235 transition count 223
Applied a total of 116 rules in 19 ms. Remains 235 /273 variables (removed 38) and now considering 223/261 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 235/273 places, 223/261 transitions.
Incomplete random walk after 10000 steps, including 1279 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 822 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 683620 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 683620 steps, saw 342024 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 235 cols
[2024-05-23 01:01:19] [INFO ] Computed 49 invariants in 18 ms
[2024-05-23 01:01:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:01:19] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 19 ms returned sat
[2024-05-23 01:01:20] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:01:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:01:20] [INFO ] After 39ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:01:20] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:01:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:01:20] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 28 ms returned sat
[2024-05-23 01:01:20] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:20] [INFO ] After 38ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:20] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-23 01:01:20] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-23 01:01:20] [INFO ] Invariant cache hit.
[2024-05-23 01:01:20] [INFO ] Implicit Places using invariants in 275 ms returned [20, 26, 48, 53, 74, 79, 99, 105, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 278 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 217 transition count 214
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 208 transition count 214
Applied a total of 18 rules in 8 ms. Remains 208 /217 variables (removed 9) and now considering 214/223 (removed 9) transitions.
// Phase 1: matrix 214 rows 208 cols
[2024-05-23 01:01:20] [INFO ] Computed 31 invariants in 13 ms
[2024-05-23 01:01:20] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-23 01:01:20] [INFO ] Invariant cache hit.
[2024-05-23 01:01:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:01:22] [INFO ] Implicit Places using invariants and state equation in 1866 ms returned []
Implicit Place search using SMT with State Equation took 2016 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/235 places, 214/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2309 ms. Remains : 208/235 places, 214/223 transitions.
Incomplete random walk after 10000 steps, including 1438 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 942 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 732997 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :{}
Probabilistic random walk after 732997 steps, saw 366579 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:01:25] [INFO ] Invariant cache hit.
[2024-05-23 01:01:25] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-23 01:01:25] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 01:01:25] [INFO ] After 69ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:01:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:01:25] [INFO ] After 24ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-23 01:01:25] [INFO ] After 40ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-23 01:01:25] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-23 01:01:25] [INFO ] Invariant cache hit.
[2024-05-23 01:01:26] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-23 01:01:26] [INFO ] Invariant cache hit.
[2024-05-23 01:01:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:01:27] [INFO ] Implicit Places using invariants and state equation in 1519 ms returned []
Implicit Place search using SMT with State Equation took 1653 ms to find 0 implicit places.
[2024-05-23 01:01:27] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:01:27] [INFO ] Invariant cache hit.
[2024-05-23 01:01:27] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1772 ms. Remains : 208/208 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 17 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2024-05-23 01:01:27] [INFO ] Computed 31 invariants in 10 ms
[2024-05-23 01:01:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-23 01:01:27] [INFO ] [Real]Absence check using 6 positive and 25 generalized place invariants in 5 ms returned sat
[2024-05-23 01:01:27] [INFO ] After 69ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:01:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 01:01:27] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-23 01:01:27] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-23 01:01:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-05-23 01:01:27] [INFO ] After 99ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:01:27] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:01:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-23 01:01:27] [INFO ] [Nat]Absence check using 6 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-23 01:01:28] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:28] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:28] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-05-23 01:01:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-23 01:01:28] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-23 01:01:28] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 13925 reset in 105 ms.
Product exploration explored 100000 steps with 13906 reset in 110 ms.
Built C files in :
/tmp/ltsmin17676333325044647004
[2024-05-23 01:01:28] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-23 01:01:28] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:01:28] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-23 01:01:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:01:28] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-23 01:01:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:01:28] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17676333325044647004
Running compilation step : cd /tmp/ltsmin17676333325044647004;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 505 ms.
Running link step : cd /tmp/ltsmin17676333325044647004;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17676333325044647004;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11158141993003912501.hoa' '--buchi-type=spotba'
LTSmin run took 10313 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-010-LTLFireability-09 finished in 44589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 122 rules applied. Total rules applied 243 place count 405 transition count 373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 245 place count 403 transition count 373
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 245 place count 403 transition count 353
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 285 place count 383 transition count 353
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 469 place count 291 transition count 261
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 505 place count 273 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 506 place count 272 transition count 260
Applied a total of 506 rules in 51 ms. Remains 272 /527 variables (removed 255) and now considering 260/497 (removed 237) transitions.
// Phase 1: matrix 260 rows 272 cols
[2024-05-23 01:01:39] [INFO ] Computed 49 invariants in 12 ms
[2024-05-23 01:01:39] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-23 01:01:39] [INFO ] Invariant cache hit.
[2024-05-23 01:01:39] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:01:40] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
[2024-05-23 01:01:40] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 01:01:40] [INFO ] Invariant cache hit.
[2024-05-23 01:01:40] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/527 places, 260/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1109 ms. Remains : 272/527 places, 260/497 transitions.
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s76 1) (LT s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13849 reset in 105 ms.
Product exploration explored 100000 steps with 13820 reset in 111 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1378 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 821 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 638566 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 638566 steps, saw 319377 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:01:44] [INFO ] Invariant cache hit.
[2024-05-23 01:01:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:01:44] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 11 ms returned sat
[2024-05-23 01:01:44] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:01:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 01:01:44] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 11 ms returned sat
[2024-05-23 01:01:44] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:44] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:01:44] [INFO ] After 29ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:44] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-23 01:01:44] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-23 01:01:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2024-05-23 01:01:44] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-23 01:01:44] [INFO ] After 419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 260/260 transitions.
Graph (complete) has 812 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 259
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 1 with 36 rules applied. Total rules applied 38 place count 271 transition count 223
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 235 transition count 223
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 113 place count 235 transition count 223
Applied a total of 113 rules in 16 ms. Remains 235 /272 variables (removed 37) and now considering 223/260 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 235/272 places, 223/260 transitions.
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 675336 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :{}
Probabilistic random walk after 675336 steps, saw 337883 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 235 cols
[2024-05-23 01:01:47] [INFO ] Computed 49 invariants in 17 ms
[2024-05-23 01:01:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 01:01:47] [INFO ] [Real]Absence check using 3 positive and 46 generalized place invariants in 11 ms returned sat
[2024-05-23 01:01:47] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:01:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 01:01:47] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 10 ms returned sat
[2024-05-23 01:01:47] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:01:47] [INFO ] After 34ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:48] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-23 01:01:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-05-23 01:01:48] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-23 01:01:48] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 6 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 6 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-23 01:01:48] [INFO ] Invariant cache hit.
[2024-05-23 01:01:48] [INFO ] Implicit Places using invariants in 270 ms returned [20, 26, 46, 51, 79, 99, 105, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 271 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 218/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 218 transition count 215
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 210 transition count 215
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 210 transition count 215
Applied a total of 17 rules in 11 ms. Remains 210 /218 variables (removed 8) and now considering 215/223 (removed 8) transitions.
// Phase 1: matrix 215 rows 210 cols
[2024-05-23 01:01:48] [INFO ] Computed 32 invariants in 11 ms
[2024-05-23 01:01:48] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-23 01:01:48] [INFO ] Invariant cache hit.
[2024-05-23 01:01:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:01:49] [INFO ] Implicit Places using invariants and state equation in 1151 ms returned []
Implicit Place search using SMT with State Equation took 1300 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 210/235 places, 215/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1590 ms. Remains : 210/235 places, 215/223 transitions.
Incomplete random walk after 10000 steps, including 1471 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 921 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 732739 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :{}
Probabilistic random walk after 732739 steps, saw 366445 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:01:52] [INFO ] Invariant cache hit.
[2024-05-23 01:01:52] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-23 01:01:52] [INFO ] [Real]Absence check using 5 positive and 27 generalized place invariants in 6 ms returned sat
[2024-05-23 01:01:52] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:01:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-23 01:01:52] [INFO ] [Nat]Absence check using 5 positive and 27 generalized place invariants in 5 ms returned sat
[2024-05-23 01:01:53] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:01:53] [INFO ] After 39ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:53] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2024-05-23 01:01:53] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 14 ms to minimize.
[2024-05-23 01:01:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2024-05-23 01:01:53] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-23 01:01:53] [INFO ] After 405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 210/210 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-23 01:01:53] [INFO ] Invariant cache hit.
[2024-05-23 01:01:53] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-23 01:01:53] [INFO ] Invariant cache hit.
[2024-05-23 01:01:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:01:54] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned []
Implicit Place search using SMT with State Equation took 1409 ms to find 0 implicit places.
[2024-05-23 01:01:54] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 01:01:54] [INFO ] Invariant cache hit.
[2024-05-23 01:01:54] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1544 ms. Remains : 210/210 places, 215/215 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 210 transition count 197
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 192 transition count 197
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 184 transition count 189
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 184 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 183 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 183 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 181 transition count 186
Applied a total of 58 rules in 13 ms. Remains 181 /210 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 181 cols
[2024-05-23 01:01:54] [INFO ] Computed 32 invariants in 6 ms
[2024-05-23 01:01:54] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-23 01:01:54] [INFO ] [Real]Absence check using 5 positive and 27 generalized place invariants in 5 ms returned sat
[2024-05-23 01:01:54] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:01:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-23 01:01:55] [INFO ] [Nat]Absence check using 5 positive and 27 generalized place invariants in 5 ms returned sat
[2024-05-23 01:01:55] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 01:01:55] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:55] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-23 01:01:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-23 01:01:55] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-23 01:01:55] [INFO ] After 255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 260/260 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 260/260 (removed 0) transitions.
// Phase 1: matrix 260 rows 272 cols
[2024-05-23 01:01:55] [INFO ] Computed 49 invariants in 7 ms
[2024-05-23 01:01:55] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-23 01:01:55] [INFO ] Invariant cache hit.
[2024-05-23 01:01:55] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:01:56] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
[2024-05-23 01:01:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 01:01:56] [INFO ] Invariant cache hit.
[2024-05-23 01:01:56] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1081 ms. Remains : 272/272 places, 260/260 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1359 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 654553 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 654553 steps, saw 327363 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:01:59] [INFO ] Invariant cache hit.
[2024-05-23 01:01:59] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 01:01:59] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 11 ms returned sat
[2024-05-23 01:01:59] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:02:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:02:00] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 10 ms returned sat
[2024-05-23 01:02:00] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:00] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:02:00] [INFO ] After 31ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:00] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2024-05-23 01:02:00] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2024-05-23 01:02:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2024-05-23 01:02:00] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-23 01:02:00] [INFO ] After 404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 260/260 transitions.
Graph (complete) has 812 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 259
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 1 with 36 rules applied. Total rules applied 38 place count 271 transition count 223
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 235 transition count 223
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 113 place count 235 transition count 223
Applied a total of 113 rules in 19 ms. Remains 235 /272 variables (removed 37) and now considering 223/260 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 235/272 places, 223/260 transitions.
Incomplete random walk after 10000 steps, including 1281 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 680468 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 680468 steps, saw 340445 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 235 cols
[2024-05-23 01:02:03] [INFO ] Computed 49 invariants in 9 ms
[2024-05-23 01:02:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 01:02:03] [INFO ] [Real]Absence check using 3 positive and 46 generalized place invariants in 17 ms returned sat
[2024-05-23 01:02:03] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:02:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 01:02:03] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 10 ms returned sat
[2024-05-23 01:02:03] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:02:03] [INFO ] After 38ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:03] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-23 01:02:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-05-23 01:02:03] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-23 01:02:03] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-23 01:02:03] [INFO ] Invariant cache hit.
[2024-05-23 01:02:04] [INFO ] Implicit Places using invariants in 280 ms returned [20, 26, 46, 51, 79, 99, 105, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 284 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 218/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 218 transition count 215
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 210 transition count 215
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 210 transition count 215
Applied a total of 17 rules in 11 ms. Remains 210 /218 variables (removed 8) and now considering 215/223 (removed 8) transitions.
// Phase 1: matrix 215 rows 210 cols
[2024-05-23 01:02:04] [INFO ] Computed 32 invariants in 13 ms
[2024-05-23 01:02:04] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-23 01:02:04] [INFO ] Invariant cache hit.
[2024-05-23 01:02:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:02:05] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 1239 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 210/235 places, 215/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1539 ms. Remains : 210/235 places, 215/223 transitions.
Incomplete random walk after 10000 steps, including 1444 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 927 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 714000 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :{}
Probabilistic random walk after 714000 steps, saw 357078 distinct states, run finished after 3003 ms. (steps per millisecond=237 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:02:08] [INFO ] Invariant cache hit.
[2024-05-23 01:02:08] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-23 01:02:08] [INFO ] [Real]Absence check using 5 positive and 27 generalized place invariants in 5 ms returned sat
[2024-05-23 01:02:08] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:02:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-23 01:02:08] [INFO ] [Nat]Absence check using 5 positive and 27 generalized place invariants in 6 ms returned sat
[2024-05-23 01:02:08] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:02:08] [INFO ] After 42ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:08] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2024-05-23 01:02:08] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2024-05-23 01:02:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2024-05-23 01:02:08] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-23 01:02:08] [INFO ] After 360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 210/210 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-23 01:02:08] [INFO ] Invariant cache hit.
[2024-05-23 01:02:09] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-23 01:02:09] [INFO ] Invariant cache hit.
[2024-05-23 01:02:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:02:10] [INFO ] Implicit Places using invariants and state equation in 1217 ms returned []
Implicit Place search using SMT with State Equation took 1359 ms to find 0 implicit places.
[2024-05-23 01:02:10] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:02:10] [INFO ] Invariant cache hit.
[2024-05-23 01:02:10] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1489 ms. Remains : 210/210 places, 215/215 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 210 transition count 197
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 192 transition count 197
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 184 transition count 189
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 184 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 183 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 183 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 181 transition count 186
Applied a total of 58 rules in 11 ms. Remains 181 /210 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 181 cols
[2024-05-23 01:02:10] [INFO ] Computed 32 invariants in 7 ms
[2024-05-23 01:02:10] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-23 01:02:10] [INFO ] [Real]Absence check using 5 positive and 27 generalized place invariants in 6 ms returned sat
[2024-05-23 01:02:10] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:02:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-23 01:02:10] [INFO ] [Nat]Absence check using 5 positive and 27 generalized place invariants in 5 ms returned sat
[2024-05-23 01:02:10] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 01:02:10] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:10] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-23 01:02:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-05-23 01:02:10] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-23 01:02:10] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 13812 reset in 100 ms.
Product exploration explored 100000 steps with 13864 reset in 111 ms.
Built C files in :
/tmp/ltsmin14977306588037227698
[2024-05-23 01:02:11] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2024-05-23 01:02:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:02:11] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2024-05-23 01:02:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:02:11] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2024-05-23 01:02:11] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:02:11] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14977306588037227698
Running compilation step : cd /tmp/ltsmin14977306588037227698;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 634 ms.
Running link step : cd /tmp/ltsmin14977306588037227698;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14977306588037227698;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13964689794837007085.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 260/260 transitions.
Applied a total of 0 rules in 10 ms. Remains 272 /272 variables (removed 0) and now considering 260/260 (removed 0) transitions.
// Phase 1: matrix 260 rows 272 cols
[2024-05-23 01:02:26] [INFO ] Computed 49 invariants in 16 ms
[2024-05-23 01:02:26] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-23 01:02:26] [INFO ] Invariant cache hit.
[2024-05-23 01:02:26] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:02:27] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 904 ms to find 0 implicit places.
[2024-05-23 01:02:27] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:02:27] [INFO ] Invariant cache hit.
[2024-05-23 01:02:27] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1056 ms. Remains : 272/272 places, 260/260 transitions.
Built C files in :
/tmp/ltsmin6578167384929298461
[2024-05-23 01:02:27] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2024-05-23 01:02:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:02:27] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2024-05-23 01:02:27] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:02:27] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2024-05-23 01:02:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:02:27] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6578167384929298461
Running compilation step : cd /tmp/ltsmin6578167384929298461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 516 ms.
Running link step : cd /tmp/ltsmin6578167384929298461;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6578167384929298461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13386356414921387299.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 01:02:42] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:02:42] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:02:42] [INFO ] Time to serialize gal into /tmp/LTL9490775065012979739.gal : 3 ms
[2024-05-23 01:02:42] [INFO ] Time to serialize properties into /tmp/LTL2111847693430900821.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9490775065012979739.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11213327030885517029.hoa' '-atoms' '/tmp/LTL2111847693430900821.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2111847693430900821.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11213327030885517029.hoa
Detected timeout of ITS tools.
[2024-05-23 01:02:57] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:02:57] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:02:57] [INFO ] Time to serialize gal into /tmp/LTL445203182094503170.gal : 4 ms
[2024-05-23 01:02:57] [INFO ] Time to serialize properties into /tmp/LTL10031909425502534870.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL445203182094503170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10031909425502534870.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G("((p228<1)||(p243<1))")))
Formula 0 simplified : F!"((p228<1)||(p243<1))"
Detected timeout of ITS tools.
[2024-05-23 01:03:12] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:03:12] [INFO ] Applying decomposition
[2024-05-23 01:03:12] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5953158639180033881.txt' '-o' '/tmp/graph5953158639180033881.bin' '-w' '/tmp/graph5953158639180033881.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5953158639180033881.bin' '-l' '-1' '-v' '-w' '/tmp/graph5953158639180033881.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:03:12] [INFO ] Decomposing Gal with order
[2024-05-23 01:03:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:03:12] [INFO ] Removed a total of 199 redundant transitions.
[2024-05-23 01:03:12] [INFO ] Flatten gal took : 51 ms
[2024-05-23 01:03:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 26 ms.
[2024-05-23 01:03:12] [INFO ] Time to serialize gal into /tmp/LTL3855195937325710023.gal : 5 ms
[2024-05-23 01:03:12] [INFO ] Time to serialize properties into /tmp/LTL4228536774109905753.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3855195937325710023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4228536774109905753.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G("((i4.i0.u25.p228<1)||(i2.u30.p243<1))")))
Formula 0 simplified : F!"((i4.i0.u25.p228<1)||(i2.u30.p243<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13802759498562978199
[2024-05-23 01:03:27] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13802759498562978199
Running compilation step : cd /tmp/ltsmin13802759498562978199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 426 ms.
Running link step : cd /tmp/ltsmin13802759498562978199;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13802759498562978199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-010-LTLFireability-10 finished in 123614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 525 transition count 374
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 243 place count 404 transition count 374
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 243 place count 404 transition count 353
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 285 place count 383 transition count 353
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 469 place count 291 transition count 261
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 505 place count 273 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 506 place count 272 transition count 260
Applied a total of 506 rules in 30 ms. Remains 272 /527 variables (removed 255) and now considering 260/497 (removed 237) transitions.
// Phase 1: matrix 260 rows 272 cols
[2024-05-23 01:03:43] [INFO ] Computed 49 invariants in 10 ms
[2024-05-23 01:03:43] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-23 01:03:43] [INFO ] Invariant cache hit.
[2024-05-23 01:03:43] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:03:44] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
[2024-05-23 01:03:44] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:03:44] [INFO ] Invariant cache hit.
[2024-05-23 01:03:44] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/527 places, 260/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1222 ms. Remains : 272/527 places, 260/497 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s147 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13859 reset in 100 ms.
Product exploration explored 100000 steps with 13848 reset in 106 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 853 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1384 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 807 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 638046 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 638046 steps, saw 319114 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:03:47] [INFO ] Invariant cache hit.
[2024-05-23 01:03:47] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 01:03:47] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 16 ms returned sat
[2024-05-23 01:03:47] [INFO ] After 141ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:03:47] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:03:47] [INFO ] After 53ms SMT Verify possible using 18 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-23 01:03:48] [INFO ] After 79ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-23 01:03:48] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 260/260 transitions.
Graph (complete) has 813 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 259
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 271 transition count 222
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 234 transition count 222
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 234 transition count 222
Applied a total of 115 rules in 13 ms. Remains 234 /272 variables (removed 38) and now considering 222/260 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 234/272 places, 222/260 transitions.
Incomplete random walk after 10000 steps, including 1259 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 834 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 677504 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :{}
Probabilistic random walk after 677504 steps, saw 338977 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 234 cols
[2024-05-23 01:03:51] [INFO ] Computed 49 invariants in 17 ms
[2024-05-23 01:03:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 01:03:51] [INFO ] [Real]Absence check using 3 positive and 46 generalized place invariants in 23 ms returned sat
[2024-05-23 01:03:51] [INFO ] After 125ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:03:51] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:03:51] [INFO ] After 102ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:03:51] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:03:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 01:03:51] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 12 ms returned sat
[2024-05-23 01:03:51] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:03:51] [INFO ] After 100ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:03:51] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-23 01:03:51] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-23 01:03:51] [INFO ] Invariant cache hit.
[2024-05-23 01:03:52] [INFO ] Implicit Places using invariants in 294 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 130, 131, 151, 156, 178, 184, 191, 225, 231]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 295 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 216/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 216 transition count 213
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 207 transition count 213
Applied a total of 18 rules in 7 ms. Remains 207 /216 variables (removed 9) and now considering 213/222 (removed 9) transitions.
// Phase 1: matrix 213 rows 207 cols
[2024-05-23 01:03:52] [INFO ] Computed 31 invariants in 10 ms
[2024-05-23 01:03:52] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-23 01:03:52] [INFO ] Invariant cache hit.
[2024-05-23 01:03:52] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:03:53] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/234 places, 213/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1477 ms. Remains : 207/234 places, 213/222 transitions.
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 728143 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 728143 steps, saw 364149 distinct states, run finished after 3004 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:03:56] [INFO ] Invariant cache hit.
[2024-05-23 01:03:56] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-23 01:03:56] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-23 01:03:56] [INFO ] After 103ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:03:56] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:03:56] [INFO ] After 87ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:03:56] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:03:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-05-23 01:03:56] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 01:03:56] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:03:56] [INFO ] After 70ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:03:56] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-23 01:03:56] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-23 01:03:56] [INFO ] Invariant cache hit.
[2024-05-23 01:03:56] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-23 01:03:56] [INFO ] Invariant cache hit.
[2024-05-23 01:03:57] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:03:58] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 1318 ms to find 0 implicit places.
[2024-05-23 01:03:58] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:03:58] [INFO ] Invariant cache hit.
[2024-05-23 01:03:58] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1450 ms. Remains : 207/207 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 181 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 184
Applied a total of 58 rules in 12 ms. Remains 178 /207 variables (removed 29) and now considering 184/213 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2024-05-23 01:03:58] [INFO ] Computed 31 invariants in 10 ms
[2024-05-23 01:03:58] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-05-23 01:03:58] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2024-05-23 01:03:58] [INFO ] After 81ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:03:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 01:03:58] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:03:58] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:03:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-23 01:03:58] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-23 01:03:58] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:03:58] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:03:58] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-23 01:03:58] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 260/260 transitions.
Applied a total of 0 rules in 7 ms. Remains 272 /272 variables (removed 0) and now considering 260/260 (removed 0) transitions.
// Phase 1: matrix 260 rows 272 cols
[2024-05-23 01:03:58] [INFO ] Computed 49 invariants in 12 ms
[2024-05-23 01:03:58] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-23 01:03:58] [INFO ] Invariant cache hit.
[2024-05-23 01:03:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:03:59] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1055 ms to find 0 implicit places.
[2024-05-23 01:03:59] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:03:59] [INFO ] Invariant cache hit.
[2024-05-23 01:03:59] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1197 ms. Remains : 272/272 places, 260/260 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 853 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1359 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 824 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 647706 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 647706 steps, saw 323950 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:04:03] [INFO ] Invariant cache hit.
[2024-05-23 01:04:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:04:03] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 11 ms returned sat
[2024-05-23 01:04:03] [INFO ] After 142ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:04:03] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:04:03] [INFO ] After 52ms SMT Verify possible using 18 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-23 01:04:03] [INFO ] After 74ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-23 01:04:03] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 260/260 transitions.
Graph (complete) has 813 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 259
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 271 transition count 222
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 234 transition count 222
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 234 transition count 222
Applied a total of 115 rules in 15 ms. Remains 234 /272 variables (removed 38) and now considering 222/260 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 234/272 places, 222/260 transitions.
Incomplete random walk after 10000 steps, including 1276 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 681683 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 681683 steps, saw 341057 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 234 cols
[2024-05-23 01:04:06] [INFO ] Computed 49 invariants in 12 ms
[2024-05-23 01:04:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 01:04:06] [INFO ] [Real]Absence check using 3 positive and 46 generalized place invariants in 12 ms returned sat
[2024-05-23 01:04:06] [INFO ] After 116ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:04:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:04:06] [INFO ] After 94ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:04:06] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:04:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 01:04:06] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 13 ms returned sat
[2024-05-23 01:04:06] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:04:06] [INFO ] After 100ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:04:07] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-23 01:04:07] [INFO ] After 303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-23 01:04:07] [INFO ] Invariant cache hit.
[2024-05-23 01:04:07] [INFO ] Implicit Places using invariants in 296 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 130, 131, 151, 156, 178, 184, 191, 225, 231]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 298 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 216/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 216 transition count 213
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 207 transition count 213
Applied a total of 18 rules in 7 ms. Remains 207 /216 variables (removed 9) and now considering 213/222 (removed 9) transitions.
// Phase 1: matrix 213 rows 207 cols
[2024-05-23 01:04:07] [INFO ] Computed 31 invariants in 10 ms
[2024-05-23 01:04:07] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-23 01:04:07] [INFO ] Invariant cache hit.
[2024-05-23 01:04:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:04:08] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/234 places, 213/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1538 ms. Remains : 207/234 places, 213/222 transitions.
Incomplete random walk after 10000 steps, including 1400 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 874 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 727599 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 727599 steps, saw 363878 distinct states, run finished after 3002 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:04:11] [INFO ] Invariant cache hit.
[2024-05-23 01:04:11] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-23 01:04:11] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 01:04:11] [INFO ] After 102ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:04:11] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:04:11] [INFO ] After 83ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:04:11] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:04:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-23 01:04:11] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 01:04:12] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:04:12] [INFO ] After 68ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:04:12] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-23 01:04:12] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-23 01:04:12] [INFO ] Invariant cache hit.
[2024-05-23 01:04:12] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-23 01:04:12] [INFO ] Invariant cache hit.
[2024-05-23 01:04:12] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:04:13] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 1160 ms to find 0 implicit places.
[2024-05-23 01:04:13] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 01:04:13] [INFO ] Invariant cache hit.
[2024-05-23 01:04:13] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1288 ms. Remains : 207/207 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 181 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 184
Applied a total of 58 rules in 11 ms. Remains 178 /207 variables (removed 29) and now considering 184/213 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2024-05-23 01:04:13] [INFO ] Computed 31 invariants in 17 ms
[2024-05-23 01:04:13] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-23 01:04:13] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-23 01:04:13] [INFO ] After 81ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:04:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 01:04:13] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:04:13] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:04:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-23 01:04:13] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 01:04:13] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:04:13] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:04:13] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-23 01:04:13] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13762 reset in 101 ms.
Product exploration explored 100000 steps with 13866 reset in 105 ms.
Built C files in :
/tmp/ltsmin11822857041795818488
[2024-05-23 01:04:14] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2024-05-23 01:04:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:04:14] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2024-05-23 01:04:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:04:14] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2024-05-23 01:04:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:04:14] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11822857041795818488
Running compilation step : cd /tmp/ltsmin11822857041795818488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 523 ms.
Running link step : cd /tmp/ltsmin11822857041795818488;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11822857041795818488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2970558372441643380.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 260/260 transitions.
Applied a total of 0 rules in 9 ms. Remains 272 /272 variables (removed 0) and now considering 260/260 (removed 0) transitions.
// Phase 1: matrix 260 rows 272 cols
[2024-05-23 01:04:29] [INFO ] Computed 49 invariants in 8 ms
[2024-05-23 01:04:29] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-23 01:04:29] [INFO ] Invariant cache hit.
[2024-05-23 01:04:29] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:04:30] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
[2024-05-23 01:04:30] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 01:04:30] [INFO ] Invariant cache hit.
[2024-05-23 01:04:30] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1176 ms. Remains : 272/272 places, 260/260 transitions.
Built C files in :
/tmp/ltsmin9202892927548320836
[2024-05-23 01:04:30] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2024-05-23 01:04:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:04:30] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2024-05-23 01:04:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:04:30] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2024-05-23 01:04:30] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:04:30] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9202892927548320836
Running compilation step : cd /tmp/ltsmin9202892927548320836;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 521 ms.
Running link step : cd /tmp/ltsmin9202892927548320836;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9202892927548320836;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12511809769341132734.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 01:04:45] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:04:45] [INFO ] Flatten gal took : 7 ms
[2024-05-23 01:04:45] [INFO ] Time to serialize gal into /tmp/LTL4173377809114646141.gal : 2 ms
[2024-05-23 01:04:45] [INFO ] Time to serialize properties into /tmp/LTL12915973242003676381.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4173377809114646141.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10581479864018303867.hoa' '-atoms' '/tmp/LTL12915973242003676381.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12915973242003676381.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10581479864018303867.hoa
Detected timeout of ITS tools.
[2024-05-23 01:05:00] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:05:00] [INFO ] Flatten gal took : 7 ms
[2024-05-23 01:05:00] [INFO ] Time to serialize gal into /tmp/LTL6325376115659067906.gal : 2 ms
[2024-05-23 01:05:00] [INFO ] Time to serialize properties into /tmp/LTL14149915382182163187.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6325376115659067906.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14149915382182163187.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(p357<1)"))))
Formula 0 simplified : GF!"(p357<1)"
Detected timeout of ITS tools.
[2024-05-23 01:05:15] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:05:15] [INFO ] Applying decomposition
[2024-05-23 01:05:15] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5970193506945802739.txt' '-o' '/tmp/graph5970193506945802739.bin' '-w' '/tmp/graph5970193506945802739.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5970193506945802739.bin' '-l' '-1' '-v' '-w' '/tmp/graph5970193506945802739.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:05:15] [INFO ] Decomposing Gal with order
[2024-05-23 01:05:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:05:15] [INFO ] Removed a total of 200 redundant transitions.
[2024-05-23 01:05:15] [INFO ] Flatten gal took : 18 ms
[2024-05-23 01:05:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2024-05-23 01:05:15] [INFO ] Time to serialize gal into /tmp/LTL10292797888608075688.gal : 3 ms
[2024-05-23 01:05:15] [INFO ] Time to serialize properties into /tmp/LTL9796814741276850480.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10292797888608075688.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9796814741276850480.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(i3.i2.u58.p357<1)"))))
Formula 0 simplified : GF!"(i3.i2.u58.p357<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3904417169411729518
[2024-05-23 01:05:30] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3904417169411729518
Running compilation step : cd /tmp/ltsmin3904417169411729518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 416 ms.
Running link step : cd /tmp/ltsmin3904417169411729518;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3904417169411729518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-010-LTLFireability-12 finished in 122860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p0))&&(X(p0)||G(p1))))))'
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 11 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2024-05-23 01:05:46] [INFO ] Computed 49 invariants in 27 ms
[2024-05-23 01:05:46] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-23 01:05:46] [INFO ] Invariant cache hit.
[2024-05-23 01:05:48] [INFO ] Implicit Places using invariants and state equation in 2081 ms returned []
Implicit Place search using SMT with State Equation took 2291 ms to find 0 implicit places.
[2024-05-23 01:05:48] [INFO ] Invariant cache hit.
[2024-05-23 01:05:48] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2515 ms. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 6}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 5}]], initial=7, aps=[p1:(AND (GEQ s482 1) (GEQ s503 1)), p0:(AND (GEQ s277 1) (GEQ s359 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-13 finished in 2823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 525 transition count 377
Reduce places removed 118 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 120 rules applied. Total rules applied 239 place count 407 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 241 place count 405 transition count 375
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 241 place count 405 transition count 354
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 283 place count 384 transition count 354
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 463 place count 294 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 499 place count 276 transition count 264
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 501 place count 276 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 502 place count 275 transition count 263
Applied a total of 502 rules in 33 ms. Remains 275 /527 variables (removed 252) and now considering 263/497 (removed 234) transitions.
// Phase 1: matrix 263 rows 275 cols
[2024-05-23 01:05:48] [INFO ] Computed 49 invariants in 12 ms
[2024-05-23 01:05:48] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-23 01:05:48] [INFO ] Invariant cache hit.
[2024-05-23 01:05:49] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 01:05:50] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
[2024-05-23 01:05:50] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:05:50] [INFO ] Invariant cache hit.
[2024-05-23 01:05:50] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/527 places, 263/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1431 ms. Remains : 275/527 places, 263/497 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s39 1) (GEQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-14 finished in 1497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-23 01:05:50] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4038221497288741516
[2024-05-23 01:05:50] [INFO ] Computing symmetric may disable matrix : 497 transitions.
[2024-05-23 01:05:50] [INFO ] Applying decomposition
[2024-05-23 01:05:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:05:50] [INFO ] Computing symmetric may enable matrix : 497 transitions.
[2024-05-23 01:05:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:05:50] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2083982910606670297.txt' '-o' '/tmp/graph2083982910606670297.bin' '-w' '/tmp/graph2083982910606670297.weights'
[2024-05-23 01:05:50] [INFO ] Computing Do-Not-Accords matrix : 497 transitions.
[2024-05-23 01:05:50] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2083982910606670297.bin' '-l' '-1' '-v' '-w' '/tmp/graph2083982910606670297.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:05:50] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4038221497288741516
Running compilation step : cd /tmp/ltsmin4038221497288741516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 01:05:50] [INFO ] Decomposing Gal with order
[2024-05-23 01:05:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:05:50] [INFO ] Removed a total of 140 redundant transitions.
[2024-05-23 01:05:50] [INFO ] Flatten gal took : 27 ms
[2024-05-23 01:05:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-23 01:05:50] [INFO ] Time to serialize gal into /tmp/LTLFireability356101682887141400.gal : 5 ms
[2024-05-23 01:05:50] [INFO ] Time to serialize properties into /tmp/LTLFireability10204588578475344531.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability356101682887141400.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10204588578475344531.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 4 LTL properties
Checking formula 0 : !((F(G("(i2.u84.p27<1)"))))
Formula 0 simplified : GF!"(i2.u84.p27<1)"
Compilation finished in 1047 ms.
Running link step : cd /tmp/ltsmin4038221497288741516;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin4038221497288741516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.032: Initializing POR dependencies: labels 501, guards 497
pins2lts-mc-linux64( 5/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 3.721: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 7/ 8), 3.721: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 3.741: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 4.162: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 4.182: There are 502 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 4.182: State length is 528, there are 501 groups
pins2lts-mc-linux64( 0/ 8), 4.182: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 4.182: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 4.182: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 4.182: Visible groups: 0 / 501, labels: 1 / 502
pins2lts-mc-linux64( 0/ 8), 4.182: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 4.182: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 2/ 8), 4.290: [Blue] ~98 levels ~960 states ~1064 transitions
pins2lts-mc-linux64( 6/ 8), 4.368: [Blue] ~184 levels ~1920 states ~2120 transitions
pins2lts-mc-linux64( 1/ 8), 4.432: [Blue] ~232 levels ~3840 states ~4280 transitions
pins2lts-mc-linux64( 4/ 8), 4.513: [Blue] ~538 levels ~7680 states ~8528 transitions
pins2lts-mc-linux64( 4/ 8), 4.647: [Blue] ~1077 levels ~15360 states ~17064 transitions
pins2lts-mc-linux64( 5/ 8), 4.989: [Blue] ~1836 levels ~30720 states ~34416 transitions
pins2lts-mc-linux64( 5/ 8), 5.629: [Blue] ~3293 levels ~61440 states ~68584 transitions
pins2lts-mc-linux64( 2/ 8), 6.829: [Blue] ~6128 levels ~122880 states ~137016 transitions
pins2lts-mc-linux64( 6/ 8), 8.929: [Blue] ~10115 levels ~245760 states ~273560 transitions
pins2lts-mc-linux64( 6/ 8), 12.784: [Blue] ~15318 levels ~491520 states ~546320 transitions
pins2lts-mc-linux64( 6/ 8), 20.094: [Blue] ~21588 levels ~983040 states ~1091424 transitions
pins2lts-mc-linux64( 7/ 8), 33.799: [Blue] ~15615 levels ~1966080 states ~2184208 transitions
pins2lts-mc-linux64( 7/ 8), 61.380: [Blue] ~18835 levels ~3932160 states ~4358128 transitions
pins2lts-mc-linux64( 2/ 8), 115.874: [Blue] ~143458 levels ~7864320 states ~8717848 transitions
pins2lts-mc-linux64( 2/ 8), 223.816: [Blue] ~286856 levels ~15728640 states ~17433880 transitions
pins2lts-mc-linux64( 2/ 8), 439.691: [Blue] ~559655 levels ~31457280 states ~34863992 transitions
pins2lts-mc-linux64( 0/ 8), 649.924: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 649.944:
pins2lts-mc-linux64( 0/ 8), 649.944: Explored 44615081 states 49507096 transitions, fanout: 1.110
pins2lts-mc-linux64( 0/ 8), 649.944: Total exploration time 645.750 sec (645.700 sec minimum, 645.731 sec on average)
pins2lts-mc-linux64( 0/ 8), 649.944: States per second: 69090, Transitions per second: 76666
pins2lts-mc-linux64( 0/ 8), 649.944:
pins2lts-mc-linux64( 0/ 8), 649.944: State space has 38085593 states, 333081 are accepting
pins2lts-mc-linux64( 0/ 8), 649.944: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 649.944: blue states: 44615081 (117.14%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 649.944: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 649.944: all-red states: 9873726 (25.93%), bogus 938203 (2.46%)
pins2lts-mc-linux64( 0/ 8), 649.944:
pins2lts-mc-linux64( 0/ 8), 649.944: Total memory used for local state coloring: 15.7MB
pins2lts-mc-linux64( 0/ 8), 649.944:
pins2lts-mc-linux64( 0/ 8), 649.944: Queue width: 8B, total height: 1031030, memory: 7.87MB
pins2lts-mc-linux64( 0/ 8), 649.944: Tree memory: 546.6MB, 15.0 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 649.944: Tree fill ratio (roots/leafs): 28.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 649.944: Stored 530 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 649.944: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 649.944: Est. total memory use: 554.4MB (~1031.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4038221497288741516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4038221497288741516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-23 01:28:53] [INFO ] Flatten gal took : 10 ms
[2024-05-23 01:28:53] [INFO ] Time to serialize gal into /tmp/LTLFireability12585860973505035472.gal : 2 ms
[2024-05-23 01:28:53] [INFO ] Time to serialize properties into /tmp/LTLFireability10929566278131532240.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12585860973505035472.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10929566278131532240.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 4 LTL properties
Checking formula 0 : !((F(G("(p27<1)"))))
Formula 0 simplified : GF!"(p27<1)"
Detected timeout of ITS tools.
[2024-05-23 01:51:56] [INFO ] Flatten gal took : 119 ms
[2024-05-23 01:51:56] [INFO ] Input system was already deterministic with 497 transitions.
[2024-05-23 01:51:56] [INFO ] Transformed 527 places.
[2024-05-23 01:51:56] [INFO ] Transformed 497 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-23 01:51:56] [INFO ] Time to serialize gal into /tmp/LTLFireability15700748861150227491.gal : 4 ms
[2024-05-23 01:51:56] [INFO ] Time to serialize properties into /tmp/LTLFireability17818281987051177449.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15700748861150227491.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17818281987051177449.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(p27<1)"))))
Formula 0 simplified : GF!"(p27<1)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13072028 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15836152 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DoubleExponent-PT-010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-tall-171631151600348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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