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.r197-tall-171640625000173.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 FunctionPointer-PT-c002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625000173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 FunctionPointer-PT-c002-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716525740053

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=FunctionPointer-PT-c002
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 04:42:21] [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-24 04:42:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 04:42:21] [INFO ] Load time of PNML (sax parser for PT used): 331 ms
[2024-05-24 04:42:21] [INFO ] Transformed 2826 places.
[2024-05-24 04:42:21] [INFO ] Transformed 8960 transitions.
[2024-05-24 04:42:22] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 521 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 27 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c002-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 296 places :
Symmetric choice reduction at 1 with 296 rule applications. Total rules 313 place count 1315 transition count 3758
Iterating global reduction 1 with 296 rules applied. Total rules applied 609 place count 1315 transition count 3758
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 412 transitions.
Iterating post reduction 1 with 412 rules applied. Total rules applied 1021 place count 1315 transition count 3346
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 1173 place count 1163 transition count 3042
Iterating global reduction 2 with 152 rules applied. Total rules applied 1325 place count 1163 transition count 3042
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 1413 place count 1163 transition count 2954
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1426 place count 1150 transition count 2928
Iterating global reduction 3 with 13 rules applied. Total rules applied 1439 place count 1150 transition count 2928
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1452 place count 1137 transition count 2902
Iterating global reduction 3 with 13 rules applied. Total rules applied 1465 place count 1137 transition count 2902
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1478 place count 1124 transition count 2876
Iterating global reduction 3 with 13 rules applied. Total rules applied 1491 place count 1124 transition count 2876
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1504 place count 1111 transition count 2850
Iterating global reduction 3 with 13 rules applied. Total rules applied 1517 place count 1111 transition count 2850
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1530 place count 1098 transition count 2824
Iterating global reduction 3 with 13 rules applied. Total rules applied 1543 place count 1098 transition count 2824
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1556 place count 1085 transition count 2798
Iterating global reduction 3 with 13 rules applied. Total rules applied 1569 place count 1085 transition count 2798
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1582 place count 1072 transition count 2772
Iterating global reduction 3 with 13 rules applied. Total rules applied 1595 place count 1072 transition count 2772
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1644 place count 1023 transition count 2590
Iterating global reduction 3 with 49 rules applied. Total rules applied 1693 place count 1023 transition count 2590
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1747 place count 969 transition count 2374
Iterating global reduction 3 with 54 rules applied. Total rules applied 1801 place count 969 transition count 2374
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1855 place count 915 transition count 2242
Iterating global reduction 3 with 54 rules applied. Total rules applied 1909 place count 915 transition count 2242
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1963 place count 861 transition count 2134
Iterating global reduction 3 with 54 rules applied. Total rules applied 2017 place count 861 transition count 2134
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2071 place count 807 transition count 2026
Iterating global reduction 3 with 54 rules applied. Total rules applied 2125 place count 807 transition count 2026
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2179 place count 753 transition count 1918
Iterating global reduction 3 with 54 rules applied. Total rules applied 2233 place count 753 transition count 1918
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2287 place count 699 transition count 1810
Iterating global reduction 3 with 54 rules applied. Total rules applied 2341 place count 699 transition count 1810
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 2353 place count 687 transition count 1786
Iterating global reduction 3 with 12 rules applied. Total rules applied 2365 place count 687 transition count 1786
Applied a total of 2365 rules in 1294 ms. Remains 687 /1628 variables (removed 941) and now considering 1786/5962 (removed 4176) transitions.
[2024-05-24 04:42:23] [INFO ] Flow matrix only has 1196 transitions (discarded 590 similar events)
// Phase 1: matrix 1196 rows 687 cols
[2024-05-24 04:42:23] [INFO ] Computed 2 invariants in 32 ms
[2024-05-24 04:42:24] [INFO ] Implicit Places using invariants in 652 ms returned []
[2024-05-24 04:42:24] [INFO ] Flow matrix only has 1196 transitions (discarded 590 similar events)
[2024-05-24 04:42:24] [INFO ] Invariant cache hit.
[2024-05-24 04:42:24] [INFO ] State equation strengthened by 290 read => feed constraints.
[2024-05-24 04:42:25] [INFO ] Implicit Places using invariants and state equation in 1522 ms returned []
Implicit Place search using SMT with State Equation took 2198 ms to find 0 implicit places.
[2024-05-24 04:42:25] [INFO ] Flow matrix only has 1196 transitions (discarded 590 similar events)
[2024-05-24 04:42:25] [INFO ] Invariant cache hit.
[2024-05-24 04:42:26] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 687/1628 places, 1786/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4023 ms. Remains : 687/1628 places, 1786/5962 transitions.
Support contains 13 out of 687 places after structural reductions.
[2024-05-24 04:42:26] [INFO ] Flatten gal took : 119 ms
[2024-05-24 04:42:26] [INFO ] Flatten gal took : 88 ms
[2024-05-24 04:42:26] [INFO ] Input system was already deterministic with 1786 transitions.
Support contains 11 out of 687 places (down from 13) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-24 04:42:27] [INFO ] Flow matrix only has 1196 transitions (discarded 590 similar events)
[2024-05-24 04:42:27] [INFO ] Invariant cache hit.
[2024-05-24 04:42:27] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 04:42:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-24 04:42:28] [INFO ] After 1303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 04:42:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 04:42:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:42:30] [INFO ] After 1136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 04:42:30] [INFO ] State equation strengthened by 290 read => feed constraints.
[2024-05-24 04:42:30] [INFO ] After 696ms SMT Verify possible using 290 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 04:42:31] [INFO ] Deduced a trap composed of 131 places in 167 ms of which 4 ms to minimize.
[2024-05-24 04:42:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2024-05-24 04:42:31] [INFO ] After 1657ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 483 ms.
[2024-05-24 04:42:32] [INFO ] After 3504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 19 ms.
Support contains 10 out of 687 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 687/687 places, 1786/1786 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 685 transition count 1780
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 685 transition count 1780
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 683 transition count 1774
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 683 transition count 1774
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 681 transition count 1770
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 681 transition count 1770
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 679 transition count 1766
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 679 transition count 1766
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 677 transition count 1762
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 677 transition count 1762
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 675 transition count 1758
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 675 transition count 1758
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 673 transition count 1754
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 673 transition count 1754
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 672 transition count 1750
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 672 transition count 1750
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 671 transition count 1746
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 671 transition count 1746
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 670 transition count 1744
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 670 transition count 1744
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 669 transition count 1742
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 669 transition count 1742
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 668 transition count 1740
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 668 transition count 1740
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 667 transition count 1738
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 667 transition count 1738
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 666 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 666 transition count 1736
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 58 place count 666 transition count 1720
Applied a total of 58 rules in 558 ms. Remains 666 /687 variables (removed 21) and now considering 1720/1786 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 559 ms. Remains : 666/687 places, 1720/1786 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-24 04:42:33] [INFO ] Flow matrix only has 1153 transitions (discarded 567 similar events)
// Phase 1: matrix 1153 rows 666 cols
[2024-05-24 04:42:33] [INFO ] Computed 2 invariants in 21 ms
[2024-05-24 04:42:33] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 04:42:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 04:42:34] [INFO ] After 803ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 04:42:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 04:42:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:42:34] [INFO ] After 690ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-24 04:42:34] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-24 04:42:35] [INFO ] After 546ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-24 04:42:35] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 1 ms to minimize.
[2024-05-24 04:42:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2024-05-24 04:42:36] [INFO ] After 1489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 571 ms.
[2024-05-24 04:42:36] [INFO ] After 2917ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 1 properties in 13 ms.
Support contains 7 out of 666 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 666/666 places, 1720/1720 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 665 transition count 1718
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 665 transition count 1718
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 664 transition count 1716
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 664 transition count 1716
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 663 transition count 1712
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 663 transition count 1712
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 662 transition count 1710
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 662 transition count 1710
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 661 transition count 1708
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 661 transition count 1708
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 660 transition count 1706
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 660 transition count 1706
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 659 transition count 1704
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 659 transition count 1704
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 658 transition count 1702
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 658 transition count 1702
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 657 transition count 1700
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 657 transition count 1700
Applied a total of 18 rules in 249 ms. Remains 657 /666 variables (removed 9) and now considering 1700/1720 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 657/666 places, 1700/1720 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 210951 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 210951 steps, saw 136938 distinct states, run finished after 3002 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 04:42:40] [INFO ] Flow matrix only has 1139 transitions (discarded 561 similar events)
// Phase 1: matrix 1139 rows 657 cols
[2024-05-24 04:42:40] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 04:42:40] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 04:42:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-24 04:42:41] [INFO ] After 855ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 04:42:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 04:42:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:42:42] [INFO ] After 744ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 04:42:42] [INFO ] State equation strengthened by 280 read => feed constraints.
[2024-05-24 04:42:42] [INFO ] After 492ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 04:42:42] [INFO ] Deduced a trap composed of 131 places in 162 ms of which 1 ms to minimize.
[2024-05-24 04:42:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2024-05-24 04:42:43] [INFO ] After 1053ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 249 ms.
[2024-05-24 04:42:43] [INFO ] After 2203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 7 ms.
Support contains 7 out of 657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 657/657 places, 1700/1700 transitions.
Applied a total of 0 rules in 86 ms. Remains 657 /657 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 657/657 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 657/657 places, 1700/1700 transitions.
Applied a total of 0 rules in 82 ms. Remains 657 /657 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2024-05-24 04:42:43] [INFO ] Flow matrix only has 1139 transitions (discarded 561 similar events)
[2024-05-24 04:42:43] [INFO ] Invariant cache hit.
[2024-05-24 04:42:44] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-24 04:42:44] [INFO ] Flow matrix only has 1139 transitions (discarded 561 similar events)
[2024-05-24 04:42:44] [INFO ] Invariant cache hit.
[2024-05-24 04:42:44] [INFO ] State equation strengthened by 280 read => feed constraints.
[2024-05-24 04:42:45] [INFO ] Implicit Places using invariants and state equation in 1464 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
[2024-05-24 04:42:45] [INFO ] Redundant transitions in 106 ms returned []
[2024-05-24 04:42:45] [INFO ] Flow matrix only has 1139 transitions (discarded 561 similar events)
[2024-05-24 04:42:45] [INFO ] Invariant cache hit.
[2024-05-24 04:42:46] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2594 ms. Remains : 657/657 places, 1700/1700 transitions.
Graph (trivial) has 998 edges and 657 vertex of which 192 / 657 are part of one of the 64 SCC in 5 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 433 transitions
Reduce isomorphic transitions removed 753 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 529 transition count 934
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 516 transition count 934
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 87 Pre rules applied. Total rules applied 27 place count 516 transition count 847
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 201 place count 429 transition count 847
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 264 place count 366 transition count 784
Iterating global reduction 2 with 63 rules applied. Total rules applied 327 place count 366 transition count 784
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 453 place count 366 transition count 658
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 711 place count 237 transition count 529
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 775 place count 173 transition count 401
Iterating global reduction 3 with 64 rules applied. Total rules applied 839 place count 173 transition count 401
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 841 place count 173 transition count 399
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 904 place count 110 transition count 273
Iterating global reduction 4 with 63 rules applied. Total rules applied 967 place count 110 transition count 273
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1030 place count 47 transition count 147
Iterating global reduction 4 with 63 rules applied. Total rules applied 1093 place count 47 transition count 147
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1156 place count 47 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1156 place count 47 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1158 place count 46 transition count 83
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 5 with 2 rules applied. Total rules applied 1160 place count 45 transition count 82
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1170 place count 40 transition count 82
Applied a total of 1170 rules in 80 ms. Remains 40 /657 variables (removed 617) and now considering 82/1700 (removed 1618) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 82 rows 40 cols
[2024-05-24 04:42:46] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 04:42:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 04:42:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:42:46] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 04:42:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 04:42:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:42:46] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 04:42:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 04:42:46] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 04:42:46] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-24 04:42:46] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 192 stabilizing places and 512 stable transitions
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)))'
Support contains 2 out of 687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 687/687 places, 1786/1786 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 679 transition count 1768
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 679 transition count 1768
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 671 transition count 1750
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 671 transition count 1750
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 663 transition count 1722
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 663 transition count 1722
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 655 transition count 1694
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 655 transition count 1694
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 72 place count 647 transition count 1678
Iterating global reduction 0 with 8 rules applied. Total rules applied 80 place count 647 transition count 1678
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 88 place count 639 transition count 1662
Iterating global reduction 0 with 8 rules applied. Total rules applied 96 place count 639 transition count 1662
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 631 transition count 1646
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 631 transition count 1646
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 119 place count 624 transition count 1630
Iterating global reduction 0 with 7 rules applied. Total rules applied 126 place count 624 transition count 1630
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 133 place count 617 transition count 1614
Iterating global reduction 0 with 7 rules applied. Total rules applied 140 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 616 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 142 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 143 place count 615 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 144 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 145 place count 614 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 146 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 147 place count 613 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 148 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 149 place count 612 transition count 1604
Iterating global reduction 0 with 1 rules applied. Total rules applied 150 place count 612 transition count 1604
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 152 place count 612 transition count 1602
Applied a total of 152 rules in 703 ms. Remains 612 /687 variables (removed 75) and now considering 1602/1786 (removed 184) transitions.
[2024-05-24 04:42:47] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 612 cols
[2024-05-24 04:42:47] [INFO ] Computed 2 invariants in 15 ms
[2024-05-24 04:42:47] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-24 04:42:47] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-24 04:42:47] [INFO ] Invariant cache hit.
[2024-05-24 04:42:47] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 04:42:49] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 1774 ms to find 0 implicit places.
[2024-05-24 04:42:49] [INFO ] Redundant transitions in 77 ms returned []
[2024-05-24 04:42:49] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-24 04:42:49] [INFO ] Invariant cache hit.
[2024-05-24 04:42:49] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 612/687 places, 1602/1786 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3077 ms. Remains : 612/687 places, 1602/1786 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 192 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s531 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 465 ms.
Stack based approach found an accepted trace after 260 steps with 0 reset with depth 261 and stack size 261 in 2 ms.
FORMULA FunctionPointer-PT-c002-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c002-LTLFireability-02 finished in 3799 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)))'
Support contains 2 out of 687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 687/687 places, 1786/1786 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 679 transition count 1768
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 679 transition count 1768
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 671 transition count 1750
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 671 transition count 1750
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 663 transition count 1722
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 663 transition count 1722
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 655 transition count 1694
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 655 transition count 1694
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 72 place count 647 transition count 1678
Iterating global reduction 0 with 8 rules applied. Total rules applied 80 place count 647 transition count 1678
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 88 place count 639 transition count 1662
Iterating global reduction 0 with 8 rules applied. Total rules applied 96 place count 639 transition count 1662
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 631 transition count 1646
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 631 transition count 1646
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 119 place count 624 transition count 1630
Iterating global reduction 0 with 7 rules applied. Total rules applied 126 place count 624 transition count 1630
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 133 place count 617 transition count 1614
Iterating global reduction 0 with 7 rules applied. Total rules applied 140 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 616 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 142 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 143 place count 615 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 144 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 145 place count 614 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 146 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 147 place count 613 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 148 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 149 place count 612 transition count 1604
Iterating global reduction 0 with 1 rules applied. Total rules applied 150 place count 612 transition count 1604
Applied a total of 150 rules in 213 ms. Remains 612 /687 variables (removed 75) and now considering 1604/1786 (removed 182) transitions.
[2024-05-24 04:42:50] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2024-05-24 04:42:50] [INFO ] Computed 2 invariants in 9 ms
[2024-05-24 04:42:50] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-24 04:42:50] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 04:42:50] [INFO ] Invariant cache hit.
[2024-05-24 04:42:51] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 04:42:52] [INFO ] Implicit Places using invariants and state equation in 1411 ms returned []
Implicit Place search using SMT with State Equation took 1756 ms to find 0 implicit places.
[2024-05-24 04:42:52] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 04:42:52] [INFO ] Invariant cache hit.
[2024-05-24 04:42:52] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 612/687 places, 1604/1786 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2443 ms. Remains : 612/687 places, 1604/1786 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s531 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c002-LTLFireability-08 finished in 2566 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((p1&&X((p1 U (p2||G(p1))))))&&p0)))'
Support contains 5 out of 687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 687/687 places, 1786/1786 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 680 transition count 1768
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 680 transition count 1768
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 673 transition count 1750
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 673 transition count 1750
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 666 transition count 1728
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 666 transition count 1728
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 659 transition count 1706
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 659 transition count 1706
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 652 transition count 1692
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 652 transition count 1692
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 645 transition count 1678
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 645 transition count 1678
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 638 transition count 1664
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 638 transition count 1664
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 103 place count 633 transition count 1652
Iterating global reduction 0 with 5 rules applied. Total rules applied 108 place count 633 transition count 1652
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 113 place count 628 transition count 1640
Iterating global reduction 0 with 5 rules applied. Total rules applied 118 place count 628 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 627 transition count 1638
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 627 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 626 transition count 1636
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 625 transition count 1634
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 624 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 623 transition count 1630
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 623 transition count 1630
Applied a total of 128 rules in 217 ms. Remains 623 /687 variables (removed 64) and now considering 1630/1786 (removed 156) transitions.
[2024-05-24 04:42:53] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2024-05-24 04:42:53] [INFO ] Computed 2 invariants in 16 ms
[2024-05-24 04:42:53] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-24 04:42:53] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-24 04:42:53] [INFO ] Invariant cache hit.
[2024-05-24 04:42:53] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:42:54] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 1762 ms to find 0 implicit places.
[2024-05-24 04:42:54] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-24 04:42:54] [INFO ] Invariant cache hit.
[2024-05-24 04:42:55] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/687 places, 1630/1786 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2514 ms. Remains : 623/687 places, 1630/1786 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s542 1)), p1:(OR (LT s0 1) (LT s551 1)), p2:(AND (GEQ s0 1) (GEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 0 ms.
FORMULA FunctionPointer-PT-c002-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c002-LTLFireability-13 finished in 2739 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 3 out of 687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 687/687 places, 1786/1786 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 680 transition count 1768
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 680 transition count 1768
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 673 transition count 1750
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 673 transition count 1750
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 666 transition count 1728
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 666 transition count 1728
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 659 transition count 1706
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 659 transition count 1706
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 652 transition count 1692
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 652 transition count 1692
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 645 transition count 1678
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 645 transition count 1678
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 638 transition count 1664
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 638 transition count 1664
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 103 place count 633 transition count 1652
Iterating global reduction 0 with 5 rules applied. Total rules applied 108 place count 633 transition count 1652
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 113 place count 628 transition count 1640
Iterating global reduction 0 with 5 rules applied. Total rules applied 118 place count 628 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 627 transition count 1638
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 627 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 626 transition count 1636
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 625 transition count 1634
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 624 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 623 transition count 1630
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 623 transition count 1630
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 134 place count 623 transition count 1624
Applied a total of 134 rules in 400 ms. Remains 623 /687 variables (removed 64) and now considering 1624/1786 (removed 162) transitions.
[2024-05-24 04:42:56] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2024-05-24 04:42:56] [INFO ] Computed 2 invariants in 15 ms
[2024-05-24 04:42:56] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-24 04:42:56] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 04:42:56] [INFO ] Invariant cache hit.
[2024-05-24 04:42:56] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:42:58] [INFO ] Implicit Places using invariants and state equation in 1741 ms returned []
Implicit Place search using SMT with State Equation took 2090 ms to find 0 implicit places.
[2024-05-24 04:42:58] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-24 04:42:58] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 04:42:58] [INFO ] Invariant cache hit.
[2024-05-24 04:42:58] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 623/687 places, 1624/1786 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3020 ms. Remains : 623/687 places, 1624/1786 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-14 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 s0 1) (LT s551 1) (LT s550 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 0 reset in 335 ms.
Product exploration explored 100000 steps with 0 reset in 419 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
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 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 524199 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :{}
Probabilistic random walk after 524199 steps, saw 340239 distinct states, run finished after 3002 ms. (steps per millisecond=174 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 04:43:02] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 04:43:02] [INFO ] Invariant cache hit.
[2024-05-24 04:43:02] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 04:43:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:43:03] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:43:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 04:43:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 04:43:03] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:43:03] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:43:03] [INFO ] After 145ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:43:03] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 0 ms to minimize.
[2024-05-24 04:43:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2024-05-24 04:43:03] [INFO ] After 446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-24 04:43:04] [INFO ] After 897ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 73 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 623/623 places, 1624/1624 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 526386 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :{}
Probabilistic random walk after 526386 steps, saw 341658 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 04:43:07] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 04:43:07] [INFO ] Invariant cache hit.
[2024-05-24 04:43:07] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 04:43:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 04:43:07] [INFO ] After 421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:43:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 04:43:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-24 04:43:07] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:43:07] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:43:08] [INFO ] After 149ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:43:08] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 0 ms to minimize.
[2024-05-24 04:43:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2024-05-24 04:43:08] [INFO ] After 450ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-24 04:43:08] [INFO ] After 939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 75 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 623/623 places, 1624/1624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 76 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2024-05-24 04:43:08] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 04:43:08] [INFO ] Invariant cache hit.
[2024-05-24 04:43:09] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-24 04:43:09] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 04:43:09] [INFO ] Invariant cache hit.
[2024-05-24 04:43:09] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:43:10] [INFO ] Implicit Places using invariants and state equation in 1680 ms returned []
Implicit Place search using SMT with State Equation took 2064 ms to find 0 implicit places.
[2024-05-24 04:43:10] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-24 04:43:10] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 04:43:10] [INFO ] Invariant cache hit.
[2024-05-24 04:43:11] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2691 ms. Remains : 623/623 places, 1624/1624 transitions.
Graph (trivial) has 956 edges and 623 vertex of which 192 / 623 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 411 transitions
Reduce isomorphic transitions removed 731 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 495 transition count 882
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 484 transition count 882
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 23 place count 484 transition count 806
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 175 place count 408 transition count 806
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 238 place count 345 transition count 743
Iterating global reduction 2 with 63 rules applied. Total rules applied 301 place count 345 transition count 743
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 427 place count 345 transition count 617
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 681 place count 218 transition count 490
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 745 place count 154 transition count 362
Iterating global reduction 3 with 64 rules applied. Total rules applied 809 place count 154 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 810 place count 154 transition count 361
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 873 place count 91 transition count 235
Iterating global reduction 4 with 63 rules applied. Total rules applied 936 place count 91 transition count 235
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 999 place count 28 transition count 109
Iterating global reduction 4 with 63 rules applied. Total rules applied 1062 place count 28 transition count 109
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1125 place count 28 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1125 place count 28 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1127 place count 27 transition count 45
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 5 with 2 rules applied. Total rules applied 1129 place count 26 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1133 place count 24 transition count 44
Applied a total of 1133 rules in 37 ms. Remains 24 /623 variables (removed 599) and now considering 44/1624 (removed 1580) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 44 rows 24 cols
[2024-05-24 04:43:11] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 04:43:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 04:43:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:43:11] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 04:43:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 04:43:11] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:43:11] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:43:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 04:43:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 04:43:11] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:43:11] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:43:11] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-24 04:43:11] [INFO ] After 43ms 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 80 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 44 ms :[(NOT p0)]
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 80 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2024-05-24 04:43:11] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2024-05-24 04:43:11] [INFO ] Computed 2 invariants in 17 ms
[2024-05-24 04:43:11] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-24 04:43:11] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 04:43:11] [INFO ] Invariant cache hit.
[2024-05-24 04:43:12] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:43:13] [INFO ] Implicit Places using invariants and state equation in 1368 ms returned []
Implicit Place search using SMT with State Equation took 1716 ms to find 0 implicit places.
[2024-05-24 04:43:13] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-24 04:43:13] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 04:43:13] [INFO ] Invariant cache hit.
[2024-05-24 04:43:13] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2362 ms. Remains : 623/623 places, 1624/1624 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 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 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 521330 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{}
Probabilistic random walk after 521330 steps, saw 338377 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 04:43:17] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 04:43:17] [INFO ] Invariant cache hit.
[2024-05-24 04:43:17] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 04:43:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:43:17] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:43:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 04:43:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:43:17] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:43:17] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:43:18] [INFO ] After 140ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:43:18] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 0 ms to minimize.
[2024-05-24 04:43:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2024-05-24 04:43:18] [INFO ] After 445ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-24 04:43:18] [INFO ] After 907ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 76 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 623/623 places, 1624/1624 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 537457 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 537457 steps, saw 348842 distinct states, run finished after 3002 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 04:43:21] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 04:43:21] [INFO ] Invariant cache hit.
[2024-05-24 04:43:21] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 04:43:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:43:21] [INFO ] After 389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:43:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 04:43:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:43:22] [INFO ] After 313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:43:22] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:43:22] [INFO ] After 144ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:43:22] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 0 ms to minimize.
[2024-05-24 04:43:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2024-05-24 04:43:22] [INFO ] After 437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-24 04:43:22] [INFO ] After 890ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 85 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 623/623 places, 1624/1624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 78 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2024-05-24 04:43:23] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 04:43:23] [INFO ] Invariant cache hit.
[2024-05-24 04:43:23] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-24 04:43:23] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 04:43:23] [INFO ] Invariant cache hit.
[2024-05-24 04:43:23] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:43:24] [INFO ] Implicit Places using invariants and state equation in 1647 ms returned []
Implicit Place search using SMT with State Equation took 1969 ms to find 0 implicit places.
[2024-05-24 04:43:25] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-24 04:43:25] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 04:43:25] [INFO ] Invariant cache hit.
[2024-05-24 04:43:25] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2583 ms. Remains : 623/623 places, 1624/1624 transitions.
Graph (trivial) has 956 edges and 623 vertex of which 192 / 623 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 411 transitions
Reduce isomorphic transitions removed 731 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 495 transition count 882
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 484 transition count 882
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 23 place count 484 transition count 806
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 175 place count 408 transition count 806
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 238 place count 345 transition count 743
Iterating global reduction 2 with 63 rules applied. Total rules applied 301 place count 345 transition count 743
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 427 place count 345 transition count 617
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 681 place count 218 transition count 490
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 745 place count 154 transition count 362
Iterating global reduction 3 with 64 rules applied. Total rules applied 809 place count 154 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 810 place count 154 transition count 361
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 873 place count 91 transition count 235
Iterating global reduction 4 with 63 rules applied. Total rules applied 936 place count 91 transition count 235
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 999 place count 28 transition count 109
Iterating global reduction 4 with 63 rules applied. Total rules applied 1062 place count 28 transition count 109
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1125 place count 28 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1125 place count 28 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1127 place count 27 transition count 45
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 5 with 2 rules applied. Total rules applied 1129 place count 26 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1133 place count 24 transition count 44
Applied a total of 1133 rules in 38 ms. Remains 24 /623 variables (removed 599) and now considering 44/1624 (removed 1580) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 44 rows 24 cols
[2024-05-24 04:43:25] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 04:43:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 04:43:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 04:43:25] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 04:43:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 04:43:25] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:43:25] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:43:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 04:43:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 04:43:25] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:43:25] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:43:25] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-24 04:43:25] [INFO ] After 37ms 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 69 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)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 317 ms.
Product exploration explored 100000 steps with 0 reset in 408 ms.
Built C files in :
/tmp/ltsmin7612877682402894557
[2024-05-24 04:43:26] [INFO ] Too many transitions (1624) to apply POR reductions. Disabling POR matrices.
[2024-05-24 04:43:26] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7612877682402894557
Running compilation step : cd /tmp/ltsmin7612877682402894557;'/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 2801 ms.
Running link step : cd /tmp/ltsmin7612877682402894557;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin7612877682402894557;'/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/stateBased15973128758037609547.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 79 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2024-05-24 04:43:41] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2024-05-24 04:43:41] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 04:43:42] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-24 04:43:42] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 04:43:42] [INFO ] Invariant cache hit.
[2024-05-24 04:43:42] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:43:43] [INFO ] Implicit Places using invariants and state equation in 1661 ms returned []
Implicit Place search using SMT with State Equation took 2035 ms to find 0 implicit places.
[2024-05-24 04:43:43] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-24 04:43:43] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 04:43:43] [INFO ] Invariant cache hit.
[2024-05-24 04:43:44] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2671 ms. Remains : 623/623 places, 1624/1624 transitions.
Built C files in :
/tmp/ltsmin14901003327771431337
[2024-05-24 04:43:44] [INFO ] Too many transitions (1624) to apply POR reductions. Disabling POR matrices.
[2024-05-24 04:43:44] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14901003327771431337
Running compilation step : cd /tmp/ltsmin14901003327771431337;'/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 2743 ms.
Running link step : cd /tmp/ltsmin14901003327771431337;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin14901003327771431337;'/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/stateBased13114201275063646752.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 04:43:59] [INFO ] Flatten gal took : 54 ms
[2024-05-24 04:43:59] [INFO ] Flatten gal took : 53 ms
[2024-05-24 04:43:59] [INFO ] Time to serialize gal into /tmp/LTL17885000139797073629.gal : 14 ms
[2024-05-24 04:43:59] [INFO ] Time to serialize properties into /tmp/LTL10787672552311169090.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/LTL17885000139797073629.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12012101231622414392.hoa' '-atoms' '/tmp/LTL10787672552311169090.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...320
Loading property file /tmp/LTL10787672552311169090.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12012101231622414392.hoa
Detected timeout of ITS tools.
[2024-05-24 04:44:14] [INFO ] Flatten gal took : 48 ms
[2024-05-24 04:44:14] [INFO ] Flatten gal took : 49 ms
[2024-05-24 04:44:14] [INFO ] Time to serialize gal into /tmp/LTL17891206263369714095.gal : 7 ms
[2024-05-24 04:44:14] [INFO ] Time to serialize properties into /tmp/LTL6301816133641132461.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/LTL17891206263369714095.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6301816133641132461.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("(((s0<1)||(l2089<1))||(l2066<1))"))))
Formula 0 simplified : GF!"(((s0<1)||(l2089<1))||(l2066<1))"
Detected timeout of ITS tools.
[2024-05-24 04:44:29] [INFO ] Flatten gal took : 41 ms
[2024-05-24 04:44:29] [INFO ] Applying decomposition
[2024-05-24 04:44:29] [INFO ] Flatten gal took : 40 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/graph2768596146530402252.txt' '-o' '/tmp/graph2768596146530402252.bin' '-w' '/tmp/graph2768596146530402252.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2768596146530402252.bin' '-l' '-1' '-v' '-w' '/tmp/graph2768596146530402252.weights' '-q' '0' '-e' '0.001'
[2024-05-24 04:44:29] [INFO ] Decomposing Gal with order
[2024-05-24 04:44:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 04:44:30] [INFO ] Removed a total of 2699 redundant transitions.
[2024-05-24 04:44:30] [INFO ] Flatten gal took : 143 ms
[2024-05-24 04:44:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 1156 labels/synchronizations in 91 ms.
[2024-05-24 04:44:30] [INFO ] Time to serialize gal into /tmp/LTL9418709843807258773.gal : 15 ms
[2024-05-24 04:44:30] [INFO ] Time to serialize properties into /tmp/LTL2098148201025521447.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/LTL9418709843807258773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2098148201025521447.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 : !((F(G("(((i0.u0.s0<1)||(i25.i2.u154.l2089<1))||(i25.i0.u153.l2066<1))"))))
Formula 0 simplified : GF!"(((i0.u0.s0<1)||(i25.i2.u154.l2089<1))||(i25.i0.u153.l2066<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2107747368498467248
[2024-05-24 04:44:45] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2107747368498467248
Running compilation step : cd /tmp/ltsmin2107747368498467248;'/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 2813 ms.
Running link step : cd /tmp/ltsmin2107747368498467248;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2107747368498467248;'/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 FunctionPointer-PT-c002-LTLFireability-14 finished in 124877 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(F(p0))))'
Support contains 3 out of 687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 687/687 places, 1786/1786 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 680 transition count 1768
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 680 transition count 1768
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 673 transition count 1750
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 673 transition count 1750
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 666 transition count 1728
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 666 transition count 1728
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 659 transition count 1706
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 659 transition count 1706
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 652 transition count 1692
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 652 transition count 1692
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 645 transition count 1678
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 645 transition count 1678
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 638 transition count 1664
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 638 transition count 1664
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 103 place count 633 transition count 1652
Iterating global reduction 0 with 5 rules applied. Total rules applied 108 place count 633 transition count 1652
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 113 place count 628 transition count 1640
Iterating global reduction 0 with 5 rules applied. Total rules applied 118 place count 628 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 627 transition count 1638
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 627 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 626 transition count 1636
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 625 transition count 1634
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 624 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 623 transition count 1630
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 623 transition count 1630
Applied a total of 128 rules in 214 ms. Remains 623 /687 variables (removed 64) and now considering 1630/1786 (removed 156) transitions.
[2024-05-24 04:45:00] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2024-05-24 04:45:00] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 04:45:01] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-24 04:45:01] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-24 04:45:01] [INFO ] Invariant cache hit.
[2024-05-24 04:45:01] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:45:02] [INFO ] Implicit Places using invariants and state equation in 1563 ms returned []
Implicit Place search using SMT with State Equation took 1941 ms to find 0 implicit places.
[2024-05-24 04:45:02] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-24 04:45:02] [INFO ] Invariant cache hit.
[2024-05-24 04:45:03] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/687 places, 1630/1786 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2689 ms. Remains : 623/687 places, 1630/1786 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s0 1) (LT s543 1) (AND (GEQ s0 1) (GEQ s544 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 660 ms.
Product exploration explored 100000 steps with 33333 reset in 636 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c002-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c002-LTLFireability-15 finished in 4139 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)))'
[2024-05-24 04:45:04] [INFO ] Flatten gal took : 47 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12707550895083914459
[2024-05-24 04:45:04] [INFO ] Too many transitions (1786) to apply POR reductions. Disabling POR matrices.
[2024-05-24 04:45:04] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12707550895083914459
Running compilation step : cd /tmp/ltsmin12707550895083914459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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-24 04:45:04] [INFO ] Applying decomposition
[2024-05-24 04:45:04] [INFO ] Flatten gal took : 45 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/graph11137229311191978590.txt' '-o' '/tmp/graph11137229311191978590.bin' '-w' '/tmp/graph11137229311191978590.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11137229311191978590.bin' '-l' '-1' '-v' '-w' '/tmp/graph11137229311191978590.weights' '-q' '0' '-e' '0.001'
[2024-05-24 04:45:05] [INFO ] Decomposing Gal with order
[2024-05-24 04:45:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 04:45:05] [INFO ] Removed a total of 3003 redundant transitions.
[2024-05-24 04:45:05] [INFO ] Flatten gal took : 195 ms
[2024-05-24 04:45:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 1216 labels/synchronizations in 135 ms.
[2024-05-24 04:45:05] [INFO ] Time to serialize gal into /tmp/LTLFireability2039761983019423900.gal : 24 ms
[2024-05-24 04:45:05] [INFO ] Time to serialize properties into /tmp/LTLFireability18264362775433581161.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/LTLFireability2039761983019423900.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18264362775433581161.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i1.u1.s0<1)||(i28.u180.l2089<1))||(i28.u179.l2066<1))"))))
Formula 0 simplified : GF!"(((i1.u1.s0<1)||(i28.u180.l2089<1))||(i28.u179.l2066<1))"
Compilation finished in 3944 ms.
Running link step : cd /tmp/ltsmin12707550895083914459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12707550895083914459;'/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'
Detected timeout of ITS tools.
[2024-05-24 05:06:00] [INFO ] Flatten gal took : 117 ms
[2024-05-24 05:06:00] [INFO ] Time to serialize gal into /tmp/LTLFireability5307413967965062791.gal : 27 ms
[2024-05-24 05:06:00] [INFO ] Time to serialize properties into /tmp/LTLFireability10588337311267159269.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/LTLFireability5307413967965062791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10588337311267159269.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...298
Read 1 LTL properties
Checking formula 0 : !((F(G("(((s0<1)||(l2089<1))||(l2066<1))"))))
Formula 0 simplified : GF!"(((s0<1)||(l2089<1))||(l2066<1))"
Detected timeout of ITS tools.
[2024-05-24 05:26:55] [INFO ] Flatten gal took : 153 ms
[2024-05-24 05:26:55] [INFO ] Input system was already deterministic with 1786 transitions.
[2024-05-24 05:26:55] [INFO ] Transformed 687 places.
[2024-05-24 05:26:55] [INFO ] Transformed 1786 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-24 05:26:55] [INFO ] Time to serialize gal into /tmp/LTLFireability8377076227535119679.gal : 6 ms
[2024-05-24 05:26:55] [INFO ] Time to serialize properties into /tmp/LTLFireability8057846365834668334.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/LTLFireability8377076227535119679.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8057846365834668334.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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(((s0<1)||(l2089<1))||(l2066<1))"))))
Formula 0 simplified : GF!"(((s0<1)||(l2089<1))||(l2066<1))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.058: Initializing POR dependencies: labels 1787, guards 1786
pins2lts-mc-linux64( 4/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 48.781: No maybe-coenabled matrix found. Turning off NESs from NDS+MC.
pins2lts-mc-linux64( 0/ 8), 167.157: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 0/ 8), 167.157: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 167.158: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 167.178: buchi has 2 states
pins2lts-mc-linux64( 0/ 8), 169.668: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 169.700: There are 1788 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 169.700: State length is 688, there are 1790 groups
pins2lts-mc-linux64( 0/ 8), 169.700: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 169.700: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 169.700: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 169.700: Visible groups: 0 / 1790, labels: 1 / 1788
pins2lts-mc-linux64( 0/ 8), 169.700: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 169.700: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 170.183: [Blue] ~120 levels ~960 states ~3240 transitions
pins2lts-mc-linux64( 0/ 8), 170.649: [Blue] ~240 levels ~1920 states ~6600 transitions
pins2lts-mc-linux64( 0/ 8), 171.566: [Blue] ~480 levels ~3840 states ~13320 transitions
pins2lts-mc-linux64( 0/ 8), 173.422: [Blue] ~960 levels ~7680 states ~26760 transitions
pins2lts-mc-linux64( 0/ 8), 177.061: [Blue] ~1920 levels ~15360 states ~53640 transitions
pins2lts-mc-linux64( 0/ 8), 184.246: [Blue] ~3840 levels ~30720 states ~107400 transitions
pins2lts-mc-linux64( 0/ 8), 198.418: [Blue] ~7680 levels ~61440 states ~214920 transitions
pins2lts-mc-linux64( 0/ 8), 226.287: [Blue] ~15360 levels ~122880 states ~429960 transitions
pins2lts-mc-linux64( 0/ 8), 282.214: [Blue] ~30720 levels ~245760 states ~860040 transitions
pins2lts-mc-linux64( 0/ 8), 391.927: [Blue] ~61440 levels ~491520 states ~1720200 transitions
pins2lts-mc-linux64( 0/ 8), 611.186: [Blue] ~122880 levels ~983040 states ~3440520 transitions
pins2lts-mc-linux64( 0/ 8), 1046.764: [Blue] ~245760 levels ~1966080 states ~6881160 transitions
pins2lts-mc-linux64( 0/ 8), 1916.563: [Blue] ~491520 levels ~3932160 states ~13762440 transitions
pins2lts-mc-linux64( 0/ 8), 3089.025: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 3089.101:
pins2lts-mc-linux64( 0/ 8), 3089.101: Explored 5139572 states 19772239 transitions, fanout: 3.847
pins2lts-mc-linux64( 0/ 8), 3089.101: Total exploration time 2919.390 sec (2919.320 sec minimum, 2919.353 sec on average)
pins2lts-mc-linux64( 0/ 8), 3089.101: States per second: 1760, Transitions per second: 6773
pins2lts-mc-linux64( 0/ 8), 3089.101:
pins2lts-mc-linux64( 0/ 8), 3089.101: State space has 18716531 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 3089.101: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 3089.101: blue states: 5139572 (27.46%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 3089.101: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 3089.101: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 3089.101:
pins2lts-mc-linux64( 0/ 8), 3089.101: Total memory used for local state coloring: 78.4MB
pins2lts-mc-linux64( 0/ 8), 3089.101:
pins2lts-mc-linux64( 0/ 8), 3089.101: Queue width: 8B, total height: 5139572, memory: 39.21MB
pins2lts-mc-linux64( 0/ 8), 3089.101: Tree memory: 398.8MB, 22.3 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 3089.101: Tree fill ratio (roots/leafs): 13.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 3089.101: Stored 1813 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 3089.101: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 3089.101: Est. total memory use: 438.0MB (~1063.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12707550895083914459;'/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/ltsmin12707550895083914459;'/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)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 891504 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16086592 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="FunctionPointer-PT-c002"
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 FunctionPointer-PT-c002, 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 r197-tall-171640625000173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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